/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/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix055_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 17:53:06,335 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 17:53:06,338 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 17:53:06,355 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 17:53:06,356 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 17:53:06,358 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 17:53:06,360 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 17:53:06,369 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 17:53:06,373 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 17:53:06,376 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 17:53:06,378 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 17:53:06,380 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 17:53:06,380 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 17:53:06,382 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 17:53:06,384 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 17:53:06,385 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 17:53:06,387 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 17:53:06,387 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 17:53:06,389 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 17:53:06,393 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 17:53:06,397 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 17:53:06,402 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 17:53:06,404 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 17:53:06,404 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 17:53:06,406 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 17:53:06,407 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 17:53:06,407 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 17:53:06,408 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 17:53:06,410 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 17:53:06,411 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 17:53:06,411 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 17:53:06,413 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 17:53:06,414 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 17:53:06,415 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 17:53:06,417 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 17:53:06,417 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 17:53:06,418 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 17:53:06,418 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 17:53:06,418 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 17:53:06,419 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 17:53:06,421 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 17:53:06,421 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf [2019-12-18 17:53:06,452 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 17:53:06,452 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 17:53:06,453 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 17:53:06,453 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 17:53:06,453 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 17:53:06,454 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 17:53:06,454 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 17:53:06,454 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 17:53:06,454 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 17:53:06,454 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 17:53:06,455 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 17:53:06,455 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 17:53:06,455 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 17:53:06,455 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 17:53:06,455 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 17:53:06,455 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 17:53:06,456 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 17:53:06,456 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 17:53:06,456 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 17:53:06,456 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 17:53:06,456 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 17:53:06,457 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 17:53:06,457 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 17:53:06,457 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 17:53:06,457 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 17:53:06,457 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 17:53:06,457 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 17:53:06,458 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 17:53:06,458 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 17:53:06,724 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 17:53:06,733 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 17:53:06,738 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 17:53:06,739 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 17:53:06,740 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 17:53:06,740 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix055_rmo.opt.i [2019-12-18 17:53:06,812 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d3cf8ad3/f10d87078b2c4d798730e2c2a714a2a8/FLAG47a10c5ba [2019-12-18 17:53:07,403 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 17:53:07,404 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix055_rmo.opt.i [2019-12-18 17:53:07,417 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d3cf8ad3/f10d87078b2c4d798730e2c2a714a2a8/FLAG47a10c5ba [2019-12-18 17:53:07,668 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d3cf8ad3/f10d87078b2c4d798730e2c2a714a2a8 [2019-12-18 17:53:07,677 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 17:53:07,679 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 17:53:07,680 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 17:53:07,680 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 17:53:07,684 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 17:53:07,685 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 05:53:07" (1/1) ... [2019-12-18 17:53:07,688 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c74ec19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:53:07, skipping insertion in model container [2019-12-18 17:53:07,688 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 05:53:07" (1/1) ... [2019-12-18 17:53:07,696 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 17:53:07,763 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 17:53:08,267 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 17:53:08,286 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 17:53:08,361 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 17:53:08,444 INFO L208 MainTranslator]: Completed translation [2019-12-18 17:53:08,444 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:53:08 WrapperNode [2019-12-18 17:53:08,444 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 17:53:08,445 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 17:53:08,445 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 17:53:08,445 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 17:53:08,454 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:53:08" (1/1) ... [2019-12-18 17:53:08,475 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:53:08" (1/1) ... [2019-12-18 17:53:08,514 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 17:53:08,514 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 17:53:08,514 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 17:53:08,515 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 17:53:08,524 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:53:08" (1/1) ... [2019-12-18 17:53:08,524 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:53:08" (1/1) ... [2019-12-18 17:53:08,529 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:53:08" (1/1) ... [2019-12-18 17:53:08,529 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:53:08" (1/1) ... [2019-12-18 17:53:08,540 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:53:08" (1/1) ... [2019-12-18 17:53:08,544 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:53:08" (1/1) ... [2019-12-18 17:53:08,548 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:53:08" (1/1) ... [2019-12-18 17:53:08,553 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 17:53:08,553 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 17:53:08,553 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 17:53:08,554 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 17:53:08,555 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:53:08" (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 [2019-12-18 17:53:08,617 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 17:53:08,618 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 17:53:08,618 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 17:53:08,618 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 17:53:08,618 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 17:53:08,618 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 17:53:08,619 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 17:53:08,619 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 17:53:08,619 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 17:53:08,619 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 17:53:08,619 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-18 17:53:08,620 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-18 17:53:08,620 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 17:53:08,620 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 17:53:08,620 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 17:53:08,622 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 17:53:09,370 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 17:53:09,370 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 17:53:09,372 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 05:53:09 BoogieIcfgContainer [2019-12-18 17:53:09,372 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 17:53:09,373 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 17:53:09,374 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 17:53:09,377 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 17:53:09,377 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 05:53:07" (1/3) ... [2019-12-18 17:53:09,378 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69dfbf42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 05:53:09, skipping insertion in model container [2019-12-18 17:53:09,378 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:53:08" (2/3) ... [2019-12-18 17:53:09,379 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69dfbf42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 05:53:09, skipping insertion in model container [2019-12-18 17:53:09,379 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 05:53:09" (3/3) ... [2019-12-18 17:53:09,381 INFO L109 eAbstractionObserver]: Analyzing ICFG mix055_rmo.opt.i [2019-12-18 17:53:09,392 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 17:53:09,392 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 17:53:09,400 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 17:53:09,401 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 17:53:09,440 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:53:09,440 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:53:09,440 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:53:09,441 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:53:09,441 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:53:09,442 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:53:09,442 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:53:09,442 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:53:09,442 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:53:09,443 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:53:09,443 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:53:09,443 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:53:09,444 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:53:09,444 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:53:09,444 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:53:09,445 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:53:09,445 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:53:09,445 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:53:09,445 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:53:09,446 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:53:09,446 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:53:09,446 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:53:09,447 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:53:09,447 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:53:09,447 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:53:09,448 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:53:09,448 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:53:09,448 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:53:09,448 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:53:09,449 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:53:09,449 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:53:09,449 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:53:09,449 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:53:09,450 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:53:09,450 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:53:09,450 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:53:09,450 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:53:09,451 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:53:09,451 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:53:09,451 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:53:09,451 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:53:09,452 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:53:09,453 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:53:09,453 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:53:09,453 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:53:09,453 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:53:09,454 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:53:09,454 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:53:09,454 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:53:09,454 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:53:09,455 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:53:09,455 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:53:09,455 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:53:09,474 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:53:09,475 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:53:09,475 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:53:09,476 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:53:09,476 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:53:09,476 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:53:09,476 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:53:09,477 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:53:09,477 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:53:09,477 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:53:09,477 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:53:09,478 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:53:09,478 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:53:09,478 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:53:09,478 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:53:09,478 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:53:09,479 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:53:09,479 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:53:09,479 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:53:09,479 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:53:09,479 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:53:09,480 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:53:09,480 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:53:09,483 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:53:09,484 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:53:09,484 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:53:09,484 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:53:09,486 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:53:09,487 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:53:09,487 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:53:09,487 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:53:09,491 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:53:09,491 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:53:09,491 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:53:09,491 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:53:09,492 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:53:09,492 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:53:09,492 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:53:09,492 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:53:09,492 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:53:09,493 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:53:09,495 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:53:09,495 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:53:09,495 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:53:09,495 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:53:09,496 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:53:09,496 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:53:09,496 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:53:09,496 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:53:09,496 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:53:09,497 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:53:09,497 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:53:09,497 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:53:09,512 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-18 17:53:09,528 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 17:53:09,528 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 17:53:09,528 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 17:53:09,529 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 17:53:09,529 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 17:53:09,529 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 17:53:09,529 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 17:53:09,529 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 17:53:09,547 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 179 places, 207 transitions [2019-12-18 17:53:09,549 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 179 places, 207 transitions [2019-12-18 17:53:09,633 INFO L126 PetriNetUnfolder]: 41/203 cut-off events. [2019-12-18 17:53:09,634 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 17:53:09,650 INFO L76 FinitePrefix]: Finished finitePrefix Result has 216 conditions, 203 events. 41/203 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 267 event pairs. 12/172 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-18 17:53:09,671 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 179 places, 207 transitions [2019-12-18 17:53:09,722 INFO L126 PetriNetUnfolder]: 41/203 cut-off events. [2019-12-18 17:53:09,722 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 17:53:09,730 INFO L76 FinitePrefix]: Finished finitePrefix Result has 216 conditions, 203 events. 41/203 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 267 event pairs. 12/172 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-18 17:53:09,746 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12668 [2019-12-18 17:53:09,748 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 17:53:14,725 WARN L192 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 93 [2019-12-18 17:53:14,878 WARN L192 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2019-12-18 17:53:14,902 INFO L206 etLargeBlockEncoding]: Checked pairs total: 50860 [2019-12-18 17:53:14,903 INFO L214 etLargeBlockEncoding]: Total number of compositions: 120 [2019-12-18 17:53:14,906 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 91 places, 97 transitions [2019-12-18 17:53:17,017 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 34622 states. [2019-12-18 17:53:17,018 INFO L276 IsEmpty]: Start isEmpty. Operand 34622 states. [2019-12-18 17:53:17,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-18 17:53:17,025 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:53:17,026 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:53:17,027 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:53:17,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:53:17,032 INFO L82 PathProgramCache]: Analyzing trace with hash 1893967926, now seen corresponding path program 1 times [2019-12-18 17:53:17,039 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:53:17,039 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886925275] [2019-12-18 17:53:17,040 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:53:17,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:53:17,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:53:17,288 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886925275] [2019-12-18 17:53:17,289 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:53:17,289 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 17:53:17,290 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107310215] [2019-12-18 17:53:17,295 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:53:17,295 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:53:17,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:53:17,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:53:17,313 INFO L87 Difference]: Start difference. First operand 34622 states. Second operand 3 states. [2019-12-18 17:53:18,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:53:18,624 INFO L93 Difference]: Finished difference Result 34366 states and 145832 transitions. [2019-12-18 17:53:18,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:53:18,626 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-18 17:53:18,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:53:18,920 INFO L225 Difference]: With dead ends: 34366 [2019-12-18 17:53:18,920 INFO L226 Difference]: Without dead ends: 33694 [2019-12-18 17:53:18,924 INFO L631 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 [2019-12-18 17:53:19,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33694 states. [2019-12-18 17:53:21,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33694 to 33694. [2019-12-18 17:53:21,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33694 states. [2019-12-18 17:53:21,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33694 states to 33694 states and 143088 transitions. [2019-12-18 17:53:21,721 INFO L78 Accepts]: Start accepts. Automaton has 33694 states and 143088 transitions. Word has length 9 [2019-12-18 17:53:21,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:53:21,722 INFO L462 AbstractCegarLoop]: Abstraction has 33694 states and 143088 transitions. [2019-12-18 17:53:21,722 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:53:21,722 INFO L276 IsEmpty]: Start isEmpty. Operand 33694 states and 143088 transitions. [2019-12-18 17:53:21,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 17:53:21,730 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:53:21,731 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:53:21,731 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:53:21,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:53:21,731 INFO L82 PathProgramCache]: Analyzing trace with hash 706074371, now seen corresponding path program 1 times [2019-12-18 17:53:21,732 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:53:21,732 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5914043] [2019-12-18 17:53:21,732 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:53:21,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:53:21,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:53:21,859 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5914043] [2019-12-18 17:53:21,859 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:53:21,860 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 17:53:21,860 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875942329] [2019-12-18 17:53:21,861 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 17:53:21,861 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:53:21,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 17:53:21,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 17:53:21,862 INFO L87 Difference]: Start difference. First operand 33694 states and 143088 transitions. Second operand 4 states. [2019-12-18 17:53:22,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:53:22,823 INFO L93 Difference]: Finished difference Result 52350 states and 214840 transitions. [2019-12-18 17:53:22,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 17:53:22,823 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-18 17:53:22,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:53:23,044 INFO L225 Difference]: With dead ends: 52350 [2019-12-18 17:53:23,045 INFO L226 Difference]: Without dead ends: 52322 [2019-12-18 17:53:23,046 INFO L631 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 [2019-12-18 17:53:23,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52322 states. [2019-12-18 17:53:24,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52322 to 47546. [2019-12-18 17:53:24,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47546 states. [2019-12-18 17:53:25,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47546 states to 47546 states and 197076 transitions. [2019-12-18 17:53:25,033 INFO L78 Accepts]: Start accepts. Automaton has 47546 states and 197076 transitions. Word has length 15 [2019-12-18 17:53:25,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:53:25,033 INFO L462 AbstractCegarLoop]: Abstraction has 47546 states and 197076 transitions. [2019-12-18 17:53:25,034 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 17:53:25,034 INFO L276 IsEmpty]: Start isEmpty. Operand 47546 states and 197076 transitions. [2019-12-18 17:53:25,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 17:53:25,037 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:53:25,037 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:53:25,038 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:53:25,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:53:25,038 INFO L82 PathProgramCache]: Analyzing trace with hash -1899832342, now seen corresponding path program 1 times [2019-12-18 17:53:25,038 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:53:25,039 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220773345] [2019-12-18 17:53:25,039 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:53:25,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:53:25,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:53:25,180 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220773345] [2019-12-18 17:53:25,180 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:53:25,181 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 17:53:25,181 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254751592] [2019-12-18 17:53:25,181 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 17:53:25,182 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:53:25,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 17:53:25,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 17:53:25,182 INFO L87 Difference]: Start difference. First operand 47546 states and 197076 transitions. Second operand 4 states. [2019-12-18 17:53:27,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:53:27,175 INFO L93 Difference]: Finished difference Result 58566 states and 240916 transitions. [2019-12-18 17:53:27,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 17:53:27,175 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-18 17:53:27,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:53:27,354 INFO L225 Difference]: With dead ends: 58566 [2019-12-18 17:53:27,355 INFO L226 Difference]: Without dead ends: 58566 [2019-12-18 17:53:27,355 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 17:53:27,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58566 states. [2019-12-18 17:53:29,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58566 to 52262. [2019-12-18 17:53:29,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52262 states. [2019-12-18 17:53:29,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52262 states to 52262 states and 216300 transitions. [2019-12-18 17:53:29,220 INFO L78 Accepts]: Start accepts. Automaton has 52262 states and 216300 transitions. Word has length 15 [2019-12-18 17:53:29,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:53:29,221 INFO L462 AbstractCegarLoop]: Abstraction has 52262 states and 216300 transitions. [2019-12-18 17:53:29,221 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 17:53:29,221 INFO L276 IsEmpty]: Start isEmpty. Operand 52262 states and 216300 transitions. [2019-12-18 17:53:29,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 17:53:29,234 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:53:29,234 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:53:29,234 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:53:29,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:53:29,235 INFO L82 PathProgramCache]: Analyzing trace with hash -1099673125, now seen corresponding path program 1 times [2019-12-18 17:53:29,235 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:53:29,235 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695884179] [2019-12-18 17:53:29,235 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:53:29,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:53:29,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:53:29,338 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695884179] [2019-12-18 17:53:29,338 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:53:29,338 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 17:53:29,338 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892786373] [2019-12-18 17:53:29,339 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 17:53:29,339 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:53:29,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 17:53:29,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 17:53:29,340 INFO L87 Difference]: Start difference. First operand 52262 states and 216300 transitions. Second operand 5 states. [2019-12-18 17:53:30,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:53:30,061 INFO L93 Difference]: Finished difference Result 69742 states and 283816 transitions. [2019-12-18 17:53:30,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 17:53:30,061 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-12-18 17:53:30,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:53:32,690 INFO L225 Difference]: With dead ends: 69742 [2019-12-18 17:53:32,691 INFO L226 Difference]: Without dead ends: 69714 [2019-12-18 17:53:32,691 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-18 17:53:32,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69714 states. [2019-12-18 17:53:33,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69714 to 52322. [2019-12-18 17:53:33,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52322 states. [2019-12-18 17:53:33,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52322 states to 52322 states and 216080 transitions. [2019-12-18 17:53:33,987 INFO L78 Accepts]: Start accepts. Automaton has 52322 states and 216080 transitions. Word has length 21 [2019-12-18 17:53:33,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:53:33,988 INFO L462 AbstractCegarLoop]: Abstraction has 52322 states and 216080 transitions. [2019-12-18 17:53:33,988 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 17:53:33,988 INFO L276 IsEmpty]: Start isEmpty. Operand 52322 states and 216080 transitions. [2019-12-18 17:53:34,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-18 17:53:34,030 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:53:34,030 INFO L411 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, 1, 1] [2019-12-18 17:53:34,030 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:53:34,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:53:34,030 INFO L82 PathProgramCache]: Analyzing trace with hash 2069453955, now seen corresponding path program 1 times [2019-12-18 17:53:34,031 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:53:34,031 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058979346] [2019-12-18 17:53:34,031 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:53:34,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:53:34,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:53:34,082 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058979346] [2019-12-18 17:53:34,082 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:53:34,082 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 17:53:34,083 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915406330] [2019-12-18 17:53:34,083 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:53:34,083 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:53:34,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:53:34,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:53:34,084 INFO L87 Difference]: Start difference. First operand 52322 states and 216080 transitions. Second operand 3 states. [2019-12-18 17:53:34,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:53:34,945 INFO L93 Difference]: Finished difference Result 66242 states and 270896 transitions. [2019-12-18 17:53:34,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:53:34,946 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-12-18 17:53:34,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:53:35,120 INFO L225 Difference]: With dead ends: 66242 [2019-12-18 17:53:35,120 INFO L226 Difference]: Without dead ends: 66242 [2019-12-18 17:53:35,121 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:53:35,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66242 states. [2019-12-18 17:53:38,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66242 to 57682. [2019-12-18 17:53:38,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57682 states. [2019-12-18 17:53:38,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57682 states to 57682 states and 237656 transitions. [2019-12-18 17:53:38,956 INFO L78 Accepts]: Start accepts. Automaton has 57682 states and 237656 transitions. Word has length 29 [2019-12-18 17:53:38,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:53:38,956 INFO L462 AbstractCegarLoop]: Abstraction has 57682 states and 237656 transitions. [2019-12-18 17:53:38,956 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:53:38,956 INFO L276 IsEmpty]: Start isEmpty. Operand 57682 states and 237656 transitions. [2019-12-18 17:53:38,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-18 17:53:38,991 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:53:38,991 INFO L411 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, 1, 1] [2019-12-18 17:53:38,991 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:53:38,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:53:38,992 INFO L82 PathProgramCache]: Analyzing trace with hash 2069217239, now seen corresponding path program 1 times [2019-12-18 17:53:38,992 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:53:38,992 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702174318] [2019-12-18 17:53:38,992 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:53:39,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:53:39,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:53:39,065 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702174318] [2019-12-18 17:53:39,065 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:53:39,065 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 17:53:39,066 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514141820] [2019-12-18 17:53:39,066 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 17:53:39,066 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:53:39,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 17:53:39,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 17:53:39,067 INFO L87 Difference]: Start difference. First operand 57682 states and 237656 transitions. Second operand 4 states. [2019-12-18 17:53:39,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:53:39,290 INFO L93 Difference]: Finished difference Result 46417 states and 175864 transitions. [2019-12-18 17:53:39,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 17:53:39,290 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2019-12-18 17:53:39,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:53:39,385 INFO L225 Difference]: With dead ends: 46417 [2019-12-18 17:53:39,385 INFO L226 Difference]: Without dead ends: 45309 [2019-12-18 17:53:39,386 INFO L631 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 [2019-12-18 17:53:39,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45309 states. [2019-12-18 17:53:40,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45309 to 45309. [2019-12-18 17:53:40,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45309 states. [2019-12-18 17:53:40,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45309 states to 45309 states and 172388 transitions. [2019-12-18 17:53:40,705 INFO L78 Accepts]: Start accepts. Automaton has 45309 states and 172388 transitions. Word has length 29 [2019-12-18 17:53:40,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:53:40,706 INFO L462 AbstractCegarLoop]: Abstraction has 45309 states and 172388 transitions. [2019-12-18 17:53:40,706 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 17:53:40,706 INFO L276 IsEmpty]: Start isEmpty. Operand 45309 states and 172388 transitions. [2019-12-18 17:53:40,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-18 17:53:40,732 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:53:40,732 INFO L411 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, 1, 1, 1] [2019-12-18 17:53:40,733 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:53:40,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:53:40,733 INFO L82 PathProgramCache]: Analyzing trace with hash -2027793723, now seen corresponding path program 1 times [2019-12-18 17:53:40,733 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:53:40,734 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657431906] [2019-12-18 17:53:40,734 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:53:40,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:53:40,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:53:40,808 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657431906] [2019-12-18 17:53:40,809 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:53:40,809 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 17:53:40,809 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178669987] [2019-12-18 17:53:40,809 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 17:53:40,810 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:53:40,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 17:53:40,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 17:53:40,810 INFO L87 Difference]: Start difference. First operand 45309 states and 172388 transitions. Second operand 5 states. [2019-12-18 17:53:40,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:53:40,913 INFO L93 Difference]: Finished difference Result 19765 states and 62245 transitions. [2019-12-18 17:53:40,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 17:53:40,913 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-12-18 17:53:40,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:53:40,940 INFO L225 Difference]: With dead ends: 19765 [2019-12-18 17:53:40,940 INFO L226 Difference]: Without dead ends: 18889 [2019-12-18 17:53:40,941 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 17:53:41,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18889 states. [2019-12-18 17:53:41,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18889 to 18889. [2019-12-18 17:53:41,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18889 states. [2019-12-18 17:53:41,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18889 states to 18889 states and 59447 transitions. [2019-12-18 17:53:41,225 INFO L78 Accepts]: Start accepts. Automaton has 18889 states and 59447 transitions. Word has length 30 [2019-12-18 17:53:41,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:53:41,226 INFO L462 AbstractCegarLoop]: Abstraction has 18889 states and 59447 transitions. [2019-12-18 17:53:41,226 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 17:53:41,226 INFO L276 IsEmpty]: Start isEmpty. Operand 18889 states and 59447 transitions. [2019-12-18 17:53:41,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-18 17:53:41,237 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:53:41,237 INFO L411 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, 1, 1, 1, 1] [2019-12-18 17:53:41,237 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:53:41,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:53:41,237 INFO L82 PathProgramCache]: Analyzing trace with hash -1945851485, now seen corresponding path program 1 times [2019-12-18 17:53:41,238 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:53:41,238 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990937718] [2019-12-18 17:53:41,238 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:53:41,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:53:41,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:53:41,322 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990937718] [2019-12-18 17:53:41,323 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:53:41,323 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 17:53:41,323 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950728257] [2019-12-18 17:53:41,324 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 17:53:41,324 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:53:41,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 17:53:41,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-18 17:53:41,324 INFO L87 Difference]: Start difference. First operand 18889 states and 59447 transitions. Second operand 6 states. [2019-12-18 17:53:42,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:53:42,196 INFO L93 Difference]: Finished difference Result 3470 states and 8793 transitions. [2019-12-18 17:53:42,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 17:53:42,197 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2019-12-18 17:53:42,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:53:42,202 INFO L225 Difference]: With dead ends: 3470 [2019-12-18 17:53:42,202 INFO L226 Difference]: Without dead ends: 3101 [2019-12-18 17:53:42,203 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-18 17:53:42,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3101 states. [2019-12-18 17:53:42,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3101 to 3101. [2019-12-18 17:53:42,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3101 states. [2019-12-18 17:53:42,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3101 states to 3101 states and 7755 transitions. [2019-12-18 17:53:42,263 INFO L78 Accepts]: Start accepts. Automaton has 3101 states and 7755 transitions. Word has length 31 [2019-12-18 17:53:42,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:53:42,263 INFO L462 AbstractCegarLoop]: Abstraction has 3101 states and 7755 transitions. [2019-12-18 17:53:42,263 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 17:53:42,264 INFO L276 IsEmpty]: Start isEmpty. Operand 3101 states and 7755 transitions. [2019-12-18 17:53:42,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-12-18 17:53:42,269 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:53:42,269 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:53:42,269 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:53:42,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:53:42,270 INFO L82 PathProgramCache]: Analyzing trace with hash -476238483, now seen corresponding path program 1 times [2019-12-18 17:53:42,270 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:53:42,270 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109959237] [2019-12-18 17:53:42,271 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:53:42,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:53:42,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:53:42,438 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109959237] [2019-12-18 17:53:42,438 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:53:42,439 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 17:53:42,439 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532595363] [2019-12-18 17:53:42,439 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 17:53:42,439 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:53:42,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 17:53:42,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-18 17:53:42,440 INFO L87 Difference]: Start difference. First operand 3101 states and 7755 transitions. Second operand 7 states. [2019-12-18 17:53:42,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:53:42,541 INFO L93 Difference]: Finished difference Result 1342 states and 3750 transitions. [2019-12-18 17:53:42,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 17:53:42,542 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 43 [2019-12-18 17:53:42,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:53:42,544 INFO L225 Difference]: With dead ends: 1342 [2019-12-18 17:53:42,545 INFO L226 Difference]: Without dead ends: 1293 [2019-12-18 17:53:42,545 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-12-18 17:53:42,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1293 states. [2019-12-18 17:53:42,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1293 to 1181. [2019-12-18 17:53:42,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1181 states. [2019-12-18 17:53:42,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1181 states to 1181 states and 3334 transitions. [2019-12-18 17:53:42,566 INFO L78 Accepts]: Start accepts. Automaton has 1181 states and 3334 transitions. Word has length 43 [2019-12-18 17:53:42,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:53:42,567 INFO L462 AbstractCegarLoop]: Abstraction has 1181 states and 3334 transitions. [2019-12-18 17:53:42,567 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 17:53:42,567 INFO L276 IsEmpty]: Start isEmpty. Operand 1181 states and 3334 transitions. [2019-12-18 17:53:42,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-18 17:53:42,574 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:53:42,575 INFO L411 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, 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, 1, 1, 1, 1] [2019-12-18 17:53:42,575 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:53:42,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:53:42,575 INFO L82 PathProgramCache]: Analyzing trace with hash -409088440, now seen corresponding path program 1 times [2019-12-18 17:53:42,575 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:53:42,576 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44224700] [2019-12-18 17:53:42,576 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:53:42,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:53:42,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:53:42,733 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44224700] [2019-12-18 17:53:42,733 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:53:42,733 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 17:53:42,734 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396259062] [2019-12-18 17:53:42,734 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 17:53:42,734 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:53:42,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 17:53:42,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 17:53:42,735 INFO L87 Difference]: Start difference. First operand 1181 states and 3334 transitions. Second operand 5 states. [2019-12-18 17:53:42,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:53:42,989 INFO L93 Difference]: Finished difference Result 1666 states and 4696 transitions. [2019-12-18 17:53:42,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 17:53:42,990 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 58 [2019-12-18 17:53:42,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:53:42,993 INFO L225 Difference]: With dead ends: 1666 [2019-12-18 17:53:42,993 INFO L226 Difference]: Without dead ends: 1666 [2019-12-18 17:53:42,993 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 17:53:42,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1666 states. [2019-12-18 17:53:43,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1666 to 1470. [2019-12-18 17:53:43,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1470 states. [2019-12-18 17:53:43,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1470 states to 1470 states and 4144 transitions. [2019-12-18 17:53:43,010 INFO L78 Accepts]: Start accepts. Automaton has 1470 states and 4144 transitions. Word has length 58 [2019-12-18 17:53:43,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:53:43,010 INFO L462 AbstractCegarLoop]: Abstraction has 1470 states and 4144 transitions. [2019-12-18 17:53:43,011 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 17:53:43,011 INFO L276 IsEmpty]: Start isEmpty. Operand 1470 states and 4144 transitions. [2019-12-18 17:53:43,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-18 17:53:43,013 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:53:43,013 INFO L411 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, 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, 1, 1, 1, 1] [2019-12-18 17:53:43,013 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:53:43,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:53:43,014 INFO L82 PathProgramCache]: Analyzing trace with hash -2087231872, now seen corresponding path program 2 times [2019-12-18 17:53:43,014 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:53:43,014 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738774262] [2019-12-18 17:53:43,014 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:53:43,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:53:43,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:53:43,111 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738774262] [2019-12-18 17:53:43,111 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:53:43,111 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 17:53:43,111 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553228586] [2019-12-18 17:53:43,112 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 17:53:43,112 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:53:43,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 17:53:43,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 17:53:43,113 INFO L87 Difference]: Start difference. First operand 1470 states and 4144 transitions. Second operand 6 states. [2019-12-18 17:53:43,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:53:43,405 INFO L93 Difference]: Finished difference Result 1745 states and 4788 transitions. [2019-12-18 17:53:43,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 17:53:43,405 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 58 [2019-12-18 17:53:43,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:53:43,409 INFO L225 Difference]: With dead ends: 1745 [2019-12-18 17:53:43,409 INFO L226 Difference]: Without dead ends: 1745 [2019-12-18 17:53:43,409 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 17:53:43,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1745 states. [2019-12-18 17:53:43,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1745 to 1522. [2019-12-18 17:53:43,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1522 states. [2019-12-18 17:53:43,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1522 states to 1522 states and 4220 transitions. [2019-12-18 17:53:43,427 INFO L78 Accepts]: Start accepts. Automaton has 1522 states and 4220 transitions. Word has length 58 [2019-12-18 17:53:43,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:53:43,428 INFO L462 AbstractCegarLoop]: Abstraction has 1522 states and 4220 transitions. [2019-12-18 17:53:43,428 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 17:53:43,428 INFO L276 IsEmpty]: Start isEmpty. Operand 1522 states and 4220 transitions. [2019-12-18 17:53:43,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-18 17:53:43,429 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:53:43,429 INFO L411 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, 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, 1, 1, 1, 1] [2019-12-18 17:53:43,430 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:53:43,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:53:43,430 INFO L82 PathProgramCache]: Analyzing trace with hash -893148506, now seen corresponding path program 3 times [2019-12-18 17:53:43,430 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:53:43,430 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727944103] [2019-12-18 17:53:43,430 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:53:43,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:53:43,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:53:43,510 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727944103] [2019-12-18 17:53:43,510 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:53:43,511 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 17:53:43,511 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758579537] [2019-12-18 17:53:43,511 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:53:43,511 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:53:43,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:53:43,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:53:43,512 INFO L87 Difference]: Start difference. First operand 1522 states and 4220 transitions. Second operand 3 states. [2019-12-18 17:53:43,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:53:43,528 INFO L93 Difference]: Finished difference Result 1414 states and 3884 transitions. [2019-12-18 17:53:43,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:53:43,528 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-12-18 17:53:43,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:53:43,530 INFO L225 Difference]: With dead ends: 1414 [2019-12-18 17:53:43,531 INFO L226 Difference]: Without dead ends: 1414 [2019-12-18 17:53:43,531 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:53:43,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1414 states. [2019-12-18 17:53:43,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1414 to 1414. [2019-12-18 17:53:43,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1414 states. [2019-12-18 17:53:43,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1414 states to 1414 states and 3884 transitions. [2019-12-18 17:53:43,552 INFO L78 Accepts]: Start accepts. Automaton has 1414 states and 3884 transitions. Word has length 58 [2019-12-18 17:53:43,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:53:43,553 INFO L462 AbstractCegarLoop]: Abstraction has 1414 states and 3884 transitions. [2019-12-18 17:53:43,553 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:53:43,553 INFO L276 IsEmpty]: Start isEmpty. Operand 1414 states and 3884 transitions. [2019-12-18 17:53:43,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-18 17:53:43,555 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:53:43,555 INFO L411 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, 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, 1, 1, 1, 1, 1] [2019-12-18 17:53:43,556 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:53:43,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:53:43,556 INFO L82 PathProgramCache]: Analyzing trace with hash -465324325, now seen corresponding path program 1 times [2019-12-18 17:53:43,556 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:53:43,557 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408029387] [2019-12-18 17:53:43,557 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:53:43,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:53:43,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:53:43,841 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408029387] [2019-12-18 17:53:43,841 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:53:43,842 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 17:53:43,842 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588466319] [2019-12-18 17:53:43,842 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 17:53:43,842 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:53:43,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 17:53:43,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-12-18 17:53:43,843 INFO L87 Difference]: Start difference. First operand 1414 states and 3884 transitions. Second operand 12 states. [2019-12-18 17:53:45,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:53:45,171 INFO L93 Difference]: Finished difference Result 3338 states and 8414 transitions. [2019-12-18 17:53:45,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-18 17:53:45,171 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 59 [2019-12-18 17:53:45,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:53:45,175 INFO L225 Difference]: With dead ends: 3338 [2019-12-18 17:53:45,175 INFO L226 Difference]: Without dead ends: 2093 [2019-12-18 17:53:45,176 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 287 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=246, Invalid=1086, Unknown=0, NotChecked=0, Total=1332 [2019-12-18 17:53:45,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2093 states. [2019-12-18 17:53:45,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2093 to 1274. [2019-12-18 17:53:45,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1274 states. [2019-12-18 17:53:45,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1274 states to 1274 states and 3413 transitions. [2019-12-18 17:53:45,194 INFO L78 Accepts]: Start accepts. Automaton has 1274 states and 3413 transitions. Word has length 59 [2019-12-18 17:53:45,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:53:45,194 INFO L462 AbstractCegarLoop]: Abstraction has 1274 states and 3413 transitions. [2019-12-18 17:53:45,194 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 17:53:45,194 INFO L276 IsEmpty]: Start isEmpty. Operand 1274 states and 3413 transitions. [2019-12-18 17:53:45,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-18 17:53:45,195 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:53:45,196 INFO L411 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, 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, 1, 1, 1, 1, 1] [2019-12-18 17:53:45,196 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:53:45,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:53:45,196 INFO L82 PathProgramCache]: Analyzing trace with hash -1959943393, now seen corresponding path program 2 times [2019-12-18 17:53:45,196 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:53:45,196 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261241261] [2019-12-18 17:53:45,197 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:53:45,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:53:45,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:53:45,443 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261241261] [2019-12-18 17:53:45,443 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:53:45,443 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-18 17:53:45,444 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650823792] [2019-12-18 17:53:45,444 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-18 17:53:45,444 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:53:45,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-18 17:53:45,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2019-12-18 17:53:45,445 INFO L87 Difference]: Start difference. First operand 1274 states and 3413 transitions. Second operand 13 states. [2019-12-18 17:53:46,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:53:46,242 INFO L93 Difference]: Finished difference Result 3088 states and 7469 transitions. [2019-12-18 17:53:46,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 17:53:46,242 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 59 [2019-12-18 17:53:46,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:53:46,244 INFO L225 Difference]: With dead ends: 3088 [2019-12-18 17:53:46,244 INFO L226 Difference]: Without dead ends: 989 [2019-12-18 17:53:46,245 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2019-12-18 17:53:46,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 989 states. [2019-12-18 17:53:46,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 989 to 699. [2019-12-18 17:53:46,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 699 states. [2019-12-18 17:53:46,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 699 states to 699 states and 1510 transitions. [2019-12-18 17:53:46,254 INFO L78 Accepts]: Start accepts. Automaton has 699 states and 1510 transitions. Word has length 59 [2019-12-18 17:53:46,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:53:46,254 INFO L462 AbstractCegarLoop]: Abstraction has 699 states and 1510 transitions. [2019-12-18 17:53:46,255 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-18 17:53:46,255 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 1510 transitions. [2019-12-18 17:53:46,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-18 17:53:46,255 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:53:46,256 INFO L411 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, 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, 1, 1, 1, 1, 1] [2019-12-18 17:53:46,256 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:53:46,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:53:46,256 INFO L82 PathProgramCache]: Analyzing trace with hash -1429809951, now seen corresponding path program 3 times [2019-12-18 17:53:46,256 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:53:46,256 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144893755] [2019-12-18 17:53:46,256 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:53:46,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:53:46,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:53:46,343 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144893755] [2019-12-18 17:53:46,343 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:53:46,344 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 17:53:46,344 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065259662] [2019-12-18 17:53:46,344 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 17:53:46,344 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:53:46,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 17:53:46,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 17:53:46,345 INFO L87 Difference]: Start difference. First operand 699 states and 1510 transitions. Second operand 5 states. [2019-12-18 17:53:46,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:53:46,384 INFO L93 Difference]: Finished difference Result 948 states and 1939 transitions. [2019-12-18 17:53:46,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 17:53:46,384 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 59 [2019-12-18 17:53:46,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:53:46,385 INFO L225 Difference]: With dead ends: 948 [2019-12-18 17:53:46,385 INFO L226 Difference]: Without dead ends: 280 [2019-12-18 17:53:46,385 INFO L631 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 [2019-12-18 17:53:46,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2019-12-18 17:53:46,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 280. [2019-12-18 17:53:46,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2019-12-18 17:53:46,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 478 transitions. [2019-12-18 17:53:46,389 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 478 transitions. Word has length 59 [2019-12-18 17:53:46,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:53:46,390 INFO L462 AbstractCegarLoop]: Abstraction has 280 states and 478 transitions. [2019-12-18 17:53:46,390 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 17:53:46,390 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 478 transitions. [2019-12-18 17:53:46,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-18 17:53:46,391 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:53:46,391 INFO L411 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, 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, 1, 1, 1, 1, 1] [2019-12-18 17:53:46,391 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:53:46,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:53:46,391 INFO L82 PathProgramCache]: Analyzing trace with hash 1315382593, now seen corresponding path program 4 times [2019-12-18 17:53:46,392 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:53:46,392 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112480047] [2019-12-18 17:53:46,392 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:53:46,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:53:46,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:53:46,443 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112480047] [2019-12-18 17:53:46,443 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:53:46,444 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 17:53:46,444 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495249904] [2019-12-18 17:53:46,444 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:53:46,444 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:53:46,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:53:46,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:53:46,445 INFO L87 Difference]: Start difference. First operand 280 states and 478 transitions. Second operand 3 states. [2019-12-18 17:53:46,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:53:46,480 INFO L93 Difference]: Finished difference Result 279 states and 476 transitions. [2019-12-18 17:53:46,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:53:46,481 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-12-18 17:53:46,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:53:46,482 INFO L225 Difference]: With dead ends: 279 [2019-12-18 17:53:46,482 INFO L226 Difference]: Without dead ends: 279 [2019-12-18 17:53:46,482 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:53:46,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2019-12-18 17:53:46,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 215. [2019-12-18 17:53:46,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2019-12-18 17:53:46,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 364 transitions. [2019-12-18 17:53:46,486 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 364 transitions. Word has length 59 [2019-12-18 17:53:46,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:53:46,487 INFO L462 AbstractCegarLoop]: Abstraction has 215 states and 364 transitions. [2019-12-18 17:53:46,487 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:53:46,487 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 364 transitions. [2019-12-18 17:53:46,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-18 17:53:46,488 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:53:46,489 INFO L411 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, 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, 1, 1, 1, 1, 1, 1] [2019-12-18 17:53:46,489 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:53:46,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:53:46,489 INFO L82 PathProgramCache]: Analyzing trace with hash 424334393, now seen corresponding path program 1 times [2019-12-18 17:53:46,489 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:53:46,490 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367577284] [2019-12-18 17:53:46,490 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:53:46,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:53:46,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:53:46,802 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367577284] [2019-12-18 17:53:46,802 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:53:46,802 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-18 17:53:46,802 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49319823] [2019-12-18 17:53:46,803 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-18 17:53:46,803 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:53:46,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-18 17:53:46,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2019-12-18 17:53:46,804 INFO L87 Difference]: Start difference. First operand 215 states and 364 transitions. Second operand 14 states. [2019-12-18 17:53:47,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:53:47,368 INFO L93 Difference]: Finished difference Result 374 states and 624 transitions. [2019-12-18 17:53:47,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-18 17:53:47,368 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 60 [2019-12-18 17:53:47,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:53:47,369 INFO L225 Difference]: With dead ends: 374 [2019-12-18 17:53:47,369 INFO L226 Difference]: Without dead ends: 341 [2019-12-18 17:53:47,370 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=130, Invalid=520, Unknown=0, NotChecked=0, Total=650 [2019-12-18 17:53:47,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2019-12-18 17:53:47,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 323. [2019-12-18 17:53:47,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2019-12-18 17:53:47,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 549 transitions. [2019-12-18 17:53:47,374 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 549 transitions. Word has length 60 [2019-12-18 17:53:47,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:53:47,374 INFO L462 AbstractCegarLoop]: Abstraction has 323 states and 549 transitions. [2019-12-18 17:53:47,374 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-18 17:53:47,374 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 549 transitions. [2019-12-18 17:53:47,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-18 17:53:47,375 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:53:47,375 INFO L411 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, 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, 1, 1, 1, 1, 1, 1] [2019-12-18 17:53:47,375 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:53:47,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:53:47,375 INFO L82 PathProgramCache]: Analyzing trace with hash -1750352957, now seen corresponding path program 2 times [2019-12-18 17:53:47,376 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:53:47,376 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659440847] [2019-12-18 17:53:47,376 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:53:47,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 17:53:47,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 17:53:47,485 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 17:53:47,486 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 17:53:47,490 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [783] [783] ULTIMATE.startENTRY-->L823: Formula: (let ((.cse0 (store |v_#valid_72| 0 0))) (and (= (store |v_#length_32| |v_ULTIMATE.start_main_~#t1477~0.base_22| 4) |v_#length_31|) (= v_~z$w_buff0~0_106 0) (= v_~z$r_buff0_thd2~0_89 0) (= v_~main$tmp_guard0~0_30 0) (= 0 |v_ULTIMATE.start_main_~#t1477~0.offset_17|) (= |v_#NULL.offset_6| 0) (= 0 v_~z$r_buff1_thd1~0_90) (< 0 |v_#StackHeapBarrier_21|) (= v_~a~0_108 0) (= v_~z$w_buff0_used~0_517 0) (= v_~z$r_buff0_thd0~0_321 0) (= 0 v_~__unbuffered_p1_EAX~0_34) (= (store |v_#memory_int_28| |v_ULTIMATE.start_main_~#t1477~0.base_22| (store (select |v_#memory_int_28| |v_ULTIMATE.start_main_~#t1477~0.base_22|) |v_ULTIMATE.start_main_~#t1477~0.offset_17| 0)) |v_#memory_int_27|) (= v_~z$read_delayed_var~0.offset_7 0) (= v_~z$r_buff1_thd0~0_244 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t1477~0.base_22|) 0) (= 0 v_~z$w_buff1~0_99) (= 0 |v_#NULL.base_6|) (= 0 v_~z$r_buff1_thd2~0_90) (= v_~z$read_delayed_var~0.base_7 0) (= 0 v_~z$flush_delayed~0_47) (= v_~z$read_delayed~0_7 0) (= 0 v_~z$r_buff0_thd3~0_147) (= 0 v_~z$r_buff1_thd4~0_142) (= 0 v_~z$r_buff1_thd3~0_154) (= 0 v_~weak$$choice0~0_24) (= v_~__unbuffered_cnt~0_141 0) (< |v_#StackHeapBarrier_21| |v_ULTIMATE.start_main_~#t1477~0.base_22|) (= v_~z$w_buff1_used~0_308 0) (= 0 v_~__unbuffered_p3_EAX~0_99) (= v_~weak$$choice2~0_108 0) (= v_~z$r_buff0_thd1~0_89 0) (= 0 v_~z$r_buff0_thd4~0_241) (= v_~z~0_160 0) (= v_~z$mem_tmp~0_28 0) (= v_~y~0_41 0) (= v_~x~0_54 0) (= |v_#valid_70| (store .cse0 |v_ULTIMATE.start_main_~#t1477~0.base_22| 1)) (= v_~main$tmp_guard1~0_22 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_21|, #valid=|v_#valid_72|, #memory_int=|v_#memory_int_28|, #length=|v_#length_32|} OutVars{ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_33|, ULTIMATE.start_main_~#t1480~0.offset=|v_ULTIMATE.start_main_~#t1480~0.offset_16|, ULTIMATE.start_main_~#t1479~0.base=|v_ULTIMATE.start_main_~#t1479~0.base_20|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_90, ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_55|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_38|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_30|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_19|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_35|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_42|, ~a~0=v_~a~0_108, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_321, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_34, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_241, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_99, #length=|v_#length_31|, ~z$mem_tmp~0=v_~z$mem_tmp~0_28, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_96|, ULTIMATE.start_main_~#t1477~0.base=|v_ULTIMATE.start_main_~#t1477~0.base_22|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_33|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_308, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_30|, ~z$flush_delayed~0=v_~z$flush_delayed~0_47, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_33|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_32|, ~weak$$choice0~0=v_~weak$$choice0~0_24, #StackHeapBarrier=|v_#StackHeapBarrier_21|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_141|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_90, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_9|, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_147, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_141, ~x~0=v_~x~0_54, ULTIMATE.start_main_~#t1477~0.offset=|v_ULTIMATE.start_main_~#t1477~0.offset_17|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_142, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_40|, ~z$read_delayed~0=v_~z$read_delayed~0_7, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_35|, ~z$w_buff1~0=v_~z$w_buff1~0_99, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_22, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_29|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_7, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_105|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_33|, ULTIMATE.start_main_#t~ite23=|v_ULTIMATE.start_main_#t~ite23_39|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_35|, ULTIMATE.start_main_~#t1478~0.base=|v_ULTIMATE.start_main_~#t1478~0.base_23|, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_40|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_244, ULTIMATE.start_main_#t~nondet26=|v_ULTIMATE.start_main_#t~nondet26_41|, ~y~0=v_~y~0_41, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_89, ULTIMATE.start_main_~#t1480~0.base=|v_ULTIMATE.start_main_~#t1480~0.base_20|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_517, ~z$w_buff0~0=v_~z$w_buff0~0_106, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_33|, ULTIMATE.start_main_#t~nondet25=|v_ULTIMATE.start_main_#t~nondet25_41|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_154, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_31|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_91|, ULTIMATE.start_main_~#t1479~0.offset=|v_ULTIMATE.start_main_~#t1479~0.offset_17|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_30, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_30|, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_34|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_27|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_17|, #valid=|v_#valid_70|, #memory_int=|v_#memory_int_27|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_9|, ULTIMATE.start_main_~#t1478~0.offset=|v_ULTIMATE.start_main_~#t1478~0.offset_18|, ULTIMATE.start_main_#t~nondet18=|v_ULTIMATE.start_main_#t~nondet18_20|, ~z~0=v_~z~0_160, ~weak$$choice2~0=v_~weak$$choice2~0_108, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_89} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28, ULTIMATE.start_main_~#t1480~0.offset, ULTIMATE.start_main_~#t1479~0.base, ~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite45, ~a~0, ~z$r_buff0_thd0~0, ~__unbuffered_p1_EAX~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, #length, ~z$mem_tmp~0, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_~#t1477~0.base, ULTIMATE.start_main_#t~ite35, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite37, ~z$flush_delayed~0, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite33, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~z$r_buff1_thd1~0, ULTIMATE.start_main_#t~nondet15, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ULTIMATE.start_main_#t~nondet17, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_~#t1477~0.offset, ~z$r_buff1_thd4~0, ULTIMATE.start_main_#t~ite29, ~z$read_delayed~0, ULTIMATE.start_main_#t~ite46, ~z$w_buff1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite23, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_~#t1478~0.base, ULTIMATE.start_main_#t~ite30, ~z$r_buff1_thd0~0, ULTIMATE.start_main_#t~nondet26, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_~#t1480~0.base, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~nondet25, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_~#t1479~0.offset, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, ULTIMATE.start_main_~#t1478~0.offset, ULTIMATE.start_main_#t~nondet18, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 17:53:47,491 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L823-1-->L825: Formula: (and (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t1478~0.base_13|) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t1478~0.base_13| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t1478~0.base_13|) |v_ULTIMATE.start_main_~#t1478~0.offset_11| 1)) |v_#memory_int_19|) (= (select |v_#valid_47| |v_ULTIMATE.start_main_~#t1478~0.base_13|) 0) (= 0 |v_ULTIMATE.start_main_~#t1478~0.offset_11|) (not (= 0 |v_ULTIMATE.start_main_~#t1478~0.base_13|)) (= (store |v_#valid_47| |v_ULTIMATE.start_main_~#t1478~0.base_13| 1) |v_#valid_46|) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t1478~0.base_13| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_20|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_~#t1478~0.base=|v_ULTIMATE.start_main_~#t1478~0.base_13|, #StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_19|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_5|, ULTIMATE.start_main_~#t1478~0.offset=|v_ULTIMATE.start_main_~#t1478~0.offset_11|, #length=|v_#length_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1478~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet15, ULTIMATE.start_main_~#t1478~0.offset, #length] because there is no mapped edge [2019-12-18 17:53:47,492 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] L825-1-->L827: Formula: (and (= 0 |v_ULTIMATE.start_main_~#t1479~0.offset_10|) (= (store |v_#length_20| |v_ULTIMATE.start_main_~#t1479~0.base_10| 4) |v_#length_19|) (= |v_#valid_40| (store |v_#valid_41| |v_ULTIMATE.start_main_~#t1479~0.base_10| 1)) (= (select |v_#valid_41| |v_ULTIMATE.start_main_~#t1479~0.base_10|) 0) (not (= 0 |v_ULTIMATE.start_main_~#t1479~0.base_10|)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1479~0.base_10|) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1479~0.base_10| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1479~0.base_10|) |v_ULTIMATE.start_main_~#t1479~0.offset_10| 2)) |v_#memory_int_15|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_16|, #length=|v_#length_20|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_~#t1479~0.base=|v_ULTIMATE.start_main_~#t1479~0.base_10|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_5|, ULTIMATE.start_main_~#t1479~0.offset=|v_ULTIMATE.start_main_~#t1479~0.offset_10|, #length=|v_#length_19|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1479~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, ULTIMATE.start_main_~#t1479~0.offset, #length] because there is no mapped edge [2019-12-18 17:53:47,492 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L827-1-->L829: Formula: (and (= |v_#valid_44| (store |v_#valid_45| |v_ULTIMATE.start_main_~#t1480~0.base_11| 1)) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1480~0.base_11|) (= (select |v_#valid_45| |v_ULTIMATE.start_main_~#t1480~0.base_11|) 0) (not (= |v_ULTIMATE.start_main_~#t1480~0.base_11| 0)) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t1480~0.base_11| 4)) (= |v_ULTIMATE.start_main_~#t1480~0.offset_10| 0) (= |v_#memory_int_17| (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1480~0.base_11| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1480~0.base_11|) |v_ULTIMATE.start_main_~#t1480~0.offset_10| 3)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_45|, #memory_int=|v_#memory_int_18|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_~#t1480~0.base=|v_ULTIMATE.start_main_~#t1480~0.base_11|, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_~#t1480~0.offset=|v_ULTIMATE.start_main_~#t1480~0.offset_10|, #valid=|v_#valid_44|, #memory_int=|v_#memory_int_17|, #length=|v_#length_21|, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1480~0.base, ULTIMATE.start_main_~#t1480~0.offset, #valid, #memory_int, #length, ULTIMATE.start_main_#t~nondet17] because there is no mapped edge [2019-12-18 17:53:47,494 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L4-->L800: Formula: (and (not (= P3Thread1of1ForFork3___VERIFIER_assert_~expression_In-1162268363 0)) (= ~a~0_In-1162268363 ~__unbuffered_p3_EAX~0_Out-1162268363) (= ~z$r_buff0_thd1~0_In-1162268363 ~z$r_buff1_thd1~0_Out-1162268363) (= ~z$r_buff0_thd4~0_In-1162268363 ~z$r_buff1_thd4~0_Out-1162268363) (= ~z$r_buff1_thd2~0_Out-1162268363 ~z$r_buff0_thd2~0_In-1162268363) (= ~z$r_buff0_thd0~0_In-1162268363 ~z$r_buff1_thd0~0_Out-1162268363) (= ~z$r_buff1_thd3~0_Out-1162268363 ~z$r_buff0_thd3~0_In-1162268363) (= 1 ~z$r_buff0_thd4~0_Out-1162268363)) InVars {~a~0=~a~0_In-1162268363, P3Thread1of1ForFork3___VERIFIER_assert_~expression=P3Thread1of1ForFork3___VERIFIER_assert_~expression_In-1162268363, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1162268363, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1162268363, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1162268363, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1162268363, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1162268363} OutVars{P3Thread1of1ForFork3___VERIFIER_assert_~expression=P3Thread1of1ForFork3___VERIFIER_assert_~expression_In-1162268363, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_Out-1162268363, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_Out-1162268363, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_Out-1162268363, ~a~0=~a~0_In-1162268363, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1162268363, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_Out-1162268363, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_Out-1162268363, ~__unbuffered_p3_EAX~0=~__unbuffered_p3_EAX~0_Out-1162268363, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out-1162268363, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1162268363, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1162268363, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1162268363} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~__unbuffered_p3_EAX~0, ~z$r_buff0_thd4~0] because there is no mapped edge [2019-12-18 17:53:47,495 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [738] [738] P0ENTRY-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork0_#res.base_9|) (= |v_P0Thread1of1ForFork0_#res.offset_9| 0) (= v_P0Thread1of1ForFork0_~arg.base_19 |v_P0Thread1of1ForFork0_#in~arg.base_19|) (= (+ v_~__unbuffered_cnt~0_81 1) v_~__unbuffered_cnt~0_80) (= v_~x~0_32 1) (= v_~a~0_41 1) (= v_P0Thread1of1ForFork0_~arg.offset_19 |v_P0Thread1of1ForFork0_#in~arg.offset_19|)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_19|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_19|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_81} OutVars{~a~0=v_~a~0_41, P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_19|, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_9|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_19|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_80, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_19, ~x~0=v_~x~0_32, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_19} AuxVars[] AssignedVars[~a~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork0_~arg.base, ~x~0, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-18 17:53:47,495 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] P1ENTRY-->P1EXIT: Formula: (and (= v_~y~0_32 v_~__unbuffered_p1_EAX~0_23) (= |v_P1Thread1of1ForFork1_#res.offset_11| 0) (= v_P1Thread1of1ForFork1_~arg.base_19 |v_P1Thread1of1ForFork1_#in~arg.base_19|) (= 0 |v_P1Thread1of1ForFork1_#res.base_11|) (= v_~x~0_41 2) (= v_~__unbuffered_cnt~0_115 (+ v_~__unbuffered_cnt~0_116 1)) (= |v_P1Thread1of1ForFork1_#in~arg.offset_19| v_P1Thread1of1ForFork1_~arg.offset_19)) InVars {P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_19|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_19|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_116, ~y~0=v_~y~0_32} OutVars{P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_19, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_11|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_23, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_19, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_19|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_19|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_115, ~y~0=v_~y~0_32, ~x~0=v_~x~0_41, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_11|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_p1_EAX~0, P1Thread1of1ForFork1_~arg.base, ~__unbuffered_cnt~0, ~x~0, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-18 17:53:47,497 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L801-->L801-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In1666889174 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd4~0_In1666889174 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P3Thread1of1ForFork3_#t~ite11_Out1666889174|)) (and (or .cse1 .cse0) (= |P3Thread1of1ForFork3_#t~ite11_Out1666889174| ~z$w_buff0_used~0_In1666889174)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1666889174, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1666889174} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1666889174, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1666889174, P3Thread1of1ForFork3_#t~ite11=|P3Thread1of1ForFork3_#t~ite11_Out1666889174|} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite11] because there is no mapped edge [2019-12-18 17:53:47,498 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L770-2-->L770-4: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff1_thd3~0_In186373850 256))) (.cse1 (= (mod ~z$w_buff1_used~0_In186373850 256) 0))) (or (and (= ~z$w_buff1~0_In186373850 |P2Thread1of1ForFork2_#t~ite3_Out186373850|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~z~0_In186373850 |P2Thread1of1ForFork2_#t~ite3_Out186373850|)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In186373850, ~z$w_buff1_used~0=~z$w_buff1_used~0_In186373850, ~z$w_buff1~0=~z$w_buff1~0_In186373850, ~z~0=~z~0_In186373850} OutVars{P2Thread1of1ForFork2_#t~ite3=|P2Thread1of1ForFork2_#t~ite3_Out186373850|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In186373850, ~z$w_buff1_used~0=~z$w_buff1_used~0_In186373850, ~z$w_buff1~0=~z$w_buff1~0_In186373850, ~z~0=~z~0_In186373850} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite3] because there is no mapped edge [2019-12-18 17:53:47,498 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [693] [693] L770-4-->L771: Formula: (= |v_P2Thread1of1ForFork2_#t~ite3_14| v_~z~0_35) InVars {P2Thread1of1ForFork2_#t~ite3=|v_P2Thread1of1ForFork2_#t~ite3_14|} OutVars{P2Thread1of1ForFork2_#t~ite4=|v_P2Thread1of1ForFork2_#t~ite4_13|, P2Thread1of1ForFork2_#t~ite3=|v_P2Thread1of1ForFork2_#t~ite3_13|, ~z~0=v_~z~0_35} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite4, P2Thread1of1ForFork2_#t~ite3, ~z~0] because there is no mapped edge [2019-12-18 17:53:47,499 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L802-->L802-2: Formula: (let ((.cse3 (= 0 (mod ~z$r_buff0_thd4~0_In-157316955 256))) (.cse2 (= (mod ~z$w_buff0_used~0_In-157316955 256) 0)) (.cse0 (= (mod ~z$w_buff1_used~0_In-157316955 256) 0)) (.cse1 (= (mod ~z$r_buff1_thd4~0_In-157316955 256) 0))) (or (and (= ~z$w_buff1_used~0_In-157316955 |P3Thread1of1ForFork3_#t~ite12_Out-157316955|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= |P3Thread1of1ForFork3_#t~ite12_Out-157316955| 0)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-157316955, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-157316955, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-157316955, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-157316955} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-157316955, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-157316955, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-157316955, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-157316955, P3Thread1of1ForFork3_#t~ite12=|P3Thread1of1ForFork3_#t~ite12_Out-157316955|} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite12] because there is no mapped edge [2019-12-18 17:53:47,500 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L803-->L804: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd4~0_In781967366 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In781967366 256)))) (or (and (not .cse0) (= 0 ~z$r_buff0_thd4~0_Out781967366) (not .cse1)) (and (= ~z$r_buff0_thd4~0_Out781967366 ~z$r_buff0_thd4~0_In781967366) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In781967366, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In781967366} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In781967366, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out781967366, P3Thread1of1ForFork3_#t~ite13=|P3Thread1of1ForFork3_#t~ite13_Out781967366|} AuxVars[] AssignedVars[~z$r_buff0_thd4~0, P3Thread1of1ForFork3_#t~ite13] because there is no mapped edge [2019-12-18 17:53:47,500 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L804-->L804-2: Formula: (let ((.cse3 (= 0 (mod ~z$r_buff1_thd4~0_In103848832 256))) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In103848832 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In103848832 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd4~0_In103848832 256)))) (or (and (= |P3Thread1of1ForFork3_#t~ite14_Out103848832| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P3Thread1of1ForFork3_#t~ite14_Out103848832| ~z$r_buff1_thd4~0_In103848832) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In103848832, ~z$w_buff0_used~0=~z$w_buff0_used~0_In103848832, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In103848832, ~z$w_buff1_used~0=~z$w_buff1_used~0_In103848832} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In103848832, ~z$w_buff0_used~0=~z$w_buff0_used~0_In103848832, P3Thread1of1ForFork3_#t~ite14=|P3Thread1of1ForFork3_#t~ite14_Out103848832|, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In103848832, ~z$w_buff1_used~0=~z$w_buff1_used~0_In103848832} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite14] because there is no mapped edge [2019-12-18 17:53:47,500 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L804-2-->P3EXIT: Formula: (and (= v_~__unbuffered_cnt~0_109 (+ v_~__unbuffered_cnt~0_110 1)) (= 0 |v_P3Thread1of1ForFork3_#res.offset_5|) (= 0 |v_P3Thread1of1ForFork3_#res.base_5|) (= |v_P3Thread1of1ForFork3_#t~ite14_46| v_~z$r_buff1_thd4~0_84)) InVars {P3Thread1of1ForFork3_#t~ite14=|v_P3Thread1of1ForFork3_#t~ite14_46|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_110} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_84, P3Thread1of1ForFork3_#t~ite14=|v_P3Thread1of1ForFork3_#t~ite14_45|, P3Thread1of1ForFork3_#res.base=|v_P3Thread1of1ForFork3_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_109, P3Thread1of1ForFork3_#res.offset=|v_P3Thread1of1ForFork3_#res.offset_5|} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, P3Thread1of1ForFork3_#t~ite14, P3Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P3Thread1of1ForFork3_#res.offset] because there is no mapped edge [2019-12-18 17:53:47,500 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [717] [717] L771-->L771-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-1185861685 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-1185861685 256)))) (or (and (not .cse0) (= |P2Thread1of1ForFork2_#t~ite5_Out-1185861685| 0) (not .cse1)) (and (= |P2Thread1of1ForFork2_#t~ite5_Out-1185861685| ~z$w_buff0_used~0_In-1185861685) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1185861685, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1185861685} OutVars{P2Thread1of1ForFork2_#t~ite5=|P2Thread1of1ForFork2_#t~ite5_Out-1185861685|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1185861685, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1185861685} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite5] because there is no mapped edge [2019-12-18 17:53:47,501 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [713] [713] L772-->L772-2: Formula: (let ((.cse3 (= 0 (mod ~z$r_buff0_thd3~0_In-2074780679 256))) (.cse2 (= (mod ~z$w_buff0_used~0_In-2074780679 256) 0)) (.cse1 (= (mod ~z$w_buff1_used~0_In-2074780679 256) 0)) (.cse0 (= (mod ~z$r_buff1_thd3~0_In-2074780679 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$w_buff1_used~0_In-2074780679 |P2Thread1of1ForFork2_#t~ite6_Out-2074780679|)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= 0 |P2Thread1of1ForFork2_#t~ite6_Out-2074780679|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-2074780679, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-2074780679, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2074780679, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-2074780679} OutVars{P2Thread1of1ForFork2_#t~ite6=|P2Thread1of1ForFork2_#t~ite6_Out-2074780679|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2074780679, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-2074780679, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2074780679, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-2074780679} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite6] because there is no mapped edge [2019-12-18 17:53:47,502 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L773-->L773-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In2106994485 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In2106994485 256)))) (or (and (= 0 |P2Thread1of1ForFork2_#t~ite7_Out2106994485|) (not .cse0) (not .cse1)) (and (= |P2Thread1of1ForFork2_#t~ite7_Out2106994485| ~z$r_buff0_thd3~0_In2106994485) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In2106994485, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In2106994485} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In2106994485, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In2106994485, P2Thread1of1ForFork2_#t~ite7=|P2Thread1of1ForFork2_#t~ite7_Out2106994485|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite7] because there is no mapped edge [2019-12-18 17:53:47,503 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L774-->L774-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff1_used~0_In1113486309 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd3~0_In1113486309 256))) (.cse3 (= (mod ~z$w_buff0_used~0_In1113486309 256) 0)) (.cse2 (= (mod ~z$r_buff0_thd3~0_In1113486309 256) 0))) (or (and (or .cse0 .cse1) (= ~z$r_buff1_thd3~0_In1113486309 |P2Thread1of1ForFork2_#t~ite8_Out1113486309|) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= 0 |P2Thread1of1ForFork2_#t~ite8_Out1113486309|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1113486309, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1113486309, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1113486309, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1113486309} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1113486309, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1113486309, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1113486309, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1113486309, P2Thread1of1ForFork2_#t~ite8=|P2Thread1of1ForFork2_#t~ite8_Out1113486309|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-18 17:53:47,503 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L774-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= v_~__unbuffered_cnt~0_125 (+ v_~__unbuffered_cnt~0_126 1)) (= |v_P2Thread1of1ForFork2_#t~ite8_44| v_~z$r_buff1_thd3~0_126) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_126, P2Thread1of1ForFork2_#t~ite8=|v_P2Thread1of1ForFork2_#t~ite8_44|} OutVars{~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_126, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_125, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|, P2Thread1of1ForFork2_#t~ite8=|v_P2Thread1of1ForFork2_#t~ite8_43|} AuxVars[] AssignedVars[~z$r_buff1_thd3~0, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset, P2Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-18 17:53:47,504 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [652] [652] L833-->L835-2: Formula: (and (or (= 0 (mod v_~z$w_buff0_used~0_104 256)) (= (mod v_~z$r_buff0_thd0~0_62 256) 0)) (not (= 0 (mod v_~main$tmp_guard0~0_5 256)))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_62, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_104, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_62, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_104, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-18 17:53:47,504 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L835-2-->L835-4: Formula: (let ((.cse1 (= (mod ~z$w_buff1_used~0_In1745084696 256) 0)) (.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In1745084696 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite19_Out1745084696| ~z~0_In1745084696)) (and (not .cse1) (not .cse0) (= |ULTIMATE.start_main_#t~ite19_Out1745084696| ~z$w_buff1~0_In1745084696)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1745084696, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1745084696, ~z$w_buff1~0=~z$w_buff1~0_In1745084696, ~z~0=~z~0_In1745084696} OutVars{ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out1745084696|, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1745084696, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1745084696, ~z$w_buff1~0=~z$w_buff1~0_In1745084696, ~z~0=~z~0_In1745084696} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite19] because there is no mapped edge [2019-12-18 17:53:47,504 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [671] [671] L835-4-->L836: Formula: (= v_~z~0_32 |v_ULTIMATE.start_main_#t~ite19_7|) InVars {ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_7|} OutVars{ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_6|, ~z~0=v_~z~0_32, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite19, ~z~0, ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-18 17:53:47,505 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L836-->L836-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In1470250372 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In1470250372 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite21_Out1470250372|)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite21_Out1470250372| ~z$w_buff0_used~0_In1470250372)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1470250372, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1470250372} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1470250372, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1470250372, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out1470250372|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-18 17:53:47,506 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [718] [718] L837-->L837-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In-197173046 256))) (.cse0 (= (mod ~z$w_buff1_used~0_In-197173046 256) 0)) (.cse3 (= 0 (mod ~z$r_buff0_thd0~0_In-197173046 256))) (.cse2 (= (mod ~z$w_buff0_used~0_In-197173046 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite22_Out-197173046|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~z$w_buff1_used~0_In-197173046 |ULTIMATE.start_main_#t~ite22_Out-197173046|) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-197173046, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-197173046, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-197173046, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-197173046} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-197173046, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-197173046, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-197173046, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-197173046, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out-197173046|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-18 17:53:47,507 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L838-->L838-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-1235198484 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd0~0_In-1235198484 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite23_Out-1235198484|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~z$r_buff0_thd0~0_In-1235198484 |ULTIMATE.start_main_#t~ite23_Out-1235198484|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1235198484, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1235198484} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1235198484, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1235198484, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out-1235198484|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite23] because there is no mapped edge [2019-12-18 17:53:47,508 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L839-->L839-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In-145777485 256))) (.cse0 (= (mod ~z$w_buff1_used~0_In-145777485 256) 0)) (.cse2 (= (mod ~z$r_buff0_thd0~0_In-145777485 256) 0)) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In-145777485 256)))) (or (and (= |ULTIMATE.start_main_#t~ite24_Out-145777485| ~z$r_buff1_thd0~0_In-145777485) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite24_Out-145777485| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-145777485, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-145777485, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-145777485, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-145777485} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-145777485, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-145777485, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-145777485, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out-145777485|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-145777485} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite24] because there is no mapped edge [2019-12-18 17:53:47,512 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L848-->L848-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In2010842851 256)))) (or (and (= |ULTIMATE.start_main_#t~ite34_Out2010842851| |ULTIMATE.start_main_#t~ite33_Out2010842851|) (let ((.cse0 (= (mod ~z$r_buff0_thd0~0_In2010842851 256) 0))) (or (and .cse0 (= 0 (mod ~z$w_buff1_used~0_In2010842851 256))) (and .cse0 (= (mod ~z$r_buff1_thd0~0_In2010842851 256) 0)) (= (mod ~z$w_buff0_used~0_In2010842851 256) 0))) (= ~z$w_buff1~0_In2010842851 |ULTIMATE.start_main_#t~ite33_Out2010842851|) .cse1) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite33_In2010842851| |ULTIMATE.start_main_#t~ite33_Out2010842851|) (= |ULTIMATE.start_main_#t~ite34_Out2010842851| ~z$w_buff1~0_In2010842851)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2010842851, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2010842851, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In2010842851, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2010842851, ~z$w_buff1~0=~z$w_buff1~0_In2010842851, ~weak$$choice2~0=~weak$$choice2~0_In2010842851, ULTIMATE.start_main_#t~ite33=|ULTIMATE.start_main_#t~ite33_In2010842851|} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2010842851, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2010842851, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In2010842851, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2010842851, ~z$w_buff1~0=~z$w_buff1~0_In2010842851, ~weak$$choice2~0=~weak$$choice2~0_In2010842851, ULTIMATE.start_main_#t~ite33=|ULTIMATE.start_main_#t~ite33_Out2010842851|, ULTIMATE.start_main_#t~ite34=|ULTIMATE.start_main_#t~ite34_Out2010842851|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite33, ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2019-12-18 17:53:47,514 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L850-->L850-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In1329625187 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite40_Out1329625187| |ULTIMATE.start_main_#t~ite39_Out1329625187|) (= ~z$w_buff1_used~0_In1329625187 |ULTIMATE.start_main_#t~ite39_Out1329625187|) (let ((.cse0 (= (mod ~z$r_buff0_thd0~0_In1329625187 256) 0))) (or (and .cse0 (= (mod ~z$w_buff1_used~0_In1329625187 256) 0)) (and (= 0 (mod ~z$r_buff1_thd0~0_In1329625187 256)) .cse0) (= 0 (mod ~z$w_buff0_used~0_In1329625187 256)))) .cse1) (and (= |ULTIMATE.start_main_#t~ite39_In1329625187| |ULTIMATE.start_main_#t~ite39_Out1329625187|) (not .cse1) (= ~z$w_buff1_used~0_In1329625187 |ULTIMATE.start_main_#t~ite40_Out1329625187|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1329625187, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1329625187, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_In1329625187|, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1329625187, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1329625187, ~weak$$choice2~0=~weak$$choice2~0_In1329625187} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1329625187, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out1329625187|, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out1329625187|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1329625187, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1329625187, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1329625187, ~weak$$choice2~0=~weak$$choice2~0_In1329625187} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-18 17:53:47,515 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L851-->L852: Formula: (and (= v_~z$r_buff0_thd0~0_135 v_~z$r_buff0_thd0~0_134) (not (= (mod v_~weak$$choice2~0_41 256) 0))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_135, ~weak$$choice2~0=v_~weak$$choice2~0_41} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_14|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_134, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_9|, ~weak$$choice2~0=v_~weak$$choice2~0_41, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ~z$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-18 17:53:47,516 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L852-->L852-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1106594782 256)))) (or (and (= |ULTIMATE.start_main_#t~ite46_Out1106594782| |ULTIMATE.start_main_#t~ite45_Out1106594782|) .cse0 (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In1106594782 256)))) (or (and (= (mod ~z$w_buff1_used~0_In1106594782 256) 0) .cse1) (= 0 (mod ~z$w_buff0_used~0_In1106594782 256)) (and (= (mod ~z$r_buff1_thd0~0_In1106594782 256) 0) .cse1))) (= ~z$r_buff1_thd0~0_In1106594782 |ULTIMATE.start_main_#t~ite45_Out1106594782|)) (and (= |ULTIMATE.start_main_#t~ite46_Out1106594782| ~z$r_buff1_thd0~0_In1106594782) (not .cse0) (= |ULTIMATE.start_main_#t~ite45_In1106594782| |ULTIMATE.start_main_#t~ite45_Out1106594782|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1106594782, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1106594782, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1106594782, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1106594782, ~weak$$choice2~0=~weak$$choice2~0_In1106594782, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_In1106594782|} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1106594782, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1106594782, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1106594782, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1106594782, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out1106594782|, ~weak$$choice2~0=~weak$$choice2~0_In1106594782, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out1106594782|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46, ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-18 17:53:47,517 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [762] [762] L854-->L4: Formula: (and (= 0 v_~z$flush_delayed~0_38) (not (= (mod v_~z$flush_delayed~0_39 256) 0)) (= v_~z$mem_tmp~0_25 v_~z~0_127) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_7| (mod v_~main$tmp_guard1~0_12 256))) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_25, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_12, ~z$flush_delayed~0=v_~z$flush_delayed~0_39} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_25, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_11, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_24|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_12, ~z$flush_delayed~0=v_~z$flush_delayed~0_38, ~z~0=v_~z~0_127, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite47, ~z$flush_delayed~0, ~z~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 17:53:47,517 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L4-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_10 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_10 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_10, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-18 17:53:47,616 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 05:53:47 BasicIcfg [2019-12-18 17:53:47,616 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 17:53:47,621 INFO L168 Benchmark]: Toolchain (without parser) took 39939.20 ms. Allocated memory was 139.5 MB in the beginning and 1.9 GB in the end (delta: 1.8 GB). Free memory was 101.1 MB in the beginning and 1.7 GB in the end (delta: -1.6 GB). Peak memory consumption was 187.2 MB. Max. memory is 7.1 GB. [2019-12-18 17:53:47,622 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 139.5 MB. Free memory was 121.4 MB in the beginning and 121.2 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-18 17:53:47,623 INFO L168 Benchmark]: CACSL2BoogieTranslator took 764.76 ms. Allocated memory was 139.5 MB in the beginning and 203.9 MB in the end (delta: 64.5 MB). Free memory was 100.7 MB in the beginning and 157.2 MB in the end (delta: -56.5 MB). Peak memory consumption was 24.4 MB. Max. memory is 7.1 GB. [2019-12-18 17:53:47,623 INFO L168 Benchmark]: Boogie Procedure Inliner took 68.96 ms. Allocated memory is still 203.9 MB. Free memory was 157.2 MB in the beginning and 154.0 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 7.1 GB. [2019-12-18 17:53:47,624 INFO L168 Benchmark]: Boogie Preprocessor took 38.73 ms. Allocated memory is still 203.9 MB. Free memory was 154.0 MB in the beginning and 151.4 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-18 17:53:47,627 INFO L168 Benchmark]: RCFGBuilder took 818.94 ms. Allocated memory is still 203.9 MB. Free memory was 151.4 MB in the beginning and 103.0 MB in the end (delta: 48.5 MB). Peak memory consumption was 48.5 MB. Max. memory is 7.1 GB. [2019-12-18 17:53:47,628 INFO L168 Benchmark]: TraceAbstraction took 38242.53 ms. Allocated memory was 203.9 MB in the beginning and 1.9 GB in the end (delta: 1.7 GB). Free memory was 102.3 MB in the beginning and 1.7 GB in the end (delta: -1.6 GB). Peak memory consumption was 123.9 MB. Max. memory is 7.1 GB. [2019-12-18 17:53:47,632 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 139.5 MB. Free memory was 121.4 MB in the beginning and 121.2 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 764.76 ms. Allocated memory was 139.5 MB in the beginning and 203.9 MB in the end (delta: 64.5 MB). Free memory was 100.7 MB in the beginning and 157.2 MB in the end (delta: -56.5 MB). Peak memory consumption was 24.4 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 68.96 ms. Allocated memory is still 203.9 MB. Free memory was 157.2 MB in the beginning and 154.0 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 38.73 ms. Allocated memory is still 203.9 MB. Free memory was 154.0 MB in the beginning and 151.4 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 818.94 ms. Allocated memory is still 203.9 MB. Free memory was 151.4 MB in the beginning and 103.0 MB in the end (delta: 48.5 MB). Peak memory consumption was 48.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 38242.53 ms. Allocated memory was 203.9 MB in the beginning and 1.9 GB in the end (delta: 1.7 GB). Free memory was 102.3 MB in the beginning and 1.7 GB in the end (delta: -1.6 GB). Peak memory consumption was 123.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.3s, 179 ProgramPointsBefore, 91 ProgramPointsAfterwards, 207 TransitionsBefore, 97 TransitionsAfterwards, 12668 CoEnabledTransitionPairs, 7 FixpointIterations, 35 TrivialSequentialCompositions, 50 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 35 ConcurrentYvCompositions, 27 ChoiceCompositions, 4846 VarBasedMoverChecksPositive, 179 VarBasedMoverChecksNegative, 25 SemBasedMoverChecksPositive, 208 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.3s, 0 MoverChecksTotal, 50860 CheckedPairsTotal, 120 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L823] FCALL, FORK 0 pthread_create(&t1477, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=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] [L825] FCALL, FORK 0 pthread_create(&t1478, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=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] [L827] FCALL, FORK 0 pthread_create(&t1479, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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] [L829] FCALL, FORK 0 pthread_create(&t1480, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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] [L784] 4 z$w_buff1 = z$w_buff0 [L785] 4 z$w_buff0 = 2 [L786] 4 z$w_buff1_used = z$w_buff0_used [L787] 4 z$w_buff0_used = (_Bool)1 [L800] 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) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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] [L764] 3 y = 1 [L767] 3 z = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=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] [L800] 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) [L770] 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2, 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] [L801] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L802] 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 [L771] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L772] 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 [L773] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L831] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2, 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=0, z$w_buff1=0, z$w_buff1_used=0] [L836] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L837] 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 [L838] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L839] 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 [L842] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L843] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L844] 0 z$flush_delayed = weak$$choice2 [L845] 0 z$mem_tmp = z VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=1, z=2, z$flush_delayed=1, 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] [L846] 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) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=1, z=2, z$flush_delayed=1, 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] [L846] 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) [L847] 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)) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=1, z=2, z$flush_delayed=1, 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] [L847] 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)) [L848] 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)) [L849] 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)) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=1, z=2, z$flush_delayed=1, 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] [L849] 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)) [L850] 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)) [L852] 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)) [L853] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 0) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=1, z=2, z$flush_delayed=1, 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, 167 locations, 2 error locations. Result: UNSAFE, OverallTime: 37.9s, OverallIterations: 18, TraceHistogramMax: 1, AutomataDifference: 14.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2043 SDtfs, 2783 SDslu, 5426 SDs, 0 SdLazy, 2824 SolverSat, 237 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 172 GetRequests, 23 SyntacticMatches, 10 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 482 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=57682occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 13.5s AutomataMinimizationTime, 17 MinimizatonAttempts, 38754 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 752 NumberOfCodeBlocks, 752 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 675 ConstructedInterpolants, 0 QuantifiedInterpolants, 134912 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...