/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/mix047_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-c7e336b [2020-10-05 23:34:15,127 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-05 23:34:15,130 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-05 23:34:15,168 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-05 23:34:15,169 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-05 23:34:15,177 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-05 23:34:15,179 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-05 23:34:15,183 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-05 23:34:15,185 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-05 23:34:15,188 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-05 23:34:15,189 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-05 23:34:15,190 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-05 23:34:15,190 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-05 23:34:15,193 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-05 23:34:15,196 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-05 23:34:15,197 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-05 23:34:15,199 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-05 23:34:15,200 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-05 23:34:15,201 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-05 23:34:15,211 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-05 23:34:15,213 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-05 23:34:15,214 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-05 23:34:15,215 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-05 23:34:15,216 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-05 23:34:15,230 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-05 23:34:15,230 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-05 23:34:15,230 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-05 23:34:15,231 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-05 23:34:15,232 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-05 23:34:15,233 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-05 23:34:15,233 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-05 23:34:15,237 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-05 23:34:15,238 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-05 23:34:15,238 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-05 23:34:15,242 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-05 23:34:15,243 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-05 23:34:15,243 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-05 23:34:15,244 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-05 23:34:15,244 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-05 23:34:15,247 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-05 23:34:15,247 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-05 23:34:15,250 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA.epf [2020-10-05 23:34:15,287 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-05 23:34:15,287 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-05 23:34:15,288 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-05 23:34:15,289 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-05 23:34:15,289 INFO L138 SettingsManager]: * Use SBE=true [2020-10-05 23:34:15,289 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-05 23:34:15,289 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-05 23:34:15,290 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-05 23:34:15,290 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-05 23:34:15,290 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-05 23:34:15,290 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-05 23:34:15,290 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-05 23:34:15,291 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-05 23:34:15,291 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-05 23:34:15,291 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-05 23:34:15,291 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-05 23:34:15,291 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-05 23:34:15,292 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-05 23:34:15,292 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-05 23:34:15,292 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-05 23:34:15,292 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-05 23:34:15,292 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-05 23:34:15,293 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-05 23:34:15,293 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2020-10-05 23:34:15,293 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-05 23:34:15,293 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-05 23:34:15,293 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-05 23:34:15,294 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2020-10-05 23:34:15,294 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-05 23:34:15,561 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-05 23:34:15,571 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-05 23:34:15,576 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-05 23:34:15,577 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-05 23:34:15,579 INFO L275 PluginConnector]: CDTParser initialized [2020-10-05 23:34:15,580 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix047_rmo.opt.i [2020-10-05 23:34:15,644 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d401aed2c/7c0f4382267e420e97c05714aec7b853/FLAG0ed32d68e [2020-10-05 23:34:16,212 INFO L306 CDTParser]: Found 1 translation units. [2020-10-05 23:34:16,212 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix047_rmo.opt.i [2020-10-05 23:34:16,240 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d401aed2c/7c0f4382267e420e97c05714aec7b853/FLAG0ed32d68e [2020-10-05 23:34:16,481 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d401aed2c/7c0f4382267e420e97c05714aec7b853 [2020-10-05 23:34:16,491 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-05 23:34:16,493 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-05 23:34:16,494 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-05 23:34:16,494 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-05 23:34:16,497 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-05 23:34:16,499 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.10 11:34:16" (1/1) ... [2020-10-05 23:34:16,502 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a3f0c9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:34:16, skipping insertion in model container [2020-10-05 23:34:16,502 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.10 11:34:16" (1/1) ... [2020-10-05 23:34:16,511 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-05 23:34:16,561 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-05 23:34:17,161 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-05 23:34:17,188 INFO L203 MainTranslator]: Completed pre-run [2020-10-05 23:34:17,248 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-05 23:34:17,326 INFO L208 MainTranslator]: Completed translation [2020-10-05 23:34:17,326 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:34:17 WrapperNode [2020-10-05 23:34:17,326 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-05 23:34:17,327 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-05 23:34:17,327 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-05 23:34:17,328 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-05 23:34:17,340 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:34:17" (1/1) ... [2020-10-05 23:34:17,360 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:34:17" (1/1) ... [2020-10-05 23:34:17,404 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-05 23:34:17,405 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-05 23:34:17,405 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-05 23:34:17,405 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-05 23:34:17,415 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:34:17" (1/1) ... [2020-10-05 23:34:17,415 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:34:17" (1/1) ... [2020-10-05 23:34:17,421 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:34:17" (1/1) ... [2020-10-05 23:34:17,422 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:34:17" (1/1) ... [2020-10-05 23:34:17,433 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:34:17" (1/1) ... [2020-10-05 23:34:17,438 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:34:17" (1/1) ... [2020-10-05 23:34:17,442 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:34:17" (1/1) ... [2020-10-05 23:34:17,448 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-05 23:34:17,449 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-05 23:34:17,449 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-05 23:34:17,449 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-05 23:34:17,451 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:34:17" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-05 23:34:17,523 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-05 23:34:17,523 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-05 23:34:17,523 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-05 23:34:17,523 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-05 23:34:17,524 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-05 23:34:17,524 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-05 23:34:17,524 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-05 23:34:17,524 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-05 23:34:17,524 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-05 23:34:17,525 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-05 23:34:17,525 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2020-10-05 23:34:17,525 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2020-10-05 23:34:17,525 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-05 23:34:17,525 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-05 23:34:17,526 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-05 23:34:17,528 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-05 23:34:19,561 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-05 23:34:19,562 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-05 23:34:19,565 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.10 11:34:19 BoogieIcfgContainer [2020-10-05 23:34:19,565 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-05 23:34:19,567 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-05 23:34:19,567 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-05 23:34:19,572 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-05 23:34:19,572 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.10 11:34:16" (1/3) ... [2020-10-05 23:34:19,573 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@324208e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.10 11:34:19, skipping insertion in model container [2020-10-05 23:34:19,574 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:34:17" (2/3) ... [2020-10-05 23:34:19,574 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@324208e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.10 11:34:19, skipping insertion in model container [2020-10-05 23:34:19,574 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.10 11:34:19" (3/3) ... [2020-10-05 23:34:19,577 INFO L109 eAbstractionObserver]: Analyzing ICFG mix047_rmo.opt.i [2020-10-05 23:34:19,589 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-05 23:34:19,589 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-05 23:34:19,598 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-05 23:34:19,599 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-05 23:34:19,647 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:34:19,648 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:34:19,648 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:34:19,648 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:34:19,649 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:34:19,649 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:34:19,649 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:34:19,650 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:34:19,650 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:34:19,650 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:34:19,650 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:34:19,650 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:34:19,651 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:34:19,651 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:34:19,651 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:34:19,651 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:34:19,651 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:34:19,652 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:34:19,652 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:34:19,652 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:34:19,652 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:34:19,652 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:34:19,652 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:34:19,653 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:34:19,653 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:34:19,654 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:34:19,654 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:34:19,654 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:34:19,654 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:34:19,655 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:34:19,655 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:34:19,655 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:34:19,655 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:34:19,656 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:34:19,656 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:34:19,658 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:34:19,658 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:34:19,658 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:34:19,659 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:34:19,661 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:34:19,661 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:34:19,662 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:34:19,671 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:34:19,672 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:34:19,672 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:34:19,672 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:34:19,677 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:34:19,677 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:34:19,677 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:34:19,677 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:34:19,677 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:34:19,678 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:34:19,678 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:34:19,678 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:34:19,678 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:34:19,679 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:34:19,682 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:34:19,682 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:34:19,682 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:34:19,683 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:34:19,683 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:34:19,683 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:34:19,683 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:34:19,684 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:34:19,684 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:34:19,684 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:34:19,684 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:34:19,685 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:34:19,687 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:34:19,687 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:34:19,687 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:34:19,688 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:34:19,705 INFO L251 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2020-10-05 23:34:19,727 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-10-05 23:34:19,727 INFO L376 AbstractCegarLoop]: Hoare is true [2020-10-05 23:34:19,728 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-05 23:34:19,728 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-05 23:34:19,728 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-05 23:34:19,728 INFO L380 AbstractCegarLoop]: Difference is false [2020-10-05 23:34:19,728 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-05 23:34:19,728 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-05 23:34:19,749 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 122 places, 111 transitions, 242 flow [2020-10-05 23:34:19,751 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 122 places, 111 transitions, 242 flow [2020-10-05 23:34:19,840 INFO L129 PetriNetUnfolder]: 2/107 cut-off events. [2020-10-05 23:34:19,840 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-05 23:34:19,850 INFO L80 FinitePrefix]: Finished finitePrefix Result has 120 conditions, 107 events. 2/107 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 80 event pairs, 0 based on Foata normal form. 0/103 useless extension candidates. Maximal degree in co-relation 75. Up to 2 conditions per place. [2020-10-05 23:34:19,858 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 122 places, 111 transitions, 242 flow [2020-10-05 23:34:19,911 INFO L129 PetriNetUnfolder]: 2/107 cut-off events. [2020-10-05 23:34:19,911 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-05 23:34:19,914 INFO L80 FinitePrefix]: Finished finitePrefix Result has 120 conditions, 107 events. 2/107 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 80 event pairs, 0 based on Foata normal form. 0/103 useless extension candidates. Maximal degree in co-relation 75. Up to 2 conditions per place. [2020-10-05 23:34:19,918 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 2540 [2020-10-05 23:34:19,919 INFO L182 etLargeBlockEncoding]: Variable Check. [2020-10-05 23:34:20,416 WARN L193 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 45 [2020-10-05 23:34:20,820 WARN L193 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-10-05 23:34:21,173 WARN L193 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-10-05 23:34:22,566 WARN L193 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 95 [2020-10-05 23:34:22,698 WARN L193 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2020-10-05 23:34:22,708 INFO L206 etLargeBlockEncoding]: Checked pairs total: 6742 [2020-10-05 23:34:22,710 INFO L214 etLargeBlockEncoding]: Total number of compositions: 86 [2020-10-05 23:34:22,715 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 46 places, 34 transitions, 88 flow [2020-10-05 23:34:22,923 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 3562 states. [2020-10-05 23:34:22,926 INFO L276 IsEmpty]: Start isEmpty. Operand 3562 states. [2020-10-05 23:34:22,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-05 23:34:22,935 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:34:22,936 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:34:22,936 INFO L427 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-05 23:34:22,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:34:22,943 INFO L82 PathProgramCache]: Analyzing trace with hash -1057468649, now seen corresponding path program 1 times [2020-10-05 23:34:22,953 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:34:22,954 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231626563] [2020-10-05 23:34:22,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:34:23,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:34:23,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:34:23,199 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231626563] [2020-10-05 23:34:23,200 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:34:23,200 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-05 23:34:23,201 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65915324] [2020-10-05 23:34:23,206 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-05 23:34:23,206 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:34:23,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-05 23:34:23,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-05 23:34:23,225 INFO L87 Difference]: Start difference. First operand 3562 states. Second operand 3 states. [2020-10-05 23:34:23,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:34:23,344 INFO L93 Difference]: Finished difference Result 3082 states and 12048 transitions. [2020-10-05 23:34:23,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-05 23:34:23,347 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-10-05 23:34:23,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:34:23,393 INFO L225 Difference]: With dead ends: 3082 [2020-10-05 23:34:23,393 INFO L226 Difference]: Without dead ends: 2602 [2020-10-05 23:34:23,395 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-05 23:34:23,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2602 states. [2020-10-05 23:34:23,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2602 to 2602. [2020-10-05 23:34:23,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2602 states. [2020-10-05 23:34:23,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2602 states to 2602 states and 10064 transitions. [2020-10-05 23:34:23,671 INFO L78 Accepts]: Start accepts. Automaton has 2602 states and 10064 transitions. Word has length 9 [2020-10-05 23:34:23,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:34:23,672 INFO L479 AbstractCegarLoop]: Abstraction has 2602 states and 10064 transitions. [2020-10-05 23:34:23,673 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-05 23:34:23,673 INFO L276 IsEmpty]: Start isEmpty. Operand 2602 states and 10064 transitions. [2020-10-05 23:34:23,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-05 23:34:23,683 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:34:23,683 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:34:23,683 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-05 23:34:23,684 INFO L427 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-05 23:34:23,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:34:23,684 INFO L82 PathProgramCache]: Analyzing trace with hash 538538719, now seen corresponding path program 1 times [2020-10-05 23:34:23,685 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:34:23,685 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382921875] [2020-10-05 23:34:23,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:34:23,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:34:23,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:34:23,893 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382921875] [2020-10-05 23:34:23,893 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:34:23,894 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-05 23:34:23,894 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230418995] [2020-10-05 23:34:23,895 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-05 23:34:23,896 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:34:23,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-05 23:34:23,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-05 23:34:23,897 INFO L87 Difference]: Start difference. First operand 2602 states and 10064 transitions. Second operand 4 states. [2020-10-05 23:34:23,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:34:23,975 INFO L93 Difference]: Finished difference Result 2986 states and 11176 transitions. [2020-10-05 23:34:23,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-05 23:34:23,976 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2020-10-05 23:34:23,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:34:24,001 INFO L225 Difference]: With dead ends: 2986 [2020-10-05 23:34:24,001 INFO L226 Difference]: Without dead ends: 2506 [2020-10-05 23:34:24,002 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-05 23:34:24,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2506 states. [2020-10-05 23:34:24,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2506 to 2506. [2020-10-05 23:34:24,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2506 states. [2020-10-05 23:34:24,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2506 states to 2506 states and 9624 transitions. [2020-10-05 23:34:24,105 INFO L78 Accepts]: Start accepts. Automaton has 2506 states and 9624 transitions. Word has length 12 [2020-10-05 23:34:24,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:34:24,106 INFO L479 AbstractCegarLoop]: Abstraction has 2506 states and 9624 transitions. [2020-10-05 23:34:24,106 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-05 23:34:24,106 INFO L276 IsEmpty]: Start isEmpty. Operand 2506 states and 9624 transitions. [2020-10-05 23:34:24,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-05 23:34:24,108 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:34:24,109 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:34:24,109 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-05 23:34:24,109 INFO L427 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-05 23:34:24,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:34:24,110 INFO L82 PathProgramCache]: Analyzing trace with hash -514142509, now seen corresponding path program 1 times [2020-10-05 23:34:24,110 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:34:24,110 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326547236] [2020-10-05 23:34:24,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:34:24,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:34:24,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:34:24,249 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326547236] [2020-10-05 23:34:24,249 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:34:24,249 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-05 23:34:24,250 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492318703] [2020-10-05 23:34:24,251 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-05 23:34:24,251 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:34:24,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-05 23:34:24,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-05 23:34:24,252 INFO L87 Difference]: Start difference. First operand 2506 states and 9624 transitions. Second operand 4 states. [2020-10-05 23:34:24,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:34:24,335 INFO L93 Difference]: Finished difference Result 2650 states and 9876 transitions. [2020-10-05 23:34:24,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-05 23:34:24,336 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2020-10-05 23:34:24,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:34:24,358 INFO L225 Difference]: With dead ends: 2650 [2020-10-05 23:34:24,358 INFO L226 Difference]: Without dead ends: 2218 [2020-10-05 23:34:24,358 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-05 23:34:24,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2218 states. [2020-10-05 23:34:24,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2218 to 2218. [2020-10-05 23:34:24,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2218 states. [2020-10-05 23:34:24,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2218 states to 2218 states and 8400 transitions. [2020-10-05 23:34:24,444 INFO L78 Accepts]: Start accepts. Automaton has 2218 states and 8400 transitions. Word has length 13 [2020-10-05 23:34:24,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:34:24,444 INFO L479 AbstractCegarLoop]: Abstraction has 2218 states and 8400 transitions. [2020-10-05 23:34:24,445 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-05 23:34:24,445 INFO L276 IsEmpty]: Start isEmpty. Operand 2218 states and 8400 transitions. [2020-10-05 23:34:24,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-05 23:34:24,448 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:34:24,448 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:34:24,448 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-05 23:34:24,449 INFO L427 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-05 23:34:24,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:34:24,449 INFO L82 PathProgramCache]: Analyzing trace with hash 1623496234, now seen corresponding path program 1 times [2020-10-05 23:34:24,450 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:34:24,451 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112447550] [2020-10-05 23:34:24,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:34:24,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:34:24,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:34:24,602 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112447550] [2020-10-05 23:34:24,602 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:34:24,603 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-05 23:34:24,603 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65999964] [2020-10-05 23:34:24,603 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-05 23:34:24,604 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:34:24,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-05 23:34:24,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-05 23:34:24,604 INFO L87 Difference]: Start difference. First operand 2218 states and 8400 transitions. Second operand 4 states. [2020-10-05 23:34:24,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:34:24,732 INFO L93 Difference]: Finished difference Result 2410 states and 8912 transitions. [2020-10-05 23:34:24,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-05 23:34:24,733 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2020-10-05 23:34:24,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:34:24,752 INFO L225 Difference]: With dead ends: 2410 [2020-10-05 23:34:24,752 INFO L226 Difference]: Without dead ends: 2154 [2020-10-05 23:34:24,753 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-05 23:34:24,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2154 states. [2020-10-05 23:34:24,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2154 to 2154. [2020-10-05 23:34:24,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2154 states. [2020-10-05 23:34:24,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2154 states to 2154 states and 8112 transitions. [2020-10-05 23:34:24,827 INFO L78 Accepts]: Start accepts. Automaton has 2154 states and 8112 transitions. Word has length 15 [2020-10-05 23:34:24,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:34:24,828 INFO L479 AbstractCegarLoop]: Abstraction has 2154 states and 8112 transitions. [2020-10-05 23:34:24,828 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-05 23:34:24,828 INFO L276 IsEmpty]: Start isEmpty. Operand 2154 states and 8112 transitions. [2020-10-05 23:34:24,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-05 23:34:24,832 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:34:24,832 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:34:24,833 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-05 23:34:24,833 INFO L427 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-05 23:34:24,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:34:24,833 INFO L82 PathProgramCache]: Analyzing trace with hash 2052747841, now seen corresponding path program 1 times [2020-10-05 23:34:24,833 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:34:24,834 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360727406] [2020-10-05 23:34:24,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:34:24,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:34:24,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:34:24,923 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360727406] [2020-10-05 23:34:24,923 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:34:24,923 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-05 23:34:24,924 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969024282] [2020-10-05 23:34:24,924 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-05 23:34:24,924 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:34:24,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-05 23:34:24,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-05 23:34:24,925 INFO L87 Difference]: Start difference. First operand 2154 states and 8112 transitions. Second operand 4 states. [2020-10-05 23:34:24,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:34:24,985 INFO L93 Difference]: Finished difference Result 3274 states and 11856 transitions. [2020-10-05 23:34:24,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-05 23:34:24,986 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2020-10-05 23:34:24,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:34:25,004 INFO L225 Difference]: With dead ends: 3274 [2020-10-05 23:34:25,005 INFO L226 Difference]: Without dead ends: 2346 [2020-10-05 23:34:25,005 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-05 23:34:25,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2346 states. [2020-10-05 23:34:25,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2346 to 2090. [2020-10-05 23:34:25,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2090 states. [2020-10-05 23:34:25,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2090 states to 2090 states and 7536 transitions. [2020-10-05 23:34:25,076 INFO L78 Accepts]: Start accepts. Automaton has 2090 states and 7536 transitions. Word has length 16 [2020-10-05 23:34:25,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:34:25,077 INFO L479 AbstractCegarLoop]: Abstraction has 2090 states and 7536 transitions. [2020-10-05 23:34:25,077 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-05 23:34:25,077 INFO L276 IsEmpty]: Start isEmpty. Operand 2090 states and 7536 transitions. [2020-10-05 23:34:25,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-05 23:34:25,080 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:34:25,081 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:34:25,081 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-05 23:34:25,081 INFO L427 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-05 23:34:25,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:34:25,082 INFO L82 PathProgramCache]: Analyzing trace with hash 1209496709, now seen corresponding path program 1 times [2020-10-05 23:34:25,082 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:34:25,082 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612902663] [2020-10-05 23:34:25,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:34:25,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:34:25,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:34:25,247 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612902663] [2020-10-05 23:34:25,248 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:34:25,248 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-05 23:34:25,248 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561700395] [2020-10-05 23:34:25,248 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-05 23:34:25,249 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:34:25,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-05 23:34:25,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-10-05 23:34:25,249 INFO L87 Difference]: Start difference. First operand 2090 states and 7536 transitions. Second operand 6 states. [2020-10-05 23:34:25,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:34:25,404 INFO L93 Difference]: Finished difference Result 2546 states and 8956 transitions. [2020-10-05 23:34:25,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-05 23:34:25,404 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2020-10-05 23:34:25,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:34:25,422 INFO L225 Difference]: With dead ends: 2546 [2020-10-05 23:34:25,422 INFO L226 Difference]: Without dead ends: 2266 [2020-10-05 23:34:25,422 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2020-10-05 23:34:25,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2266 states. [2020-10-05 23:34:25,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2266 to 2266. [2020-10-05 23:34:25,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2266 states. [2020-10-05 23:34:25,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2266 states to 2266 states and 8024 transitions. [2020-10-05 23:34:25,495 INFO L78 Accepts]: Start accepts. Automaton has 2266 states and 8024 transitions. Word has length 16 [2020-10-05 23:34:25,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:34:25,495 INFO L479 AbstractCegarLoop]: Abstraction has 2266 states and 8024 transitions. [2020-10-05 23:34:25,495 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-05 23:34:25,495 INFO L276 IsEmpty]: Start isEmpty. Operand 2266 states and 8024 transitions. [2020-10-05 23:34:25,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-05 23:34:25,501 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:34:25,501 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:34:25,501 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-05 23:34:25,501 INFO L427 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-05 23:34:25,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:34:25,502 INFO L82 PathProgramCache]: Analyzing trace with hash 1333331684, now seen corresponding path program 1 times [2020-10-05 23:34:25,502 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:34:25,502 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680555558] [2020-10-05 23:34:25,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:34:25,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:34:25,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:34:25,671 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680555558] [2020-10-05 23:34:25,672 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:34:25,672 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-05 23:34:25,672 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13731248] [2020-10-05 23:34:25,672 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-05 23:34:25,673 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:34:25,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-05 23:34:25,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-05 23:34:25,673 INFO L87 Difference]: Start difference. First operand 2266 states and 8024 transitions. Second operand 4 states. [2020-10-05 23:34:25,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:34:25,714 INFO L93 Difference]: Finished difference Result 2358 states and 7591 transitions. [2020-10-05 23:34:25,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-05 23:34:25,715 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2020-10-05 23:34:25,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:34:25,722 INFO L225 Difference]: With dead ends: 2358 [2020-10-05 23:34:25,722 INFO L226 Difference]: Without dead ends: 1782 [2020-10-05 23:34:25,723 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-05 23:34:25,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1782 states. [2020-10-05 23:34:25,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1782 to 1782. [2020-10-05 23:34:25,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1782 states. [2020-10-05 23:34:25,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1782 states to 1782 states and 5712 transitions. [2020-10-05 23:34:25,771 INFO L78 Accepts]: Start accepts. Automaton has 1782 states and 5712 transitions. Word has length 18 [2020-10-05 23:34:25,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:34:25,772 INFO L479 AbstractCegarLoop]: Abstraction has 1782 states and 5712 transitions. [2020-10-05 23:34:25,772 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-05 23:34:25,772 INFO L276 IsEmpty]: Start isEmpty. Operand 1782 states and 5712 transitions. [2020-10-05 23:34:25,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-05 23:34:25,776 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:34:25,776 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-05 23:34:25,777 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-05 23:34:25,777 INFO L427 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-05 23:34:25,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:34:25,777 INFO L82 PathProgramCache]: Analyzing trace with hash -757860689, now seen corresponding path program 1 times [2020-10-05 23:34:25,777 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:34:25,778 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418813321] [2020-10-05 23:34:25,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:34:25,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:34:25,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:34:25,909 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418813321] [2020-10-05 23:34:25,909 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:34:25,909 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-05 23:34:25,909 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188999186] [2020-10-05 23:34:25,910 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-05 23:34:25,910 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:34:25,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-05 23:34:25,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-05 23:34:25,911 INFO L87 Difference]: Start difference. First operand 1782 states and 5712 transitions. Second operand 5 states. [2020-10-05 23:34:25,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:34:25,970 INFO L93 Difference]: Finished difference Result 1515 states and 4414 transitions. [2020-10-05 23:34:25,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-05 23:34:25,970 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2020-10-05 23:34:25,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:34:25,974 INFO L225 Difference]: With dead ends: 1515 [2020-10-05 23:34:25,975 INFO L226 Difference]: Without dead ends: 1146 [2020-10-05 23:34:25,975 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-05 23:34:25,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1146 states. [2020-10-05 23:34:25,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1146 to 1146. [2020-10-05 23:34:25,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1146 states. [2020-10-05 23:34:26,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1146 states to 1146 states and 3270 transitions. [2020-10-05 23:34:26,002 INFO L78 Accepts]: Start accepts. Automaton has 1146 states and 3270 transitions. Word has length 19 [2020-10-05 23:34:26,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:34:26,002 INFO L479 AbstractCegarLoop]: Abstraction has 1146 states and 3270 transitions. [2020-10-05 23:34:26,003 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-05 23:34:26,003 INFO L276 IsEmpty]: Start isEmpty. Operand 1146 states and 3270 transitions. [2020-10-05 23:34:26,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-05 23:34:26,005 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:34:26,005 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:34:26,006 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-05 23:34:26,006 INFO L427 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-05 23:34:26,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:34:26,006 INFO L82 PathProgramCache]: Analyzing trace with hash -1834278306, now seen corresponding path program 1 times [2020-10-05 23:34:26,006 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:34:26,007 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082752128] [2020-10-05 23:34:26,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:34:26,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:34:26,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:34:26,083 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082752128] [2020-10-05 23:34:26,083 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:34:26,083 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-05 23:34:26,084 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742333549] [2020-10-05 23:34:26,084 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-05 23:34:26,084 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:34:26,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-05 23:34:26,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-05 23:34:26,085 INFO L87 Difference]: Start difference. First operand 1146 states and 3270 transitions. Second operand 5 states. [2020-10-05 23:34:26,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:34:26,141 INFO L93 Difference]: Finished difference Result 1563 states and 4357 transitions. [2020-10-05 23:34:26,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-05 23:34:26,142 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2020-10-05 23:34:26,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:34:26,146 INFO L225 Difference]: With dead ends: 1563 [2020-10-05 23:34:26,147 INFO L226 Difference]: Without dead ends: 1026 [2020-10-05 23:34:26,147 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-05 23:34:26,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1026 states. [2020-10-05 23:34:26,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1026 to 984. [2020-10-05 23:34:26,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 984 states. [2020-10-05 23:34:26,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 984 states to 984 states and 2672 transitions. [2020-10-05 23:34:26,176 INFO L78 Accepts]: Start accepts. Automaton has 984 states and 2672 transitions. Word has length 21 [2020-10-05 23:34:26,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:34:26,177 INFO L479 AbstractCegarLoop]: Abstraction has 984 states and 2672 transitions. [2020-10-05 23:34:26,177 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-05 23:34:26,177 INFO L276 IsEmpty]: Start isEmpty. Operand 984 states and 2672 transitions. [2020-10-05 23:34:26,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-05 23:34:26,179 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:34:26,180 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:34:26,180 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-05 23:34:26,180 INFO L427 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-05 23:34:26,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:34:26,181 INFO L82 PathProgramCache]: Analyzing trace with hash 884998233, now seen corresponding path program 1 times [2020-10-05 23:34:26,181 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:34:26,181 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038375201] [2020-10-05 23:34:26,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:34:26,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:34:26,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:34:26,252 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038375201] [2020-10-05 23:34:26,252 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:34:26,253 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-05 23:34:26,253 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975742060] [2020-10-05 23:34:26,253 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-05 23:34:26,253 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:34:26,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-05 23:34:26,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-05 23:34:26,254 INFO L87 Difference]: Start difference. First operand 984 states and 2672 transitions. Second operand 4 states. [2020-10-05 23:34:26,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:34:26,289 INFO L93 Difference]: Finished difference Result 1407 states and 3652 transitions. [2020-10-05 23:34:26,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-05 23:34:26,290 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2020-10-05 23:34:26,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:34:26,293 INFO L225 Difference]: With dead ends: 1407 [2020-10-05 23:34:26,293 INFO L226 Difference]: Without dead ends: 974 [2020-10-05 23:34:26,293 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-05 23:34:26,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 974 states. [2020-10-05 23:34:26,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 974 to 930. [2020-10-05 23:34:26,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 930 states. [2020-10-05 23:34:26,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 930 states to 930 states and 2380 transitions. [2020-10-05 23:34:26,317 INFO L78 Accepts]: Start accepts. Automaton has 930 states and 2380 transitions. Word has length 21 [2020-10-05 23:34:26,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:34:26,318 INFO L479 AbstractCegarLoop]: Abstraction has 930 states and 2380 transitions. [2020-10-05 23:34:26,318 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-05 23:34:26,318 INFO L276 IsEmpty]: Start isEmpty. Operand 930 states and 2380 transitions. [2020-10-05 23:34:26,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-05 23:34:26,320 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:34:26,320 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:34:26,321 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-05 23:34:26,321 INFO L427 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-05 23:34:26,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:34:26,321 INFO L82 PathProgramCache]: Analyzing trace with hash 1432438344, now seen corresponding path program 1 times [2020-10-05 23:34:26,321 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:34:26,322 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351264886] [2020-10-05 23:34:26,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:34:26,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:34:26,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:34:26,450 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351264886] [2020-10-05 23:34:26,450 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:34:26,450 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-05 23:34:26,451 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985183627] [2020-10-05 23:34:26,451 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-05 23:34:26,451 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:34:26,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-05 23:34:26,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-05 23:34:26,452 INFO L87 Difference]: Start difference. First operand 930 states and 2380 transitions. Second operand 6 states. [2020-10-05 23:34:26,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:34:26,512 INFO L93 Difference]: Finished difference Result 780 states and 1931 transitions. [2020-10-05 23:34:26,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-05 23:34:26,513 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2020-10-05 23:34:26,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:34:26,514 INFO L225 Difference]: With dead ends: 780 [2020-10-05 23:34:26,514 INFO L226 Difference]: Without dead ends: 519 [2020-10-05 23:34:26,515 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-10-05 23:34:26,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2020-10-05 23:34:26,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 487. [2020-10-05 23:34:26,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 487 states. [2020-10-05 23:34:26,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 1136 transitions. [2020-10-05 23:34:26,525 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 1136 transitions. Word has length 21 [2020-10-05 23:34:26,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:34:26,525 INFO L479 AbstractCegarLoop]: Abstraction has 487 states and 1136 transitions. [2020-10-05 23:34:26,526 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-05 23:34:26,526 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 1136 transitions. [2020-10-05 23:34:26,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-10-05 23:34:26,527 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:34:26,527 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] [2020-10-05 23:34:26,527 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-05 23:34:26,528 INFO L427 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-05 23:34:26,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:34:26,528 INFO L82 PathProgramCache]: Analyzing trace with hash -1088023473, now seen corresponding path program 1 times [2020-10-05 23:34:26,528 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:34:26,529 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083794900] [2020-10-05 23:34:26,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:34:26,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:34:26,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:34:26,789 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083794900] [2020-10-05 23:34:26,789 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:34:26,789 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-05 23:34:26,789 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568441006] [2020-10-05 23:34:26,790 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-05 23:34:26,790 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:34:26,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-05 23:34:26,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-05 23:34:26,791 INFO L87 Difference]: Start difference. First operand 487 states and 1136 transitions. Second operand 7 states. [2020-10-05 23:34:26,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:34:26,930 INFO L93 Difference]: Finished difference Result 606 states and 1373 transitions. [2020-10-05 23:34:26,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-05 23:34:26,931 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2020-10-05 23:34:26,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:34:26,976 INFO L225 Difference]: With dead ends: 606 [2020-10-05 23:34:26,977 INFO L226 Difference]: Without dead ends: 328 [2020-10-05 23:34:26,977 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2020-10-05 23:34:26,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2020-10-05 23:34:26,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 322. [2020-10-05 23:34:26,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 322 states. [2020-10-05 23:34:26,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 700 transitions. [2020-10-05 23:34:26,986 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 700 transitions. Word has length 24 [2020-10-05 23:34:26,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:34:26,986 INFO L479 AbstractCegarLoop]: Abstraction has 322 states and 700 transitions. [2020-10-05 23:34:26,986 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-05 23:34:26,986 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 700 transitions. [2020-10-05 23:34:26,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-10-05 23:34:26,987 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:34:26,988 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] [2020-10-05 23:34:26,988 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-05 23:34:26,988 INFO L427 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-05 23:34:26,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:34:26,989 INFO L82 PathProgramCache]: Analyzing trace with hash -1285952249, now seen corresponding path program 1 times [2020-10-05 23:34:26,989 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:34:26,989 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824428424] [2020-10-05 23:34:26,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:34:27,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:34:27,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:34:27,112 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824428424] [2020-10-05 23:34:27,112 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:34:27,112 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-05 23:34:27,112 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220073498] [2020-10-05 23:34:27,113 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-05 23:34:27,113 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:34:27,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-05 23:34:27,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-05 23:34:27,114 INFO L87 Difference]: Start difference. First operand 322 states and 700 transitions. Second operand 7 states. [2020-10-05 23:34:27,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:34:27,191 INFO L93 Difference]: Finished difference Result 293 states and 643 transitions. [2020-10-05 23:34:27,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-05 23:34:27,192 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2020-10-05 23:34:27,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:34:27,192 INFO L225 Difference]: With dead ends: 293 [2020-10-05 23:34:27,193 INFO L226 Difference]: Without dead ends: 65 [2020-10-05 23:34:27,193 INFO L675 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-05 23:34:27,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2020-10-05 23:34:27,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2020-10-05 23:34:27,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2020-10-05 23:34:27,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 123 transitions. [2020-10-05 23:34:27,195 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 123 transitions. Word has length 24 [2020-10-05 23:34:27,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:34:27,196 INFO L479 AbstractCegarLoop]: Abstraction has 65 states and 123 transitions. [2020-10-05 23:34:27,196 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-05 23:34:27,196 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 123 transitions. [2020-10-05 23:34:27,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-10-05 23:34:27,197 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:34:27,197 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, 1] [2020-10-05 23:34:27,197 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-05 23:34:27,198 INFO L427 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-05 23:34:27,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:34:27,198 INFO L82 PathProgramCache]: Analyzing trace with hash -218081697, now seen corresponding path program 1 times [2020-10-05 23:34:27,198 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:34:27,198 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159957856] [2020-10-05 23:34:27,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:34:27,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-05 23:34:27,251 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-05 23:34:27,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-05 23:34:27,295 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-05 23:34:27,336 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-05 23:34:27,336 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-10-05 23:34:27,337 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-05 23:34:27,369 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:34:27,370 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:34:27,372 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:34:27,372 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:34:27,372 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:34:27,373 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:34:27,373 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:34:27,373 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:34:27,373 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:34:27,373 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:34:27,374 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:34:27,374 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:34:27,374 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:34:27,375 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:34:27,375 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:34:27,375 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:34:27,375 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:34:27,375 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:34:27,376 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:34:27,376 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:34:27,376 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:34:27,376 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:34:27,377 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:34:27,377 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:34:27,377 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:34:27,377 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:34:27,378 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:34:27,378 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:34:27,378 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:34:27,378 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:34:27,378 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:34:27,378 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:34:27,379 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:34:27,379 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:34:27,379 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:34:27,379 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:34:27,379 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:34:27,380 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:34:27,380 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:34:27,380 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:34:27,380 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:34:27,380 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:34:27,381 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:34:27,381 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:34:27,381 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:34:27,381 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:34:27,381 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:34:27,381 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:34:27,382 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:34:27,382 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:34:27,382 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:34:27,382 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:34:27,382 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:34:27,382 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:34:27,383 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:34:27,383 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:34:27,458 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.10 11:34:27 BasicIcfg [2020-10-05 23:34:27,458 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-05 23:34:27,463 INFO L168 Benchmark]: Toolchain (without parser) took 10967.81 ms. Allocated memory was 140.5 MB in the beginning and 370.7 MB in the end (delta: 230.2 MB). Free memory was 102.0 MB in the beginning and 221.5 MB in the end (delta: -119.5 MB). Peak memory consumption was 110.6 MB. Max. memory is 7.1 GB. [2020-10-05 23:34:27,464 INFO L168 Benchmark]: CDTParser took 0.44 ms. Allocated memory is still 140.5 MB. Free memory was 122.0 MB in the beginning and 121.8 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2020-10-05 23:34:27,465 INFO L168 Benchmark]: CACSL2BoogieTranslator took 833.18 ms. Allocated memory was 140.5 MB in the beginning and 203.9 MB in the end (delta: 63.4 MB). Free memory was 101.8 MB in the beginning and 157.0 MB in the end (delta: -55.2 MB). Peak memory consumption was 24.6 MB. Max. memory is 7.1 GB. [2020-10-05 23:34:27,466 INFO L168 Benchmark]: Boogie Procedure Inliner took 77.28 ms. Allocated memory is still 203.9 MB. Free memory was 157.0 MB in the beginning and 153.8 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 7.1 GB. [2020-10-05 23:34:27,466 INFO L168 Benchmark]: Boogie Preprocessor took 43.87 ms. Allocated memory is still 203.9 MB. Free memory was 153.8 MB in the beginning and 151.3 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2020-10-05 23:34:27,471 INFO L168 Benchmark]: RCFGBuilder took 2116.68 ms. Allocated memory was 203.9 MB in the beginning and 245.4 MB in the end (delta: 41.4 MB). Free memory was 151.3 MB in the beginning and 175.9 MB in the end (delta: -24.7 MB). Peak memory consumption was 98.4 MB. Max. memory is 7.1 GB. [2020-10-05 23:34:27,472 INFO L168 Benchmark]: TraceAbstraction took 7891.42 ms. Allocated memory was 245.4 MB in the beginning and 370.7 MB in the end (delta: 125.3 MB). Free memory was 175.9 MB in the beginning and 221.5 MB in the end (delta: -45.6 MB). Peak memory consumption was 79.7 MB. Max. memory is 7.1 GB. [2020-10-05 23:34:27,479 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.44 ms. Allocated memory is still 140.5 MB. Free memory was 122.0 MB in the beginning and 121.8 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 833.18 ms. Allocated memory was 140.5 MB in the beginning and 203.9 MB in the end (delta: 63.4 MB). Free memory was 101.8 MB in the beginning and 157.0 MB in the end (delta: -55.2 MB). Peak memory consumption was 24.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 77.28 ms. Allocated memory is still 203.9 MB. Free memory was 157.0 MB in the beginning and 153.8 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 43.87 ms. Allocated memory is still 203.9 MB. Free memory was 153.8 MB in the beginning and 151.3 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2116.68 ms. Allocated memory was 203.9 MB in the beginning and 245.4 MB in the end (delta: 41.4 MB). Free memory was 151.3 MB in the beginning and 175.9 MB in the end (delta: -24.7 MB). Peak memory consumption was 98.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 7891.42 ms. Allocated memory was 245.4 MB in the beginning and 370.7 MB in the end (delta: 125.3 MB). Free memory was 175.9 MB in the beginning and 221.5 MB in the end (delta: -45.6 MB). Peak memory consumption was 79.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 2.9s, 122 ProgramPointsBefore, 46 ProgramPointsAfterwards, 111 TransitionsBefore, 34 TransitionsAfterwards, 2540 CoEnabledTransitionPairs, 8 FixpointIterations, 36 TrivialSequentialCompositions, 45 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 1 ChoiceCompositions, 1260 VarBasedMoverChecksPositive, 32 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 6742 CheckedPairsTotal, 86 TotalNumberOfCompositions - 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_p3_EAX = 0; [L703] 0 int __unbuffered_p3_EBX = 0; [L705] 0 int a = 0; [L707] 0 int b = 0; [L708] 0 _Bool main$tmp_guard0; [L709] 0 _Bool main$tmp_guard1; [L711] 0 int x = 0; [L713] 0 int y = 0; [L715] 0 int z = 0; [L716] 0 _Bool z$flush_delayed; [L717] 0 int z$mem_tmp; [L718] 0 _Bool z$r_buff0_thd0; [L719] 0 _Bool z$r_buff0_thd1; [L720] 0 _Bool z$r_buff0_thd2; [L721] 0 _Bool z$r_buff0_thd3; [L722] 0 _Bool z$r_buff0_thd4; [L723] 0 _Bool z$r_buff1_thd0; [L724] 0 _Bool z$r_buff1_thd1; [L725] 0 _Bool z$r_buff1_thd2; [L726] 0 _Bool z$r_buff1_thd3; [L727] 0 _Bool z$r_buff1_thd4; [L728] 0 _Bool z$read_delayed; [L729] 0 int *z$read_delayed_var; [L730] 0 int z$w_buff0; [L731] 0 _Bool z$w_buff0_used; [L732] 0 int z$w_buff1; [L733] 0 _Bool z$w_buff1_used; [L734] 0 _Bool weak$$choice0; [L735] 0 _Bool weak$$choice2; [L833] 0 pthread_t t1269; [L834] FCALL, FORK 0 pthread_create(&t1269, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=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] [L835] 0 pthread_t t1270; [L836] FCALL, FORK 0 pthread_create(&t1270, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=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] [L837] 0 pthread_t t1271; [L838] FCALL, FORK 0 pthread_create(&t1271, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=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] [L839] 0 pthread_t t1272; [L840] FCALL, FORK 0 pthread_create(&t1272, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=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] [L789] 4 z$w_buff1 = z$w_buff0 [L790] 4 z$w_buff0 = 2 [L791] 4 z$w_buff1_used = z$w_buff0_used [L792] 4 z$w_buff0_used = (_Bool)1 [L7] COND TRUE 4 !expression [L7] 4 __VERIFIER_error() [L794] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L795] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L796] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L797] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L798] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L799] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=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] [L802] 4 a = 1 [L805] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=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] [L808] 4 __unbuffered_p3_EBX = b VAL [__unbuffered_cnt=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] [L739] 1 b = 1 VAL [__unbuffered_cnt=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] [L742] 1 x = 1 VAL [__unbuffered_cnt=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=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] [L754] 2 x = 2 VAL [__unbuffered_cnt=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=2, 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] [L747] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L749] 1 return 0; [L757] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __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=2, 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] [L762] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L764] 2 return 0; [L769] 3 y = 2 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __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=2, 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] [L772] 3 z = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __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=2, 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] [L811] 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) [L811] 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) [L812] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L812] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L813] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L813] 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 [L814] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L814] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L815] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L815] 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 [L818] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L820] 4 return 0; [L775] 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) [L775] 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) [L776] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L776] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L777] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L777] 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 [L778] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L778] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L779] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L779] 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 [L782] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L784] 3 return 0; [L842] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L3] COND FALSE 0 !(!cond) [L846] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L846] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L846] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L846] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L847] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L847] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L848] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L848] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L849] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L849] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L850] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L850] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L853] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L854] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L855] 0 z$flush_delayed = weak$$choice2 [L856] 0 z$mem_tmp = z [L857] 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) [L857] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1 [L857] 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) [L857] 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) [L858] 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)) [L858] EXPR 0 !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) [L858] 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)) [L858] 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)) [L859] 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)) [L859] 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) [L859] 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)) [L859] 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)) [L860] 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)) [L860] 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)) [L861] 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)) [L861] 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)) [L862] 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)) [L862] 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)) [L863] 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)) [L863] 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)) [L864] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L865] EXPR 0 z$flush_delayed ? z$mem_tmp : z [L865] 0 z = z$flush_delayed ? z$mem_tmp : z [L866] 0 z$flush_delayed = (_Bool)0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __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=9, weak$$choice2=255, x=2, 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] [L7] COND TRUE 0 !expression [L7] 0 __VERIFIER_error() VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __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=9, weak$$choice2=255, x=2, 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, 110 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 7.6s, OverallIterations: 14, TraceHistogramMax: 1, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.1s, HoareTripleCheckerStatistics: 527 SDtfs, 646 SDslu, 886 SDs, 0 SdLazy, 267 SolverSat, 88 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 60 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3562occurred 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.8s AutomataMinimizationTime, 13 MinimizatonAttempts, 380 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 256 NumberOfCodeBlocks, 256 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 216 ConstructedInterpolants, 0 QuantifiedInterpolants, 17089 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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...