/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/mix046_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-b09bf87 [2020-10-16 12:03:28,159 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-16 12:03:28,161 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-16 12:03:28,203 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-16 12:03:28,203 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-16 12:03:28,212 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-16 12:03:28,215 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-16 12:03:28,219 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-16 12:03:28,222 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-16 12:03:28,226 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-16 12:03:28,227 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-16 12:03:28,228 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-16 12:03:28,228 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-16 12:03:28,231 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-16 12:03:28,233 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-16 12:03:28,235 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-16 12:03:28,236 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-16 12:03:28,237 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-16 12:03:28,239 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-16 12:03:28,247 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-16 12:03:28,249 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-16 12:03:28,250 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-16 12:03:28,251 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-16 12:03:28,252 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-16 12:03:28,268 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-16 12:03:28,268 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-16 12:03:28,268 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-16 12:03:28,269 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-16 12:03:28,269 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-16 12:03:28,274 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-16 12:03:28,274 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-16 12:03:28,274 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-16 12:03:28,275 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-16 12:03:28,278 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-16 12:03:28,279 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-16 12:03:28,279 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-16 12:03:28,280 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-16 12:03:28,280 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-16 12:03:28,280 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-16 12:03:28,283 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-16 12:03:28,283 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-16 12:03:28,284 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA.epf [2020-10-16 12:03:28,324 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-16 12:03:28,325 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-16 12:03:28,327 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-16 12:03:28,327 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-16 12:03:28,328 INFO L138 SettingsManager]: * Use SBE=true [2020-10-16 12:03:28,328 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-16 12:03:28,328 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-16 12:03:28,328 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-16 12:03:28,328 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-16 12:03:28,329 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-16 12:03:28,330 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-16 12:03:28,330 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-16 12:03:28,330 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-16 12:03:28,331 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-16 12:03:28,331 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-16 12:03:28,331 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-16 12:03:28,331 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-16 12:03:28,331 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-16 12:03:28,331 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-16 12:03:28,332 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-16 12:03:28,332 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-16 12:03:28,332 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-16 12:03:28,332 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-16 12:03:28,332 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2020-10-16 12:03:28,333 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-16 12:03:28,333 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-16 12:03:28,333 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-16 12:03:28,333 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2020-10-16 12:03:28,333 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-16 12:03:28,617 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-16 12:03:28,630 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-16 12:03:28,634 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-16 12:03:28,635 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-16 12:03:28,636 INFO L275 PluginConnector]: CDTParser initialized [2020-10-16 12:03:28,636 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix046_power.opt.i [2020-10-16 12:03:28,695 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/fd7c4ddc0/b81a133ee9d44959965bdd7fdde47759/FLAG5a5684dfd [2020-10-16 12:03:29,203 INFO L306 CDTParser]: Found 1 translation units. [2020-10-16 12:03:29,204 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/pthread-wmm/mix046_power.opt.i [2020-10-16 12:03:29,223 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/fd7c4ddc0/b81a133ee9d44959965bdd7fdde47759/FLAG5a5684dfd [2020-10-16 12:03:29,448 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/fd7c4ddc0/b81a133ee9d44959965bdd7fdde47759 [2020-10-16 12:03:29,457 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-16 12:03:29,458 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-16 12:03:29,459 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-16 12:03:29,460 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-16 12:03:29,463 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-16 12:03:29,464 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 12:03:29" (1/1) ... [2020-10-16 12:03:29,467 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@dd2c79c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:03:29, skipping insertion in model container [2020-10-16 12:03:29,467 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 12:03:29" (1/1) ... [2020-10-16 12:03:29,475 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-16 12:03:29,524 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-16 12:03:30,053 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 12:03:30,077 INFO L203 MainTranslator]: Completed pre-run [2020-10-16 12:03:30,204 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 12:03:30,323 INFO L208 MainTranslator]: Completed translation [2020-10-16 12:03:30,324 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:03:30 WrapperNode [2020-10-16 12:03:30,325 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-16 12:03:30,326 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-16 12:03:30,326 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-16 12:03:30,326 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-16 12:03:30,335 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:03:30" (1/1) ... [2020-10-16 12:03:30,384 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:03:30" (1/1) ... [2020-10-16 12:03:30,417 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-16 12:03:30,418 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-16 12:03:30,418 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-16 12:03:30,418 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-16 12:03:30,428 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:03:30" (1/1) ... [2020-10-16 12:03:30,428 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:03:30" (1/1) ... [2020-10-16 12:03:30,432 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:03:30" (1/1) ... [2020-10-16 12:03:30,433 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:03:30" (1/1) ... [2020-10-16 12:03:30,443 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:03:30" (1/1) ... [2020-10-16 12:03:30,447 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:03:30" (1/1) ... [2020-10-16 12:03:30,450 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:03:30" (1/1) ... [2020-10-16 12:03:30,456 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-16 12:03:30,457 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-16 12:03:30,457 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-16 12:03:30,457 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-16 12:03:30,458 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:03:30" (1/1) ... No working directory specified, using /storage/repos/ultimate-2/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-16 12:03:30,526 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-16 12:03:30,526 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-16 12:03:30,526 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-16 12:03:30,526 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-16 12:03:30,526 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-16 12:03:30,527 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-16 12:03:30,527 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-16 12:03:30,527 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-16 12:03:30,527 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-16 12:03:30,527 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-16 12:03:30,528 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2020-10-16 12:03:30,528 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2020-10-16 12:03:30,528 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-16 12:03:30,528 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-16 12:03:30,529 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-16 12:03:30,531 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-16 12:03:32,584 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-16 12:03:32,584 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-16 12:03:32,587 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 12:03:32 BoogieIcfgContainer [2020-10-16 12:03:32,587 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-16 12:03:32,588 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-16 12:03:32,588 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-16 12:03:32,591 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-16 12:03:32,592 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 12:03:29" (1/3) ... [2020-10-16 12:03:32,593 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@327e4977 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 12:03:32, skipping insertion in model container [2020-10-16 12:03:32,593 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:03:30" (2/3) ... [2020-10-16 12:03:32,593 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@327e4977 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 12:03:32, skipping insertion in model container [2020-10-16 12:03:32,594 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 12:03:32" (3/3) ... [2020-10-16 12:03:32,595 INFO L111 eAbstractionObserver]: Analyzing ICFG mix046_power.opt.i [2020-10-16 12:03:32,607 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-16 12:03:32,607 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-16 12:03:32,616 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-16 12:03:32,617 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-16 12:03:32,647 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:03:32,648 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:03:32,648 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:03:32,648 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:03:32,648 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:03:32,649 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:03:32,649 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:03:32,649 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:03:32,649 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:03:32,650 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:03:32,650 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:03:32,650 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:03:32,651 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:03:32,651 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:03:32,651 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:03:32,651 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:03:32,652 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:03:32,652 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:03:32,652 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:03:32,652 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:03:32,652 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:03:32,653 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:03:32,653 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:03:32,653 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:03:32,654 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:03:32,654 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:03:32,654 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:03:32,655 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:03:32,655 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:03:32,655 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:03:32,655 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:03:32,655 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:03:32,656 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:03:32,656 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:03:32,656 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:03:32,656 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:03:32,657 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:03:32,657 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:03:32,657 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:03:32,657 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:03:32,658 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:03:32,658 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:03:32,662 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:03:32,662 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:03:32,662 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:03:32,662 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:03:32,668 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:03:32,668 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:03:32,668 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:03:32,668 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:03:32,669 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:03:32,669 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:03:32,669 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:03:32,669 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:03:32,669 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:03:32,670 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:03:32,674 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:03:32,675 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:03:32,675 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:03:32,675 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:03:32,675 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:03:32,676 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:03:32,676 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:03:32,676 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:03:32,676 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:03:32,676 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:03:32,677 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:03:32,677 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:03:32,678 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:03:32,679 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:03:32,679 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:03:32,679 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:03:32,680 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-10-16 12:03:32,695 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2020-10-16 12:03:32,716 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-16 12:03:32,717 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-16 12:03:32,717 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-16 12:03:32,717 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-16 12:03:32,717 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-16 12:03:32,717 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-16 12:03:32,717 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-16 12:03:32,717 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-16 12:03:32,732 INFO L137 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2020-10-16 12:03:32,733 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 123 places, 112 transitions, 244 flow [2020-10-16 12:03:32,736 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 123 places, 112 transitions, 244 flow [2020-10-16 12:03:32,738 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 123 places, 112 transitions, 244 flow [2020-10-16 12:03:32,791 INFO L129 PetriNetUnfolder]: 2/108 cut-off events. [2020-10-16 12:03:32,791 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 12:03:32,797 INFO L80 FinitePrefix]: Finished finitePrefix Result has 121 conditions, 108 events. 2/108 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 84 event pairs, 0 based on Foata normal form. 0/104 useless extension candidates. Maximal degree in co-relation 75. Up to 2 conditions per place. [2020-10-16 12:03:32,801 INFO L117 LiptonReduction]: Number of co-enabled transitions 2540 [2020-10-16 12:03:33,082 WARN L193 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 45 [2020-10-16 12:03:33,532 WARN L193 SmtUtils]: Spent 313.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-10-16 12:03:33,650 WARN L193 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2020-10-16 12:03:35,376 WARN L193 SmtUtils]: Spent 1.54 s on a formula simplification. DAG size of input: 230 DAG size of output: 189 [2020-10-16 12:03:35,398 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-10-16 12:03:35,398 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 12:03:35,400 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-16 12:03:35,401 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 12:03:36,760 WARN L193 SmtUtils]: Spent 1.34 s on a formula simplification. DAG size of input: 147 DAG size of output: 127 [2020-10-16 12:03:37,181 WARN L193 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-10-16 12:03:37,298 WARN L193 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-10-16 12:03:38,681 WARN L193 SmtUtils]: Spent 977.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 129 [2020-10-16 12:03:39,101 WARN L193 SmtUtils]: Spent 417.00 ms on a formula simplification that was a NOOP. DAG size: 126 [2020-10-16 12:03:39,960 WARN L193 SmtUtils]: Spent 850.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 112 [2020-10-16 12:03:40,266 WARN L193 SmtUtils]: Spent 298.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2020-10-16 12:03:40,933 WARN L193 SmtUtils]: Spent 333.00 ms on a formula simplification that was a NOOP. DAG size: 136 [2020-10-16 12:03:41,291 WARN L193 SmtUtils]: Spent 351.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2020-10-16 12:03:41,728 WARN L193 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 97 [2020-10-16 12:03:41,862 WARN L193 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2020-10-16 12:03:41,875 INFO L132 LiptonReduction]: Checked pairs total: 6806 [2020-10-16 12:03:41,876 INFO L134 LiptonReduction]: Total number of compositions: 92 [2020-10-16 12:03:41,886 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 45 places, 32 transitions, 84 flow [2020-10-16 12:03:42,099 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 3002 states. [2020-10-16 12:03:42,101 INFO L276 IsEmpty]: Start isEmpty. Operand 3002 states. [2020-10-16 12:03:42,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-16 12:03:42,111 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:03:42,112 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:03:42,112 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:03:42,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:03:42,119 INFO L82 PathProgramCache]: Analyzing trace with hash -681881970, now seen corresponding path program 1 times [2020-10-16 12:03:42,130 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:03:42,130 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063005211] [2020-10-16 12:03:42,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:03:42,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:03:42,436 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-16 12:03:42,437 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063005211] [2020-10-16 12:03:42,438 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:03:42,438 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 12:03:42,439 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884678494] [2020-10-16 12:03:42,443 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 12:03:42,444 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:03:42,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 12:03:42,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 12:03:42,458 INFO L87 Difference]: Start difference. First operand 3002 states. Second operand 3 states. [2020-10-16 12:03:42,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:03:42,594 INFO L93 Difference]: Finished difference Result 2602 states and 10064 transitions. [2020-10-16 12:03:42,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 12:03:42,596 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-10-16 12:03:42,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:03:42,638 INFO L225 Difference]: With dead ends: 2602 [2020-10-16 12:03:42,639 INFO L226 Difference]: Without dead ends: 2122 [2020-10-16 12:03:42,640 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-16 12:03:42,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2122 states. [2020-10-16 12:03:42,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2122 to 2122. [2020-10-16 12:03:42,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2122 states. [2020-10-16 12:03:42,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2122 states to 2122 states and 8080 transitions. [2020-10-16 12:03:42,895 INFO L78 Accepts]: Start accepts. Automaton has 2122 states and 8080 transitions. Word has length 9 [2020-10-16 12:03:42,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:03:42,896 INFO L481 AbstractCegarLoop]: Abstraction has 2122 states and 8080 transitions. [2020-10-16 12:03:42,896 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 12:03:42,896 INFO L276 IsEmpty]: Start isEmpty. Operand 2122 states and 8080 transitions. [2020-10-16 12:03:42,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-16 12:03:42,899 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:03:42,899 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:03:42,899 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-16 12:03:42,900 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:03:42,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:03:42,903 INFO L82 PathProgramCache]: Analyzing trace with hash 1841504421, now seen corresponding path program 1 times [2020-10-16 12:03:42,904 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:03:42,904 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828665958] [2020-10-16 12:03:42,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:03:42,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:03:43,031 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-16 12:03:43,033 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828665958] [2020-10-16 12:03:43,033 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:03:43,033 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 12:03:43,034 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105767030] [2020-10-16 12:03:43,035 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 12:03:43,035 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:03:43,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 12:03:43,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 12:03:43,037 INFO L87 Difference]: Start difference. First operand 2122 states and 8080 transitions. Second operand 3 states. [2020-10-16 12:03:43,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:03:43,095 INFO L93 Difference]: Finished difference Result 2114 states and 8042 transitions. [2020-10-16 12:03:43,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 12:03:43,096 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2020-10-16 12:03:43,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:03:43,115 INFO L225 Difference]: With dead ends: 2114 [2020-10-16 12:03:43,115 INFO L226 Difference]: Without dead ends: 2114 [2020-10-16 12:03:43,116 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-16 12:03:43,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2114 states. [2020-10-16 12:03:43,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2114 to 2114. [2020-10-16 12:03:43,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2114 states. [2020-10-16 12:03:43,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2114 states to 2114 states and 8042 transitions. [2020-10-16 12:03:43,209 INFO L78 Accepts]: Start accepts. Automaton has 2114 states and 8042 transitions. Word has length 11 [2020-10-16 12:03:43,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:03:43,210 INFO L481 AbstractCegarLoop]: Abstraction has 2114 states and 8042 transitions. [2020-10-16 12:03:43,210 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 12:03:43,210 INFO L276 IsEmpty]: Start isEmpty. Operand 2114 states and 8042 transitions. [2020-10-16 12:03:43,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-16 12:03:43,220 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:03:43,220 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:03:43,220 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-16 12:03:43,221 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:03:43,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:03:43,221 INFO L82 PathProgramCache]: Analyzing trace with hash 1250521648, now seen corresponding path program 1 times [2020-10-16 12:03:43,222 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:03:43,222 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380256266] [2020-10-16 12:03:43,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:03:43,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:03:43,360 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-16 12:03:43,361 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380256266] [2020-10-16 12:03:43,361 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:03:43,361 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 12:03:43,362 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494879892] [2020-10-16 12:03:43,363 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 12:03:43,363 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:03:43,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 12:03:43,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 12:03:43,363 INFO L87 Difference]: Start difference. First operand 2114 states and 8042 transitions. Second operand 3 states. [2020-10-16 12:03:43,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:03:43,397 INFO L93 Difference]: Finished difference Result 1962 states and 7392 transitions. [2020-10-16 12:03:43,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 12:03:43,399 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2020-10-16 12:03:43,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:03:43,416 INFO L225 Difference]: With dead ends: 1962 [2020-10-16 12:03:43,417 INFO L226 Difference]: Without dead ends: 1962 [2020-10-16 12:03:43,417 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-16 12:03:43,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1962 states. [2020-10-16 12:03:43,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1962 to 1962. [2020-10-16 12:03:43,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1962 states. [2020-10-16 12:03:43,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1962 states to 1962 states and 7392 transitions. [2020-10-16 12:03:43,497 INFO L78 Accepts]: Start accepts. Automaton has 1962 states and 7392 transitions. Word has length 12 [2020-10-16 12:03:43,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:03:43,497 INFO L481 AbstractCegarLoop]: Abstraction has 1962 states and 7392 transitions. [2020-10-16 12:03:43,497 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 12:03:43,498 INFO L276 IsEmpty]: Start isEmpty. Operand 1962 states and 7392 transitions. [2020-10-16 12:03:43,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-16 12:03:43,500 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:03:43,504 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:03:43,504 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-16 12:03:43,505 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:03:43,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:03:43,505 INFO L82 PathProgramCache]: Analyzing trace with hash 110610062, now seen corresponding path program 1 times [2020-10-16 12:03:43,506 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:03:43,506 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070125143] [2020-10-16 12:03:43,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:03:43,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:03:43,612 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-16 12:03:43,612 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070125143] [2020-10-16 12:03:43,613 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:03:43,613 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 12:03:43,613 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322561532] [2020-10-16 12:03:43,614 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 12:03:43,614 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:03:43,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 12:03:43,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-10-16 12:03:43,615 INFO L87 Difference]: Start difference. First operand 1962 states and 7392 transitions. Second operand 5 states. [2020-10-16 12:03:43,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:03:43,696 INFO L93 Difference]: Finished difference Result 1946 states and 7316 transitions. [2020-10-16 12:03:43,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 12:03:43,698 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-10-16 12:03:43,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:03:43,717 INFO L225 Difference]: With dead ends: 1946 [2020-10-16 12:03:43,717 INFO L226 Difference]: Without dead ends: 1946 [2020-10-16 12:03:43,718 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-10-16 12:03:43,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1946 states. [2020-10-16 12:03:43,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1946 to 1946. [2020-10-16 12:03:43,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1946 states. [2020-10-16 12:03:43,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1946 states to 1946 states and 7316 transitions. [2020-10-16 12:03:43,800 INFO L78 Accepts]: Start accepts. Automaton has 1946 states and 7316 transitions. Word has length 13 [2020-10-16 12:03:43,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:03:43,800 INFO L481 AbstractCegarLoop]: Abstraction has 1946 states and 7316 transitions. [2020-10-16 12:03:43,800 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 12:03:43,801 INFO L276 IsEmpty]: Start isEmpty. Operand 1946 states and 7316 transitions. [2020-10-16 12:03:43,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-16 12:03:43,803 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:03:43,803 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:03:43,803 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-16 12:03:43,803 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:03:43,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:03:43,804 INFO L82 PathProgramCache]: Analyzing trace with hash -866056128, now seen corresponding path program 1 times [2020-10-16 12:03:43,804 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:03:43,804 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726493279] [2020-10-16 12:03:43,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:03:43,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:03:43,932 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-16 12:03:43,933 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726493279] [2020-10-16 12:03:43,933 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:03:43,933 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 12:03:43,933 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941105956] [2020-10-16 12:03:43,934 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 12:03:43,934 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:03:43,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 12:03:43,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 12:03:43,935 INFO L87 Difference]: Start difference. First operand 1946 states and 7316 transitions. Second operand 4 states. [2020-10-16 12:03:43,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:03:43,999 INFO L93 Difference]: Finished difference Result 1898 states and 7104 transitions. [2020-10-16 12:03:44,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 12:03:44,001 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2020-10-16 12:03:44,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:03:44,018 INFO L225 Difference]: With dead ends: 1898 [2020-10-16 12:03:44,019 INFO L226 Difference]: Without dead ends: 1898 [2020-10-16 12:03:44,019 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-16 12:03:44,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1898 states. [2020-10-16 12:03:44,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1898 to 1898. [2020-10-16 12:03:44,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1898 states. [2020-10-16 12:03:44,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1898 states to 1898 states and 7104 transitions. [2020-10-16 12:03:44,144 INFO L78 Accepts]: Start accepts. Automaton has 1898 states and 7104 transitions. Word has length 14 [2020-10-16 12:03:44,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:03:44,144 INFO L481 AbstractCegarLoop]: Abstraction has 1898 states and 7104 transitions. [2020-10-16 12:03:44,144 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 12:03:44,145 INFO L276 IsEmpty]: Start isEmpty. Operand 1898 states and 7104 transitions. [2020-10-16 12:03:44,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-16 12:03:44,148 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:03:44,148 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:03:44,148 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-16 12:03:44,148 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:03:44,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:03:44,149 INFO L82 PathProgramCache]: Analyzing trace with hash -1141480467, now seen corresponding path program 1 times [2020-10-16 12:03:44,149 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:03:44,150 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392774511] [2020-10-16 12:03:44,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:03:44,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:03:44,204 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-16 12:03:44,204 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392774511] [2020-10-16 12:03:44,204 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:03:44,204 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 12:03:44,205 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325097063] [2020-10-16 12:03:44,205 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 12:03:44,205 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:03:44,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 12:03:44,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 12:03:44,206 INFO L87 Difference]: Start difference. First operand 1898 states and 7104 transitions. Second operand 3 states. [2020-10-16 12:03:44,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:03:44,227 INFO L93 Difference]: Finished difference Result 1882 states and 7036 transitions. [2020-10-16 12:03:44,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 12:03:44,228 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2020-10-16 12:03:44,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:03:44,244 INFO L225 Difference]: With dead ends: 1882 [2020-10-16 12:03:44,245 INFO L226 Difference]: Without dead ends: 1882 [2020-10-16 12:03:44,245 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-16 12:03:44,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1882 states. [2020-10-16 12:03:44,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1882 to 1882. [2020-10-16 12:03:44,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1882 states. [2020-10-16 12:03:44,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1882 states to 1882 states and 7036 transitions. [2020-10-16 12:03:44,311 INFO L78 Accepts]: Start accepts. Automaton has 1882 states and 7036 transitions. Word has length 15 [2020-10-16 12:03:44,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:03:44,311 INFO L481 AbstractCegarLoop]: Abstraction has 1882 states and 7036 transitions. [2020-10-16 12:03:44,311 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 12:03:44,311 INFO L276 IsEmpty]: Start isEmpty. Operand 1882 states and 7036 transitions. [2020-10-16 12:03:44,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-16 12:03:44,315 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:03:44,315 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:03:44,315 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-16 12:03:44,315 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:03:44,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:03:44,315 INFO L82 PathProgramCache]: Analyzing trace with hash -1077938372, now seen corresponding path program 1 times [2020-10-16 12:03:44,316 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:03:44,316 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90389305] [2020-10-16 12:03:44,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:03:44,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:03:44,408 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-16 12:03:44,409 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90389305] [2020-10-16 12:03:44,409 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:03:44,409 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 12:03:44,409 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119376406] [2020-10-16 12:03:44,410 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 12:03:44,410 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:03:44,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 12:03:44,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-16 12:03:44,411 INFO L87 Difference]: Start difference. First operand 1882 states and 7036 transitions. Second operand 6 states. [2020-10-16 12:03:44,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:03:44,563 INFO L93 Difference]: Finished difference Result 3194 states and 11792 transitions. [2020-10-16 12:03:44,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 12:03:44,564 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2020-10-16 12:03:44,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:03:44,588 INFO L225 Difference]: With dead ends: 3194 [2020-10-16 12:03:44,588 INFO L226 Difference]: Without dead ends: 3194 [2020-10-16 12:03:44,589 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-16 12:03:44,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3194 states. [2020-10-16 12:03:44,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3194 to 2122. [2020-10-16 12:03:44,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2122 states. [2020-10-16 12:03:44,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2122 states to 2122 states and 7876 transitions. [2020-10-16 12:03:44,684 INFO L78 Accepts]: Start accepts. Automaton has 2122 states and 7876 transitions. Word has length 15 [2020-10-16 12:03:44,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:03:44,685 INFO L481 AbstractCegarLoop]: Abstraction has 2122 states and 7876 transitions. [2020-10-16 12:03:44,685 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 12:03:44,685 INFO L276 IsEmpty]: Start isEmpty. Operand 2122 states and 7876 transitions. [2020-10-16 12:03:44,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-16 12:03:44,689 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:03:44,689 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:03:44,689 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-16 12:03:44,689 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:03:44,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:03:44,690 INFO L82 PathProgramCache]: Analyzing trace with hash -1079558432, now seen corresponding path program 2 times [2020-10-16 12:03:44,690 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:03:44,690 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282553782] [2020-10-16 12:03:44,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:03:44,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:03:44,787 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-16 12:03:44,788 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282553782] [2020-10-16 12:03:44,788 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:03:44,788 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 12:03:44,789 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279466240] [2020-10-16 12:03:44,789 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 12:03:44,789 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:03:44,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 12:03:44,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-16 12:03:44,790 INFO L87 Difference]: Start difference. First operand 2122 states and 7876 transitions. Second operand 6 states. [2020-10-16 12:03:44,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:03:44,904 INFO L93 Difference]: Finished difference Result 2218 states and 8180 transitions. [2020-10-16 12:03:44,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 12:03:44,905 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2020-10-16 12:03:44,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:03:44,915 INFO L225 Difference]: With dead ends: 2218 [2020-10-16 12:03:44,915 INFO L226 Difference]: Without dead ends: 2218 [2020-10-16 12:03:44,916 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-10-16 12:03:44,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2218 states. [2020-10-16 12:03:44,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2218 to 1946. [2020-10-16 12:03:44,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1946 states. [2020-10-16 12:03:44,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1946 states to 1946 states and 7244 transitions. [2020-10-16 12:03:44,981 INFO L78 Accepts]: Start accepts. Automaton has 1946 states and 7244 transitions. Word has length 15 [2020-10-16 12:03:44,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:03:44,982 INFO L481 AbstractCegarLoop]: Abstraction has 1946 states and 7244 transitions. [2020-10-16 12:03:44,982 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 12:03:44,982 INFO L276 IsEmpty]: Start isEmpty. Operand 1946 states and 7244 transitions. [2020-10-16 12:03:44,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-16 12:03:44,986 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:03:44,986 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:03:44,986 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-16 12:03:44,986 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:03:44,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:03:44,987 INFO L82 PathProgramCache]: Analyzing trace with hash -1026156863, now seen corresponding path program 1 times [2020-10-16 12:03:44,987 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:03:44,987 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830936385] [2020-10-16 12:03:44,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:03:45,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:03:45,053 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-16 12:03:45,054 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830936385] [2020-10-16 12:03:45,054 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:03:45,054 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 12:03:45,055 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181408657] [2020-10-16 12:03:45,055 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 12:03:45,055 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:03:45,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 12:03:45,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 12:03:45,056 INFO L87 Difference]: Start difference. First operand 1946 states and 7244 transitions. Second operand 4 states. [2020-10-16 12:03:45,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:03:45,105 INFO L93 Difference]: Finished difference Result 2032 states and 6903 transitions. [2020-10-16 12:03:45,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 12:03:45,105 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2020-10-16 12:03:45,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:03:45,112 INFO L225 Difference]: With dead ends: 2032 [2020-10-16 12:03:45,112 INFO L226 Difference]: Without dead ends: 1520 [2020-10-16 12:03:45,112 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-16 12:03:45,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1520 states. [2020-10-16 12:03:45,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1520 to 1520. [2020-10-16 12:03:45,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1520 states. [2020-10-16 12:03:45,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1520 states to 1520 states and 5114 transitions. [2020-10-16 12:03:45,164 INFO L78 Accepts]: Start accepts. Automaton has 1520 states and 5114 transitions. Word has length 16 [2020-10-16 12:03:45,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:03:45,165 INFO L481 AbstractCegarLoop]: Abstraction has 1520 states and 5114 transitions. [2020-10-16 12:03:45,165 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 12:03:45,165 INFO L276 IsEmpty]: Start isEmpty. Operand 1520 states and 5114 transitions. [2020-10-16 12:03:45,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-16 12:03:45,229 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:03:45,229 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:03:45,230 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-16 12:03:45,230 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:03:45,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:03:45,230 INFO L82 PathProgramCache]: Analyzing trace with hash -1736567964, now seen corresponding path program 1 times [2020-10-16 12:03:45,230 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:03:45,231 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544970499] [2020-10-16 12:03:45,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:03:45,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:03:45,344 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-16 12:03:45,345 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544970499] [2020-10-16 12:03:45,345 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:03:45,345 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 12:03:45,345 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443019606] [2020-10-16 12:03:45,346 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 12:03:45,346 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:03:45,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 12:03:45,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-16 12:03:45,347 INFO L87 Difference]: Start difference. First operand 1520 states and 5114 transitions. Second operand 5 states. [2020-10-16 12:03:45,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:03:45,412 INFO L93 Difference]: Finished difference Result 1320 states and 4082 transitions. [2020-10-16 12:03:45,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 12:03:45,412 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2020-10-16 12:03:45,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:03:45,417 INFO L225 Difference]: With dead ends: 1320 [2020-10-16 12:03:45,418 INFO L226 Difference]: Without dead ends: 997 [2020-10-16 12:03:45,418 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-16 12:03:45,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 997 states. [2020-10-16 12:03:45,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 997 to 997. [2020-10-16 12:03:45,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 997 states. [2020-10-16 12:03:45,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 997 states to 997 states and 3022 transitions. [2020-10-16 12:03:45,446 INFO L78 Accepts]: Start accepts. Automaton has 997 states and 3022 transitions. Word has length 17 [2020-10-16 12:03:45,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:03:45,450 INFO L481 AbstractCegarLoop]: Abstraction has 997 states and 3022 transitions. [2020-10-16 12:03:45,450 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 12:03:45,450 INFO L276 IsEmpty]: Start isEmpty. Operand 997 states and 3022 transitions. [2020-10-16 12:03:45,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-16 12:03:45,453 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:03:45,453 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:03:45,453 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-16 12:03:45,454 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:03:45,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:03:45,454 INFO L82 PathProgramCache]: Analyzing trace with hash 1553780394, now seen corresponding path program 1 times [2020-10-16 12:03:45,454 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:03:45,454 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869219413] [2020-10-16 12:03:45,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:03:45,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:03:45,529 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-16 12:03:45,530 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869219413] [2020-10-16 12:03:45,530 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:03:45,530 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 12:03:45,530 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274019542] [2020-10-16 12:03:45,531 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 12:03:45,531 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:03:45,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 12:03:45,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 12:03:45,532 INFO L87 Difference]: Start difference. First operand 997 states and 3022 transitions. Second operand 3 states. [2020-10-16 12:03:45,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:03:45,548 INFO L93 Difference]: Finished difference Result 1421 states and 4197 transitions. [2020-10-16 12:03:45,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 12:03:45,549 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2020-10-16 12:03:45,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:03:45,553 INFO L225 Difference]: With dead ends: 1421 [2020-10-16 12:03:45,553 INFO L226 Difference]: Without dead ends: 1011 [2020-10-16 12:03:45,554 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-16 12:03:45,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1011 states. [2020-10-16 12:03:45,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1011 to 991. [2020-10-16 12:03:45,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 991 states. [2020-10-16 12:03:45,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 991 states to 991 states and 2843 transitions. [2020-10-16 12:03:45,579 INFO L78 Accepts]: Start accepts. Automaton has 991 states and 2843 transitions. Word has length 19 [2020-10-16 12:03:45,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:03:45,579 INFO L481 AbstractCegarLoop]: Abstraction has 991 states and 2843 transitions. [2020-10-16 12:03:45,580 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 12:03:45,580 INFO L276 IsEmpty]: Start isEmpty. Operand 991 states and 2843 transitions. [2020-10-16 12:03:45,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-10-16 12:03:45,582 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:03:45,583 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:03:45,583 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-16 12:03:45,583 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:03:45,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:03:45,583 INFO L82 PathProgramCache]: Analyzing trace with hash 922551204, now seen corresponding path program 1 times [2020-10-16 12:03:45,584 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:03:45,584 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018312191] [2020-10-16 12:03:45,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:03:45,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:03:45,668 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-16 12:03:45,669 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018312191] [2020-10-16 12:03:45,669 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:03:45,669 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 12:03:45,670 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738720407] [2020-10-16 12:03:45,670 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 12:03:45,670 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:03:45,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 12:03:45,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-16 12:03:45,671 INFO L87 Difference]: Start difference. First operand 991 states and 2843 transitions. Second operand 6 states. [2020-10-16 12:03:45,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:03:45,736 INFO L93 Difference]: Finished difference Result 868 states and 2450 transitions. [2020-10-16 12:03:45,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 12:03:45,737 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2020-10-16 12:03:45,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:03:45,740 INFO L225 Difference]: With dead ends: 868 [2020-10-16 12:03:45,740 INFO L226 Difference]: Without dead ends: 761 [2020-10-16 12:03:45,740 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-16 12:03:45,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 761 states. [2020-10-16 12:03:45,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 761 to 745. [2020-10-16 12:03:45,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 745 states. [2020-10-16 12:03:45,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 745 states to 745 states and 2133 transitions. [2020-10-16 12:03:45,758 INFO L78 Accepts]: Start accepts. Automaton has 745 states and 2133 transitions. Word has length 20 [2020-10-16 12:03:45,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:03:45,758 INFO L481 AbstractCegarLoop]: Abstraction has 745 states and 2133 transitions. [2020-10-16 12:03:45,758 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 12:03:45,758 INFO L276 IsEmpty]: Start isEmpty. Operand 745 states and 2133 transitions. [2020-10-16 12:03:45,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-16 12:03:45,761 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:03:45,761 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, 1, 1] [2020-10-16 12:03:45,761 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-16 12:03:45,761 INFO L429 AbstractCegarLoop]: === Iteration 13 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:03:45,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:03:45,762 INFO L82 PathProgramCache]: Analyzing trace with hash 198735402, now seen corresponding path program 1 times [2020-10-16 12:03:45,762 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:03:45,762 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866938052] [2020-10-16 12:03:45,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:03:45,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:03:45,807 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-16 12:03:45,808 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866938052] [2020-10-16 12:03:45,808 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:03:45,808 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 12:03:45,808 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548005587] [2020-10-16 12:03:45,809 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 12:03:45,809 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:03:45,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 12:03:45,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 12:03:45,809 INFO L87 Difference]: Start difference. First operand 745 states and 2133 transitions. Second operand 4 states. [2020-10-16 12:03:45,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:03:45,831 INFO L93 Difference]: Finished difference Result 1035 states and 2850 transitions. [2020-10-16 12:03:45,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 12:03:45,832 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2020-10-16 12:03:45,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:03:45,834 INFO L225 Difference]: With dead ends: 1035 [2020-10-16 12:03:45,834 INFO L226 Difference]: Without dead ends: 683 [2020-10-16 12:03:45,835 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-16 12:03:45,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 683 states. [2020-10-16 12:03:45,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 683 to 673. [2020-10-16 12:03:45,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 673 states. [2020-10-16 12:03:45,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 673 states to 673 states and 1765 transitions. [2020-10-16 12:03:45,851 INFO L78 Accepts]: Start accepts. Automaton has 673 states and 1765 transitions. Word has length 23 [2020-10-16 12:03:45,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:03:45,851 INFO L481 AbstractCegarLoop]: Abstraction has 673 states and 1765 transitions. [2020-10-16 12:03:45,851 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 12:03:45,852 INFO L276 IsEmpty]: Start isEmpty. Operand 673 states and 1765 transitions. [2020-10-16 12:03:45,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-16 12:03:45,854 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:03:45,854 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, 1, 1] [2020-10-16 12:03:45,855 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-16 12:03:45,855 INFO L429 AbstractCegarLoop]: === Iteration 14 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:03:45,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:03:45,855 INFO L82 PathProgramCache]: Analyzing trace with hash 791331944, now seen corresponding path program 1 times [2020-10-16 12:03:45,856 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:03:45,856 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712039215] [2020-10-16 12:03:45,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:03:45,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:03:45,989 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-16 12:03:45,989 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712039215] [2020-10-16 12:03:45,989 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:03:45,989 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 12:03:45,990 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358361674] [2020-10-16 12:03:45,990 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 12:03:45,990 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:03:45,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 12:03:45,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-16 12:03:45,991 INFO L87 Difference]: Start difference. First operand 673 states and 1765 transitions. Second operand 7 states. [2020-10-16 12:03:46,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:03:46,119 INFO L93 Difference]: Finished difference Result 768 states and 1955 transitions. [2020-10-16 12:03:46,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 12:03:46,119 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2020-10-16 12:03:46,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:03:46,121 INFO L225 Difference]: With dead ends: 768 [2020-10-16 12:03:46,122 INFO L226 Difference]: Without dead ends: 632 [2020-10-16 12:03:46,122 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2020-10-16 12:03:46,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2020-10-16 12:03:46,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 629. [2020-10-16 12:03:46,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 629 states. [2020-10-16 12:03:46,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 629 states to 629 states and 1617 transitions. [2020-10-16 12:03:46,137 INFO L78 Accepts]: Start accepts. Automaton has 629 states and 1617 transitions. Word has length 23 [2020-10-16 12:03:46,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:03:46,137 INFO L481 AbstractCegarLoop]: Abstraction has 629 states and 1617 transitions. [2020-10-16 12:03:46,138 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 12:03:46,138 INFO L276 IsEmpty]: Start isEmpty. Operand 629 states and 1617 transitions. [2020-10-16 12:03:46,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-16 12:03:46,140 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:03:46,140 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, 1, 1] [2020-10-16 12:03:46,140 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-16 12:03:46,140 INFO L429 AbstractCegarLoop]: === Iteration 15 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:03:46,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:03:46,141 INFO L82 PathProgramCache]: Analyzing trace with hash 1699706600, now seen corresponding path program 2 times [2020-10-16 12:03:46,141 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:03:46,141 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686355473] [2020-10-16 12:03:46,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:03:46,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:03:46,238 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-16 12:03:46,238 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686355473] [2020-10-16 12:03:46,238 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:03:46,239 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-16 12:03:46,239 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477037143] [2020-10-16 12:03:46,239 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 12:03:46,239 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:03:46,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 12:03:46,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-16 12:03:46,240 INFO L87 Difference]: Start difference. First operand 629 states and 1617 transitions. Second operand 7 states. [2020-10-16 12:03:46,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:03:46,325 INFO L93 Difference]: Finished difference Result 605 states and 1570 transitions. [2020-10-16 12:03:46,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-16 12:03:46,326 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2020-10-16 12:03:46,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:03:46,327 INFO L225 Difference]: With dead ends: 605 [2020-10-16 12:03:46,328 INFO L226 Difference]: Without dead ends: 213 [2020-10-16 12:03:46,328 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2020-10-16 12:03:46,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2020-10-16 12:03:46,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 213. [2020-10-16 12:03:46,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2020-10-16 12:03:46,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 521 transitions. [2020-10-16 12:03:46,334 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 521 transitions. Word has length 23 [2020-10-16 12:03:46,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:03:46,334 INFO L481 AbstractCegarLoop]: Abstraction has 213 states and 521 transitions. [2020-10-16 12:03:46,334 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 12:03:46,334 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 521 transitions. [2020-10-16 12:03:46,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-10-16 12:03:46,335 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:03:46,335 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, 1, 1, 1, 1, 1] [2020-10-16 12:03:46,335 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-16 12:03:46,336 INFO L429 AbstractCegarLoop]: === Iteration 16 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:03:46,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:03:46,336 INFO L82 PathProgramCache]: Analyzing trace with hash 1972919976, now seen corresponding path program 1 times [2020-10-16 12:03:46,336 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:03:46,336 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300544480] [2020-10-16 12:03:46,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:03:46,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:03:46,473 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-16 12:03:46,474 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300544480] [2020-10-16 12:03:46,474 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:03:46,474 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-16 12:03:46,474 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512135822] [2020-10-16 12:03:46,475 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-16 12:03:46,475 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:03:46,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-16 12:03:46,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-10-16 12:03:46,476 INFO L87 Difference]: Start difference. First operand 213 states and 521 transitions. Second operand 8 states. [2020-10-16 12:03:46,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:03:46,624 INFO L93 Difference]: Finished difference Result 326 states and 798 transitions. [2020-10-16 12:03:46,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 12:03:46,625 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 26 [2020-10-16 12:03:46,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:03:46,626 INFO L225 Difference]: With dead ends: 326 [2020-10-16 12:03:46,626 INFO L226 Difference]: Without dead ends: 114 [2020-10-16 12:03:46,626 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-10-16 12:03:46,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2020-10-16 12:03:46,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2020-10-16 12:03:46,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2020-10-16 12:03:46,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 260 transitions. [2020-10-16 12:03:46,629 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 260 transitions. Word has length 26 [2020-10-16 12:03:46,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:03:46,630 INFO L481 AbstractCegarLoop]: Abstraction has 114 states and 260 transitions. [2020-10-16 12:03:46,630 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-16 12:03:46,630 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 260 transitions. [2020-10-16 12:03:46,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-10-16 12:03:46,631 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:03:46,631 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, 1, 1, 1, 1, 1] [2020-10-16 12:03:46,631 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-16 12:03:46,631 INFO L429 AbstractCegarLoop]: === Iteration 17 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:03:46,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:03:46,632 INFO L82 PathProgramCache]: Analyzing trace with hash 1826608808, now seen corresponding path program 2 times [2020-10-16 12:03:46,632 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:03:46,632 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618048221] [2020-10-16 12:03:46,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:03:46,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:03:46,857 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-16 12:03:46,857 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618048221] [2020-10-16 12:03:46,858 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:03:46,858 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-16 12:03:46,858 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028786809] [2020-10-16 12:03:46,859 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-16 12:03:46,859 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:03:46,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-16 12:03:46,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2020-10-16 12:03:46,859 INFO L87 Difference]: Start difference. First operand 114 states and 260 transitions. Second operand 8 states. [2020-10-16 12:03:47,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:03:47,068 INFO L93 Difference]: Finished difference Result 177 states and 401 transitions. [2020-10-16 12:03:47,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 12:03:47,069 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 26 [2020-10-16 12:03:47,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:03:47,070 INFO L225 Difference]: With dead ends: 177 [2020-10-16 12:03:47,070 INFO L226 Difference]: Without dead ends: 64 [2020-10-16 12:03:47,071 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2020-10-16 12:03:47,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2020-10-16 12:03:47,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2020-10-16 12:03:47,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2020-10-16 12:03:47,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 122 transitions. [2020-10-16 12:03:47,074 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 122 transitions. Word has length 26 [2020-10-16 12:03:47,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:03:47,074 INFO L481 AbstractCegarLoop]: Abstraction has 64 states and 122 transitions. [2020-10-16 12:03:47,075 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-16 12:03:47,075 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 122 transitions. [2020-10-16 12:03:47,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-10-16 12:03:47,075 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:03:47,076 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, 1, 1, 1, 1, 1] [2020-10-16 12:03:47,076 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-10-16 12:03:47,076 INFO L429 AbstractCegarLoop]: === Iteration 18 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:03:47,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:03:47,077 INFO L82 PathProgramCache]: Analyzing trace with hash 1649584844, now seen corresponding path program 3 times [2020-10-16 12:03:47,077 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:03:47,079 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80578005] [2020-10-16 12:03:47,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:03:47,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 12:03:47,133 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 12:03:47,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 12:03:47,176 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 12:03:47,241 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-16 12:03:47,242 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-16 12:03:47,242 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-10-16 12:03:47,243 WARN L264 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-16 12:03:47,267 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [979] [979] L846-->L853: Formula: (let ((.cse6 (= (mod ~z$r_buff0_thd0~0_In-207602788 256) 0)) (.cse7 (= (mod ~z$w_buff0_used~0_In-207602788 256) 0)) (.cse9 (= (mod ~z$w_buff1_used~0_In-207602788 256) 0)) (.cse8 (= (mod ~z$r_buff1_thd0~0_In-207602788 256) 0))) (let ((.cse0 (not .cse8)) (.cse1 (not .cse9)) (.cse2 (or .cse8 .cse9)) (.cse5 (or .cse6 .cse7)) (.cse3 (not .cse7)) (.cse4 (not .cse6))) (and (or (and .cse0 (= ~z$w_buff1_used~0_Out-207602788 0) .cse1) (and .cse2 (= ~z$w_buff1_used~0_Out-207602788 ~z$w_buff1_used~0_In-207602788))) (not (= ULTIMATE.start_assume_abort_if_not_~cond_Out-207602788 0)) (= ~z$r_buff0_thd0~0_In-207602788 ~z$r_buff0_thd0~0_Out-207602788) (or (and .cse3 (= ~z$w_buff0_used~0_Out-207602788 0) .cse4) (and (= ~z$w_buff0_used~0_In-207602788 ~z$w_buff0_used~0_Out-207602788) .cse5)) (= ~z$r_buff1_thd0~0_In-207602788 ~z$r_buff1_thd0~0_Out-207602788) (or (and (or (and .cse0 (= ~z~0_Out-207602788 ~z$w_buff1~0_In-207602788) .cse1) (and .cse2 (= ~z~0_In-207602788 ~z~0_Out-207602788))) .cse5) (and .cse3 (= ~z~0_Out-207602788 ~z$w_buff0~0_In-207602788) .cse4)) (= ULTIMATE.start_assume_abort_if_not_~cond_Out-207602788 |ULTIMATE.start_assume_abort_if_not_#in~cond_In-207602788|)))) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-207602788|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-207602788, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-207602788, ~z$w_buff0~0=~z$w_buff0~0_In-207602788, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-207602788, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-207602788, ~z$w_buff1~0=~z$w_buff1~0_In-207602788, ~z~0=~z~0_In-207602788} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_Out-207602788, ULTIMATE.start_main_#t~ite18=|ULTIMATE.start_main_#t~ite18_Out-207602788|, ~z$w_buff0~0=~z$w_buff0~0_In-207602788, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out-207602788|, ~z$w_buff1_used~0=~z$w_buff1_used~0_Out-207602788, ~z$w_buff1~0=~z$w_buff1~0_In-207602788, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out-207602788|, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out-207602788|, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out-207602788|, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out-207602788|, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-207602788|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_Out-207602788, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out-207602788, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_Out-207602788, ~z~0=~z~0_Out-207602788} AuxVars[] AssignedVars[~z$r_buff0_thd0~0, ULTIMATE.start_assume_abort_if_not_~cond, ~z$w_buff0_used~0, ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite19, ~z$r_buff1_thd0~0, ~z$w_buff1_used~0, ~z~0, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite23] because there is no mapped edge [2020-10-16 12:03:47,281 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-16 12:03:47,281 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:03:47,285 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-16 12:03:47,285 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:03:47,285 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-16 12:03:47,285 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:03:47,286 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-16 12:03:47,286 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:03:47,286 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-16 12:03:47,286 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:03:47,286 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-16 12:03:47,286 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:03:47,287 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-16 12:03:47,287 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:03:47,288 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-16 12:03:47,288 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:03:47,288 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-16 12:03:47,289 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:03:47,289 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-16 12:03:47,289 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:03:47,289 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-16 12:03:47,289 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:03:47,289 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-16 12:03:47,290 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:03:47,290 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-16 12:03:47,290 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:03:47,292 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-16 12:03:47,292 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:03:47,292 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-16 12:03:47,292 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:03:47,292 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-16 12:03:47,293 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:03:47,297 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-16 12:03:47,297 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:03:47,298 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-16 12:03:47,298 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:03:47,298 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-16 12:03:47,298 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:03:47,298 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-16 12:03:47,298 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:03:47,299 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-16 12:03:47,299 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:03:47,299 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-16 12:03:47,299 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:03:47,299 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-16 12:03:47,300 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:03:47,413 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 12:03:47 BasicIcfg [2020-10-16 12:03:47,414 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-16 12:03:47,417 INFO L168 Benchmark]: Toolchain (without parser) took 17957.20 ms. Allocated memory was 147.3 MB in the beginning and 455.1 MB in the end (delta: 307.8 MB). Free memory was 101.1 MB in the beginning and 297.7 MB in the end (delta: -196.6 MB). Peak memory consumption was 111.2 MB. Max. memory is 7.1 GB. [2020-10-16 12:03:47,419 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 147.3 MB. Free memory was 120.7 MB in the beginning and 120.5 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. [2020-10-16 12:03:47,419 INFO L168 Benchmark]: CACSL2BoogieTranslator took 865.92 ms. Allocated memory was 147.3 MB in the beginning and 205.0 MB in the end (delta: 57.7 MB). Free memory was 100.7 MB in the beginning and 160.1 MB in the end (delta: -59.4 MB). Peak memory consumption was 25.0 MB. Max. memory is 7.1 GB. [2020-10-16 12:03:47,420 INFO L168 Benchmark]: Boogie Procedure Inliner took 91.76 ms. Allocated memory is still 205.0 MB. Free memory was 160.1 MB in the beginning and 157.5 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2020-10-16 12:03:47,420 INFO L168 Benchmark]: Boogie Preprocessor took 38.62 ms. Allocated memory is still 205.0 MB. Free memory was 157.5 MB in the beginning and 154.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2020-10-16 12:03:47,422 INFO L168 Benchmark]: RCFGBuilder took 2130.31 ms. Allocated memory was 205.0 MB in the beginning and 245.4 MB in the end (delta: 40.4 MB). Free memory was 154.8 MB in the beginning and 182.4 MB in the end (delta: -27.6 MB). Peak memory consumption was 99.6 MB. Max. memory is 7.1 GB. [2020-10-16 12:03:47,423 INFO L168 Benchmark]: TraceAbstraction took 14825.78 ms. Allocated memory was 245.4 MB in the beginning and 455.1 MB in the end (delta: 209.7 MB). Free memory was 182.4 MB in the beginning and 297.7 MB in the end (delta: -115.4 MB). Peak memory consumption was 94.4 MB. Max. memory is 7.1 GB. [2020-10-16 12:03:47,425 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 147.3 MB. Free memory was 120.7 MB in the beginning and 120.5 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 865.92 ms. Allocated memory was 147.3 MB in the beginning and 205.0 MB in the end (delta: 57.7 MB). Free memory was 100.7 MB in the beginning and 160.1 MB in the end (delta: -59.4 MB). Peak memory consumption was 25.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 91.76 ms. Allocated memory is still 205.0 MB. Free memory was 160.1 MB in the beginning and 157.5 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 38.62 ms. Allocated memory is still 205.0 MB. Free memory was 157.5 MB in the beginning and 154.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2130.31 ms. Allocated memory was 205.0 MB in the beginning and 245.4 MB in the end (delta: 40.4 MB). Free memory was 154.8 MB in the beginning and 182.4 MB in the end (delta: -27.6 MB). Peak memory consumption was 99.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 14825.78 ms. Allocated memory was 245.4 MB in the beginning and 455.1 MB in the end (delta: 209.7 MB). Free memory was 182.4 MB in the beginning and 297.7 MB in the end (delta: -115.4 MB). Peak memory consumption was 94.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1361 VarBasedMoverChecksPositive, 46 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 132 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 9.1s, 123 PlacesBefore, 45 PlacesAfterwards, 112 TransitionsBefore, 32 TransitionsAfterwards, 2540 CoEnabledTransitionPairs, 7 FixpointIterations, 37 TrivialSequentialCompositions, 46 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 2 ChoiceCompositions, 92 TotalNumberOfCompositions, 6806 MoverChecksTotal - CounterExampleResult [Line: 7]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L699] 0 int __unbuffered_cnt = 0; [L701] 0 int __unbuffered_p0_EAX = 0; [L703] 0 int __unbuffered_p3_EAX = 0; [L705] 0 int __unbuffered_p3_EBX = 0; [L707] 0 int a = 0; [L709] 0 int b = 0; [L710] 0 _Bool main$tmp_guard0; [L711] 0 _Bool main$tmp_guard1; [L713] 0 int x = 0; [L715] 0 int y = 0; [L717] 0 int z = 0; [L718] 0 _Bool z$flush_delayed; [L719] 0 int z$mem_tmp; [L720] 0 _Bool z$r_buff0_thd0; [L721] 0 _Bool z$r_buff0_thd1; [L722] 0 _Bool z$r_buff0_thd2; [L723] 0 _Bool z$r_buff0_thd3; [L724] 0 _Bool z$r_buff0_thd4; [L725] 0 _Bool z$r_buff1_thd0; [L726] 0 _Bool z$r_buff1_thd1; [L727] 0 _Bool z$r_buff1_thd2; [L728] 0 _Bool z$r_buff1_thd3; [L729] 0 _Bool z$r_buff1_thd4; [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; [L835] 0 pthread_t t1221; [L836] FCALL, FORK 0 pthread_create(&t1221, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L837] 0 pthread_t t1222; [L838] FCALL, FORK 0 pthread_create(&t1222, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L839] 0 pthread_t t1223; [L840] FCALL, FORK 0 pthread_create(&t1223, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L841] 0 pthread_t t1224; [L842] FCALL, FORK 0 pthread_create(&t1224, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L791] 4 z$w_buff1 = z$w_buff0 [L792] 4 z$w_buff0 = 2 [L793] 4 z$w_buff1_used = z$w_buff0_used [L794] 4 z$w_buff0_used = (_Bool)1 [L7] COND FALSE 4 !(!expression) [L796] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L797] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L798] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L799] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L800] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L801] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L804] 4 a = 1 [L807] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L810] 4 __unbuffered_p3_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L741] 1 b = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, 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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L744] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, 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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, 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=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L749] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L751] 1 return 0; [L759] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, 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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L764] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L766] 2 return 0; [L771] 3 y = 2 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, 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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L774] 3 z = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=1, 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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L777] 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) [L777] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L777] 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) [L777] 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) [L778] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L778] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L779] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L779] 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 [L780] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L780] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L781] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L781] 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 [L784] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L786] 3 return 0; [L813] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L813] EXPR 4 z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z [L813] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L813] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L814] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L814] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L815] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L815] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L816] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L816] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L817] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L817] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L820] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L822] 4 return 0; [L844] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L855] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L856] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L857] 0 z$flush_delayed = weak$$choice2 [L858] 0 z$mem_tmp = z [L859] 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) [L859] 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) [L860] 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)) [L860] 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)) [L861] 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)) [L861] 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) [L861] 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)) [L861] 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)) [L862] 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)) [L862] 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)) [L863] 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)) [L863] 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)) [L864] 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)) [L864] EXPR 0 !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) [L864] 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)) [L864] 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)) [L865] 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)) [L865] 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)) [L866] 0 main$tmp_guard1 = !(y == 2 && z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L867] EXPR 0 z$flush_delayed ? z$mem_tmp : z [L867] 0 z = z$flush_delayed ? z$mem_tmp : z [L868] 0 z$flush_delayed = (_Bool)0 [L7] COND TRUE 0 !expression [L7] 0 __VERIFIER_error() VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=2, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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 5 procedures, 111 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 14.5s, OverallIterations: 18, TraceHistogramMax: 1, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 9.3s, HoareTripleCheckerStatistics: 554 SDtfs, 714 SDslu, 930 SDs, 0 SdLazy, 392 SolverSat, 138 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 77 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3002occurred 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.9s AutomataMinimizationTime, 17 MinimizatonAttempts, 1393 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 323 NumberOfCodeBlocks, 323 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 280 ConstructedInterpolants, 0 QuantifiedInterpolants, 38153 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...