/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe017_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-c7e336b [2020-10-05 23:39:58,082 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-05 23:39:58,087 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-05 23:39:58,128 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-05 23:39:58,129 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-05 23:39:58,137 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-05 23:39:58,138 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-05 23:39:58,141 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-05 23:39:58,145 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-05 23:39:58,148 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-05 23:39:58,149 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-05 23:39:58,151 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-05 23:39:58,151 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-05 23:39:58,154 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-05 23:39:58,156 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-05 23:39:58,158 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-05 23:39:58,159 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-05 23:39:58,160 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-05 23:39:58,162 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-05 23:39:58,170 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-05 23:39:58,173 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-05 23:39:58,174 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-05 23:39:58,175 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-05 23:39:58,176 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-05 23:39:58,187 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-05 23:39:58,187 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-05 23:39:58,188 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-05 23:39:58,190 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-05 23:39:58,190 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-05 23:39:58,193 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-05 23:39:58,193 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-05 23:39:58,194 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-05 23:39:58,195 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-05 23:39:58,195 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-05 23:39:58,196 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-05 23:39:58,197 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-05 23:39:58,197 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-05 23:39:58,197 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-05 23:39:58,198 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-05 23:39:58,199 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-05 23:39:58,200 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-05 23:39:58,201 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA.epf [2020-10-05 23:39:58,246 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-05 23:39:58,246 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-05 23:39:58,249 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-05 23:39:58,249 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-05 23:39:58,249 INFO L138 SettingsManager]: * Use SBE=true [2020-10-05 23:39:58,249 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-05 23:39:58,250 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-05 23:39:58,250 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-05 23:39:58,250 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-05 23:39:58,251 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-05 23:39:58,252 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-05 23:39:58,252 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-05 23:39:58,252 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-05 23:39:58,253 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-05 23:39:58,253 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-05 23:39:58,253 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-05 23:39:58,253 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-05 23:39:58,254 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-05 23:39:58,254 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-05 23:39:58,254 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-05 23:39:58,254 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-05 23:39:58,254 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-05 23:39:58,255 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-05 23:39:58,255 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2020-10-05 23:39:58,255 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-05 23:39:58,255 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-05 23:39:58,255 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-05 23:39:58,256 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2020-10-05 23:39:58,256 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-05 23:39:58,573 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-05 23:39:58,585 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-05 23:39:58,589 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-05 23:39:58,590 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-05 23:39:58,591 INFO L275 PluginConnector]: CDTParser initialized [2020-10-05 23:39:58,592 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe017_power.oepc.i [2020-10-05 23:39:58,664 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/56ac5fabe/9c3b9f7047cb454dafea1c7256717a77/FLAGa97f5e21c [2020-10-05 23:39:59,229 INFO L306 CDTParser]: Found 1 translation units. [2020-10-05 23:39:59,230 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe017_power.oepc.i [2020-10-05 23:39:59,249 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/56ac5fabe/9c3b9f7047cb454dafea1c7256717a77/FLAGa97f5e21c [2020-10-05 23:39:59,531 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/56ac5fabe/9c3b9f7047cb454dafea1c7256717a77 [2020-10-05 23:39:59,541 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-05 23:39:59,543 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-05 23:39:59,544 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-05 23:39:59,545 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-05 23:39:59,550 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-05 23:39:59,551 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.10 11:39:59" (1/1) ... [2020-10-05 23:39:59,554 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f65bce9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:39:59, skipping insertion in model container [2020-10-05 23:39:59,555 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.10 11:39:59" (1/1) ... [2020-10-05 23:39:59,563 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-05 23:39:59,607 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-05 23:40:00,127 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-05 23:40:00,143 INFO L203 MainTranslator]: Completed pre-run [2020-10-05 23:40:00,249 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-05 23:40:00,328 INFO L208 MainTranslator]: Completed translation [2020-10-05 23:40:00,328 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:40:00 WrapperNode [2020-10-05 23:40:00,329 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-05 23:40:00,330 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-05 23:40:00,330 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-05 23:40:00,330 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-05 23:40:00,339 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:40:00" (1/1) ... [2020-10-05 23:40:00,365 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:40:00" (1/1) ... [2020-10-05 23:40:00,417 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-05 23:40:00,417 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-05 23:40:00,418 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-05 23:40:00,418 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-05 23:40:00,426 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:40:00" (1/1) ... [2020-10-05 23:40:00,427 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:40:00" (1/1) ... [2020-10-05 23:40:00,431 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:40:00" (1/1) ... [2020-10-05 23:40:00,432 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:40:00" (1/1) ... [2020-10-05 23:40:00,442 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:40:00" (1/1) ... [2020-10-05 23:40:00,447 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:40:00" (1/1) ... [2020-10-05 23:40:00,452 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:40:00" (1/1) ... [2020-10-05 23:40:00,459 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-05 23:40:00,460 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-05 23:40:00,460 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-05 23:40:00,460 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-05 23:40:00,461 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:40:00" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-05 23:40:00,529 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-05 23:40:00,529 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-05 23:40:00,529 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-05 23:40:00,530 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-05 23:40:00,530 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-05 23:40:00,530 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-05 23:40:00,530 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-05 23:40:00,531 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-05 23:40:00,531 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-05 23:40:00,531 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-05 23:40:00,531 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-05 23:40:00,532 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-05 23:40:00,532 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-05 23:40:00,534 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-05 23:40:02,685 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-05 23:40:02,685 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-05 23:40:02,687 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.10 11:40:02 BoogieIcfgContainer [2020-10-05 23:40:02,688 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-05 23:40:02,689 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-05 23:40:02,689 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-05 23:40:02,693 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-05 23:40:02,693 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.10 11:39:59" (1/3) ... [2020-10-05 23:40:02,694 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f836ce4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.10 11:40:02, skipping insertion in model container [2020-10-05 23:40:02,694 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:40:00" (2/3) ... [2020-10-05 23:40:02,695 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f836ce4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.10 11:40:02, skipping insertion in model container [2020-10-05 23:40:02,695 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.10 11:40:02" (3/3) ... [2020-10-05 23:40:02,697 INFO L109 eAbstractionObserver]: Analyzing ICFG safe017_power.oepc.i [2020-10-05 23:40:02,708 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-05 23:40:02,709 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-05 23:40:02,717 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-05 23:40:02,718 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-05 23:40:02,747 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:02,748 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:02,748 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:02,748 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:02,749 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:02,749 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:02,749 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:02,749 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:02,750 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:02,750 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:02,750 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:02,750 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:02,750 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:02,750 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:02,751 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:02,751 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:02,751 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:02,752 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:02,752 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:02,752 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:02,752 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:02,752 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:02,753 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:02,753 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:02,753 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:02,753 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:02,753 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:02,753 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:02,754 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:02,754 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:02,754 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:02,755 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:02,755 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:02,755 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:02,755 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:02,756 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:02,756 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:02,756 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:02,756 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:02,756 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:02,757 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:02,757 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:02,757 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:02,761 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:02,762 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:02,762 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:02,762 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:02,762 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:02,762 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:02,763 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:02,763 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:02,763 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:02,763 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:02,763 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:02,764 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:02,772 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:02,772 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:02,772 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:02,772 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:02,773 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:02,773 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:02,773 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:02,773 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:02,773 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:02,773 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:02,775 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:02,775 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:02,776 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:02,776 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:02,776 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:02,776 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:02,776 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:02,777 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:02,777 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:02,777 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:40:02,793 INFO L251 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-10-05 23:40:02,815 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-10-05 23:40:02,815 INFO L376 AbstractCegarLoop]: Hoare is true [2020-10-05 23:40:02,815 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-05 23:40:02,815 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-05 23:40:02,815 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-05 23:40:02,816 INFO L380 AbstractCegarLoop]: Difference is false [2020-10-05 23:40:02,816 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-05 23:40:02,816 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-05 23:40:02,832 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 98 places, 90 transitions, 195 flow [2020-10-05 23:40:02,834 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 98 places, 90 transitions, 195 flow [2020-10-05 23:40:02,882 INFO L129 PetriNetUnfolder]: 2/87 cut-off events. [2020-10-05 23:40:02,882 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-05 23:40:02,888 INFO L80 FinitePrefix]: Finished finitePrefix Result has 97 conditions, 87 events. 2/87 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 61 event pairs, 0 based on Foata normal form. 0/83 useless extension candidates. Maximal degree in co-relation 59. Up to 2 conditions per place. [2020-10-05 23:40:02,891 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 98 places, 90 transitions, 195 flow [2020-10-05 23:40:02,914 INFO L129 PetriNetUnfolder]: 2/87 cut-off events. [2020-10-05 23:40:02,915 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-05 23:40:02,915 INFO L80 FinitePrefix]: Finished finitePrefix Result has 97 conditions, 87 events. 2/87 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 61 event pairs, 0 based on Foata normal form. 0/83 useless extension candidates. Maximal degree in co-relation 59. Up to 2 conditions per place. [2020-10-05 23:40:02,918 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 1560 [2020-10-05 23:40:02,919 INFO L182 etLargeBlockEncoding]: Variable Check. [2020-10-05 23:40:03,276 WARN L193 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 42 [2020-10-05 23:40:03,773 WARN L193 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-10-05 23:40:05,930 WARN L193 SmtUtils]: Spent 1.13 s on a formula simplification. DAG size of input: 229 DAG size of output: 189 [2020-10-05 23:40:05,960 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 2, 2, 1] term [2020-10-05 23:40:05,960 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 23:40:05,965 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-05 23:40:05,965 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 23:40:07,319 WARN L193 SmtUtils]: Spent 1.33 s on a formula simplification. DAG size of input: 145 DAG size of output: 108 [2020-10-05 23:40:07,761 WARN L193 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2020-10-05 23:40:07,903 WARN L193 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2020-10-05 23:40:09,389 WARN L193 SmtUtils]: Spent 1.48 s on a formula simplification. DAG size of input: 243 DAG size of output: 203 [2020-10-05 23:40:09,415 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 2, 2, 1] term [2020-10-05 23:40:09,415 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 23:40:09,417 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-05 23:40:09,418 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 23:40:10,449 WARN L193 SmtUtils]: Spent 1.02 s on a formula simplification. DAG size of input: 159 DAG size of output: 129 [2020-10-05 23:40:10,488 INFO L206 etLargeBlockEncoding]: Checked pairs total: 3870 [2020-10-05 23:40:10,488 INFO L214 etLargeBlockEncoding]: Total number of compositions: 76 [2020-10-05 23:40:10,492 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 35 places, 25 transitions, 65 flow [2020-10-05 23:40:10,534 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 662 states. [2020-10-05 23:40:10,537 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states. [2020-10-05 23:40:10,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-10-05 23:40:10,543 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:40:10,544 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-10-05 23:40:10,545 INFO L427 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:40:10,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:40:10,551 INFO L82 PathProgramCache]: Analyzing trace with hash 1035167, now seen corresponding path program 1 times [2020-10-05 23:40:10,561 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:40:10,561 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20882545] [2020-10-05 23:40:10,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:40:10,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:40:10,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:40:10,775 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20882545] [2020-10-05 23:40:10,776 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:40:10,776 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-05 23:40:10,777 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862319578] [2020-10-05 23:40:10,782 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-05 23:40:10,783 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:40:10,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-05 23:40:10,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-05 23:40:10,801 INFO L87 Difference]: Start difference. First operand 662 states. Second operand 3 states. [2020-10-05 23:40:10,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:40:10,901 INFO L93 Difference]: Finished difference Result 552 states and 1697 transitions. [2020-10-05 23:40:10,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-05 23:40:10,904 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-10-05 23:40:10,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:40:10,929 INFO L225 Difference]: With dead ends: 552 [2020-10-05 23:40:10,929 INFO L226 Difference]: Without dead ends: 452 [2020-10-05 23:40:10,930 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-05 23:40:10,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2020-10-05 23:40:11,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 452. [2020-10-05 23:40:11,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 452 states. [2020-10-05 23:40:11,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 1362 transitions. [2020-10-05 23:40:11,043 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 1362 transitions. Word has length 3 [2020-10-05 23:40:11,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:40:11,043 INFO L479 AbstractCegarLoop]: Abstraction has 452 states and 1362 transitions. [2020-10-05 23:40:11,043 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-05 23:40:11,044 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 1362 transitions. [2020-10-05 23:40:11,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-05 23:40:11,050 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:40:11,050 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:40:11,050 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-05 23:40:11,050 INFO L427 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:40:11,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:40:11,051 INFO L82 PathProgramCache]: Analyzing trace with hash 793045883, now seen corresponding path program 1 times [2020-10-05 23:40:11,051 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:40:11,051 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742935129] [2020-10-05 23:40:11,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:40:11,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:40:11,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:40:11,189 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742935129] [2020-10-05 23:40:11,190 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:40:11,190 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-05 23:40:11,190 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446961590] [2020-10-05 23:40:11,191 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-05 23:40:11,192 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:40:11,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-05 23:40:11,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-05 23:40:11,192 INFO L87 Difference]: Start difference. First operand 452 states and 1362 transitions. Second operand 3 states. [2020-10-05 23:40:11,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:40:11,226 INFO L93 Difference]: Finished difference Result 448 states and 1347 transitions. [2020-10-05 23:40:11,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-05 23:40:11,227 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-10-05 23:40:11,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:40:11,232 INFO L225 Difference]: With dead ends: 448 [2020-10-05 23:40:11,233 INFO L226 Difference]: Without dead ends: 448 [2020-10-05 23:40:11,234 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-05 23:40:11,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2020-10-05 23:40:11,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 448. [2020-10-05 23:40:11,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 448 states. [2020-10-05 23:40:11,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 1347 transitions. [2020-10-05 23:40:11,264 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 1347 transitions. Word has length 9 [2020-10-05 23:40:11,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:40:11,267 INFO L479 AbstractCegarLoop]: Abstraction has 448 states and 1347 transitions. [2020-10-05 23:40:11,267 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-05 23:40:11,267 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 1347 transitions. [2020-10-05 23:40:11,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-10-05 23:40:11,273 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:40:11,273 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:40:11,274 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-05 23:40:11,274 INFO L427 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:40:11,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:40:11,274 INFO L82 PathProgramCache]: Analyzing trace with hash 203121197, now seen corresponding path program 1 times [2020-10-05 23:40:11,275 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:40:11,275 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016425043] [2020-10-05 23:40:11,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:40:11,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:40:11,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:40:11,420 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016425043] [2020-10-05 23:40:11,420 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:40:11,420 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-05 23:40:11,420 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772903835] [2020-10-05 23:40:11,421 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-05 23:40:11,421 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:40:11,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-05 23:40:11,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-05 23:40:11,422 INFO L87 Difference]: Start difference. First operand 448 states and 1347 transitions. Second operand 3 states. [2020-10-05 23:40:11,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:40:11,438 INFO L93 Difference]: Finished difference Result 439 states and 1313 transitions. [2020-10-05 23:40:11,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-05 23:40:11,440 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2020-10-05 23:40:11,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:40:11,444 INFO L225 Difference]: With dead ends: 439 [2020-10-05 23:40:11,445 INFO L226 Difference]: Without dead ends: 439 [2020-10-05 23:40:11,445 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-05 23:40:11,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2020-10-05 23:40:11,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 439. [2020-10-05 23:40:11,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 439 states. [2020-10-05 23:40:11,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 1313 transitions. [2020-10-05 23:40:11,465 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 1313 transitions. Word has length 10 [2020-10-05 23:40:11,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:40:11,465 INFO L479 AbstractCegarLoop]: Abstraction has 439 states and 1313 transitions. [2020-10-05 23:40:11,466 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-05 23:40:11,466 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 1313 transitions. [2020-10-05 23:40:11,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-05 23:40:11,468 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:40:11,468 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:40:11,468 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-05 23:40:11,468 INFO L427 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:40:11,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:40:11,469 INFO L82 PathProgramCache]: Analyzing trace with hash -872477858, now seen corresponding path program 1 times [2020-10-05 23:40:11,469 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:40:11,470 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503946970] [2020-10-05 23:40:11,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:40:11,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:40:11,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:40:11,550 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503946970] [2020-10-05 23:40:11,550 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:40:11,551 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-05 23:40:11,551 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517691368] [2020-10-05 23:40:11,551 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-05 23:40:11,552 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:40:11,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-05 23:40:11,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-05 23:40:11,553 INFO L87 Difference]: Start difference. First operand 439 states and 1313 transitions. Second operand 3 states. [2020-10-05 23:40:11,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:40:11,568 INFO L93 Difference]: Finished difference Result 424 states and 1261 transitions. [2020-10-05 23:40:11,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-05 23:40:11,569 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2020-10-05 23:40:11,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:40:11,573 INFO L225 Difference]: With dead ends: 424 [2020-10-05 23:40:11,573 INFO L226 Difference]: Without dead ends: 424 [2020-10-05 23:40:11,574 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-05 23:40:11,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2020-10-05 23:40:11,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 424. [2020-10-05 23:40:11,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 424 states. [2020-10-05 23:40:11,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 1261 transitions. [2020-10-05 23:40:11,589 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 1261 transitions. Word has length 11 [2020-10-05 23:40:11,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:40:11,589 INFO L479 AbstractCegarLoop]: Abstraction has 424 states and 1261 transitions. [2020-10-05 23:40:11,590 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-05 23:40:11,590 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 1261 transitions. [2020-10-05 23:40:11,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-05 23:40:11,597 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:40:11,597 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:40:11,597 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-05 23:40:11,597 INFO L427 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:40:11,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:40:11,598 INFO L82 PathProgramCache]: Analyzing trace with hash 167058694, now seen corresponding path program 1 times [2020-10-05 23:40:11,598 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:40:11,598 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131994897] [2020-10-05 23:40:11,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:40:11,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:40:11,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:40:11,696 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131994897] [2020-10-05 23:40:11,696 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:40:11,697 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-05 23:40:11,697 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075058152] [2020-10-05 23:40:11,697 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-05 23:40:11,698 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:40:11,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-05 23:40:11,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-05 23:40:11,698 INFO L87 Difference]: Start difference. First operand 424 states and 1261 transitions. Second operand 3 states. [2020-10-05 23:40:11,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:40:11,769 INFO L93 Difference]: Finished difference Result 421 states and 1250 transitions. [2020-10-05 23:40:11,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-05 23:40:11,770 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2020-10-05 23:40:11,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:40:11,774 INFO L225 Difference]: With dead ends: 421 [2020-10-05 23:40:11,774 INFO L226 Difference]: Without dead ends: 421 [2020-10-05 23:40:11,775 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-05 23:40:11,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2020-10-05 23:40:11,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 421. [2020-10-05 23:40:11,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2020-10-05 23:40:11,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 1250 transitions. [2020-10-05 23:40:11,789 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 1250 transitions. Word has length 11 [2020-10-05 23:40:11,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:40:11,790 INFO L479 AbstractCegarLoop]: Abstraction has 421 states and 1250 transitions. [2020-10-05 23:40:11,790 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-05 23:40:11,790 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 1250 transitions. [2020-10-05 23:40:11,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-05 23:40:11,791 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:40:11,791 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:40:11,791 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-05 23:40:11,792 INFO L427 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:40:11,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:40:11,792 INFO L82 PathProgramCache]: Analyzing trace with hash -1277010548, now seen corresponding path program 1 times [2020-10-05 23:40:11,792 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:40:11,792 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085679865] [2020-10-05 23:40:11,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:40:11,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:40:11,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:40:11,847 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085679865] [2020-10-05 23:40:11,848 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:40:11,848 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-05 23:40:11,848 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325192298] [2020-10-05 23:40:11,848 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-05 23:40:11,849 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:40:11,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-05 23:40:11,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-05 23:40:11,849 INFO L87 Difference]: Start difference. First operand 421 states and 1250 transitions. Second operand 4 states. [2020-10-05 23:40:11,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:40:11,883 INFO L93 Difference]: Finished difference Result 598 states and 1704 transitions. [2020-10-05 23:40:11,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-05 23:40:11,884 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2020-10-05 23:40:11,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:40:11,888 INFO L225 Difference]: With dead ends: 598 [2020-10-05 23:40:11,888 INFO L226 Difference]: Without dead ends: 445 [2020-10-05 23:40:11,888 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-05 23:40:11,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2020-10-05 23:40:11,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 409. [2020-10-05 23:40:11,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 409 states. [2020-10-05 23:40:11,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 1158 transitions. [2020-10-05 23:40:11,902 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 1158 transitions. Word has length 12 [2020-10-05 23:40:11,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:40:11,903 INFO L479 AbstractCegarLoop]: Abstraction has 409 states and 1158 transitions. [2020-10-05 23:40:11,903 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-05 23:40:11,903 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 1158 transitions. [2020-10-05 23:40:11,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-05 23:40:11,904 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:40:11,904 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:40:11,904 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-05 23:40:11,904 INFO L427 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:40:11,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:40:11,905 INFO L82 PathProgramCache]: Analyzing trace with hash 185118520, now seen corresponding path program 1 times [2020-10-05 23:40:11,905 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:40:11,905 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908205978] [2020-10-05 23:40:11,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:40:11,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:40:12,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:40:12,015 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908205978] [2020-10-05 23:40:12,015 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:40:12,015 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-05 23:40:12,015 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367233638] [2020-10-05 23:40:12,016 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-05 23:40:12,016 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:40:12,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-05 23:40:12,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-05 23:40:12,017 INFO L87 Difference]: Start difference. First operand 409 states and 1158 transitions. Second operand 5 states. [2020-10-05 23:40:12,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:40:12,106 INFO L93 Difference]: Finished difference Result 423 states and 1182 transitions. [2020-10-05 23:40:12,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-05 23:40:12,107 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2020-10-05 23:40:12,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:40:12,110 INFO L225 Difference]: With dead ends: 423 [2020-10-05 23:40:12,110 INFO L226 Difference]: Without dead ends: 423 [2020-10-05 23:40:12,111 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-10-05 23:40:12,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2020-10-05 23:40:12,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 423. [2020-10-05 23:40:12,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 423 states. [2020-10-05 23:40:12,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 1182 transitions. [2020-10-05 23:40:12,125 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 1182 transitions. Word has length 12 [2020-10-05 23:40:12,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:40:12,125 INFO L479 AbstractCegarLoop]: Abstraction has 423 states and 1182 transitions. [2020-10-05 23:40:12,125 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-05 23:40:12,126 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 1182 transitions. [2020-10-05 23:40:12,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-05 23:40:12,127 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:40:12,127 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:40:12,127 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-05 23:40:12,127 INFO L427 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:40:12,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:40:12,128 INFO L82 PathProgramCache]: Analyzing trace with hash 883850748, now seen corresponding path program 1 times [2020-10-05 23:40:12,128 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:40:12,128 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643835504] [2020-10-05 23:40:12,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:40:12,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:40:12,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:40:12,176 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643835504] [2020-10-05 23:40:12,176 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:40:12,176 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-05 23:40:12,176 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366352473] [2020-10-05 23:40:12,177 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-05 23:40:12,177 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:40:12,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-05 23:40:12,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-05 23:40:12,178 INFO L87 Difference]: Start difference. First operand 423 states and 1182 transitions. Second operand 4 states. [2020-10-05 23:40:12,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:40:12,235 INFO L93 Difference]: Finished difference Result 431 states and 1207 transitions. [2020-10-05 23:40:12,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-05 23:40:12,236 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2020-10-05 23:40:12,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:40:12,239 INFO L225 Difference]: With dead ends: 431 [2020-10-05 23:40:12,239 INFO L226 Difference]: Without dead ends: 431 [2020-10-05 23:40:12,240 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-05 23:40:12,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2020-10-05 23:40:12,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 427. [2020-10-05 23:40:12,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 427 states. [2020-10-05 23:40:12,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 1193 transitions. [2020-10-05 23:40:12,254 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 1193 transitions. Word has length 12 [2020-10-05 23:40:12,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:40:12,255 INFO L479 AbstractCegarLoop]: Abstraction has 427 states and 1193 transitions. [2020-10-05 23:40:12,255 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-05 23:40:12,255 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 1193 transitions. [2020-10-05 23:40:12,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-05 23:40:12,256 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:40:12,256 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:40:12,257 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-05 23:40:12,257 INFO L427 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:40:12,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:40:12,257 INFO L82 PathProgramCache]: Analyzing trace with hash 882578508, now seen corresponding path program 2 times [2020-10-05 23:40:12,258 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:40:12,258 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820419776] [2020-10-05 23:40:12,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:40:12,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:40:12,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:40:12,338 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820419776] [2020-10-05 23:40:12,338 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:40:12,339 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-05 23:40:12,339 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296307151] [2020-10-05 23:40:12,339 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-05 23:40:12,340 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:40:12,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-05 23:40:12,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-10-05 23:40:12,340 INFO L87 Difference]: Start difference. First operand 427 states and 1193 transitions. Second operand 5 states. [2020-10-05 23:40:12,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:40:12,433 INFO L93 Difference]: Finished difference Result 422 states and 1177 transitions. [2020-10-05 23:40:12,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-05 23:40:12,434 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2020-10-05 23:40:12,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:40:12,438 INFO L225 Difference]: With dead ends: 422 [2020-10-05 23:40:12,439 INFO L226 Difference]: Without dead ends: 422 [2020-10-05 23:40:12,439 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-10-05 23:40:12,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2020-10-05 23:40:12,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 414. [2020-10-05 23:40:12,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 414 states. [2020-10-05 23:40:12,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 1152 transitions. [2020-10-05 23:40:12,455 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 1152 transitions. Word has length 12 [2020-10-05 23:40:12,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:40:12,456 INFO L479 AbstractCegarLoop]: Abstraction has 414 states and 1152 transitions. [2020-10-05 23:40:12,456 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-05 23:40:12,456 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 1152 transitions. [2020-10-05 23:40:12,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-05 23:40:12,457 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:40:12,458 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:40:12,458 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-05 23:40:12,458 INFO L427 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:40:12,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:40:12,459 INFO L82 PathProgramCache]: Analyzing trace with hash 939905806, now seen corresponding path program 1 times [2020-10-05 23:40:12,459 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:40:12,459 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053224459] [2020-10-05 23:40:12,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:40:12,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:40:12,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:40:12,609 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053224459] [2020-10-05 23:40:12,609 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:40:12,609 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-05 23:40:12,610 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095162554] [2020-10-05 23:40:12,610 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-05 23:40:12,610 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:40:12,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-05 23:40:12,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-05 23:40:12,611 INFO L87 Difference]: Start difference. First operand 414 states and 1152 transitions. Second operand 6 states. [2020-10-05 23:40:12,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:40:12,718 INFO L93 Difference]: Finished difference Result 410 states and 1138 transitions. [2020-10-05 23:40:12,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-05 23:40:12,719 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2020-10-05 23:40:12,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:40:12,723 INFO L225 Difference]: With dead ends: 410 [2020-10-05 23:40:12,723 INFO L226 Difference]: Without dead ends: 410 [2020-10-05 23:40:12,723 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-10-05 23:40:12,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2020-10-05 23:40:12,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 394. [2020-10-05 23:40:12,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2020-10-05 23:40:12,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 1106 transitions. [2020-10-05 23:40:12,737 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 1106 transitions. Word has length 13 [2020-10-05 23:40:12,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:40:12,737 INFO L479 AbstractCegarLoop]: Abstraction has 394 states and 1106 transitions. [2020-10-05 23:40:12,737 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-05 23:40:12,738 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 1106 transitions. [2020-10-05 23:40:12,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-05 23:40:12,739 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:40:12,739 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:40:12,739 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-05 23:40:12,739 INFO L427 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:40:12,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:40:12,740 INFO L82 PathProgramCache]: Analyzing trace with hash 1443705354, now seen corresponding path program 1 times [2020-10-05 23:40:12,740 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:40:12,740 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522817377] [2020-10-05 23:40:12,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:40:12,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:40:12,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:40:12,821 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522817377] [2020-10-05 23:40:12,821 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:40:12,821 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-05 23:40:12,821 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415278769] [2020-10-05 23:40:12,822 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-05 23:40:12,822 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:40:12,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-05 23:40:12,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-05 23:40:12,823 INFO L87 Difference]: Start difference. First operand 394 states and 1106 transitions. Second operand 5 states. [2020-10-05 23:40:12,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:40:12,924 INFO L93 Difference]: Finished difference Result 448 states and 1257 transitions. [2020-10-05 23:40:12,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-05 23:40:12,925 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-10-05 23:40:12,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:40:12,928 INFO L225 Difference]: With dead ends: 448 [2020-10-05 23:40:12,928 INFO L226 Difference]: Without dead ends: 448 [2020-10-05 23:40:12,929 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-10-05 23:40:12,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2020-10-05 23:40:12,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 414. [2020-10-05 23:40:12,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 414 states. [2020-10-05 23:40:12,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 1154 transitions. [2020-10-05 23:40:12,943 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 1154 transitions. Word has length 13 [2020-10-05 23:40:12,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:40:12,944 INFO L479 AbstractCegarLoop]: Abstraction has 414 states and 1154 transitions. [2020-10-05 23:40:12,944 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-05 23:40:12,944 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 1154 transitions. [2020-10-05 23:40:12,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-05 23:40:12,945 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:40:12,945 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:40:12,946 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-05 23:40:12,946 INFO L427 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:40:12,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:40:12,946 INFO L82 PathProgramCache]: Analyzing trace with hash 1442433114, now seen corresponding path program 2 times [2020-10-05 23:40:12,946 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:40:12,947 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565389154] [2020-10-05 23:40:12,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:40:12,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:40:13,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:40:13,037 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565389154] [2020-10-05 23:40:13,037 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:40:13,038 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-05 23:40:13,038 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088394274] [2020-10-05 23:40:13,038 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-05 23:40:13,038 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:40:13,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-05 23:40:13,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-05 23:40:13,039 INFO L87 Difference]: Start difference. First operand 414 states and 1154 transitions. Second operand 6 states. [2020-10-05 23:40:13,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:40:13,170 INFO L93 Difference]: Finished difference Result 460 states and 1280 transitions. [2020-10-05 23:40:13,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-05 23:40:13,171 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2020-10-05 23:40:13,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:40:13,174 INFO L225 Difference]: With dead ends: 460 [2020-10-05 23:40:13,174 INFO L226 Difference]: Without dead ends: 460 [2020-10-05 23:40:13,175 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-10-05 23:40:13,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2020-10-05 23:40:13,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 434. [2020-10-05 23:40:13,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2020-10-05 23:40:13,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 1219 transitions. [2020-10-05 23:40:13,192 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 1219 transitions. Word has length 13 [2020-10-05 23:40:13,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:40:13,192 INFO L479 AbstractCegarLoop]: Abstraction has 434 states and 1219 transitions. [2020-10-05 23:40:13,192 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-05 23:40:13,193 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 1219 transitions. [2020-10-05 23:40:13,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-05 23:40:13,194 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:40:13,194 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:40:13,194 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-05 23:40:13,195 INFO L427 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:40:13,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:40:13,195 INFO L82 PathProgramCache]: Analyzing trace with hash 1393638489, now seen corresponding path program 1 times [2020-10-05 23:40:13,195 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:40:13,196 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295079267] [2020-10-05 23:40:13,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:40:13,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:40:13,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:40:13,251 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295079267] [2020-10-05 23:40:13,251 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:40:13,252 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-05 23:40:13,252 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407140766] [2020-10-05 23:40:13,252 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-05 23:40:13,253 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:40:13,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-05 23:40:13,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-05 23:40:13,253 INFO L87 Difference]: Start difference. First operand 434 states and 1219 transitions. Second operand 4 states. [2020-10-05 23:40:13,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:40:13,315 INFO L93 Difference]: Finished difference Result 428 states and 1062 transitions. [2020-10-05 23:40:13,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-05 23:40:13,316 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2020-10-05 23:40:13,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:40:13,318 INFO L225 Difference]: With dead ends: 428 [2020-10-05 23:40:13,318 INFO L226 Difference]: Without dead ends: 314 [2020-10-05 23:40:13,319 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-05 23:40:13,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2020-10-05 23:40:13,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 314. [2020-10-05 23:40:13,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 314 states. [2020-10-05 23:40:13,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 757 transitions. [2020-10-05 23:40:13,328 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 757 transitions. Word has length 14 [2020-10-05 23:40:13,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:40:13,329 INFO L479 AbstractCegarLoop]: Abstraction has 314 states and 757 transitions. [2020-10-05 23:40:13,329 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-05 23:40:13,329 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 757 transitions. [2020-10-05 23:40:13,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-05 23:40:13,330 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:40:13,330 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:40:13,330 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-05 23:40:13,331 INFO L427 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:40:13,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:40:13,331 INFO L82 PathProgramCache]: Analyzing trace with hash 211902524, now seen corresponding path program 1 times [2020-10-05 23:40:13,331 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:40:13,332 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365648244] [2020-10-05 23:40:13,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:40:13,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:40:13,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:40:13,409 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365648244] [2020-10-05 23:40:13,409 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:40:13,410 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-05 23:40:13,410 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451490629] [2020-10-05 23:40:13,411 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-05 23:40:13,412 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:40:13,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-05 23:40:13,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-05 23:40:13,412 INFO L87 Difference]: Start difference. First operand 314 states and 757 transitions. Second operand 5 states. [2020-10-05 23:40:13,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:40:13,454 INFO L93 Difference]: Finished difference Result 261 states and 577 transitions. [2020-10-05 23:40:13,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-05 23:40:13,455 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2020-10-05 23:40:13,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:40:13,457 INFO L225 Difference]: With dead ends: 261 [2020-10-05 23:40:13,457 INFO L226 Difference]: Without dead ends: 201 [2020-10-05 23:40:13,457 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-05 23:40:13,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2020-10-05 23:40:13,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 191. [2020-10-05 23:40:13,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2020-10-05 23:40:13,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 409 transitions. [2020-10-05 23:40:13,464 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 409 transitions. Word has length 15 [2020-10-05 23:40:13,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:40:13,464 INFO L479 AbstractCegarLoop]: Abstraction has 191 states and 409 transitions. [2020-10-05 23:40:13,464 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-05 23:40:13,464 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 409 transitions. [2020-10-05 23:40:13,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-05 23:40:13,465 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:40:13,465 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:40:13,465 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-05 23:40:13,465 INFO L427 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:40:13,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:40:13,466 INFO L82 PathProgramCache]: Analyzing trace with hash 1129550295, now seen corresponding path program 1 times [2020-10-05 23:40:13,466 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:40:13,466 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201097261] [2020-10-05 23:40:13,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:40:13,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:40:13,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:40:13,591 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201097261] [2020-10-05 23:40:13,591 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:40:13,591 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-05 23:40:13,591 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915349976] [2020-10-05 23:40:13,592 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-05 23:40:13,592 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:40:13,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-05 23:40:13,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-05 23:40:13,592 INFO L87 Difference]: Start difference. First operand 191 states and 409 transitions. Second operand 6 states. [2020-10-05 23:40:13,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:40:13,658 INFO L93 Difference]: Finished difference Result 172 states and 370 transitions. [2020-10-05 23:40:13,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-05 23:40:13,659 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2020-10-05 23:40:13,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:40:13,660 INFO L225 Difference]: With dead ends: 172 [2020-10-05 23:40:13,660 INFO L226 Difference]: Without dead ends: 117 [2020-10-05 23:40:13,661 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-10-05 23:40:13,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2020-10-05 23:40:13,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 113. [2020-10-05 23:40:13,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2020-10-05 23:40:13,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 240 transitions. [2020-10-05 23:40:13,667 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 240 transitions. Word has length 17 [2020-10-05 23:40:13,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:40:13,667 INFO L479 AbstractCegarLoop]: Abstraction has 113 states and 240 transitions. [2020-10-05 23:40:13,668 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-05 23:40:13,668 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 240 transitions. [2020-10-05 23:40:13,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-10-05 23:40:13,668 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:40:13,668 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:40:13,669 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-05 23:40:13,669 INFO L427 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:40:13,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:40:13,669 INFO L82 PathProgramCache]: Analyzing trace with hash 444947368, now seen corresponding path program 1 times [2020-10-05 23:40:13,670 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:40:13,670 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276666339] [2020-10-05 23:40:13,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:40:13,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:40:13,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:40:13,882 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276666339] [2020-10-05 23:40:13,883 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:40:13,883 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-05 23:40:13,883 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31414608] [2020-10-05 23:40:13,884 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-05 23:40:13,887 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:40:13,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-05 23:40:13,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-05 23:40:13,888 INFO L87 Difference]: Start difference. First operand 113 states and 240 transitions. Second operand 7 states. [2020-10-05 23:40:14,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:40:14,052 INFO L93 Difference]: Finished difference Result 145 states and 301 transitions. [2020-10-05 23:40:14,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-05 23:40:14,053 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2020-10-05 23:40:14,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:40:14,054 INFO L225 Difference]: With dead ends: 145 [2020-10-05 23:40:14,055 INFO L226 Difference]: Without dead ends: 115 [2020-10-05 23:40:14,055 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2020-10-05 23:40:14,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2020-10-05 23:40:14,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 97. [2020-10-05 23:40:14,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2020-10-05 23:40:14,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 192 transitions. [2020-10-05 23:40:14,059 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 192 transitions. Word has length 20 [2020-10-05 23:40:14,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:40:14,059 INFO L479 AbstractCegarLoop]: Abstraction has 97 states and 192 transitions. [2020-10-05 23:40:14,060 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-05 23:40:14,060 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 192 transitions. [2020-10-05 23:40:14,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-10-05 23:40:14,060 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:40:14,060 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:40:14,061 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-05 23:40:14,061 INFO L427 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:40:14,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:40:14,061 INFO L82 PathProgramCache]: Analyzing trace with hash 1757585640, now seen corresponding path program 2 times [2020-10-05 23:40:14,061 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:40:14,062 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428237120] [2020-10-05 23:40:14,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:40:14,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:40:14,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:40:14,270 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428237120] [2020-10-05 23:40:14,270 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:40:14,270 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-05 23:40:14,271 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883555258] [2020-10-05 23:40:14,271 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-05 23:40:14,271 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:40:14,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-05 23:40:14,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2020-10-05 23:40:14,272 INFO L87 Difference]: Start difference. First operand 97 states and 192 transitions. Second operand 8 states. [2020-10-05 23:40:14,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:40:14,444 INFO L93 Difference]: Finished difference Result 123 states and 240 transitions. [2020-10-05 23:40:14,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-05 23:40:14,445 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2020-10-05 23:40:14,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:40:14,446 INFO L225 Difference]: With dead ends: 123 [2020-10-05 23:40:14,446 INFO L226 Difference]: Without dead ends: 77 [2020-10-05 23:40:14,446 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2020-10-05 23:40:14,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2020-10-05 23:40:14,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2020-10-05 23:40:14,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2020-10-05 23:40:14,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 144 transitions. [2020-10-05 23:40:14,449 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 144 transitions. Word has length 20 [2020-10-05 23:40:14,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:40:14,449 INFO L479 AbstractCegarLoop]: Abstraction has 77 states and 144 transitions. [2020-10-05 23:40:14,449 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-05 23:40:14,450 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 144 transitions. [2020-10-05 23:40:14,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-10-05 23:40:14,450 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:40:14,450 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:40:14,451 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-10-05 23:40:14,451 INFO L427 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:40:14,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:40:14,451 INFO L82 PathProgramCache]: Analyzing trace with hash 1467741448, now seen corresponding path program 3 times [2020-10-05 23:40:14,451 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:40:14,452 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774330771] [2020-10-05 23:40:14,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:40:14,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-05 23:40:14,488 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-05 23:40:14,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-05 23:40:14,522 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-05 23:40:14,555 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-05 23:40:14,555 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-10-05 23:40:14,555 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-10-05 23:40:14,556 WARN L633 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-05 23:40:14,569 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [996] [996] L2-->L818: Formula: (let ((.cse6 (= (mod ~y$w_buff1_used~0_In961504514 256) 0)) (.cse7 (= (mod ~y$r_buff1_thd0~0_In961504514 256) 0)) (.cse8 (= (mod ~y$r_buff0_thd0~0_In961504514 256) 0)) (.cse9 (= (mod ~y$w_buff0_used~0_In961504514 256) 0))) (let ((.cse3 (not .cse9)) (.cse4 (not .cse8)) (.cse5 (or .cse8 .cse9)) (.cse0 (or .cse6 .cse7)) (.cse1 (not .cse7)) (.cse2 (not .cse6))) (and (not (= ULTIMATE.start_assume_abort_if_not_~cond_Out961504514 0)) (or (and (= ~y$w_buff1_used~0_In961504514 ~y$w_buff1_used~0_Out961504514) .cse0) (and .cse1 .cse2 (= ~y$w_buff1_used~0_Out961504514 0))) (or (and .cse3 (= ~y$w_buff0_used~0_Out961504514 0) .cse4) (and .cse5 (= ~y$w_buff0_used~0_In961504514 ~y$w_buff0_used~0_Out961504514))) (or (and .cse3 (= ~y$w_buff0~0_In961504514 ~y~0_Out961504514) .cse4) (and .cse5 (or (and (= ~y~0_Out961504514 ~y~0_In961504514) .cse0) (and .cse1 (= ~y~0_Out961504514 ~y$w_buff1~0_In961504514) .cse2)))) (= ~y$r_buff1_thd0~0_Out961504514 ~y$r_buff1_thd0~0_In961504514) (= |ULTIMATE.start_assume_abort_if_not_#in~cond_In961504514| ULTIMATE.start_assume_abort_if_not_~cond_Out961504514) (= ~y$r_buff0_thd0~0_Out961504514 ~y$r_buff0_thd0~0_In961504514)))) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In961504514|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In961504514, ~y$w_buff1~0=~y$w_buff1~0_In961504514, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In961504514, ~y$w_buff0~0=~y$w_buff0~0_In961504514, ~y~0=~y~0_In961504514, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In961504514, ~y$w_buff1_used~0=~y$w_buff1_used~0_In961504514} OutVars{ULTIMATE.start_main_#t~ite28=|ULTIMATE.start_main_#t~ite28_Out961504514|, ~y$w_buff0_used~0=~y$w_buff0_used~0_Out961504514, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out961504514|, ULTIMATE.start_main_#t~ite25=|ULTIMATE.start_main_#t~ite25_Out961504514|, ULTIMATE.start_main_#t~ite26=|ULTIMATE.start_main_#t~ite26_Out961504514|, ULTIMATE.start_main_#t~ite27=|ULTIMATE.start_main_#t~ite27_Out961504514|, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out961504514|, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In961504514|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out961504514, ~y$w_buff1~0=~y$w_buff1~0_In961504514, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_Out961504514, ~y$w_buff0~0=~y$w_buff0~0_In961504514, ~y~0=~y~0_Out961504514, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out961504514, ~y$w_buff1_used~0=~y$w_buff1_used~0_Out961504514} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond, ULTIMATE.start_main_#t~ite28, ~y$w_buff0_used~0, ~y$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite25, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite27, ~y~0, ~y$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite23, ~y$w_buff1_used~0] because there is no mapped edge [2020-10-05 23:40:14,574 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:40:14,575 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:40:14,576 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:40:14,576 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:40:14,577 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:40:14,577 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:40:14,577 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:40:14,577 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:40:14,577 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:40:14,577 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:40:14,578 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:40:14,578 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:40:14,579 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:40:14,579 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:40:14,580 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:40:14,580 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:40:14,580 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:40:14,580 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:40:14,580 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:40:14,580 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:40:14,581 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:40:14,581 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:40:14,581 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:40:14,582 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:40:14,582 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:40:14,582 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:40:14,582 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:40:14,582 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:40:14,582 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:40:14,582 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:40:14,583 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:40:14,583 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:40:14,583 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:40:14,583 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:40:14,584 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:40:14,584 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:40:14,584 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:40:14,584 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:40:14,585 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:40:14,585 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:40:14,585 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:40:14,585 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:40:14,585 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:40:14,586 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:40:14,586 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:40:14,586 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:40:14,586 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:40:14,586 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:40:14,586 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:40:14,587 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:40:14,587 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:40:14,587 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:40:14,587 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:40:14,587 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:40:14,587 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:40:14,588 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:40:14,588 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:40:14,588 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:40:14,588 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:40:14,588 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:40:14,589 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:40:14,589 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:40:14,589 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:40:14,589 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:40:14,640 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.10 11:40:14 BasicIcfg [2020-10-05 23:40:14,641 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-05 23:40:14,642 INFO L168 Benchmark]: Toolchain (without parser) took 15099.69 ms. Allocated memory was 142.1 MB in the beginning and 353.4 MB in the end (delta: 211.3 MB). Free memory was 101.9 MB in the beginning and 132.9 MB in the end (delta: -31.0 MB). Peak memory consumption was 180.3 MB. Max. memory is 7.1 GB. [2020-10-05 23:40:14,643 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 142.1 MB. Free memory was 122.4 MB in the beginning and 121.9 MB in the end (delta: 419.7 kB). Peak memory consumption was 419.7 kB. Max. memory is 7.1 GB. [2020-10-05 23:40:14,644 INFO L168 Benchmark]: CACSL2BoogieTranslator took 784.95 ms. Allocated memory was 142.1 MB in the beginning and 204.5 MB in the end (delta: 62.4 MB). Free memory was 101.5 MB in the beginning and 159.2 MB in the end (delta: -57.7 MB). Peak memory consumption was 25.8 MB. Max. memory is 7.1 GB. [2020-10-05 23:40:14,644 INFO L168 Benchmark]: Boogie Procedure Inliner took 87.52 ms. Allocated memory is still 204.5 MB. Free memory was 159.2 MB in the beginning and 156.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2020-10-05 23:40:14,645 INFO L168 Benchmark]: Boogie Preprocessor took 42.06 ms. Allocated memory is still 204.5 MB. Free memory was 156.4 MB in the beginning and 153.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2020-10-05 23:40:14,645 INFO L168 Benchmark]: RCFGBuilder took 2227.86 ms. Allocated memory was 204.5 MB in the beginning and 244.8 MB in the end (delta: 40.4 MB). Free memory was 153.7 MB in the beginning and 160.9 MB in the end (delta: -7.2 MB). Peak memory consumption was 96.9 MB. Max. memory is 7.1 GB. [2020-10-05 23:40:14,646 INFO L168 Benchmark]: TraceAbstraction took 11951.66 ms. Allocated memory was 244.8 MB in the beginning and 353.4 MB in the end (delta: 108.5 MB). Free memory was 160.9 MB in the beginning and 132.9 MB in the end (delta: 27.9 MB). Peak memory consumption was 136.5 MB. Max. memory is 7.1 GB. [2020-10-05 23:40:14,649 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 142.1 MB. Free memory was 122.4 MB in the beginning and 121.9 MB in the end (delta: 419.7 kB). Peak memory consumption was 419.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 784.95 ms. Allocated memory was 142.1 MB in the beginning and 204.5 MB in the end (delta: 62.4 MB). Free memory was 101.5 MB in the beginning and 159.2 MB in the end (delta: -57.7 MB). Peak memory consumption was 25.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 87.52 ms. Allocated memory is still 204.5 MB. Free memory was 159.2 MB in the beginning and 156.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 42.06 ms. Allocated memory is still 204.5 MB. Free memory was 156.4 MB in the beginning and 153.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2227.86 ms. Allocated memory was 204.5 MB in the beginning and 244.8 MB in the end (delta: 40.4 MB). Free memory was 153.7 MB in the beginning and 160.9 MB in the end (delta: -7.2 MB). Peak memory consumption was 96.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 11951.66 ms. Allocated memory was 244.8 MB in the beginning and 353.4 MB in the end (delta: 108.5 MB). Free memory was 160.9 MB in the beginning and 132.9 MB in the end (delta: 27.9 MB). Peak memory consumption was 136.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 7.6s, 98 ProgramPointsBefore, 35 ProgramPointsAfterwards, 90 TransitionsBefore, 25 TransitionsAfterwards, 1560 CoEnabledTransitionPairs, 8 FixpointIterations, 30 TrivialSequentialCompositions, 39 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 2 ChoiceCompositions, 786 VarBasedMoverChecksPositive, 31 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 3870 CheckedPairsTotal, 76 TotalNumberOfCompositions - CounterExampleResult [Line: 7]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L698] 0 int __unbuffered_cnt = 0; [L700] 0 int __unbuffered_p2_EAX = 0; [L701] 0 _Bool main$tmp_guard0; [L702] 0 _Bool main$tmp_guard1; [L704] 0 int x = 0; [L706] 0 int y = 0; [L707] 0 _Bool y$flush_delayed; [L708] 0 int y$mem_tmp; [L709] 0 _Bool y$r_buff0_thd0; [L710] 0 _Bool y$r_buff0_thd1; [L711] 0 _Bool y$r_buff0_thd2; [L712] 0 _Bool y$r_buff0_thd3; [L713] 0 _Bool y$r_buff1_thd0; [L714] 0 _Bool y$r_buff1_thd1; [L715] 0 _Bool y$r_buff1_thd2; [L716] 0 _Bool y$r_buff1_thd3; [L717] 0 _Bool y$read_delayed; [L718] 0 int *y$read_delayed_var; [L719] 0 int y$w_buff0; [L720] 0 _Bool y$w_buff0_used; [L721] 0 int y$w_buff1; [L722] 0 _Bool y$w_buff1_used; [L723] 0 _Bool weak$$choice0; [L724] 0 _Bool weak$$choice2; [L802] 0 pthread_t t2177; [L803] FCALL, FORK 0 pthread_create(&t2177, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L804] 0 pthread_t t2178; [L728] 1 y$w_buff1 = y$w_buff0 [L729] 1 y$w_buff0 = 2 [L730] 1 y$w_buff1_used = y$w_buff0_used [L731] 1 y$w_buff0_used = (_Bool)1 [L7] COND TRUE 1 !expression [L7] 1 __VERIFIER_error() [L733] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L734] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L735] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L736] 1 y$r_buff1_thd3 = y$r_buff0_thd3 [L737] 1 y$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L740] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L805] FCALL, FORK 0 pthread_create(&t2178, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L757] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L760] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L760] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L761] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L761] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L762] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L762] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L763] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L763] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L764] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L764] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L767] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L769] 2 return 0; [L806] 0 pthread_t t2179; [L807] FCALL, FORK 0 pthread_create(&t2179, ((void *)0), P2, ((void *)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L774] 3 __unbuffered_p2_EAX = x VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L777] 3 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L780] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L780] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L781] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L781] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L782] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L782] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L783] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L783] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L784] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L784] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L787] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L789] 3 return 0; [L743] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L743] EXPR 1 y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y [L743] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L743] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L744] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L744] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L745] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L745] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L746] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L746] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L747] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L747] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L750] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L752] 1 return 0; [L809] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L820] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L821] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L822] 0 y$flush_delayed = weak$$choice2 [L823] 0 y$mem_tmp = y [L824] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L824] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L825] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L825] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0) [L825] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L825] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L826] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L826] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1) [L826] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1 [L826] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1) [L826] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L826] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L827] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L827] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L828] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L828] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L829] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L829] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0) [L829] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L829] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0) [L829] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L829] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L830] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L830] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L830] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0 [L830] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L830] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L830] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L831] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 2) [L832] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L832] 0 y = y$flush_delayed ? y$mem_tmp : y [L833] 0 y$flush_delayed = (_Bool)0 [L7] COND TRUE 0 !expression [L7] 0 __VERIFIER_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 89 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 11.7s, OverallIterations: 18, TraceHistogramMax: 1, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 7.7s, HoareTripleCheckerStatistics: 331 SDtfs, 375 SDslu, 536 SDs, 0 SdLazy, 394 SolverSat, 114 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 67 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=662occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 17 MinimizatonAttempts, 156 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 237 NumberOfCodeBlocks, 237 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 200 ConstructedInterpolants, 0 QuantifiedInterpolants, 24299 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...