/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/safe011_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-1d1d2b5 [2020-10-21 23:05:31,363 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-21 23:05:31,366 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-21 23:05:31,390 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-21 23:05:31,390 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-21 23:05:31,391 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-21 23:05:31,393 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-21 23:05:31,395 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-21 23:05:31,396 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-21 23:05:31,397 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-21 23:05:31,398 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-21 23:05:31,399 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-21 23:05:31,400 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-21 23:05:31,401 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-21 23:05:31,402 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-21 23:05:31,403 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-21 23:05:31,404 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-21 23:05:31,405 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-21 23:05:31,406 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-21 23:05:31,408 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-21 23:05:31,410 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-21 23:05:31,411 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-21 23:05:31,412 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-21 23:05:31,413 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-21 23:05:31,415 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-21 23:05:31,415 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-21 23:05:31,415 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-21 23:05:31,416 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-21 23:05:31,417 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-21 23:05:31,418 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-21 23:05:31,418 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-21 23:05:31,419 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-21 23:05:31,419 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-21 23:05:31,420 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-21 23:05:31,421 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-21 23:05:31,421 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-21 23:05:31,422 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-21 23:05:31,422 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-21 23:05:31,422 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-21 23:05:31,423 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-21 23:05:31,424 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-21 23:05:31,425 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-21 23:05:31,453 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-21 23:05:31,455 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-21 23:05:31,456 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-21 23:05:31,457 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-21 23:05:31,457 INFO L138 SettingsManager]: * Use SBE=true [2020-10-21 23:05:31,460 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-21 23:05:31,460 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-21 23:05:31,461 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-21 23:05:31,461 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-21 23:05:31,461 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-21 23:05:31,461 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-21 23:05:31,461 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-21 23:05:31,461 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-21 23:05:31,462 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-21 23:05:31,462 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-21 23:05:31,462 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-21 23:05:31,462 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-21 23:05:31,462 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-21 23:05:31,463 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-21 23:05:31,463 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-21 23:05:31,466 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-21 23:05:31,466 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-21 23:05:31,467 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-21 23:05:31,467 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2020-10-21 23:05:31,467 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-21 23:05:31,467 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-21 23:05:31,467 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-21 23:05:31,468 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2020-10-21 23:05:31,468 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-21 23:05:31,772 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-21 23:05:31,785 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-21 23:05:31,788 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-21 23:05:31,790 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-21 23:05:31,790 INFO L275 PluginConnector]: CDTParser initialized [2020-10-21 23:05:31,791 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe011_power.oepc.i [2020-10-21 23:05:31,853 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/95932a808/b4d291d72a154427b6645d7dda1a5cb3/FLAGf201315f4 [2020-10-21 23:05:32,345 INFO L306 CDTParser]: Found 1 translation units. [2020-10-21 23:05:32,346 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe011_power.oepc.i [2020-10-21 23:05:32,361 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/95932a808/b4d291d72a154427b6645d7dda1a5cb3/FLAGf201315f4 [2020-10-21 23:05:32,660 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/95932a808/b4d291d72a154427b6645d7dda1a5cb3 [2020-10-21 23:05:32,669 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-21 23:05:32,675 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-21 23:05:32,676 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-21 23:05:32,676 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-21 23:05:32,680 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-21 23:05:32,681 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.10 11:05:32" (1/1) ... [2020-10-21 23:05:32,684 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61977029 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:05:32, skipping insertion in model container [2020-10-21 23:05:32,685 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.10 11:05:32" (1/1) ... [2020-10-21 23:05:32,693 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-21 23:05:32,737 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-21 23:05:33,238 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-21 23:05:33,249 INFO L203 MainTranslator]: Completed pre-run [2020-10-21 23:05:33,356 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-21 23:05:33,447 INFO L208 MainTranslator]: Completed translation [2020-10-21 23:05:33,448 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:05:33 WrapperNode [2020-10-21 23:05:33,448 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-21 23:05:33,449 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-21 23:05:33,449 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-21 23:05:33,449 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-21 23:05:33,456 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:05:33" (1/1) ... [2020-10-21 23:05:33,486 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:05:33" (1/1) ... [2020-10-21 23:05:33,526 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-21 23:05:33,526 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-21 23:05:33,527 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-21 23:05:33,527 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-21 23:05:33,538 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:05:33" (1/1) ... [2020-10-21 23:05:33,538 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:05:33" (1/1) ... [2020-10-21 23:05:33,543 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:05:33" (1/1) ... [2020-10-21 23:05:33,544 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:05:33" (1/1) ... [2020-10-21 23:05:33,555 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:05:33" (1/1) ... [2020-10-21 23:05:33,559 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:05:33" (1/1) ... [2020-10-21 23:05:33,563 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:05:33" (1/1) ... [2020-10-21 23:05:33,568 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-21 23:05:33,569 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-21 23:05:33,569 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-21 23:05:33,569 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-21 23:05:33,570 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:05:33" (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-21 23:05:33,652 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-21 23:05:33,652 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-21 23:05:33,653 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-21 23:05:33,653 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-21 23:05:33,653 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-21 23:05:33,653 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-21 23:05:33,654 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-21 23:05:33,654 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-21 23:05:33,654 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-21 23:05:33,654 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-21 23:05:33,655 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-21 23:05:33,655 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-21 23:05:33,655 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-21 23:05:33,655 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-21 23:05:33,657 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-21 23:05:35,872 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-21 23:05:35,873 INFO L298 CfgBuilder]: Removed 14 assume(true) statements. [2020-10-21 23:05:35,875 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.10 11:05:35 BoogieIcfgContainer [2020-10-21 23:05:35,876 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-21 23:05:35,877 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-21 23:05:35,877 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-21 23:05:35,880 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-21 23:05:35,881 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.10 11:05:32" (1/3) ... [2020-10-21 23:05:35,882 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24bfef59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.10 11:05:35, skipping insertion in model container [2020-10-21 23:05:35,882 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:05:33" (2/3) ... [2020-10-21 23:05:35,882 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24bfef59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.10 11:05:35, skipping insertion in model container [2020-10-21 23:05:35,882 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.10 11:05:35" (3/3) ... [2020-10-21 23:05:35,884 INFO L111 eAbstractionObserver]: Analyzing ICFG safe011_power.oepc.i [2020-10-21 23:05:35,896 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-21 23:05:35,897 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-21 23:05:35,905 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-21 23:05:35,906 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-21 23:05:35,938 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:05:35,938 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:05:35,938 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:05:35,939 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:05:35,939 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:05:35,939 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:05:35,940 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:05:35,940 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:05:35,940 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:05:35,940 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:05:35,940 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:05:35,941 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:05:35,941 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:05:35,941 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:05:35,942 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:05:35,942 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:05:35,942 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:05:35,942 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:05:35,942 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:05:35,943 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:05:35,943 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:05:35,944 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:05:35,944 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:05:35,945 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:05:35,945 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:05:35,945 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:05:35,945 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:05:35,946 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:05:35,946 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:05:35,946 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:05:35,946 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:05:35,946 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:05:35,946 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:05:35,947 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:05:35,947 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:05:35,947 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:05:35,948 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:05:35,948 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:05:35,948 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:05:35,948 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:05:35,949 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:05:35,949 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:05:35,949 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:05:35,949 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:05:35,949 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:05:35,950 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:05:35,950 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:05:35,950 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:05:35,950 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:05:35,954 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:05:35,955 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:05:35,955 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:05:35,955 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:05:35,956 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:05:35,956 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:05:35,956 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:05:35,956 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:05:35,956 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:05:35,957 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:05:35,957 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:05:35,957 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:05:35,957 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:05:35,958 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:05:35,965 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:05:35,965 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:05:35,965 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:05:35,966 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:05:35,966 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:05:35,966 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:05:35,966 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:05:35,966 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:05:35,967 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:05:35,967 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:05:35,969 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:05:35,969 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:05:35,969 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:05:35,969 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:05:35,970 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:05:35,970 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:05:35,970 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:05:35,970 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:05:35,970 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:05:35,970 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:05:35,972 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-10-21 23:05:35,987 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-10-21 23:05:36,010 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-21 23:05:36,011 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-21 23:05:36,011 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-21 23:05:36,011 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-21 23:05:36,011 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-21 23:05:36,011 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-21 23:05:36,011 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-21 23:05:36,012 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-21 23:05:36,026 INFO L137 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2020-10-21 23:05:36,027 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 108 places, 101 transitions, 217 flow [2020-10-21 23:05:36,030 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 108 places, 101 transitions, 217 flow [2020-10-21 23:05:36,032 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 108 places, 101 transitions, 217 flow [2020-10-21 23:05:36,085 INFO L129 PetriNetUnfolder]: 3/98 cut-off events. [2020-10-21 23:05:36,085 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-21 23:05:36,090 INFO L80 FinitePrefix]: Finished finitePrefix Result has 108 conditions, 98 events. 3/98 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 76 event pairs, 0 based on Foata normal form. 0/93 useless extension candidates. Maximal degree in co-relation 65. Up to 2 conditions per place. [2020-10-21 23:05:36,094 INFO L116 LiptonReduction]: Number of co-enabled transitions 1870 [2020-10-21 23:05:38,061 WARN L193 SmtUtils]: Spent 1.41 s on a formula simplification. DAG size of input: 226 DAG size of output: 186 [2020-10-21 23:05:38,113 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 2, 2, 1] term [2020-10-21 23:05:38,113 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 23:05:38,116 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-21 23:05:38,117 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 23:05:38,961 WARN L193 SmtUtils]: Spent 828.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 122 [2020-10-21 23:05:39,555 WARN L193 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60 [2020-10-21 23:05:39,689 WARN L193 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-10-21 23:05:40,235 WARN L193 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 54 [2020-10-21 23:05:40,880 WARN L193 SmtUtils]: Spent 591.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 108 [2020-10-21 23:05:41,206 WARN L193 SmtUtils]: Spent 322.00 ms on a formula simplification that was a NOOP. DAG size: 105 [2020-10-21 23:05:42,505 WARN L193 SmtUtils]: Spent 1.01 s on a formula simplification. DAG size of input: 139 DAG size of output: 130 [2020-10-21 23:05:42,816 WARN L193 SmtUtils]: Spent 305.00 ms on a formula simplification that was a NOOP. DAG size: 127 [2020-10-21 23:05:43,235 WARN L193 SmtUtils]: Spent 376.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 112 [2020-10-21 23:05:43,417 WARN L193 SmtUtils]: Spent 178.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2020-10-21 23:05:43,445 INFO L131 LiptonReduction]: Checked pairs total: 4956 [2020-10-21 23:05:43,446 INFO L133 LiptonReduction]: Total number of compositions: 92 [2020-10-21 23:05:43,452 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 36 places, 26 transitions, 67 flow [2020-10-21 23:05:43,506 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 824 states. [2020-10-21 23:05:43,509 INFO L276 IsEmpty]: Start isEmpty. Operand 824 states. [2020-10-21 23:05:43,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-10-21 23:05:43,515 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:05:43,516 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-10-21 23:05:43,516 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:05:43,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:05:43,522 INFO L82 PathProgramCache]: Analyzing trace with hash 1092291, now seen corresponding path program 1 times [2020-10-21 23:05:43,532 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:05:43,533 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093869547] [2020-10-21 23:05:43,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:05:43,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:05:43,790 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-21 23:05:43,791 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093869547] [2020-10-21 23:05:43,792 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:05:43,792 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-21 23:05:43,793 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369245768] [2020-10-21 23:05:43,799 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-21 23:05:43,800 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:05:43,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-21 23:05:43,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-21 23:05:43,813 INFO L87 Difference]: Start difference. First operand 824 states. Second operand 3 states. [2020-10-21 23:05:43,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:05:43,927 INFO L93 Difference]: Finished difference Result 687 states and 2150 transitions. [2020-10-21 23:05:43,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-21 23:05:43,930 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-10-21 23:05:43,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:05:43,954 INFO L225 Difference]: With dead ends: 687 [2020-10-21 23:05:43,954 INFO L226 Difference]: Without dead ends: 562 [2020-10-21 23:05:43,956 INFO L677 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-21 23:05:43,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2020-10-21 23:05:44,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 562. [2020-10-21 23:05:44,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 562 states. [2020-10-21 23:05:44,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 1725 transitions. [2020-10-21 23:05:44,062 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 1725 transitions. Word has length 3 [2020-10-21 23:05:44,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:05:44,063 INFO L481 AbstractCegarLoop]: Abstraction has 562 states and 1725 transitions. [2020-10-21 23:05:44,063 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-21 23:05:44,063 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 1725 transitions. [2020-10-21 23:05:44,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-21 23:05:44,065 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:05:44,065 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:05:44,065 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-21 23:05:44,066 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:05:44,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:05:44,066 INFO L82 PathProgramCache]: Analyzing trace with hash -1825720558, now seen corresponding path program 1 times [2020-10-21 23:05:44,066 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:05:44,067 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811768535] [2020-10-21 23:05:44,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:05:44,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:05:44,205 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-21 23:05:44,205 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811768535] [2020-10-21 23:05:44,205 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:05:44,206 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-21 23:05:44,206 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042391532] [2020-10-21 23:05:44,207 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-21 23:05:44,208 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:05:44,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-21 23:05:44,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-21 23:05:44,208 INFO L87 Difference]: Start difference. First operand 562 states and 1725 transitions. Second operand 3 states. [2020-10-21 23:05:44,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:05:44,250 INFO L93 Difference]: Finished difference Result 552 states and 1687 transitions. [2020-10-21 23:05:44,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-21 23:05:44,251 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-10-21 23:05:44,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:05:44,257 INFO L225 Difference]: With dead ends: 552 [2020-10-21 23:05:44,258 INFO L226 Difference]: Without dead ends: 552 [2020-10-21 23:05:44,259 INFO L677 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-21 23:05:44,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2020-10-21 23:05:44,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 552. [2020-10-21 23:05:44,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 552 states. [2020-10-21 23:05:44,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 1687 transitions. [2020-10-21 23:05:44,290 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 1687 transitions. Word has length 9 [2020-10-21 23:05:44,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:05:44,292 INFO L481 AbstractCegarLoop]: Abstraction has 552 states and 1687 transitions. [2020-10-21 23:05:44,292 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-21 23:05:44,292 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 1687 transitions. [2020-10-21 23:05:44,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-10-21 23:05:44,293 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:05:44,293 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:05:44,294 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-21 23:05:44,294 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:05:44,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:05:44,294 INFO L82 PathProgramCache]: Analyzing trace with hash -128941837, now seen corresponding path program 1 times [2020-10-21 23:05:44,295 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:05:44,295 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611981092] [2020-10-21 23:05:44,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:05:44,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:05:44,374 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-21 23:05:44,374 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611981092] [2020-10-21 23:05:44,374 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:05:44,375 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-21 23:05:44,375 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889637743] [2020-10-21 23:05:44,375 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-21 23:05:44,375 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:05:44,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-21 23:05:44,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-21 23:05:44,376 INFO L87 Difference]: Start difference. First operand 552 states and 1687 transitions. Second operand 3 states. [2020-10-21 23:05:44,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:05:44,394 INFO L93 Difference]: Finished difference Result 544 states and 1657 transitions. [2020-10-21 23:05:44,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-21 23:05:44,395 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2020-10-21 23:05:44,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:05:44,400 INFO L225 Difference]: With dead ends: 544 [2020-10-21 23:05:44,400 INFO L226 Difference]: Without dead ends: 544 [2020-10-21 23:05:44,401 INFO L677 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-21 23:05:44,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2020-10-21 23:05:44,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 544. [2020-10-21 23:05:44,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 544 states. [2020-10-21 23:05:44,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 1657 transitions. [2020-10-21 23:05:44,424 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 1657 transitions. Word has length 10 [2020-10-21 23:05:44,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:05:44,425 INFO L481 AbstractCegarLoop]: Abstraction has 544 states and 1657 transitions. [2020-10-21 23:05:44,425 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-21 23:05:44,425 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 1657 transitions. [2020-10-21 23:05:44,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-21 23:05:44,427 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:05:44,427 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:05:44,428 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-21 23:05:44,428 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:05:44,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:05:44,428 INFO L82 PathProgramCache]: Analyzing trace with hash 297770051, now seen corresponding path program 1 times [2020-10-21 23:05:44,429 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:05:44,429 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866370700] [2020-10-21 23:05:44,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:05:44,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:05:44,489 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-21 23:05:44,490 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866370700] [2020-10-21 23:05:44,490 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:05:44,490 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-21 23:05:44,490 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720437730] [2020-10-21 23:05:44,491 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-21 23:05:44,491 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:05:44,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-21 23:05:44,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-21 23:05:44,492 INFO L87 Difference]: Start difference. First operand 544 states and 1657 transitions. Second operand 3 states. [2020-10-21 23:05:44,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:05:44,503 INFO L93 Difference]: Finished difference Result 525 states and 1590 transitions. [2020-10-21 23:05:44,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-21 23:05:44,505 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2020-10-21 23:05:44,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:05:44,509 INFO L225 Difference]: With dead ends: 525 [2020-10-21 23:05:44,509 INFO L226 Difference]: Without dead ends: 525 [2020-10-21 23:05:44,510 INFO L677 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-21 23:05:44,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2020-10-21 23:05:44,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 525. [2020-10-21 23:05:44,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 525 states. [2020-10-21 23:05:44,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 525 states and 1590 transitions. [2020-10-21 23:05:44,528 INFO L78 Accepts]: Start accepts. Automaton has 525 states and 1590 transitions. Word has length 11 [2020-10-21 23:05:44,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:05:44,529 INFO L481 AbstractCegarLoop]: Abstraction has 525 states and 1590 transitions. [2020-10-21 23:05:44,529 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-21 23:05:44,529 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states and 1590 transitions. [2020-10-21 23:05:44,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-21 23:05:44,531 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:05:44,532 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:05:44,532 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-21 23:05:44,532 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:05:44,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:05:44,532 INFO L82 PathProgramCache]: Analyzing trace with hash 640929964, now seen corresponding path program 1 times [2020-10-21 23:05:44,533 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:05:44,533 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406485901] [2020-10-21 23:05:44,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:05:44,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:05:44,593 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-21 23:05:44,593 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406485901] [2020-10-21 23:05:44,594 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:05:44,594 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-21 23:05:44,594 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139889344] [2020-10-21 23:05:44,594 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-21 23:05:44,595 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:05:44,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-21 23:05:44,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-21 23:05:44,595 INFO L87 Difference]: Start difference. First operand 525 states and 1590 transitions. Second operand 4 states. [2020-10-21 23:05:44,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:05:44,659 INFO L93 Difference]: Finished difference Result 674 states and 2001 transitions. [2020-10-21 23:05:44,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-21 23:05:44,661 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2020-10-21 23:05:44,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:05:44,664 INFO L225 Difference]: With dead ends: 674 [2020-10-21 23:05:44,664 INFO L226 Difference]: Without dead ends: 374 [2020-10-21 23:05:44,664 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 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-21 23:05:44,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2020-10-21 23:05:44,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 374. [2020-10-21 23:05:44,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2020-10-21 23:05:44,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 1066 transitions. [2020-10-21 23:05:44,678 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 1066 transitions. Word has length 12 [2020-10-21 23:05:44,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:05:44,678 INFO L481 AbstractCegarLoop]: Abstraction has 374 states and 1066 transitions. [2020-10-21 23:05:44,678 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-21 23:05:44,679 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 1066 transitions. [2020-10-21 23:05:44,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-21 23:05:44,685 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:05:44,685 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:05:44,685 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-21 23:05:44,685 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:05:44,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:05:44,686 INFO L82 PathProgramCache]: Analyzing trace with hash -1605853390, now seen corresponding path program 1 times [2020-10-21 23:05:44,686 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:05:44,686 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982390267] [2020-10-21 23:05:44,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:05:44,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:05:44,835 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-21 23:05:44,835 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982390267] [2020-10-21 23:05:44,835 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:05:44,835 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-21 23:05:44,836 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068734607] [2020-10-21 23:05:44,836 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-21 23:05:44,836 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:05:44,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-21 23:05:44,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-21 23:05:44,837 INFO L87 Difference]: Start difference. First operand 374 states and 1066 transitions. Second operand 5 states. [2020-10-21 23:05:44,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:05:44,950 INFO L93 Difference]: Finished difference Result 404 states and 1154 transitions. [2020-10-21 23:05:44,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-21 23:05:44,951 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-10-21 23:05:44,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:05:44,954 INFO L225 Difference]: With dead ends: 404 [2020-10-21 23:05:44,954 INFO L226 Difference]: Without dead ends: 404 [2020-10-21 23:05:44,955 INFO L677 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-21 23:05:44,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2020-10-21 23:05:44,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 404. [2020-10-21 23:05:44,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 404 states. [2020-10-21 23:05:44,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 1154 transitions. [2020-10-21 23:05:44,970 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 1154 transitions. Word has length 13 [2020-10-21 23:05:44,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:05:44,970 INFO L481 AbstractCegarLoop]: Abstraction has 404 states and 1154 transitions. [2020-10-21 23:05:44,970 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-21 23:05:44,971 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 1154 transitions. [2020-10-21 23:05:44,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-21 23:05:44,972 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:05:44,972 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:05:44,972 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-21 23:05:44,973 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:05:44,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:05:44,973 INFO L82 PathProgramCache]: Analyzing trace with hash 1204965012, now seen corresponding path program 1 times [2020-10-21 23:05:44,973 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:05:44,975 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845437615] [2020-10-21 23:05:44,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:05:45,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:05:45,071 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-21 23:05:45,071 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845437615] [2020-10-21 23:05:45,071 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:05:45,072 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-21 23:05:45,077 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472615804] [2020-10-21 23:05:45,078 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-21 23:05:45,078 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:05:45,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-21 23:05:45,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-21 23:05:45,079 INFO L87 Difference]: Start difference. First operand 404 states and 1154 transitions. Second operand 4 states. [2020-10-21 23:05:45,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:05:45,172 INFO L93 Difference]: Finished difference Result 411 states and 1176 transitions. [2020-10-21 23:05:45,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-21 23:05:45,173 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2020-10-21 23:05:45,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:05:45,178 INFO L225 Difference]: With dead ends: 411 [2020-10-21 23:05:45,179 INFO L226 Difference]: Without dead ends: 411 [2020-10-21 23:05:45,179 INFO L677 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-21 23:05:45,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2020-10-21 23:05:45,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 407. [2020-10-21 23:05:45,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2020-10-21 23:05:45,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 1162 transitions. [2020-10-21 23:05:45,196 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 1162 transitions. Word has length 13 [2020-10-21 23:05:45,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:05:45,196 INFO L481 AbstractCegarLoop]: Abstraction has 407 states and 1162 transitions. [2020-10-21 23:05:45,196 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-21 23:05:45,196 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 1162 transitions. [2020-10-21 23:05:45,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-21 23:05:45,198 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:05:45,198 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:05:45,198 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-21 23:05:45,198 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:05:45,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:05:45,199 INFO L82 PathProgramCache]: Analyzing trace with hash 438940752, now seen corresponding path program 2 times [2020-10-21 23:05:45,199 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:05:45,199 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179037053] [2020-10-21 23:05:45,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:05:45,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:05:45,309 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-21 23:05:45,310 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179037053] [2020-10-21 23:05:45,311 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:05:45,311 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-21 23:05:45,312 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25540769] [2020-10-21 23:05:45,312 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-21 23:05:45,313 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:05:45,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-21 23:05:45,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-10-21 23:05:45,314 INFO L87 Difference]: Start difference. First operand 407 states and 1162 transitions. Second operand 5 states. [2020-10-21 23:05:45,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:05:45,397 INFO L93 Difference]: Finished difference Result 402 states and 1146 transitions. [2020-10-21 23:05:45,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-21 23:05:45,398 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-10-21 23:05:45,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:05:45,402 INFO L225 Difference]: With dead ends: 402 [2020-10-21 23:05:45,402 INFO L226 Difference]: Without dead ends: 402 [2020-10-21 23:05:45,403 INFO L677 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-21 23:05:45,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2020-10-21 23:05:45,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 395. [2020-10-21 23:05:45,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2020-10-21 23:05:45,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 1124 transitions. [2020-10-21 23:05:45,416 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 1124 transitions. Word has length 13 [2020-10-21 23:05:45,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:05:45,416 INFO L481 AbstractCegarLoop]: Abstraction has 395 states and 1124 transitions. [2020-10-21 23:05:45,416 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-21 23:05:45,416 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 1124 transitions. [2020-10-21 23:05:45,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-21 23:05:45,417 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:05:45,418 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:05:45,418 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-21 23:05:45,418 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:05:45,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:05:45,418 INFO L82 PathProgramCache]: Analyzing trace with hash 1758105819, now seen corresponding path program 1 times [2020-10-21 23:05:45,419 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:05:45,421 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790020358] [2020-10-21 23:05:45,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:05:45,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:05:45,653 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-21 23:05:45,654 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790020358] [2020-10-21 23:05:45,654 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:05:45,654 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-21 23:05:45,654 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383118783] [2020-10-21 23:05:45,655 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-21 23:05:45,655 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:05:45,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-21 23:05:45,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-21 23:05:45,656 INFO L87 Difference]: Start difference. First operand 395 states and 1124 transitions. Second operand 6 states. [2020-10-21 23:05:45,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:05:45,766 INFO L93 Difference]: Finished difference Result 391 states and 1110 transitions. [2020-10-21 23:05:45,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-21 23:05:45,767 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2020-10-21 23:05:45,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:05:45,770 INFO L225 Difference]: With dead ends: 391 [2020-10-21 23:05:45,770 INFO L226 Difference]: Without dead ends: 391 [2020-10-21 23:05:45,771 INFO L677 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-21 23:05:45,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2020-10-21 23:05:45,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 359. [2020-10-21 23:05:45,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 359 states. [2020-10-21 23:05:45,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 1014 transitions. [2020-10-21 23:05:45,784 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 1014 transitions. Word has length 14 [2020-10-21 23:05:45,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:05:45,784 INFO L481 AbstractCegarLoop]: Abstraction has 359 states and 1014 transitions. [2020-10-21 23:05:45,784 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-21 23:05:45,784 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 1014 transitions. [2020-10-21 23:05:45,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-21 23:05:45,785 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:05:45,785 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:05:45,786 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-21 23:05:45,786 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:05:45,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:05:45,786 INFO L82 PathProgramCache]: Analyzing trace with hash 1758150645, now seen corresponding path program 1 times [2020-10-21 23:05:45,787 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:05:45,787 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296729098] [2020-10-21 23:05:45,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:05:45,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:05:45,906 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-21 23:05:45,906 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296729098] [2020-10-21 23:05:45,907 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:05:45,907 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-21 23:05:45,907 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128188720] [2020-10-21 23:05:45,908 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-21 23:05:45,908 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:05:45,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-21 23:05:45,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-21 23:05:45,909 INFO L87 Difference]: Start difference. First operand 359 states and 1014 transitions. Second operand 5 states. [2020-10-21 23:05:46,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:05:46,029 INFO L93 Difference]: Finished difference Result 429 states and 1210 transitions. [2020-10-21 23:05:46,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-21 23:05:46,031 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-10-21 23:05:46,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:05:46,034 INFO L225 Difference]: With dead ends: 429 [2020-10-21 23:05:46,034 INFO L226 Difference]: Without dead ends: 429 [2020-10-21 23:05:46,035 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-10-21 23:05:46,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2020-10-21 23:05:46,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 423. [2020-10-21 23:05:46,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 423 states. [2020-10-21 23:05:46,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 1197 transitions. [2020-10-21 23:05:46,049 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 1197 transitions. Word has length 14 [2020-10-21 23:05:46,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:05:46,049 INFO L481 AbstractCegarLoop]: Abstraction has 423 states and 1197 transitions. [2020-10-21 23:05:46,049 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-21 23:05:46,050 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 1197 transitions. [2020-10-21 23:05:46,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-21 23:05:46,051 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:05:46,051 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:05:46,051 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-21 23:05:46,051 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:05:46,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:05:46,052 INFO L82 PathProgramCache]: Analyzing trace with hash -1331906856, now seen corresponding path program 1 times [2020-10-21 23:05:46,052 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:05:46,052 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612857943] [2020-10-21 23:05:46,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:05:46,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:05:46,143 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-21 23:05:46,143 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612857943] [2020-10-21 23:05:46,143 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:05:46,143 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-21 23:05:46,144 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595026630] [2020-10-21 23:05:46,144 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-21 23:05:46,144 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:05:46,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-21 23:05:46,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-21 23:05:46,145 INFO L87 Difference]: Start difference. First operand 423 states and 1197 transitions. Second operand 6 states. [2020-10-21 23:05:46,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:05:46,310 INFO L93 Difference]: Finished difference Result 492 states and 1379 transitions. [2020-10-21 23:05:46,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-21 23:05:46,311 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2020-10-21 23:05:46,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:05:46,315 INFO L225 Difference]: With dead ends: 492 [2020-10-21 23:05:46,315 INFO L226 Difference]: Without dead ends: 492 [2020-10-21 23:05:46,315 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-10-21 23:05:46,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 492 states. [2020-10-21 23:05:46,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 492 to 407. [2020-10-21 23:05:46,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2020-10-21 23:05:46,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 1145 transitions. [2020-10-21 23:05:46,330 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 1145 transitions. Word has length 15 [2020-10-21 23:05:46,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:05:46,330 INFO L481 AbstractCegarLoop]: Abstraction has 407 states and 1145 transitions. [2020-10-21 23:05:46,330 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-21 23:05:46,330 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 1145 transitions. [2020-10-21 23:05:46,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-21 23:05:46,331 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:05:46,331 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:05:46,332 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-21 23:05:46,332 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:05:46,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:05:46,332 INFO L82 PathProgramCache]: Analyzing trace with hash -1331906639, now seen corresponding path program 1 times [2020-10-21 23:05:46,332 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:05:46,333 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170633953] [2020-10-21 23:05:46,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:05:46,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:05:46,479 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-21 23:05:46,479 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170633953] [2020-10-21 23:05:46,479 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:05:46,480 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-21 23:05:46,480 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103873492] [2020-10-21 23:05:46,480 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-21 23:05:46,480 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:05:46,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-21 23:05:46,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-10-21 23:05:46,481 INFO L87 Difference]: Start difference. First operand 407 states and 1145 transitions. Second operand 6 states. [2020-10-21 23:05:46,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:05:46,559 INFO L93 Difference]: Finished difference Result 547 states and 1497 transitions. [2020-10-21 23:05:46,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-21 23:05:46,560 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2020-10-21 23:05:46,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:05:46,569 INFO L225 Difference]: With dead ends: 547 [2020-10-21 23:05:46,569 INFO L226 Difference]: Without dead ends: 511 [2020-10-21 23:05:46,571 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-10-21 23:05:46,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2020-10-21 23:05:46,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 433. [2020-10-21 23:05:46,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 433 states. [2020-10-21 23:05:46,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 1208 transitions. [2020-10-21 23:05:46,593 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 1208 transitions. Word has length 15 [2020-10-21 23:05:46,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:05:46,593 INFO L481 AbstractCegarLoop]: Abstraction has 433 states and 1208 transitions. [2020-10-21 23:05:46,594 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-21 23:05:46,594 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 1208 transitions. [2020-10-21 23:05:46,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-21 23:05:46,595 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:05:46,595 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:05:46,595 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-21 23:05:46,595 INFO L429 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:05:46,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:05:46,596 INFO L82 PathProgramCache]: Analyzing trace with hash -1331920527, now seen corresponding path program 1 times [2020-10-21 23:05:46,596 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:05:46,601 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826074740] [2020-10-21 23:05:46,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:05:46,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:05:46,768 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-21 23:05:46,768 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826074740] [2020-10-21 23:05:46,768 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:05:46,769 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-21 23:05:46,769 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873286698] [2020-10-21 23:05:46,770 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-21 23:05:46,770 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:05:46,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-21 23:05:46,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-21 23:05:46,770 INFO L87 Difference]: Start difference. First operand 433 states and 1208 transitions. Second operand 5 states. [2020-10-21 23:05:46,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:05:46,852 INFO L93 Difference]: Finished difference Result 661 states and 1807 transitions. [2020-10-21 23:05:46,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-21 23:05:46,853 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2020-10-21 23:05:46,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:05:46,856 INFO L225 Difference]: With dead ends: 661 [2020-10-21 23:05:46,857 INFO L226 Difference]: Without dead ends: 359 [2020-10-21 23:05:46,857 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-21 23:05:46,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2020-10-21 23:05:46,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 347. [2020-10-21 23:05:46,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 347 states. [2020-10-21 23:05:46,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 888 transitions. [2020-10-21 23:05:46,869 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 888 transitions. Word has length 15 [2020-10-21 23:05:46,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:05:46,869 INFO L481 AbstractCegarLoop]: Abstraction has 347 states and 888 transitions. [2020-10-21 23:05:46,869 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-21 23:05:46,869 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 888 transitions. [2020-10-21 23:05:46,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-21 23:05:46,870 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:05:46,870 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:05:46,870 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-21 23:05:46,871 INFO L429 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:05:46,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:05:46,871 INFO L82 PathProgramCache]: Analyzing trace with hash 1154086099, now seen corresponding path program 2 times [2020-10-21 23:05:46,871 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:05:46,872 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989885101] [2020-10-21 23:05:46,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:05:46,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:05:46,919 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-21 23:05:46,920 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989885101] [2020-10-21 23:05:46,920 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:05:46,920 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-21 23:05:46,920 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222759342] [2020-10-21 23:05:46,920 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-21 23:05:46,921 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:05:46,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-21 23:05:46,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-21 23:05:46,921 INFO L87 Difference]: Start difference. First operand 347 states and 888 transitions. Second operand 4 states. [2020-10-21 23:05:46,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:05:46,954 INFO L93 Difference]: Finished difference Result 348 states and 793 transitions. [2020-10-21 23:05:46,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-21 23:05:46,955 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2020-10-21 23:05:46,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:05:46,957 INFO L225 Difference]: With dead ends: 348 [2020-10-21 23:05:46,957 INFO L226 Difference]: Without dead ends: 261 [2020-10-21 23:05:46,957 INFO L677 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-21 23:05:46,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2020-10-21 23:05:46,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 261. [2020-10-21 23:05:46,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2020-10-21 23:05:46,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 588 transitions. [2020-10-21 23:05:46,964 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 588 transitions. Word has length 15 [2020-10-21 23:05:46,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:05:46,965 INFO L481 AbstractCegarLoop]: Abstraction has 261 states and 588 transitions. [2020-10-21 23:05:46,965 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-21 23:05:46,965 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 588 transitions. [2020-10-21 23:05:46,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-21 23:05:46,966 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:05:46,966 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:05:46,966 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-21 23:05:46,966 INFO L429 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:05:46,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:05:46,967 INFO L82 PathProgramCache]: Analyzing trace with hash 1927467217, now seen corresponding path program 1 times [2020-10-21 23:05:46,967 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:05:46,967 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615910645] [2020-10-21 23:05:46,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:05:46,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:05:47,025 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-21 23:05:47,026 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615910645] [2020-10-21 23:05:47,026 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:05:47,026 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-21 23:05:47,026 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607810954] [2020-10-21 23:05:47,027 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-21 23:05:47,027 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:05:47,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-21 23:05:47,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-21 23:05:47,028 INFO L87 Difference]: Start difference. First operand 261 states and 588 transitions. Second operand 5 states. [2020-10-21 23:05:47,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:05:47,070 INFO L93 Difference]: Finished difference Result 224 states and 457 transitions. [2020-10-21 23:05:47,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-21 23:05:47,071 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-10-21 23:05:47,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:05:47,072 INFO L225 Difference]: With dead ends: 224 [2020-10-21 23:05:47,073 INFO L226 Difference]: Without dead ends: 176 [2020-10-21 23:05:47,073 INFO L677 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-21 23:05:47,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2020-10-21 23:05:47,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 176. [2020-10-21 23:05:47,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2020-10-21 23:05:47,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 351 transitions. [2020-10-21 23:05:47,078 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 351 transitions. Word has length 16 [2020-10-21 23:05:47,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:05:47,078 INFO L481 AbstractCegarLoop]: Abstraction has 176 states and 351 transitions. [2020-10-21 23:05:47,079 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-21 23:05:47,079 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 351 transitions. [2020-10-21 23:05:47,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-21 23:05:47,079 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:05:47,079 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:05:47,080 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-21 23:05:47,080 INFO L429 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:05:47,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:05:47,080 INFO L82 PathProgramCache]: Analyzing trace with hash 2038631197, now seen corresponding path program 1 times [2020-10-21 23:05:47,080 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:05:47,081 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113245522] [2020-10-21 23:05:47,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:05:47,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:05:47,234 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-21 23:05:47,234 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113245522] [2020-10-21 23:05:47,234 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:05:47,235 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-21 23:05:47,235 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387554282] [2020-10-21 23:05:47,235 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-21 23:05:47,235 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:05:47,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-21 23:05:47,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2020-10-21 23:05:47,236 INFO L87 Difference]: Start difference. First operand 176 states and 351 transitions. Second operand 8 states. [2020-10-21 23:05:47,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:05:47,418 INFO L93 Difference]: Finished difference Result 193 states and 375 transitions. [2020-10-21 23:05:47,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-21 23:05:47,420 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2020-10-21 23:05:47,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:05:47,421 INFO L225 Difference]: With dead ends: 193 [2020-10-21 23:05:47,422 INFO L226 Difference]: Without dead ends: 135 [2020-10-21 23:05:47,422 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2020-10-21 23:05:47,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2020-10-21 23:05:47,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 124. [2020-10-21 23:05:47,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2020-10-21 23:05:47,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 249 transitions. [2020-10-21 23:05:47,426 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 249 transitions. Word has length 18 [2020-10-21 23:05:47,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:05:47,426 INFO L481 AbstractCegarLoop]: Abstraction has 124 states and 249 transitions. [2020-10-21 23:05:47,426 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-21 23:05:47,426 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 249 transitions. [2020-10-21 23:05:47,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-21 23:05:47,427 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:05:47,427 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:05:47,427 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-21 23:05:47,428 INFO L429 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:05:47,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:05:47,428 INFO L82 PathProgramCache]: Analyzing trace with hash 1448239176, now seen corresponding path program 1 times [2020-10-21 23:05:47,428 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:05:47,428 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50231143] [2020-10-21 23:05:47,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:05:47,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:05:47,508 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-21 23:05:47,509 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50231143] [2020-10-21 23:05:47,509 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:05:47,509 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-21 23:05:47,509 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131924859] [2020-10-21 23:05:47,510 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-21 23:05:47,510 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:05:47,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-21 23:05:47,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-21 23:05:47,511 INFO L87 Difference]: Start difference. First operand 124 states and 249 transitions. Second operand 6 states. [2020-10-21 23:05:47,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:05:47,557 INFO L93 Difference]: Finished difference Result 111 states and 222 transitions. [2020-10-21 23:05:47,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-21 23:05:47,558 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2020-10-21 23:05:47,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:05:47,559 INFO L225 Difference]: With dead ends: 111 [2020-10-21 23:05:47,559 INFO L226 Difference]: Without dead ends: 62 [2020-10-21 23:05:47,559 INFO L677 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-21 23:05:47,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2020-10-21 23:05:47,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2020-10-21 23:05:47,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2020-10-21 23:05:47,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 109 transitions. [2020-10-21 23:05:47,562 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 109 transitions. Word has length 18 [2020-10-21 23:05:47,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:05:47,562 INFO L481 AbstractCegarLoop]: Abstraction has 62 states and 109 transitions. [2020-10-21 23:05:47,562 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-21 23:05:47,562 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 109 transitions. [2020-10-21 23:05:47,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-21 23:05:47,563 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:05:47,563 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, 1] [2020-10-21 23:05:47,563 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-10-21 23:05:47,563 INFO L429 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:05:47,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:05:47,563 INFO L82 PathProgramCache]: Analyzing trace with hash 357676392, now seen corresponding path program 1 times [2020-10-21 23:05:47,564 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:05:47,564 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616443872] [2020-10-21 23:05:47,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:05:47,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-21 23:05:47,601 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-21 23:05:47,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-21 23:05:47,640 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-21 23:05:47,675 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-21 23:05:47,676 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-21 23:05:47,676 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-10-21 23:05:47,677 WARN L264 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-21 23:05:47,694 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [1047] [1047] L2-->L834: Formula: (let ((.cse6 (= (mod ~z$r_buff1_thd0~0_In2029713215 256) 0)) (.cse7 (= (mod ~z$w_buff1_used~0_In2029713215 256) 0)) (.cse9 (= (mod ~z$r_buff0_thd0~0_In2029713215 256) 0)) (.cse8 (= (mod ~z$w_buff0_used~0_In2029713215 256) 0))) (let ((.cse0 (not .cse8)) (.cse1 (not .cse9)) (.cse2 (or .cse8 .cse9)) (.cse3 (not .cse7)) (.cse4 (not .cse6)) (.cse5 (or .cse6 .cse7))) (and (or (and .cse0 .cse1 (= ~z$w_buff0_used~0_Out2029713215 0)) (and (= ~z$w_buff0_used~0_In2029713215 ~z$w_buff0_used~0_Out2029713215) .cse2)) (= ~z$r_buff0_thd0~0_Out2029713215 ~z$r_buff0_thd0~0_In2029713215) (not (= ULTIMATE.start_assume_abort_if_not_~cond_Out2029713215 0)) (= ~z$r_buff1_thd0~0_Out2029713215 ~z$r_buff1_thd0~0_In2029713215) (or (and .cse0 .cse1 (= ~z~0_Out2029713215 ~z$w_buff0~0_In2029713215)) (and (or (and .cse3 .cse4 (= ~z$w_buff1~0_In2029713215 ~z~0_Out2029713215)) (and (= ~z~0_In2029713215 ~z~0_Out2029713215) .cse5)) .cse2)) (= ULTIMATE.start_assume_abort_if_not_~cond_Out2029713215 |ULTIMATE.start_assume_abort_if_not_#in~cond_In2029713215|) (or (and (= ~z$w_buff1_used~0_Out2029713215 0) .cse3 .cse4) (and .cse5 (= ~z$w_buff1_used~0_Out2029713215 ~z$w_buff1_used~0_In2029713215)))))) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In2029713215|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2029713215, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2029713215, ~z$w_buff0~0=~z$w_buff0~0_In2029713215, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In2029713215, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2029713215, ~z$w_buff1~0=~z$w_buff1~0_In2029713215, ~z~0=~z~0_In2029713215} OutVars{ULTIMATE.start_main_#t~ite28=|ULTIMATE.start_main_#t~ite28_Out2029713215|, ~z$w_buff0_used~0=~z$w_buff0_used~0_Out2029713215, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_Out2029713215|, ~z$w_buff0~0=~z$w_buff0~0_In2029713215, ~z$w_buff1_used~0=~z$w_buff1_used~0_Out2029713215, ~z$w_buff1~0=~z$w_buff1~0_In2029713215, ULTIMATE.start_main_#t~ite26=|ULTIMATE.start_main_#t~ite26_Out2029713215|, ULTIMATE.start_main_#t~ite27=|ULTIMATE.start_main_#t~ite27_Out2029713215|, ULTIMATE.start_main_#t~ite31=|ULTIMATE.start_main_#t~ite31_Out2029713215|, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In2029713215|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_Out2029713215, ULTIMATE.start_main_#t~ite30=|ULTIMATE.start_main_#t~ite30_Out2029713215|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out2029713215, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_Out2029713215, ~z~0=~z~0_Out2029713215} AuxVars[] AssignedVars[~z$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite30, ULTIMATE.start_assume_abort_if_not_~cond, ULTIMATE.start_main_#t~ite28, ~z$w_buff0_used~0, ULTIMATE.start_main_#t~ite29, ~z$r_buff1_thd0~0, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite27, ~z~0, ULTIMATE.start_main_#t~ite31] because there is no mapped edge [2020-10-21 23:05:47,699 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-21 23:05:47,699 WARN L224 RCFGBacktranslator]: unable to determine which branch was taken at C: __VERIFIER_atomic_begin() [740] [2020-10-21 23:05:47,702 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-21 23:05:47,702 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:05:47,702 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-21 23:05:47,702 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:05:47,703 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-21 23:05:47,703 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:05:47,703 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-21 23:05:47,703 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:05:47,703 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-21 23:05:47,703 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:05:47,704 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-21 23:05:47,704 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:05:47,705 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-21 23:05:47,705 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:05:47,705 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-21 23:05:47,705 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:05:47,705 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-21 23:05:47,706 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:05:47,706 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-21 23:05:47,706 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:05:47,706 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-21 23:05:47,706 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:05:47,707 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-21 23:05:47,707 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:05:47,707 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-21 23:05:47,707 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:05:47,707 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-21 23:05:47,707 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:05:47,708 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-21 23:05:47,708 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:05:47,708 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-21 23:05:47,708 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:05:47,708 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-21 23:05:47,709 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:05:47,709 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-21 23:05:47,709 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:05:47,710 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-21 23:05:47,710 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:05:47,710 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-21 23:05:47,710 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:05:47,710 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-21 23:05:47,710 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:05:47,711 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-21 23:05:47,711 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:05:47,711 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-21 23:05:47,711 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:05:47,711 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-21 23:05:47,711 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:05:47,712 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-21 23:05:47,712 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:05:47,712 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-21 23:05:47,712 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:05:47,779 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.10 11:05:47 BasicIcfg [2020-10-21 23:05:47,779 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-21 23:05:47,782 INFO L168 Benchmark]: Toolchain (without parser) took 15110.27 ms. Allocated memory was 139.5 MB in the beginning and 360.2 MB in the end (delta: 220.7 MB). Free memory was 101.0 MB in the beginning and 143.5 MB in the end (delta: -42.6 MB). Peak memory consumption was 178.2 MB. Max. memory is 7.1 GB. [2020-10-21 23:05:47,783 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 139.5 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2020-10-21 23:05:47,783 INFO L168 Benchmark]: CACSL2BoogieTranslator took 772.21 ms. Allocated memory was 139.5 MB in the beginning and 202.4 MB in the end (delta: 62.9 MB). Free memory was 100.1 MB in the beginning and 154.3 MB in the end (delta: -54.2 MB). Peak memory consumption was 24.5 MB. Max. memory is 7.1 GB. [2020-10-21 23:05:47,785 INFO L168 Benchmark]: Boogie Procedure Inliner took 77.40 ms. Allocated memory is still 202.4 MB. Free memory was 154.3 MB in the beginning and 151.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2020-10-21 23:05:47,785 INFO L168 Benchmark]: Boogie Preprocessor took 42.27 ms. Allocated memory is still 202.4 MB. Free memory was 151.6 MB in the beginning and 148.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2020-10-21 23:05:47,786 INFO L168 Benchmark]: RCFGBuilder took 2306.57 ms. Allocated memory was 202.4 MB in the beginning and 249.0 MB in the end (delta: 46.7 MB). Free memory was 148.9 MB in the beginning and 161.7 MB in the end (delta: -12.8 MB). Peak memory consumption was 103.3 MB. Max. memory is 7.1 GB. [2020-10-21 23:05:47,787 INFO L168 Benchmark]: TraceAbstraction took 11902.35 ms. Allocated memory was 249.0 MB in the beginning and 360.2 MB in the end (delta: 111.1 MB). Free memory was 159.9 MB in the beginning and 143.5 MB in the end (delta: 16.4 MB). Peak memory consumption was 127.5 MB. Max. memory is 7.1 GB. [2020-10-21 23:05:47,796 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 139.5 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 772.21 ms. Allocated memory was 139.5 MB in the beginning and 202.4 MB in the end (delta: 62.9 MB). Free memory was 100.1 MB in the beginning and 154.3 MB in the end (delta: -54.2 MB). Peak memory consumption was 24.5 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 77.40 ms. Allocated memory is still 202.4 MB. Free memory was 154.3 MB in the beginning and 151.6 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.27 ms. Allocated memory is still 202.4 MB. Free memory was 151.6 MB in the beginning and 148.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2306.57 ms. Allocated memory was 202.4 MB in the beginning and 249.0 MB in the end (delta: 46.7 MB). Free memory was 148.9 MB in the beginning and 161.7 MB in the end (delta: -12.8 MB). Peak memory consumption was 103.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 11902.35 ms. Allocated memory was 249.0 MB in the beginning and 360.2 MB in the end (delta: 111.1 MB). Free memory was 159.9 MB in the beginning and 143.5 MB in the end (delta: 16.4 MB). Peak memory consumption was 127.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1029 VarBasedMoverChecksPositive, 36 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 82 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 7.4s, 108 PlacesBefore, 36 PlacesAfterwards, 101 TransitionsBefore, 26 TransitionsAfterwards, 1870 CoEnabledTransitionPairs, 6 FixpointIterations, 35 TrivialSequentialCompositions, 43 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 11 ConcurrentYvCompositions, 3 ChoiceCompositions, 92 TotalNumberOfCompositions, 4956 MoverChecksTotal - CounterExampleResult [Line: 17]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p2_EAX = 0; [L712] 0 _Bool main$tmp_guard0; [L713] 0 _Bool main$tmp_guard1; [L715] 0 int x = 0; [L717] 0 int y = 0; [L719] 0 int z = 0; [L720] 0 _Bool z$flush_delayed; [L721] 0 int z$mem_tmp; [L722] 0 _Bool z$r_buff0_thd0; [L723] 0 _Bool z$r_buff0_thd1; [L724] 0 _Bool z$r_buff0_thd2; [L725] 0 _Bool z$r_buff0_thd3; [L726] 0 _Bool z$r_buff1_thd0; [L727] 0 _Bool z$r_buff1_thd1; [L728] 0 _Bool z$r_buff1_thd2; [L729] 0 _Bool z$r_buff1_thd3; [L730] 0 _Bool z$read_delayed; [L731] 0 int *z$read_delayed_var; [L732] 0 int z$w_buff0; [L733] 0 _Bool z$w_buff0_used; [L734] 0 int z$w_buff1; [L735] 0 _Bool z$w_buff1_used; [L736] 0 _Bool weak$$choice0; [L737] 0 _Bool weak$$choice2; [L818] 0 pthread_t t2025; [L819] FCALL, FORK 0 pthread_create(&t2025, ((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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L741] 1 z$w_buff1 = z$w_buff0 [L742] 1 z$w_buff0 = 2 [L743] 1 z$w_buff1_used = z$w_buff0_used [L744] 1 z$w_buff0_used = (_Bool)1 [L18] COND FALSE 1 !(!expression) [L746] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L747] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L748] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L749] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L750] 1 z$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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L820] 0 pthread_t t2026; [L821] FCALL, FORK 0 pthread_create(&t2026, ((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=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L822] 0 pthread_t t2027; [L823] FCALL, FORK 0 pthread_create(&t2027, ((void *)0), P2, ((void *)0)) 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=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L753] 1 x = 1 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=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L770] 2 x = 2 VAL [__unbuffered_cnt=0, __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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L773] 2 y = 1 VAL [__unbuffered_cnt=0, __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=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L776] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L776] EXPR 2 z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z [L776] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L776] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L777] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L777] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L778] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L778] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L779] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L779] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L780] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L780] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L790] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, 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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L783] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L785] 2 return 0; [L793] 3 z = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=1, 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, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L756] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L756] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L757] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L757] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L758] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L758] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L759] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L759] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L760] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L760] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L763] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L765] 1 return 0; [L796] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L796] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L796] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L796] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L797] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L797] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L798] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L798] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L799] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L799] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L800] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L800] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L803] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L805] 3 return 0; [L825] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L836] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L837] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L838] 0 z$flush_delayed = weak$$choice2 [L839] 0 z$mem_tmp = z [L840] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L840] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L841] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L841] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L842] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L842] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1) [L842] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L842] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L843] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L843] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L844] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L844] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L845] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L845] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L846] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L846] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L847] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p2_EAX == 1) [L848] EXPR 0 z$flush_delayed ? z$mem_tmp : z [L848] 0 z = z$flush_delayed ? z$mem_tmp : z [L849] 0 z$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "safe011_power.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=0, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 99 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 11.6s, OverallIterations: 18, TraceHistogramMax: 1, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 7.4s, HoareTripleCheckerStatistics: 342 SDtfs, 463 SDslu, 550 SDs, 0 SdLazy, 372 SolverSat, 136 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 71 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=824occurred 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, 235 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 245 NumberOfCodeBlocks, 245 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 207 ConstructedInterpolants, 0 QuantifiedInterpolants, 22187 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...