/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-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix032_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 16:45:39,089 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 16:45:39,092 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 16:45:39,112 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 16:45:39,112 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 16:45:39,115 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 16:45:39,117 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 16:45:39,130 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 16:45:39,132 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 16:45:39,134 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 16:45:39,136 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 16:45:39,137 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 16:45:39,137 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 16:45:39,140 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 16:45:39,143 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 16:45:39,145 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 16:45:39,147 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 16:45:39,150 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 16:45:39,153 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 16:45:39,159 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 16:45:39,160 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 16:45:39,165 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 16:45:39,166 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 16:45:39,167 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 16:45:39,170 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 16:45:39,170 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 16:45:39,170 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 16:45:39,172 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 16:45:39,174 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 16:45:39,175 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 16:45:39,175 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 16:45:39,176 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 16:45:39,176 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 16:45:39,177 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 16:45:39,178 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 16:45:39,178 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 16:45:39,179 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 16:45:39,179 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 16:45:39,179 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 16:45:39,180 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 16:45:39,182 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 16:45:39,183 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-MCR.epf [2019-12-27 16:45:39,203 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 16:45:39,203 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 16:45:39,206 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 16:45:39,206 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 16:45:39,206 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 16:45:39,206 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 16:45:39,207 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 16:45:39,207 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 16:45:39,207 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 16:45:39,207 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 16:45:39,208 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 16:45:39,209 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 16:45:39,209 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 16:45:39,209 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 16:45:39,209 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 16:45:39,210 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 16:45:39,210 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 16:45:39,210 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 16:45:39,210 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 16:45:39,210 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 16:45:39,211 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 16:45:39,211 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 16:45:39,211 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 16:45:39,211 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 16:45:39,211 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 16:45:39,212 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 16:45:39,212 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 16:45:39,212 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 16:45:39,212 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 16:45:39,212 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 16:45:39,214 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 16:45:39,486 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 16:45:39,506 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 16:45:39,510 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 16:45:39,515 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 16:45:39,516 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 16:45:39,517 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix032_pso.oepc.i [2019-12-27 16:45:39,589 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28a591390/5963d60d4a00467291ae179edcb5db1a/FLAG60a254624 [2019-12-27 16:45:40,168 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 16:45:40,169 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix032_pso.oepc.i [2019-12-27 16:45:40,192 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28a591390/5963d60d4a00467291ae179edcb5db1a/FLAG60a254624 [2019-12-27 16:45:40,451 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28a591390/5963d60d4a00467291ae179edcb5db1a [2019-12-27 16:45:40,459 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 16:45:40,461 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 16:45:40,462 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 16:45:40,462 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 16:45:40,466 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 16:45:40,467 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 04:45:40" (1/1) ... [2019-12-27 16:45:40,470 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e1151a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:45:40, skipping insertion in model container [2019-12-27 16:45:40,470 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 04:45:40" (1/1) ... [2019-12-27 16:45:40,478 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 16:45:40,538 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 16:45:41,119 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 16:45:41,132 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 16:45:41,198 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 16:45:41,278 INFO L208 MainTranslator]: Completed translation [2019-12-27 16:45:41,278 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:45:41 WrapperNode [2019-12-27 16:45:41,278 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 16:45:41,279 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 16:45:41,279 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 16:45:41,279 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 16:45:41,288 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:45:41" (1/1) ... [2019-12-27 16:45:41,311 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:45:41" (1/1) ... [2019-12-27 16:45:41,345 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 16:45:41,345 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 16:45:41,345 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 16:45:41,345 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 16:45:41,354 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:45:41" (1/1) ... [2019-12-27 16:45:41,354 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:45:41" (1/1) ... [2019-12-27 16:45:41,359 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:45:41" (1/1) ... [2019-12-27 16:45:41,359 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:45:41" (1/1) ... [2019-12-27 16:45:41,370 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:45:41" (1/1) ... [2019-12-27 16:45:41,375 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:45:41" (1/1) ... [2019-12-27 16:45:41,379 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:45:41" (1/1) ... [2019-12-27 16:45:41,384 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 16:45:41,385 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 16:45:41,385 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 16:45:41,385 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 16:45:41,386 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:45:41" (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-27 16:45:41,478 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 16:45:41,478 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 16:45:41,478 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 16:45:41,479 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 16:45:41,479 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 16:45:41,479 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 16:45:41,479 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 16:45:41,479 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 16:45:41,480 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 16:45:41,480 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 16:45:41,480 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 16:45:41,480 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 16:45:41,480 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 16:45:41,483 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 16:45:42,331 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 16:45:42,332 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 16:45:42,333 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 04:45:42 BoogieIcfgContainer [2019-12-27 16:45:42,333 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 16:45:42,335 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 16:45:42,335 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 16:45:42,338 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 16:45:42,338 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 04:45:40" (1/3) ... [2019-12-27 16:45:42,339 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c0428b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 04:45:42, skipping insertion in model container [2019-12-27 16:45:42,340 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:45:41" (2/3) ... [2019-12-27 16:45:42,340 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c0428b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 04:45:42, skipping insertion in model container [2019-12-27 16:45:42,341 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 04:45:42" (3/3) ... [2019-12-27 16:45:42,343 INFO L109 eAbstractionObserver]: Analyzing ICFG mix032_pso.oepc.i [2019-12-27 16:45:42,352 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 16:45:42,352 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 16:45:42,361 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 16:45:42,362 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 16:45:42,405 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:42,405 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:42,406 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:42,406 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:42,406 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:42,406 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:42,407 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:42,407 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:42,408 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:42,408 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:42,408 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:42,408 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:42,427 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:42,427 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:42,427 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:42,428 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:42,428 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:42,428 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:42,428 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:42,428 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:42,429 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:42,429 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:42,429 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:42,429 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:42,430 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:42,430 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:42,430 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:42,430 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:42,431 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:42,431 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:42,431 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:42,431 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:42,432 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:42,432 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:42,432 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:42,432 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:42,433 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:42,433 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:42,433 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:42,433 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:42,434 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:42,434 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:42,434 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:42,434 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:42,435 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:42,435 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:42,435 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:42,435 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:42,435 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:42,436 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:42,436 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:42,436 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:42,436 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:42,437 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:42,437 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:42,437 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:42,437 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:42,437 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:42,438 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:42,438 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:42,438 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:42,438 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:42,439 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:42,439 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:42,440 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:42,440 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:42,440 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:42,440 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:42,440 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:42,441 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:42,441 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:42,441 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:42,441 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:42,442 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:42,442 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:42,442 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:42,442 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:42,443 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:42,443 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:42,443 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:42,443 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:42,443 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:42,444 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:42,444 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:42,444 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:42,444 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:42,445 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:42,445 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:42,445 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:42,445 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:42,445 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:42,446 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:42,446 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:42,446 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:42,446 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:42,446 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:42,447 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:42,447 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:42,447 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:42,447 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:42,447 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:42,448 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:42,448 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:42,448 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:42,448 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:42,448 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:42,449 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:42,449 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:42,449 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:42,449 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:42,450 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:42,450 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:42,450 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:42,450 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:42,450 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:42,451 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:42,451 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:42,451 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:42,451 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:42,451 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:42,452 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:42,452 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:42,452 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:42,452 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:42,453 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:42,453 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:42,453 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:42,453 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:42,453 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:42,454 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:42,456 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:42,457 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:42,457 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:42,457 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:42,457 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:42,457 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:42,458 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:42,458 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:42,458 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:42,458 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:42,458 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:42,459 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:42,459 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:42,459 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:42,459 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:42,459 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:42,460 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:42,460 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:42,460 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:42,460 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:42,460 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:42,461 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:42,461 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:42,461 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:42,461 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:42,461 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:42,462 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:42,462 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:42,462 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:42,462 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:42,462 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:42,463 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:42,463 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:42,463 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:42,463 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:42,464 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:42,464 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:42,464 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:42,464 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:42,464 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:42,465 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:42,465 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:42,465 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:42,465 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:42,465 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:42,466 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:42,466 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:42,466 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:42,466 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:42,466 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:42,467 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:42,467 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:42,470 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:42,471 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:42,471 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:42,471 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:42,471 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:42,471 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:42,472 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:42,472 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:42,472 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:42,472 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:42,475 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:42,475 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:42,475 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:42,476 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:42,476 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:42,476 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:42,476 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:42,476 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:42,477 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:42,477 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:42,477 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:42,477 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:42,478 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:42,478 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:42,478 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:42,478 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:42,478 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:42,479 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:42,479 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:42,479 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:42,479 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:42,479 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:42,480 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:42,480 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:42,480 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:42,480 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:42,480 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:42,481 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:42,481 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:42,481 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:42,481 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:42,481 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:42,482 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:42,484 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:42,485 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:42,485 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:42,485 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:42,485 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:42,485 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:42,486 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:42,486 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:42,486 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:42,486 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:42,486 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:42,487 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:42,502 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 16:45:42,522 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 16:45:42,523 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 16:45:42,523 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 16:45:42,523 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 16:45:42,523 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 16:45:42,523 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 16:45:42,524 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 16:45:42,524 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 16:45:42,547 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 180 places, 217 transitions [2019-12-27 16:45:42,549 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 180 places, 217 transitions [2019-12-27 16:45:42,692 INFO L132 PetriNetUnfolder]: 47/214 cut-off events. [2019-12-27 16:45:42,693 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 16:45:42,708 INFO L76 FinitePrefix]: Finished finitePrefix Result has 224 conditions, 214 events. 47/214 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 436 event pairs. 0/165 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 16:45:42,731 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 180 places, 217 transitions [2019-12-27 16:45:42,815 INFO L132 PetriNetUnfolder]: 47/214 cut-off events. [2019-12-27 16:45:42,815 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 16:45:42,828 INFO L76 FinitePrefix]: Finished finitePrefix Result has 224 conditions, 214 events. 47/214 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 436 event pairs. 0/165 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 16:45:42,854 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-27 16:45:42,855 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 16:45:48,564 WARN L192 SmtUtils]: Spent 303.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 97 [2019-12-27 16:45:48,704 WARN L192 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2019-12-27 16:45:48,747 INFO L206 etLargeBlockEncoding]: Checked pairs total: 83556 [2019-12-27 16:45:48,748 INFO L214 etLargeBlockEncoding]: Total number of compositions: 115 [2019-12-27 16:45:48,751 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 96 places, 105 transitions [2019-12-27 16:46:11,437 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 129602 states. [2019-12-27 16:46:11,439 INFO L276 IsEmpty]: Start isEmpty. Operand 129602 states. [2019-12-27 16:46:11,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 16:46:11,445 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:46:11,446 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 16:46:11,447 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:46:11,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:46:11,453 INFO L82 PathProgramCache]: Analyzing trace with hash 923865, now seen corresponding path program 1 times [2019-12-27 16:46:11,462 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:46:11,462 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373611451] [2019-12-27 16:46:11,462 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:46:11,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:46:11,748 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-27 16:46:11,749 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373611451] [2019-12-27 16:46:11,750 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:46:11,750 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 16:46:11,751 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1931897432] [2019-12-27 16:46:11,754 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:46:11,758 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:46:11,771 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 4 states and 3 transitions. [2019-12-27 16:46:11,772 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:46:11,776 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:46:11,777 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:46:11,777 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:46:11,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:46:11,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:46:11,795 INFO L87 Difference]: Start difference. First operand 129602 states. Second operand 3 states. [2019-12-27 16:46:13,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:46:13,001 INFO L93 Difference]: Finished difference Result 128376 states and 546782 transitions. [2019-12-27 16:46:13,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:46:13,003 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 16:46:13,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:46:17,059 INFO L225 Difference]: With dead ends: 128376 [2019-12-27 16:46:17,060 INFO L226 Difference]: Without dead ends: 120914 [2019-12-27 16:46:17,061 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-27 16:46:22,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120914 states. [2019-12-27 16:46:25,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120914 to 120914. [2019-12-27 16:46:25,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120914 states. [2019-12-27 16:46:30,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120914 states to 120914 states and 514358 transitions. [2019-12-27 16:46:30,623 INFO L78 Accepts]: Start accepts. Automaton has 120914 states and 514358 transitions. Word has length 3 [2019-12-27 16:46:30,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:46:30,623 INFO L462 AbstractCegarLoop]: Abstraction has 120914 states and 514358 transitions. [2019-12-27 16:46:30,623 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:46:30,623 INFO L276 IsEmpty]: Start isEmpty. Operand 120914 states and 514358 transitions. [2019-12-27 16:46:30,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 16:46:30,628 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:46:30,629 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:46:30,629 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:46:30,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:46:30,629 INFO L82 PathProgramCache]: Analyzing trace with hash 2102120012, now seen corresponding path program 1 times [2019-12-27 16:46:30,630 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:46:30,630 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437740250] [2019-12-27 16:46:30,630 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:46:30,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:46:30,714 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-27 16:46:30,714 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437740250] [2019-12-27 16:46:30,714 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:46:30,715 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:46:30,715 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1329013559] [2019-12-27 16:46:30,716 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:46:30,718 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:46:30,724 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 11 transitions. [2019-12-27 16:46:30,724 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:46:30,724 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:46:30,725 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 16:46:30,726 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:46:30,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 16:46:30,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 16:46:30,726 INFO L87 Difference]: Start difference. First operand 120914 states and 514358 transitions. Second operand 4 states. [2019-12-27 16:46:31,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:46:31,993 INFO L93 Difference]: Finished difference Result 187704 states and 768206 transitions. [2019-12-27 16:46:31,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 16:46:31,993 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 16:46:31,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:46:38,065 INFO L225 Difference]: With dead ends: 187704 [2019-12-27 16:46:38,066 INFO L226 Difference]: Without dead ends: 187655 [2019-12-27 16:46:38,066 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-27 16:46:44,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187655 states. [2019-12-27 16:46:47,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187655 to 171775. [2019-12-27 16:46:47,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171775 states. [2019-12-27 16:46:54,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171775 states to 171775 states and 711726 transitions. [2019-12-27 16:46:54,941 INFO L78 Accepts]: Start accepts. Automaton has 171775 states and 711726 transitions. Word has length 11 [2019-12-27 16:46:54,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:46:54,941 INFO L462 AbstractCegarLoop]: Abstraction has 171775 states and 711726 transitions. [2019-12-27 16:46:54,941 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 16:46:54,942 INFO L276 IsEmpty]: Start isEmpty. Operand 171775 states and 711726 transitions. [2019-12-27 16:46:54,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 16:46:54,949 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:46:54,949 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:46:54,950 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:46:54,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:46:54,950 INFO L82 PathProgramCache]: Analyzing trace with hash -1617299066, now seen corresponding path program 1 times [2019-12-27 16:46:54,951 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:46:54,951 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792057314] [2019-12-27 16:46:54,951 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:46:54,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:46:55,015 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-27 16:46:55,015 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792057314] [2019-12-27 16:46:55,015 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:46:55,016 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:46:55,016 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1076338440] [2019-12-27 16:46:55,016 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:46:55,017 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:46:55,019 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 16:46:55,019 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:46:55,020 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:46:55,020 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:46:55,020 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:46:55,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:46:55,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:46:55,021 INFO L87 Difference]: Start difference. First operand 171775 states and 711726 transitions. Second operand 3 states. [2019-12-27 16:46:55,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:46:55,222 INFO L93 Difference]: Finished difference Result 36261 states and 117727 transitions. [2019-12-27 16:46:55,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:46:55,223 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 16:46:55,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:46:55,281 INFO L225 Difference]: With dead ends: 36261 [2019-12-27 16:46:55,281 INFO L226 Difference]: Without dead ends: 36261 [2019-12-27 16:46:55,282 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:46:55,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36261 states. [2019-12-27 16:46:55,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36261 to 36261. [2019-12-27 16:46:55,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36261 states. [2019-12-27 16:46:55,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36261 states to 36261 states and 117727 transitions. [2019-12-27 16:46:55,939 INFO L78 Accepts]: Start accepts. Automaton has 36261 states and 117727 transitions. Word has length 13 [2019-12-27 16:46:55,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:46:55,940 INFO L462 AbstractCegarLoop]: Abstraction has 36261 states and 117727 transitions. [2019-12-27 16:46:55,940 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:46:55,940 INFO L276 IsEmpty]: Start isEmpty. Operand 36261 states and 117727 transitions. [2019-12-27 16:46:55,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 16:46:55,943 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:46:55,943 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:46:55,943 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:46:55,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:46:55,943 INFO L82 PathProgramCache]: Analyzing trace with hash 947448332, now seen corresponding path program 1 times [2019-12-27 16:46:55,944 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:46:55,944 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243785775] [2019-12-27 16:46:55,944 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:46:55,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:46:56,068 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-27 16:46:56,069 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243785775] [2019-12-27 16:46:56,069 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:46:56,069 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:46:56,069 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [507270682] [2019-12-27 16:46:56,069 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:46:56,072 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:46:56,074 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 17 states and 16 transitions. [2019-12-27 16:46:56,074 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:46:56,074 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:46:56,075 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 16:46:56,075 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:46:56,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 16:46:56,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:46:56,075 INFO L87 Difference]: Start difference. First operand 36261 states and 117727 transitions. Second operand 5 states. [2019-12-27 16:46:56,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:46:56,634 INFO L93 Difference]: Finished difference Result 50300 states and 161544 transitions. [2019-12-27 16:46:56,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 16:46:56,635 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-27 16:46:56,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:46:56,728 INFO L225 Difference]: With dead ends: 50300 [2019-12-27 16:46:56,728 INFO L226 Difference]: Without dead ends: 50300 [2019-12-27 16:46:56,729 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-27 16:46:58,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50300 states. [2019-12-27 16:46:58,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50300 to 43029. [2019-12-27 16:46:58,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43029 states. [2019-12-27 16:46:58,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43029 states to 43029 states and 139308 transitions. [2019-12-27 16:46:58,738 INFO L78 Accepts]: Start accepts. Automaton has 43029 states and 139308 transitions. Word has length 16 [2019-12-27 16:46:58,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:46:58,739 INFO L462 AbstractCegarLoop]: Abstraction has 43029 states and 139308 transitions. [2019-12-27 16:46:58,739 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 16:46:58,739 INFO L276 IsEmpty]: Start isEmpty. Operand 43029 states and 139308 transitions. [2019-12-27 16:46:58,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 16:46:58,748 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:46:58,749 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] [2019-12-27 16:46:58,749 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:46:58,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:46:58,749 INFO L82 PathProgramCache]: Analyzing trace with hash -282717849, now seen corresponding path program 1 times [2019-12-27 16:46:58,750 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:46:58,750 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887656266] [2019-12-27 16:46:58,750 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:46:58,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:46:58,875 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-27 16:46:58,876 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887656266] [2019-12-27 16:46:58,876 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:46:58,876 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 16:46:58,876 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1171134818] [2019-12-27 16:46:58,877 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:46:58,880 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:46:58,886 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 37 states and 50 transitions. [2019-12-27 16:46:58,886 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:46:58,925 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 16:46:58,925 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 16:46:58,926 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:46:58,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 16:46:58,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-27 16:46:58,926 INFO L87 Difference]: Start difference. First operand 43029 states and 139308 transitions. Second operand 7 states. [2019-12-27 16:46:59,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:46:59,874 INFO L93 Difference]: Finished difference Result 64122 states and 202692 transitions. [2019-12-27 16:46:59,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 16:46:59,874 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2019-12-27 16:46:59,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:46:59,984 INFO L225 Difference]: With dead ends: 64122 [2019-12-27 16:46:59,984 INFO L226 Difference]: Without dead ends: 64115 [2019-12-27 16:46:59,984 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2019-12-27 16:47:00,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64115 states. [2019-12-27 16:47:01,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64115 to 42953. [2019-12-27 16:47:01,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42953 states. [2019-12-27 16:47:01,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42953 states to 42953 states and 138310 transitions. [2019-12-27 16:47:01,706 INFO L78 Accepts]: Start accepts. Automaton has 42953 states and 138310 transitions. Word has length 22 [2019-12-27 16:47:01,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:47:01,706 INFO L462 AbstractCegarLoop]: Abstraction has 42953 states and 138310 transitions. [2019-12-27 16:47:01,706 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 16:47:01,706 INFO L276 IsEmpty]: Start isEmpty. Operand 42953 states and 138310 transitions. [2019-12-27 16:47:01,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 16:47:01,721 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:47:01,721 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] [2019-12-27 16:47:01,721 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:47:01,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:47:01,721 INFO L82 PathProgramCache]: Analyzing trace with hash -71664384, now seen corresponding path program 1 times [2019-12-27 16:47:01,722 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:47:01,722 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588385380] [2019-12-27 16:47:01,722 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:47:01,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:47:01,785 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-27 16:47:01,785 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588385380] [2019-12-27 16:47:01,785 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:47:01,786 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:47:01,786 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1218347264] [2019-12-27 16:47:01,786 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:47:01,792 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:47:01,800 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 50 states and 73 transitions. [2019-12-27 16:47:01,801 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:47:01,816 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 16:47:01,816 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 16:47:01,816 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:47:01,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 16:47:01,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:47:01,817 INFO L87 Difference]: Start difference. First operand 42953 states and 138310 transitions. Second operand 5 states. [2019-12-27 16:47:01,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:47:01,916 INFO L93 Difference]: Finished difference Result 17024 states and 51836 transitions. [2019-12-27 16:47:01,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 16:47:01,916 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-27 16:47:01,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:47:01,950 INFO L225 Difference]: With dead ends: 17024 [2019-12-27 16:47:01,951 INFO L226 Difference]: Without dead ends: 17024 [2019-12-27 16:47:01,951 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:47:02,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17024 states. [2019-12-27 16:47:02,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17024 to 16731. [2019-12-27 16:47:02,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16731 states. [2019-12-27 16:47:02,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16731 states to 16731 states and 51000 transitions. [2019-12-27 16:47:02,235 INFO L78 Accepts]: Start accepts. Automaton has 16731 states and 51000 transitions. Word has length 25 [2019-12-27 16:47:02,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:47:02,235 INFO L462 AbstractCegarLoop]: Abstraction has 16731 states and 51000 transitions. [2019-12-27 16:47:02,235 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 16:47:02,235 INFO L276 IsEmpty]: Start isEmpty. Operand 16731 states and 51000 transitions. [2019-12-27 16:47:02,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 16:47:02,247 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:47:02,247 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] [2019-12-27 16:47:02,247 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:47:02,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:47:02,247 INFO L82 PathProgramCache]: Analyzing trace with hash -1418175430, now seen corresponding path program 1 times [2019-12-27 16:47:02,248 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:47:02,248 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102139094] [2019-12-27 16:47:02,248 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:47:02,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:47:02,300 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-27 16:47:02,300 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102139094] [2019-12-27 16:47:02,300 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:47:02,301 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:47:02,301 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1316540532] [2019-12-27 16:47:02,301 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:47:02,305 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:47:02,311 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 28 states and 27 transitions. [2019-12-27 16:47:02,311 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:47:02,311 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:47:02,312 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:47:02,312 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:47:02,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:47:02,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:47:02,312 INFO L87 Difference]: Start difference. First operand 16731 states and 51000 transitions. Second operand 3 states. [2019-12-27 16:47:02,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:47:02,414 INFO L93 Difference]: Finished difference Result 24375 states and 72822 transitions. [2019-12-27 16:47:02,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:47:02,415 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-12-27 16:47:02,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:47:02,458 INFO L225 Difference]: With dead ends: 24375 [2019-12-27 16:47:02,458 INFO L226 Difference]: Without dead ends: 24375 [2019-12-27 16:47:02,459 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-27 16:47:02,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24375 states. [2019-12-27 16:47:02,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24375 to 18589. [2019-12-27 16:47:02,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18589 states. [2019-12-27 16:47:02,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18589 states to 18589 states and 56096 transitions. [2019-12-27 16:47:02,793 INFO L78 Accepts]: Start accepts. Automaton has 18589 states and 56096 transitions. Word has length 27 [2019-12-27 16:47:02,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:47:02,793 INFO L462 AbstractCegarLoop]: Abstraction has 18589 states and 56096 transitions. [2019-12-27 16:47:02,794 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:47:02,794 INFO L276 IsEmpty]: Start isEmpty. Operand 18589 states and 56096 transitions. [2019-12-27 16:47:02,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 16:47:02,806 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:47:02,807 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] [2019-12-27 16:47:02,807 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:47:02,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:47:02,807 INFO L82 PathProgramCache]: Analyzing trace with hash 1834697800, now seen corresponding path program 1 times [2019-12-27 16:47:02,807 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:47:02,808 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464263622] [2019-12-27 16:47:02,808 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:47:02,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:47:02,908 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-27 16:47:02,908 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464263622] [2019-12-27 16:47:02,908 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:47:02,909 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 16:47:02,910 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1345702602] [2019-12-27 16:47:02,910 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:47:02,915 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:47:02,922 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 28 states and 27 transitions. [2019-12-27 16:47:02,922 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:47:02,922 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:47:02,922 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 16:47:02,923 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:47:02,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 16:47:02,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 16:47:02,923 INFO L87 Difference]: Start difference. First operand 18589 states and 56096 transitions. Second operand 6 states. [2019-12-27 16:47:03,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:47:03,967 INFO L93 Difference]: Finished difference Result 26038 states and 76681 transitions. [2019-12-27 16:47:03,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 16:47:03,968 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-27 16:47:03,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:47:04,002 INFO L225 Difference]: With dead ends: 26038 [2019-12-27 16:47:04,002 INFO L226 Difference]: Without dead ends: 26038 [2019-12-27 16:47:04,003 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-27 16:47:04,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26038 states. [2019-12-27 16:47:04,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26038 to 21331. [2019-12-27 16:47:04,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21331 states. [2019-12-27 16:47:04,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21331 states to 21331 states and 64000 transitions. [2019-12-27 16:47:04,322 INFO L78 Accepts]: Start accepts. Automaton has 21331 states and 64000 transitions. Word has length 27 [2019-12-27 16:47:04,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:47:04,323 INFO L462 AbstractCegarLoop]: Abstraction has 21331 states and 64000 transitions. [2019-12-27 16:47:04,323 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 16:47:04,323 INFO L276 IsEmpty]: Start isEmpty. Operand 21331 states and 64000 transitions. [2019-12-27 16:47:04,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 16:47:04,344 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:47:04,344 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] [2019-12-27 16:47:04,344 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:47:04,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:47:04,345 INFO L82 PathProgramCache]: Analyzing trace with hash -2065332723, now seen corresponding path program 1 times [2019-12-27 16:47:04,345 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:47:04,345 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50984333] [2019-12-27 16:47:04,345 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:47:04,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:47:04,463 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-27 16:47:04,464 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50984333] [2019-12-27 16:47:04,464 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:47:04,464 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 16:47:04,464 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1100665223] [2019-12-27 16:47:04,464 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:47:04,469 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:47:04,480 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 48 states and 61 transitions. [2019-12-27 16:47:04,481 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:47:04,502 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 16:47:04,503 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 16:47:04,503 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:47:04,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 16:47:04,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-27 16:47:04,503 INFO L87 Difference]: Start difference. First operand 21331 states and 64000 transitions. Second operand 8 states. [2019-12-27 16:47:05,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:47:05,792 INFO L93 Difference]: Finished difference Result 28794 states and 84449 transitions. [2019-12-27 16:47:05,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 16:47:05,792 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 33 [2019-12-27 16:47:05,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:47:05,833 INFO L225 Difference]: With dead ends: 28794 [2019-12-27 16:47:05,833 INFO L226 Difference]: Without dead ends: 28794 [2019-12-27 16:47:05,834 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=101, Invalid=279, Unknown=0, NotChecked=0, Total=380 [2019-12-27 16:47:05,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28794 states. [2019-12-27 16:47:06,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28794 to 19492. [2019-12-27 16:47:06,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19492 states. [2019-12-27 16:47:06,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19492 states to 19492 states and 58703 transitions. [2019-12-27 16:47:06,198 INFO L78 Accepts]: Start accepts. Automaton has 19492 states and 58703 transitions. Word has length 33 [2019-12-27 16:47:06,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:47:06,199 INFO L462 AbstractCegarLoop]: Abstraction has 19492 states and 58703 transitions. [2019-12-27 16:47:06,199 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 16:47:06,199 INFO L276 IsEmpty]: Start isEmpty. Operand 19492 states and 58703 transitions. [2019-12-27 16:47:06,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 16:47:06,225 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:47:06,225 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] [2019-12-27 16:47:06,226 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:47:06,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:47:06,226 INFO L82 PathProgramCache]: Analyzing trace with hash 603828080, now seen corresponding path program 1 times [2019-12-27 16:47:06,227 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:47:06,227 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196964152] [2019-12-27 16:47:06,227 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:47:06,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:47:06,311 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-27 16:47:06,311 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196964152] [2019-12-27 16:47:06,311 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:47:06,312 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:47:06,312 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2037888278] [2019-12-27 16:47:06,312 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:47:06,321 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:47:06,394 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 170 states and 355 transitions. [2019-12-27 16:47:06,394 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:47:06,437 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 16:47:06,437 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 16:47:06,437 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:47:06,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 16:47:06,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 16:47:06,438 INFO L87 Difference]: Start difference. First operand 19492 states and 58703 transitions. Second operand 6 states. [2019-12-27 16:47:06,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:47:06,664 INFO L93 Difference]: Finished difference Result 33180 states and 100186 transitions. [2019-12-27 16:47:06,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 16:47:06,664 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 39 [2019-12-27 16:47:06,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:47:06,706 INFO L225 Difference]: With dead ends: 33180 [2019-12-27 16:47:06,707 INFO L226 Difference]: Without dead ends: 16657 [2019-12-27 16:47:06,707 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-27 16:47:06,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16657 states. [2019-12-27 16:47:07,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16657 to 16583. [2019-12-27 16:47:07,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16583 states. [2019-12-27 16:47:07,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16583 states to 16583 states and 49025 transitions. [2019-12-27 16:47:07,662 INFO L78 Accepts]: Start accepts. Automaton has 16583 states and 49025 transitions. Word has length 39 [2019-12-27 16:47:07,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:47:07,662 INFO L462 AbstractCegarLoop]: Abstraction has 16583 states and 49025 transitions. [2019-12-27 16:47:07,662 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 16:47:07,662 INFO L276 IsEmpty]: Start isEmpty. Operand 16583 states and 49025 transitions. [2019-12-27 16:47:07,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 16:47:07,681 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:47:07,682 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] [2019-12-27 16:47:07,682 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:47:07,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:47:07,682 INFO L82 PathProgramCache]: Analyzing trace with hash 1247651138, now seen corresponding path program 2 times [2019-12-27 16:47:07,683 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:47:07,683 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217354856] [2019-12-27 16:47:07,683 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:47:07,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:47:07,737 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-27 16:47:07,737 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217354856] [2019-12-27 16:47:07,738 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:47:07,738 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 16:47:07,738 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1258933814] [2019-12-27 16:47:07,738 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:47:07,746 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:47:07,802 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 170 states and 351 transitions. [2019-12-27 16:47:07,802 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:47:07,803 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:47:07,803 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:47:07,803 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:47:07,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:47:07,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:47:07,804 INFO L87 Difference]: Start difference. First operand 16583 states and 49025 transitions. Second operand 3 states. [2019-12-27 16:47:07,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:47:07,874 INFO L93 Difference]: Finished difference Result 16582 states and 49023 transitions. [2019-12-27 16:47:07,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:47:07,874 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-27 16:47:07,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:47:07,908 INFO L225 Difference]: With dead ends: 16582 [2019-12-27 16:47:07,909 INFO L226 Difference]: Without dead ends: 16582 [2019-12-27 16:47:07,909 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-27 16:47:08,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16582 states. [2019-12-27 16:47:08,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16582 to 16582. [2019-12-27 16:47:08,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16582 states. [2019-12-27 16:47:08,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16582 states to 16582 states and 49023 transitions. [2019-12-27 16:47:08,227 INFO L78 Accepts]: Start accepts. Automaton has 16582 states and 49023 transitions. Word has length 39 [2019-12-27 16:47:08,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:47:08,227 INFO L462 AbstractCegarLoop]: Abstraction has 16582 states and 49023 transitions. [2019-12-27 16:47:08,227 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:47:08,228 INFO L276 IsEmpty]: Start isEmpty. Operand 16582 states and 49023 transitions. [2019-12-27 16:47:08,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 16:47:08,242 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:47:08,243 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] [2019-12-27 16:47:08,243 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:47:08,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:47:08,243 INFO L82 PathProgramCache]: Analyzing trace with hash -2020108147, now seen corresponding path program 1 times [2019-12-27 16:47:08,244 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:47:08,244 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466236197] [2019-12-27 16:47:08,244 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:47:08,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:47:08,305 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-27 16:47:08,305 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466236197] [2019-12-27 16:47:08,305 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:47:08,306 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:47:08,306 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1812026573] [2019-12-27 16:47:08,306 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:47:08,315 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:47:08,345 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 82 states and 122 transitions. [2019-12-27 16:47:08,346 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:47:08,359 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 16:47:08,359 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 16:47:08,359 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:47:08,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 16:47:08,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:47:08,360 INFO L87 Difference]: Start difference. First operand 16582 states and 49023 transitions. Second operand 5 states. [2019-12-27 16:47:08,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:47:08,771 INFO L93 Difference]: Finished difference Result 31293 states and 93283 transitions. [2019-12-27 16:47:08,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 16:47:08,771 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-27 16:47:08,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:47:08,810 INFO L225 Difference]: With dead ends: 31293 [2019-12-27 16:47:08,810 INFO L226 Difference]: Without dead ends: 16903 [2019-12-27 16:47:08,811 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 16:47:08,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16903 states. [2019-12-27 16:47:09,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16903 to 11605. [2019-12-27 16:47:09,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11605 states. [2019-12-27 16:47:09,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11605 states to 11605 states and 33387 transitions. [2019-12-27 16:47:09,135 INFO L78 Accepts]: Start accepts. Automaton has 11605 states and 33387 transitions. Word has length 40 [2019-12-27 16:47:09,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:47:09,135 INFO L462 AbstractCegarLoop]: Abstraction has 11605 states and 33387 transitions. [2019-12-27 16:47:09,135 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 16:47:09,136 INFO L276 IsEmpty]: Start isEmpty. Operand 11605 states and 33387 transitions. [2019-12-27 16:47:09,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 16:47:09,150 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:47:09,150 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] [2019-12-27 16:47:09,150 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:47:09,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:47:09,150 INFO L82 PathProgramCache]: Analyzing trace with hash -1707989501, now seen corresponding path program 2 times [2019-12-27 16:47:09,151 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:47:09,151 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10534125] [2019-12-27 16:47:09,151 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:47:09,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:47:09,218 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-27 16:47:09,218 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10534125] [2019-12-27 16:47:09,219 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:47:09,219 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 16:47:09,219 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [466246236] [2019-12-27 16:47:09,219 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:47:09,227 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:47:09,327 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 210 states and 423 transitions. [2019-12-27 16:47:09,327 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:47:09,373 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 16:47:09,374 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 16:47:09,374 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:47:09,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 16:47:09,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-12-27 16:47:09,375 INFO L87 Difference]: Start difference. First operand 11605 states and 33387 transitions. Second operand 7 states. [2019-12-27 16:47:09,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:47:09,462 INFO L93 Difference]: Finished difference Result 10656 states and 31273 transitions. [2019-12-27 16:47:09,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 16:47:09,463 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 40 [2019-12-27 16:47:09,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:47:09,478 INFO L225 Difference]: With dead ends: 10656 [2019-12-27 16:47:09,478 INFO L226 Difference]: Without dead ends: 7573 [2019-12-27 16:47:09,482 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-12-27 16:47:09,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7573 states. [2019-12-27 16:47:09,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7573 to 7573. [2019-12-27 16:47:09,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7573 states. [2019-12-27 16:47:09,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7573 states to 7573 states and 24358 transitions. [2019-12-27 16:47:09,638 INFO L78 Accepts]: Start accepts. Automaton has 7573 states and 24358 transitions. Word has length 40 [2019-12-27 16:47:09,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:47:09,638 INFO L462 AbstractCegarLoop]: Abstraction has 7573 states and 24358 transitions. [2019-12-27 16:47:09,639 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 16:47:09,639 INFO L276 IsEmpty]: Start isEmpty. Operand 7573 states and 24358 transitions. [2019-12-27 16:47:09,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 16:47:09,650 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:47:09,650 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, 1, 1, 1, 1] [2019-12-27 16:47:09,650 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:47:09,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:47:09,651 INFO L82 PathProgramCache]: Analyzing trace with hash -1827713058, now seen corresponding path program 1 times [2019-12-27 16:47:09,651 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:47:09,651 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792576723] [2019-12-27 16:47:09,652 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:47:09,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:47:09,704 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-27 16:47:09,705 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792576723] [2019-12-27 16:47:09,705 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:47:09,705 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:47:09,705 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1948551095] [2019-12-27 16:47:09,705 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:47:09,727 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:47:10,450 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 301 states and 548 transitions. [2019-12-27 16:47:10,450 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:47:10,469 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 16:47:10,470 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:47:10,470 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:47:10,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:47:10,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:47:10,471 INFO L87 Difference]: Start difference. First operand 7573 states and 24358 transitions. Second operand 3 states. [2019-12-27 16:47:10,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:47:10,532 INFO L93 Difference]: Finished difference Result 10082 states and 31704 transitions. [2019-12-27 16:47:10,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:47:10,533 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-27 16:47:10,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:47:10,546 INFO L225 Difference]: With dead ends: 10082 [2019-12-27 16:47:10,546 INFO L226 Difference]: Without dead ends: 10082 [2019-12-27 16:47:10,547 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:47:10,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10082 states. [2019-12-27 16:47:10,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10082 to 7729. [2019-12-27 16:47:10,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7729 states. [2019-12-27 16:47:10,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7729 states to 7729 states and 24514 transitions. [2019-12-27 16:47:10,699 INFO L78 Accepts]: Start accepts. Automaton has 7729 states and 24514 transitions. Word has length 64 [2019-12-27 16:47:10,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:47:10,699 INFO L462 AbstractCegarLoop]: Abstraction has 7729 states and 24514 transitions. [2019-12-27 16:47:10,699 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:47:10,699 INFO L276 IsEmpty]: Start isEmpty. Operand 7729 states and 24514 transitions. [2019-12-27 16:47:10,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 16:47:10,709 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:47:10,709 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, 1, 1, 1, 1] [2019-12-27 16:47:10,709 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:47:10,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:47:10,710 INFO L82 PathProgramCache]: Analyzing trace with hash 572197328, now seen corresponding path program 1 times [2019-12-27 16:47:10,710 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:47:10,711 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146299431] [2019-12-27 16:47:10,711 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:47:10,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:47:10,810 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-27 16:47:10,811 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146299431] [2019-12-27 16:47:10,811 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:47:10,811 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 16:47:10,811 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1832206408] [2019-12-27 16:47:10,811 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:47:10,832 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:47:11,196 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 301 states and 548 transitions. [2019-12-27 16:47:11,197 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:47:11,418 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 22 times. [2019-12-27 16:47:11,419 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 16:47:11,419 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:47:11,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 16:47:11,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2019-12-27 16:47:11,420 INFO L87 Difference]: Start difference. First operand 7729 states and 24514 transitions. Second operand 15 states. [2019-12-27 16:47:14,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:47:14,029 INFO L93 Difference]: Finished difference Result 25820 states and 78978 transitions. [2019-12-27 16:47:14,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-27 16:47:14,030 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 64 [2019-12-27 16:47:14,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:47:14,056 INFO L225 Difference]: With dead ends: 25820 [2019-12-27 16:47:14,057 INFO L226 Difference]: Without dead ends: 19646 [2019-12-27 16:47:14,057 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 22 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=247, Invalid=875, Unknown=0, NotChecked=0, Total=1122 [2019-12-27 16:47:14,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19646 states. [2019-12-27 16:47:14,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19646 to 9445. [2019-12-27 16:47:14,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9445 states. [2019-12-27 16:47:14,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9445 states to 9445 states and 29808 transitions. [2019-12-27 16:47:14,293 INFO L78 Accepts]: Start accepts. Automaton has 9445 states and 29808 transitions. Word has length 64 [2019-12-27 16:47:14,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:47:14,293 INFO L462 AbstractCegarLoop]: Abstraction has 9445 states and 29808 transitions. [2019-12-27 16:47:14,293 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 16:47:14,293 INFO L276 IsEmpty]: Start isEmpty. Operand 9445 states and 29808 transitions. [2019-12-27 16:47:14,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 16:47:14,304 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:47:14,304 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, 1, 1, 1, 1] [2019-12-27 16:47:14,305 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:47:14,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:47:14,305 INFO L82 PathProgramCache]: Analyzing trace with hash -22937850, now seen corresponding path program 2 times [2019-12-27 16:47:14,305 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:47:14,306 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598372398] [2019-12-27 16:47:14,306 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:47:14,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:47:14,402 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-27 16:47:14,402 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598372398] [2019-12-27 16:47:14,403 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:47:14,403 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 16:47:14,403 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1376122058] [2019-12-27 16:47:14,403 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:47:14,423 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:47:14,610 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 206 states and 348 transitions. [2019-12-27 16:47:14,610 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:47:14,805 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 13 times. [2019-12-27 16:47:14,806 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-27 16:47:14,806 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:47:14,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-27 16:47:14,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2019-12-27 16:47:14,807 INFO L87 Difference]: Start difference. First operand 9445 states and 29808 transitions. Second operand 14 states. [2019-12-27 16:47:16,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:47:16,957 INFO L93 Difference]: Finished difference Result 24845 states and 77092 transitions. [2019-12-27 16:47:16,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-27 16:47:16,957 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 64 [2019-12-27 16:47:16,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:47:16,991 INFO L225 Difference]: With dead ends: 24845 [2019-12-27 16:47:16,992 INFO L226 Difference]: Without dead ends: 17631 [2019-12-27 16:47:16,992 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=176, Invalid=694, Unknown=0, NotChecked=0, Total=870 [2019-12-27 16:47:17,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17631 states. [2019-12-27 16:47:17,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17631 to 11056. [2019-12-27 16:47:17,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11056 states. [2019-12-27 16:47:17,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11056 states to 11056 states and 34695 transitions. [2019-12-27 16:47:17,243 INFO L78 Accepts]: Start accepts. Automaton has 11056 states and 34695 transitions. Word has length 64 [2019-12-27 16:47:17,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:47:17,243 INFO L462 AbstractCegarLoop]: Abstraction has 11056 states and 34695 transitions. [2019-12-27 16:47:17,243 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-27 16:47:17,243 INFO L276 IsEmpty]: Start isEmpty. Operand 11056 states and 34695 transitions. [2019-12-27 16:47:17,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 16:47:17,256 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:47:17,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, 1, 1, 1, 1, 1] [2019-12-27 16:47:17,256 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:47:17,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:47:17,256 INFO L82 PathProgramCache]: Analyzing trace with hash -1388618928, now seen corresponding path program 3 times [2019-12-27 16:47:17,257 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:47:17,257 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715420014] [2019-12-27 16:47:17,257 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:47:17,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:47:17,372 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-27 16:47:17,372 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715420014] [2019-12-27 16:47:17,372 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:47:17,373 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 16:47:17,373 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1632794915] [2019-12-27 16:47:17,373 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:47:17,393 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:47:18,040 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 151 states and 245 transitions. [2019-12-27 16:47:18,040 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:47:18,159 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 16:47:18,159 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 16:47:18,160 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:47:18,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 16:47:18,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2019-12-27 16:47:18,161 INFO L87 Difference]: Start difference. First operand 11056 states and 34695 transitions. Second operand 13 states. [2019-12-27 16:47:20,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:47:20,781 INFO L93 Difference]: Finished difference Result 33680 states and 103747 transitions. [2019-12-27 16:47:20,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-12-27 16:47:20,782 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 64 [2019-12-27 16:47:20,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:47:20,829 INFO L225 Difference]: With dead ends: 33680 [2019-12-27 16:47:20,830 INFO L226 Difference]: Without dead ends: 31192 [2019-12-27 16:47:20,831 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 728 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=505, Invalid=1945, Unknown=0, NotChecked=0, Total=2450 [2019-12-27 16:47:20,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31192 states. [2019-12-27 16:47:21,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31192 to 10916. [2019-12-27 16:47:21,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10916 states. [2019-12-27 16:47:21,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10916 states to 10916 states and 34289 transitions. [2019-12-27 16:47:21,142 INFO L78 Accepts]: Start accepts. Automaton has 10916 states and 34289 transitions. Word has length 64 [2019-12-27 16:47:21,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:47:21,142 INFO L462 AbstractCegarLoop]: Abstraction has 10916 states and 34289 transitions. [2019-12-27 16:47:21,142 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 16:47:21,142 INFO L276 IsEmpty]: Start isEmpty. Operand 10916 states and 34289 transitions. [2019-12-27 16:47:21,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 16:47:21,153 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:47:21,153 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, 1, 1, 1, 1] [2019-12-27 16:47:21,154 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:47:21,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:47:21,154 INFO L82 PathProgramCache]: Analyzing trace with hash 1911526292, now seen corresponding path program 4 times [2019-12-27 16:47:21,154 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:47:21,155 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139943847] [2019-12-27 16:47:21,155 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:47:21,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:47:21,222 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-27 16:47:21,222 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139943847] [2019-12-27 16:47:21,223 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:47:21,223 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:47:21,223 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1370743342] [2019-12-27 16:47:21,223 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:47:21,243 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:47:21,636 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 305 states and 558 transitions. [2019-12-27 16:47:21,636 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:47:21,644 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 16:47:21,644 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:47:21,644 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:47:21,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:47:21,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:47:21,645 INFO L87 Difference]: Start difference. First operand 10916 states and 34289 transitions. Second operand 3 states. [2019-12-27 16:47:22,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:47:22,261 INFO L93 Difference]: Finished difference Result 12632 states and 39593 transitions. [2019-12-27 16:47:22,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:47:22,262 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-27 16:47:22,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:47:22,292 INFO L225 Difference]: With dead ends: 12632 [2019-12-27 16:47:22,293 INFO L226 Difference]: Without dead ends: 12632 [2019-12-27 16:47:22,296 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 4 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:47:22,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12632 states. [2019-12-27 16:47:22,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12632 to 11384. [2019-12-27 16:47:22,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11384 states. [2019-12-27 16:47:22,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11384 states to 11384 states and 35849 transitions. [2019-12-27 16:47:22,667 INFO L78 Accepts]: Start accepts. Automaton has 11384 states and 35849 transitions. Word has length 64 [2019-12-27 16:47:22,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:47:22,667 INFO L462 AbstractCegarLoop]: Abstraction has 11384 states and 35849 transitions. [2019-12-27 16:47:22,667 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:47:22,667 INFO L276 IsEmpty]: Start isEmpty. Operand 11384 states and 35849 transitions. [2019-12-27 16:47:22,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 16:47:22,684 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:47:22,684 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, 1, 1, 1, 1, 1] [2019-12-27 16:47:22,684 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:47:22,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:47:22,685 INFO L82 PathProgramCache]: Analyzing trace with hash -2140458066, now seen corresponding path program 1 times [2019-12-27 16:47:22,685 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:47:22,686 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997419915] [2019-12-27 16:47:22,686 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:47:22,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:47:22,807 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-27 16:47:22,808 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997419915] [2019-12-27 16:47:22,808 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:47:22,808 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 16:47:22,808 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1931784857] [2019-12-27 16:47:22,808 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:47:22,829 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:47:22,998 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 161 states and 264 transitions. [2019-12-27 16:47:22,998 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:47:23,191 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 11 times. [2019-12-27 16:47:23,192 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 16:47:23,192 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:47:23,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 16:47:23,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2019-12-27 16:47:23,192 INFO L87 Difference]: Start difference. First operand 11384 states and 35849 transitions. Second operand 13 states. [2019-12-27 16:47:27,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:47:27,425 INFO L93 Difference]: Finished difference Result 56068 states and 173510 transitions. [2019-12-27 16:47:27,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-12-27 16:47:27,425 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 65 [2019-12-27 16:47:27,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:47:27,487 INFO L225 Difference]: With dead ends: 56068 [2019-12-27 16:47:27,488 INFO L226 Difference]: Without dead ends: 44689 [2019-12-27 16:47:27,489 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 931 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=595, Invalid=2597, Unknown=0, NotChecked=0, Total=3192 [2019-12-27 16:47:27,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44689 states. [2019-12-27 16:47:28,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44689 to 14995. [2019-12-27 16:47:28,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14995 states. [2019-12-27 16:47:28,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14995 states to 14995 states and 47906 transitions. [2019-12-27 16:47:28,540 INFO L78 Accepts]: Start accepts. Automaton has 14995 states and 47906 transitions. Word has length 65 [2019-12-27 16:47:28,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:47:28,541 INFO L462 AbstractCegarLoop]: Abstraction has 14995 states and 47906 transitions. [2019-12-27 16:47:28,541 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 16:47:28,541 INFO L276 IsEmpty]: Start isEmpty. Operand 14995 states and 47906 transitions. [2019-12-27 16:47:28,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 16:47:28,557 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:47:28,557 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, 1, 1, 1, 1, 1] [2019-12-27 16:47:28,558 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:47:28,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:47:28,558 INFO L82 PathProgramCache]: Analyzing trace with hash -281745782, now seen corresponding path program 2 times [2019-12-27 16:47:28,559 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:47:28,559 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658090074] [2019-12-27 16:47:28,559 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:47:28,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:47:28,670 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-27 16:47:28,670 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658090074] [2019-12-27 16:47:28,670 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:47:28,670 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 16:47:28,671 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [224600068] [2019-12-27 16:47:28,671 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:47:28,691 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:47:28,834 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 164 states and 270 transitions. [2019-12-27 16:47:28,834 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:47:29,086 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:47:29,106 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 16 times. [2019-12-27 16:47:29,106 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 16:47:29,106 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:47:29,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 16:47:29,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2019-12-27 16:47:29,107 INFO L87 Difference]: Start difference. First operand 14995 states and 47906 transitions. Second operand 16 states. [2019-12-27 16:47:39,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:47:39,085 INFO L93 Difference]: Finished difference Result 68761 states and 211276 transitions. [2019-12-27 16:47:39,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2019-12-27 16:47:39,086 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 65 [2019-12-27 16:47:39,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:47:39,170 INFO L225 Difference]: With dead ends: 68761 [2019-12-27 16:47:39,170 INFO L226 Difference]: Without dead ends: 58612 [2019-12-27 16:47:39,173 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 36 SyntacticMatches, 3 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5123 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=1963, Invalid=11377, Unknown=0, NotChecked=0, Total=13340 [2019-12-27 16:47:39,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58612 states. [2019-12-27 16:47:39,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58612 to 14575. [2019-12-27 16:47:39,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14575 states. [2019-12-27 16:47:39,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14575 states to 14575 states and 46485 transitions. [2019-12-27 16:47:39,721 INFO L78 Accepts]: Start accepts. Automaton has 14575 states and 46485 transitions. Word has length 65 [2019-12-27 16:47:39,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:47:39,721 INFO L462 AbstractCegarLoop]: Abstraction has 14575 states and 46485 transitions. [2019-12-27 16:47:39,721 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 16:47:39,721 INFO L276 IsEmpty]: Start isEmpty. Operand 14575 states and 46485 transitions. [2019-12-27 16:47:39,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 16:47:39,737 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:47:39,737 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, 1, 1, 1, 1, 1] [2019-12-27 16:47:39,737 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:47:39,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:47:39,738 INFO L82 PathProgramCache]: Analyzing trace with hash 597443054, now seen corresponding path program 3 times [2019-12-27 16:47:39,738 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:47:39,738 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080756603] [2019-12-27 16:47:39,739 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:47:39,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:47:39,849 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-27 16:47:39,849 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080756603] [2019-12-27 16:47:39,850 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:47:39,850 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 16:47:39,850 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1735145924] [2019-12-27 16:47:39,850 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:47:39,870 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:47:40,538 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 164 states and 282 transitions. [2019-12-27 16:47:40,538 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:47:40,645 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 16:47:40,645 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 16:47:40,646 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:47:40,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 16:47:40,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-12-27 16:47:40,647 INFO L87 Difference]: Start difference. First operand 14575 states and 46485 transitions. Second operand 11 states. [2019-12-27 16:47:41,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:47:41,790 INFO L93 Difference]: Finished difference Result 39752 states and 121974 transitions. [2019-12-27 16:47:41,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-27 16:47:41,790 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 65 [2019-12-27 16:47:41,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:47:41,839 INFO L225 Difference]: With dead ends: 39752 [2019-12-27 16:47:41,839 INFO L226 Difference]: Without dead ends: 35992 [2019-12-27 16:47:41,840 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=141, Invalid=459, Unknown=0, NotChecked=0, Total=600 [2019-12-27 16:47:41,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35992 states. [2019-12-27 16:47:42,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35992 to 14470. [2019-12-27 16:47:42,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14470 states. [2019-12-27 16:47:42,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14470 states to 14470 states and 46039 transitions. [2019-12-27 16:47:42,212 INFO L78 Accepts]: Start accepts. Automaton has 14470 states and 46039 transitions. Word has length 65 [2019-12-27 16:47:42,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:47:42,213 INFO L462 AbstractCegarLoop]: Abstraction has 14470 states and 46039 transitions. [2019-12-27 16:47:42,213 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 16:47:42,213 INFO L276 IsEmpty]: Start isEmpty. Operand 14470 states and 46039 transitions. [2019-12-27 16:47:42,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 16:47:42,228 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:47:42,228 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, 1, 1, 1, 1, 1] [2019-12-27 16:47:42,229 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:47:42,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:47:42,229 INFO L82 PathProgramCache]: Analyzing trace with hash -1262085647, now seen corresponding path program 1 times [2019-12-27 16:47:42,229 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:47:42,229 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490758858] [2019-12-27 16:47:42,230 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:47:42,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:47:42,308 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-27 16:47:42,308 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490758858] [2019-12-27 16:47:42,308 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:47:42,309 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:47:42,309 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1418814250] [2019-12-27 16:47:42,309 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:47:42,327 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:47:42,675 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 279 states and 502 transitions. [2019-12-27 16:47:42,676 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:47:42,681 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 16:47:42,681 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 16:47:42,681 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:47:42,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 16:47:42,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 16:47:42,682 INFO L87 Difference]: Start difference. First operand 14470 states and 46039 transitions. Second operand 4 states. [2019-12-27 16:47:42,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:47:42,785 INFO L93 Difference]: Finished difference Result 14314 states and 45415 transitions. [2019-12-27 16:47:42,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 16:47:42,786 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-12-27 16:47:42,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:47:42,806 INFO L225 Difference]: With dead ends: 14314 [2019-12-27 16:47:42,806 INFO L226 Difference]: Without dead ends: 14314 [2019-12-27 16:47:42,806 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 5 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:47:42,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14314 states. [2019-12-27 16:47:43,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14314 to 13846. [2019-12-27 16:47:43,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13846 states. [2019-12-27 16:47:43,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13846 states to 13846 states and 43855 transitions. [2019-12-27 16:47:43,029 INFO L78 Accepts]: Start accepts. Automaton has 13846 states and 43855 transitions. Word has length 65 [2019-12-27 16:47:43,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:47:43,029 INFO L462 AbstractCegarLoop]: Abstraction has 13846 states and 43855 transitions. [2019-12-27 16:47:43,029 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 16:47:43,029 INFO L276 IsEmpty]: Start isEmpty. Operand 13846 states and 43855 transitions. [2019-12-27 16:47:43,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 16:47:43,043 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:47:43,043 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, 1, 1, 1, 1, 1] [2019-12-27 16:47:43,043 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:47:43,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:47:43,044 INFO L82 PathProgramCache]: Analyzing trace with hash 837718325, now seen corresponding path program 1 times [2019-12-27 16:47:43,044 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:47:43,045 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470445240] [2019-12-27 16:47:43,045 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:47:43,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:47:43,595 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-27 16:47:43,596 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470445240] [2019-12-27 16:47:43,596 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:47:43,596 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:47:43,596 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1153721443] [2019-12-27 16:47:43,596 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:47:43,618 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:47:43,813 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 227 states and 377 transitions. [2019-12-27 16:47:43,813 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:47:43,848 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 16:47:43,848 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 16:47:43,849 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:47:43,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 16:47:43,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 16:47:43,849 INFO L87 Difference]: Start difference. First operand 13846 states and 43855 transitions. Second operand 6 states. [2019-12-27 16:47:44,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:47:44,178 INFO L93 Difference]: Finished difference Result 17655 states and 53961 transitions. [2019-12-27 16:47:44,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 16:47:44,178 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2019-12-27 16:47:44,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:47:44,203 INFO L225 Difference]: With dead ends: 17655 [2019-12-27 16:47:44,203 INFO L226 Difference]: Without dead ends: 17655 [2019-12-27 16:47:44,203 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-12-27 16:47:44,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17655 states. [2019-12-27 16:47:44,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17655 to 12045. [2019-12-27 16:47:44,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12045 states. [2019-12-27 16:47:44,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12045 states to 12045 states and 37284 transitions. [2019-12-27 16:47:44,441 INFO L78 Accepts]: Start accepts. Automaton has 12045 states and 37284 transitions. Word has length 65 [2019-12-27 16:47:44,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:47:44,441 INFO L462 AbstractCegarLoop]: Abstraction has 12045 states and 37284 transitions. [2019-12-27 16:47:44,441 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 16:47:44,441 INFO L276 IsEmpty]: Start isEmpty. Operand 12045 states and 37284 transitions. [2019-12-27 16:47:44,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 16:47:44,454 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:47:44,454 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, 1, 1, 1, 1, 1, 1] [2019-12-27 16:47:44,454 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:47:44,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:47:44,455 INFO L82 PathProgramCache]: Analyzing trace with hash 1324094588, now seen corresponding path program 1 times [2019-12-27 16:47:44,456 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:47:44,456 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603236416] [2019-12-27 16:47:44,456 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:47:44,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:47:44,650 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-27 16:47:44,651 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603236416] [2019-12-27 16:47:44,651 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:47:44,651 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 16:47:44,651 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [21517719] [2019-12-27 16:47:44,651 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:47:44,681 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:47:44,905 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 194 states and 333 transitions. [2019-12-27 16:47:44,905 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:47:45,177 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:47:45,234 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:47:45,284 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:47:45,377 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 21 times. [2019-12-27 16:47:45,378 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-27 16:47:45,378 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:47:45,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-27 16:47:45,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2019-12-27 16:47:45,379 INFO L87 Difference]: Start difference. First operand 12045 states and 37284 transitions. Second operand 18 states. [2019-12-27 16:47:47,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:47:47,959 INFO L93 Difference]: Finished difference Result 20238 states and 61434 transitions. [2019-12-27 16:47:47,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 16:47:47,960 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 66 [2019-12-27 16:47:47,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:47:47,982 INFO L225 Difference]: With dead ends: 20238 [2019-12-27 16:47:47,983 INFO L226 Difference]: Without dead ends: 15362 [2019-12-27 16:47:47,983 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 10 SyntacticMatches, 5 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=147, Invalid=609, Unknown=0, NotChecked=0, Total=756 [2019-12-27 16:47:48,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15362 states. [2019-12-27 16:47:48,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15362 to 12603. [2019-12-27 16:47:48,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12603 states. [2019-12-27 16:47:48,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12603 states to 12603 states and 38819 transitions. [2019-12-27 16:47:48,703 INFO L78 Accepts]: Start accepts. Automaton has 12603 states and 38819 transitions. Word has length 66 [2019-12-27 16:47:48,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:47:48,704 INFO L462 AbstractCegarLoop]: Abstraction has 12603 states and 38819 transitions. [2019-12-27 16:47:48,704 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-27 16:47:48,704 INFO L276 IsEmpty]: Start isEmpty. Operand 12603 states and 38819 transitions. [2019-12-27 16:47:48,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 16:47:48,717 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:47:48,718 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, 1, 1, 1, 1, 1, 1] [2019-12-27 16:47:48,718 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:47:48,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:47:48,718 INFO L82 PathProgramCache]: Analyzing trace with hash -1320774952, now seen corresponding path program 2 times [2019-12-27 16:47:48,719 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:47:48,719 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311548335] [2019-12-27 16:47:48,719 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:47:48,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:47:48,877 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-27 16:47:48,877 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311548335] [2019-12-27 16:47:48,877 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:47:48,878 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 16:47:48,878 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1411412612] [2019-12-27 16:47:48,878 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:47:48,898 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:47:49,136 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 198 states and 340 transitions. [2019-12-27 16:47:49,136 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:47:49,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:47:49,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:47:49,505 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:47:49,592 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 23 times. [2019-12-27 16:47:49,592 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-27 16:47:49,592 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:47:49,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-27 16:47:49,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2019-12-27 16:47:49,593 INFO L87 Difference]: Start difference. First operand 12603 states and 38819 transitions. Second operand 18 states. [2019-12-27 16:47:53,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:47:53,206 INFO L93 Difference]: Finished difference Result 22730 states and 68515 transitions. [2019-12-27 16:47:53,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-27 16:47:53,206 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 66 [2019-12-27 16:47:53,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:47:53,233 INFO L225 Difference]: With dead ends: 22730 [2019-12-27 16:47:53,233 INFO L226 Difference]: Without dead ends: 19110 [2019-12-27 16:47:53,233 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 10 SyntacticMatches, 6 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=180, Invalid=876, Unknown=0, NotChecked=0, Total=1056 [2019-12-27 16:47:53,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19110 states. [2019-12-27 16:47:53,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19110 to 12995. [2019-12-27 16:47:53,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12995 states. [2019-12-27 16:47:53,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12995 states to 12995 states and 39751 transitions. [2019-12-27 16:47:53,471 INFO L78 Accepts]: Start accepts. Automaton has 12995 states and 39751 transitions. Word has length 66 [2019-12-27 16:47:53,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:47:53,471 INFO L462 AbstractCegarLoop]: Abstraction has 12995 states and 39751 transitions. [2019-12-27 16:47:53,471 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-27 16:47:53,471 INFO L276 IsEmpty]: Start isEmpty. Operand 12995 states and 39751 transitions. [2019-12-27 16:47:53,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 16:47:53,484 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:47:53,484 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, 1, 1, 1, 1, 1, 1] [2019-12-27 16:47:53,484 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:47:53,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:47:53,484 INFO L82 PathProgramCache]: Analyzing trace with hash -961619660, now seen corresponding path program 3 times [2019-12-27 16:47:53,485 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:47:53,485 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2147061133] [2019-12-27 16:47:53,485 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:47:53,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:47:53,643 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-27 16:47:53,643 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2147061133] [2019-12-27 16:47:53,644 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:47:53,644 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 16:47:53,644 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1588536322] [2019-12-27 16:47:53,644 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:47:53,663 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:47:54,336 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 253 states and 481 transitions. [2019-12-27 16:47:54,336 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:47:54,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:47:54,754 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:47:54,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:47:54,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:47:55,132 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 31 times. [2019-12-27 16:47:55,132 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-12-27 16:47:55,132 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:47:55,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-12-27 16:47:55,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=362, Unknown=0, NotChecked=0, Total=420 [2019-12-27 16:47:55,133 INFO L87 Difference]: Start difference. First operand 12995 states and 39751 transitions. Second operand 21 states. [2019-12-27 16:47:58,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:47:58,080 INFO L93 Difference]: Finished difference Result 19366 states and 57882 transitions. [2019-12-27 16:47:58,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-27 16:47:58,080 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 66 [2019-12-27 16:47:58,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:47:58,102 INFO L225 Difference]: With dead ends: 19366 [2019-12-27 16:47:58,102 INFO L226 Difference]: Without dead ends: 15974 [2019-12-27 16:47:58,103 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 15 SyntacticMatches, 7 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=155, Invalid=775, Unknown=0, NotChecked=0, Total=930 [2019-12-27 16:47:58,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15974 states. [2019-12-27 16:47:58,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15974 to 12707. [2019-12-27 16:47:58,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12707 states. [2019-12-27 16:47:58,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12707 states to 12707 states and 38911 transitions. [2019-12-27 16:47:58,323 INFO L78 Accepts]: Start accepts. Automaton has 12707 states and 38911 transitions. Word has length 66 [2019-12-27 16:47:58,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:47:58,323 INFO L462 AbstractCegarLoop]: Abstraction has 12707 states and 38911 transitions. [2019-12-27 16:47:58,323 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-12-27 16:47:58,323 INFO L276 IsEmpty]: Start isEmpty. Operand 12707 states and 38911 transitions. [2019-12-27 16:47:58,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 16:47:58,337 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:47:58,337 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, 1, 1, 1, 1, 1, 1] [2019-12-27 16:47:58,337 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:47:58,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:47:58,337 INFO L82 PathProgramCache]: Analyzing trace with hash 1444762494, now seen corresponding path program 4 times [2019-12-27 16:47:58,338 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:47:58,338 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168538694] [2019-12-27 16:47:58,338 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:47:58,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:47:58,734 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-27 16:47:58,734 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168538694] [2019-12-27 16:47:58,735 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:47:58,735 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-27 16:47:58,735 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1472678054] [2019-12-27 16:47:58,735 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:47:58,753 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:47:58,977 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 189 states and 323 transitions. [2019-12-27 16:47:58,977 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:47:59,481 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:47:59,542 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-27 16:47:59,762 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 39 times. [2019-12-27 16:47:59,762 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-12-27 16:47:59,762 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:47:59,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-12-27 16:47:59,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=542, Unknown=0, NotChecked=0, Total=650 [2019-12-27 16:47:59,763 INFO L87 Difference]: Start difference. First operand 12707 states and 38911 transitions. Second operand 26 states. [2019-12-27 16:48:20,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:48:20,559 INFO L93 Difference]: Finished difference Result 57923 states and 165487 transitions. [2019-12-27 16:48:20,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 164 states. [2019-12-27 16:48:20,560 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 66 [2019-12-27 16:48:20,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:48:20,631 INFO L225 Difference]: With dead ends: 57923 [2019-12-27 16:48:20,631 INFO L226 Difference]: Without dead ends: 57755 [2019-12-27 16:48:20,637 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 36 SyntacticMatches, 10 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11581 ImplicationChecksByTransitivity, 11.2s TimeCoverageRelationStatistics Valid=4560, Invalid=24852, Unknown=0, NotChecked=0, Total=29412 [2019-12-27 16:48:20,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57755 states. [2019-12-27 16:48:21,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57755 to 15715. [2019-12-27 16:48:21,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15715 states. [2019-12-27 16:48:21,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15715 states to 15715 states and 46365 transitions. [2019-12-27 16:48:21,186 INFO L78 Accepts]: Start accepts. Automaton has 15715 states and 46365 transitions. Word has length 66 [2019-12-27 16:48:21,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:48:21,186 INFO L462 AbstractCegarLoop]: Abstraction has 15715 states and 46365 transitions. [2019-12-27 16:48:21,186 INFO L463 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-12-27 16:48:21,186 INFO L276 IsEmpty]: Start isEmpty. Operand 15715 states and 46365 transitions. [2019-12-27 16:48:21,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 16:48:21,202 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:48:21,202 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, 1, 1, 1, 1, 1, 1] [2019-12-27 16:48:21,202 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:48:21,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:48:21,202 INFO L82 PathProgramCache]: Analyzing trace with hash -1142030836, now seen corresponding path program 5 times [2019-12-27 16:48:21,203 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:48:21,203 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28981293] [2019-12-27 16:48:21,203 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:48:21,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:48:21,262 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-27 16:48:21,262 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28981293] [2019-12-27 16:48:21,262 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:48:21,262 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:48:21,263 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [415871445] [2019-12-27 16:48:21,263 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:48:21,279 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:48:21,714 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 243 states and 464 transitions. [2019-12-27 16:48:21,714 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:48:21,715 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:48:21,715 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:48:21,716 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:48:21,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:48:21,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:48:21,716 INFO L87 Difference]: Start difference. First operand 15715 states and 46365 transitions. Second operand 3 states. [2019-12-27 16:48:21,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:48:21,762 INFO L93 Difference]: Finished difference Result 15714 states and 46363 transitions. [2019-12-27 16:48:21,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:48:21,762 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-27 16:48:21,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:48:21,784 INFO L225 Difference]: With dead ends: 15714 [2019-12-27 16:48:21,784 INFO L226 Difference]: Without dead ends: 15714 [2019-12-27 16:48:21,785 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-27 16:48:21,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15714 states. [2019-12-27 16:48:21,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15714 to 13045. [2019-12-27 16:48:21,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13045 states. [2019-12-27 16:48:21,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13045 states to 13045 states and 38751 transitions. [2019-12-27 16:48:21,997 INFO L78 Accepts]: Start accepts. Automaton has 13045 states and 38751 transitions. Word has length 66 [2019-12-27 16:48:21,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:48:21,997 INFO L462 AbstractCegarLoop]: Abstraction has 13045 states and 38751 transitions. [2019-12-27 16:48:21,997 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:48:21,997 INFO L276 IsEmpty]: Start isEmpty. Operand 13045 states and 38751 transitions. [2019-12-27 16:48:22,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 16:48:22,010 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:48:22,010 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, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:48:22,010 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:48:22,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:48:22,011 INFO L82 PathProgramCache]: Analyzing trace with hash -1555205525, now seen corresponding path program 1 times [2019-12-27 16:48:22,011 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:48:22,011 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200138573] [2019-12-27 16:48:22,011 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:48:22,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:48:22,440 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-27 16:48:22,440 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200138573] [2019-12-27 16:48:22,441 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:48:22,441 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-27 16:48:22,441 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [828523077] [2019-12-27 16:48:22,441 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:48:22,456 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:48:22,706 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 190 states and 324 transitions. [2019-12-27 16:48:22,706 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:48:23,224 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-27 16:48:23,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:48:23,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-27 16:48:23,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-27 16:48:23,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-27 16:48:23,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-27 16:48:23,983 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 31 times. [2019-12-27 16:48:23,983 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-12-27 16:48:23,983 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:48:23,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-12-27 16:48:23,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=960, Unknown=0, NotChecked=0, Total=1056 [2019-12-27 16:48:23,984 INFO L87 Difference]: Start difference. First operand 13045 states and 38751 transitions. Second operand 33 states. [2019-12-27 16:48:24,135 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 38 [2019-12-27 16:48:24,800 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 41 [2019-12-27 16:48:33,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:48:33,343 INFO L93 Difference]: Finished difference Result 25569 states and 74873 transitions. [2019-12-27 16:48:33,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-12-27 16:48:33,343 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 67 [2019-12-27 16:48:33,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:48:33,373 INFO L225 Difference]: With dead ends: 25569 [2019-12-27 16:48:33,373 INFO L226 Difference]: Without dead ends: 22480 [2019-12-27 16:48:33,376 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 11 SyntacticMatches, 8 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2011 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=918, Invalid=7272, Unknown=0, NotChecked=0, Total=8190 [2019-12-27 16:48:33,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22480 states. [2019-12-27 16:48:33,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22480 to 14589. [2019-12-27 16:48:33,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14589 states. [2019-12-27 16:48:33,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14589 states to 14589 states and 43189 transitions. [2019-12-27 16:48:33,643 INFO L78 Accepts]: Start accepts. Automaton has 14589 states and 43189 transitions. Word has length 67 [2019-12-27 16:48:33,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:48:33,643 INFO L462 AbstractCegarLoop]: Abstraction has 14589 states and 43189 transitions. [2019-12-27 16:48:33,643 INFO L463 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-12-27 16:48:33,643 INFO L276 IsEmpty]: Start isEmpty. Operand 14589 states and 43189 transitions. [2019-12-27 16:48:33,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 16:48:33,658 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:48:33,658 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, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:48:33,658 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:48:33,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:48:33,658 INFO L82 PathProgramCache]: Analyzing trace with hash 1785638345, now seen corresponding path program 2 times [2019-12-27 16:48:33,659 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:48:33,659 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379928377] [2019-12-27 16:48:33,659 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:48:33,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:48:33,854 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-27 16:48:33,854 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379928377] [2019-12-27 16:48:33,854 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:48:33,855 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 16:48:33,855 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [658757103] [2019-12-27 16:48:33,855 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:48:33,865 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:48:34,202 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 271 states and 536 transitions. [2019-12-27 16:48:34,202 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:48:34,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:48:34,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:48:34,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:48:34,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:48:34,723 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 24 times. [2019-12-27 16:48:34,724 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-12-27 16:48:34,724 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:48:34,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-12-27 16:48:34,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=403, Unknown=0, NotChecked=0, Total=462 [2019-12-27 16:48:34,725 INFO L87 Difference]: Start difference. First operand 14589 states and 43189 transitions. Second operand 22 states. [2019-12-27 16:48:39,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:48:39,612 INFO L93 Difference]: Finished difference Result 40242 states and 118024 transitions. [2019-12-27 16:48:39,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-12-27 16:48:39,617 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 67 [2019-12-27 16:48:39,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:48:39,651 INFO L225 Difference]: With dead ends: 40242 [2019-12-27 16:48:39,651 INFO L226 Difference]: Without dead ends: 25406 [2019-12-27 16:48:39,652 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 14 SyntacticMatches, 5 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1981 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=1029, Invalid=5943, Unknown=0, NotChecked=0, Total=6972 [2019-12-27 16:48:39,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25406 states. [2019-12-27 16:48:39,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25406 to 11649. [2019-12-27 16:48:39,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11649 states. [2019-12-27 16:48:39,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11649 states to 11649 states and 34251 transitions. [2019-12-27 16:48:39,920 INFO L78 Accepts]: Start accepts. Automaton has 11649 states and 34251 transitions. Word has length 67 [2019-12-27 16:48:39,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:48:39,920 INFO L462 AbstractCegarLoop]: Abstraction has 11649 states and 34251 transitions. [2019-12-27 16:48:39,920 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-12-27 16:48:39,920 INFO L276 IsEmpty]: Start isEmpty. Operand 11649 states and 34251 transitions. [2019-12-27 16:48:39,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 16:48:39,933 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:48:39,933 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, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:48:39,933 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:48:39,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:48:39,934 INFO L82 PathProgramCache]: Analyzing trace with hash -945042827, now seen corresponding path program 3 times [2019-12-27 16:48:39,934 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:48:39,934 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972731396] [2019-12-27 16:48:39,934 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:48:39,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:48:40,094 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-27 16:48:40,094 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972731396] [2019-12-27 16:48:40,094 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:48:40,095 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 16:48:40,095 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1400456846] [2019-12-27 16:48:40,095 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:48:40,105 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:48:40,448 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 248 states and 470 transitions. [2019-12-27 16:48:40,449 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:48:40,678 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:48:40,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:48:40,775 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:48:40,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:48:40,883 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 27 times. [2019-12-27 16:48:40,883 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-27 16:48:40,883 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:48:40,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-27 16:48:40,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=328, Unknown=0, NotChecked=0, Total=380 [2019-12-27 16:48:40,884 INFO L87 Difference]: Start difference. First operand 11649 states and 34251 transitions. Second operand 20 states. [2019-12-27 16:48:42,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:48:42,071 INFO L93 Difference]: Finished difference Result 14322 states and 41262 transitions. [2019-12-27 16:48:42,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 16:48:42,072 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 67 [2019-12-27 16:48:42,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:48:42,091 INFO L225 Difference]: With dead ends: 14322 [2019-12-27 16:48:42,091 INFO L226 Difference]: Without dead ends: 14079 [2019-12-27 16:48:42,092 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 13 SyntacticMatches, 7 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=216, Invalid=974, Unknown=0, NotChecked=0, Total=1190 [2019-12-27 16:48:42,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14079 states. [2019-12-27 16:48:42,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14079 to 11633. [2019-12-27 16:48:42,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11633 states. [2019-12-27 16:48:42,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11633 states to 11633 states and 34211 transitions. [2019-12-27 16:48:42,278 INFO L78 Accepts]: Start accepts. Automaton has 11633 states and 34211 transitions. Word has length 67 [2019-12-27 16:48:42,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:48:42,278 INFO L462 AbstractCegarLoop]: Abstraction has 11633 states and 34211 transitions. [2019-12-27 16:48:42,278 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-27 16:48:42,278 INFO L276 IsEmpty]: Start isEmpty. Operand 11633 states and 34211 transitions. [2019-12-27 16:48:42,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 16:48:42,290 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:48:42,290 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, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:48:42,290 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:48:42,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:48:42,291 INFO L82 PathProgramCache]: Analyzing trace with hash -1748623595, now seen corresponding path program 4 times [2019-12-27 16:48:42,291 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:48:42,291 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201634216] [2019-12-27 16:48:42,291 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:48:42,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 16:48:42,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 16:48:42,399 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 16:48:42,400 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 16:48:42,404 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [905] [905] ULTIMATE.startENTRY-->L842: Formula: (let ((.cse0 (store |v_#valid_67| 0 0))) (and (= v_~b$r_buff1_thd0~0_230 0) (= v_~b$w_buff1~0_176 0) (= v_~b$mem_tmp~0_20 0) (= |v_#length_25| (store |v_#length_26| |v_ULTIMATE.start_main_~#t855~0.base_25| 4)) (= v_~weak$$choice2~0_144 0) (= 0 v_~b$r_buff1_thd3~0_337) (= 0 v_~b$read_delayed~0_7) (= 0 v_~b$r_buff0_thd2~0_182) (= 0 v_~__unbuffered_p0_EAX~0_176) (= v_~__unbuffered_p1_EBX~0_38 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t855~0.base_25|) 0) (= v_~main$tmp_guard1~0_34 0) (= v_~y~0_19 0) (= 0 v_~__unbuffered_p1_EAX~0_38) (= v_~b$r_buff0_thd0~0_204 0) (< 0 |v_#StackHeapBarrier_17|) (= 0 v_~b$r_buff1_thd1~0_215) (= v_~a~0_14 0) (= 0 v_~x~0_124) (= 0 v_~b$r_buff0_thd3~0_395) (= v_~__unbuffered_p2_EBX~0_38 0) (= v_~b$read_delayed_var~0.offset_7 0) (= v_~z~0_23 0) (= 0 |v_ULTIMATE.start_main_~#t855~0.offset_17|) (= 0 |v_#NULL.base_4|) (= 0 v_~__unbuffered_p2_EAX~0_34) (= 0 v_~b$w_buff0_used~0_787) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t855~0.base_25|) (= |v_#NULL.offset_4| 0) (= 0 v_~b$w_buff0~0_250) (= |v_#valid_65| (store .cse0 |v_ULTIMATE.start_main_~#t855~0.base_25| 1)) (= v_~__unbuffered_cnt~0_137 0) (= 0 v_~b$w_buff1_used~0_450) (= 0 v_~b$r_buff1_thd2~0_222) (= 0 v_~weak$$choice0~0_13) (= v_~b~0_186 0) (= v_~main$tmp_guard0~0_24 0) (= v_~b$flush_delayed~0_35 0) (= 0 v_~b$read_delayed_var~0.base_7) (= 0 v_~b$r_buff0_thd1~0_323) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t855~0.base_25| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t855~0.base_25|) |v_ULTIMATE.start_main_~#t855~0.offset_17| 0)) |v_#memory_int_23|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_67|, #memory_int=|v_#memory_int_24|, #length=|v_#length_26|} OutVars{~b$r_buff0_thd3~0=v_~b$r_buff0_thd3~0_395, ~b$r_buff1_thd1~0=v_~b$r_buff1_thd1~0_215, ~b$read_delayed_var~0.offset=v_~b$read_delayed_var~0.offset_7, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_35|, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_245|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_51|, ~b$w_buff0_used~0=v_~b$w_buff0_used~0_787, ~a~0=v_~a~0_14, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_68|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_176, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_38, #length=|v_#length_25|, ~b$w_buff0~0=v_~b$w_buff0~0_250, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_34, ULTIMATE.start_main_~#t855~0.offset=|v_ULTIMATE.start_main_~#t855~0.offset_17|, ULTIMATE.start_main_~#t855~0.base=|v_ULTIMATE.start_main_~#t855~0.base_25|, ~b$r_buff0_thd0~0=v_~b$r_buff0_thd0~0_204, ~b$r_buff0_thd2~0=v_~b$r_buff0_thd2~0_182, ~b$mem_tmp~0=v_~b$mem_tmp~0_20, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_38, ~b$flush_delayed~0=v_~b$flush_delayed~0_35, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_10|, ULTIMATE.start_main_~#t856~0.offset=|v_ULTIMATE.start_main_~#t856~0.offset_17|, ~b$read_delayed~0=v_~b$read_delayed~0_7, ~weak$$choice0~0=v_~weak$$choice0~0_13, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ~b$w_buff1~0=v_~b$w_buff1~0_176, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_137, ULTIMATE.start_main_~#t857~0.offset=|v_ULTIMATE.start_main_~#t857~0.offset_17|, ~x~0=v_~x~0_124, ~b$r_buff0_thd1~0=v_~b$r_buff0_thd1~0_323, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_34, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_37|, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_45|, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_450, ~y~0=v_~y~0_19, ~b$r_buff1_thd2~0=v_~b$r_buff1_thd2~0_222, ~b$r_buff1_thd0~0=v_~b$r_buff1_thd0~0_230, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_38, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_23|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_9|, ULTIMATE.start_main_~#t857~0.base=|v_ULTIMATE.start_main_~#t857~0.base_21|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_24, #NULL.base=|v_#NULL.base_4|, ~b$read_delayed_var~0.base=v_~b$read_delayed_var~0.base_7, ULTIMATE.start_main_~#t856~0.base=|v_ULTIMATE.start_main_~#t856~0.base_21|, ~b~0=v_~b~0_186, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_28|, #valid=|v_#valid_65|, #memory_int=|v_#memory_int_23|, ~z~0=v_~z~0_23, ~weak$$choice2~0=v_~weak$$choice2~0_144, ~b$r_buff1_thd3~0=v_~b$r_buff1_thd3~0_337} AuxVars[] AssignedVars[~b$r_buff0_thd3~0, ~b$r_buff1_thd1~0, ~b$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_#t~ite50, ~b$w_buff0_used~0, ~a~0, ULTIMATE.start_main_#t~ite52, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, #length, ~b$w_buff0~0, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t855~0.offset, ULTIMATE.start_main_~#t855~0.base, ~b$r_buff0_thd0~0, ~b$r_buff0_thd2~0, ~b$mem_tmp~0, ~__unbuffered_p2_EBX~0, ~b$flush_delayed~0, ULTIMATE.start_main_#t~nondet45, ULTIMATE.start_main_~#t856~0.offset, ~b$read_delayed~0, ~weak$$choice0~0, ~b$w_buff1~0, ~__unbuffered_cnt~0, ULTIMATE.start_main_~#t857~0.offset, ~x~0, ~b$r_buff0_thd1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ULTIMATE.start_main_#t~ite51, ~b$w_buff1_used~0, ~y~0, ~b$r_buff1_thd2~0, ~b$r_buff1_thd0~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~nondet46, ULTIMATE.start_main_#t~nondet44, ULTIMATE.start_main_~#t857~0.base, ~main$tmp_guard0~0, #NULL.base, ~b$read_delayed_var~0.base, ULTIMATE.start_main_~#t856~0.base, ~b~0, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~b$r_buff1_thd3~0] because there is no mapped edge [2019-12-27 16:48:42,405 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [864] [864] L842-1-->L844: Formula: (and (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t856~0.base_10|) (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t856~0.base_10| 1)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t856~0.base_10| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t856~0.base_10|) |v_ULTIMATE.start_main_~#t856~0.offset_9| 1)) |v_#memory_int_11|) (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t856~0.base_10|)) (not (= |v_ULTIMATE.start_main_~#t856~0.base_10| 0)) (= |v_ULTIMATE.start_main_~#t856~0.offset_9| 0) (= (store |v_#length_14| |v_ULTIMATE.start_main_~#t856~0.base_10| 4) |v_#length_13|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_~#t856~0.base=|v_ULTIMATE.start_main_~#t856~0.base_10|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_4|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t856~0.offset=|v_ULTIMATE.start_main_~#t856~0.offset_9|, #length=|v_#length_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t856~0.base, ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, ULTIMATE.start_main_~#t856~0.offset, #length] because there is no mapped edge [2019-12-27 16:48:42,405 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [880] [880] L844-1-->L846: Formula: (and (= |v_#valid_36| (store |v_#valid_37| |v_ULTIMATE.start_main_~#t857~0.base_13| 1)) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t857~0.base_13| 4)) (= 0 |v_ULTIMATE.start_main_~#t857~0.offset_11|) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t857~0.base_13| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t857~0.base_13|) |v_ULTIMATE.start_main_~#t857~0.offset_11| 2)) |v_#memory_int_15|) (not (= 0 |v_ULTIMATE.start_main_~#t857~0.base_13|)) (= (select |v_#valid_37| |v_ULTIMATE.start_main_~#t857~0.base_13|) 0) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t857~0.base_13|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_36|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_6|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~#t857~0.base=|v_ULTIMATE.start_main_~#t857~0.base_13|, #length=|v_#length_17|, ULTIMATE.start_main_~#t857~0.offset=|v_ULTIMATE.start_main_~#t857~0.offset_11|} AuxVars[] AssignedVars[#valid, ULTIMATE.start_main_#t~nondet45, #memory_int, ULTIMATE.start_main_~#t857~0.base, #length, ULTIMATE.start_main_~#t857~0.offset] because there is no mapped edge [2019-12-27 16:48:42,407 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [883] [883] L4-->L754: Formula: (and (not (= P0Thread1of1ForFork2___VERIFIER_assert_~expression_In-1685575505 0)) (= ~b$r_buff1_thd3~0_Out-1685575505 ~b$r_buff0_thd3~0_In-1685575505) (= ~b$r_buff0_thd2~0_In-1685575505 ~b$r_buff1_thd2~0_Out-1685575505) (= ~x~0_In-1685575505 ~__unbuffered_p0_EAX~0_Out-1685575505) (= ~b$r_buff0_thd1~0_In-1685575505 ~b$r_buff1_thd1~0_Out-1685575505) (= 1 ~b$r_buff0_thd1~0_Out-1685575505) (= ~b$r_buff0_thd0~0_In-1685575505 ~b$r_buff1_thd0~0_Out-1685575505)) InVars {~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_In-1685575505, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In-1685575505, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In-1685575505, P0Thread1of1ForFork2___VERIFIER_assert_~expression=P0Thread1of1ForFork2___VERIFIER_assert_~expression_In-1685575505, ~x~0=~x~0_In-1685575505, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In-1685575505} OutVars{~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_Out-1685575505, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In-1685575505, ~__unbuffered_p0_EAX~0=~__unbuffered_p0_EAX~0_Out-1685575505, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In-1685575505, ~b$r_buff1_thd1~0=~b$r_buff1_thd1~0_Out-1685575505, ~b$r_buff1_thd0~0=~b$r_buff1_thd0~0_Out-1685575505, P0Thread1of1ForFork2___VERIFIER_assert_~expression=P0Thread1of1ForFork2___VERIFIER_assert_~expression_In-1685575505, ~b$r_buff1_thd2~0=~b$r_buff1_thd2~0_Out-1685575505, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_Out-1685575505, ~x~0=~x~0_In-1685575505, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In-1685575505} AuxVars[] AssignedVars[~b$r_buff0_thd1~0, ~__unbuffered_p0_EAX~0, ~b$r_buff1_thd1~0, ~b$r_buff1_thd0~0, ~b$r_buff1_thd2~0, ~b$r_buff1_thd3~0] because there is no mapped edge [2019-12-27 16:48:42,409 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L780-2-->L780-4: Formula: (let ((.cse1 (= 0 (mod ~b$r_buff1_thd2~0_In1257051996 256))) (.cse0 (= (mod ~b$w_buff1_used~0_In1257051996 256) 0))) (or (and (not .cse0) (= |P1Thread1of1ForFork0_#t~ite9_Out1257051996| ~b$w_buff1~0_In1257051996) (not .cse1)) (and (= |P1Thread1of1ForFork0_#t~ite9_Out1257051996| ~b~0_In1257051996) (or .cse1 .cse0)))) InVars {~b$w_buff1_used~0=~b$w_buff1_used~0_In1257051996, ~b~0=~b~0_In1257051996, ~b$w_buff1~0=~b$w_buff1~0_In1257051996, ~b$r_buff1_thd2~0=~b$r_buff1_thd2~0_In1257051996} OutVars{~b$w_buff1_used~0=~b$w_buff1_used~0_In1257051996, ~b~0=~b~0_In1257051996, ~b$w_buff1~0=~b$w_buff1~0_In1257051996, P1Thread1of1ForFork0_#t~ite9=|P1Thread1of1ForFork0_#t~ite9_Out1257051996|, ~b$r_buff1_thd2~0=~b$r_buff1_thd2~0_In1257051996} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite9] because there is no mapped edge [2019-12-27 16:48:42,410 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L780-4-->L781: Formula: (= v_~b~0_66 |v_P1Thread1of1ForFork0_#t~ite9_34|) InVars {P1Thread1of1ForFork0_#t~ite9=|v_P1Thread1of1ForFork0_#t~ite9_34|} OutVars{~b~0=v_~b~0_66, P1Thread1of1ForFork0_#t~ite10=|v_P1Thread1of1ForFork0_#t~ite10_53|, P1Thread1of1ForFork0_#t~ite9=|v_P1Thread1of1ForFork0_#t~ite9_33|} AuxVars[] AssignedVars[~b~0, P1Thread1of1ForFork0_#t~ite10, P1Thread1of1ForFork0_#t~ite9] because there is no mapped edge [2019-12-27 16:48:42,410 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [845] [845] L781-->L781-2: Formula: (let ((.cse1 (= 0 (mod ~b$r_buff0_thd2~0_In607716150 256))) (.cse0 (= (mod ~b$w_buff0_used~0_In607716150 256) 0))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork0_#t~ite11_Out607716150| 0)) (and (= |P1Thread1of1ForFork0_#t~ite11_Out607716150| ~b$w_buff0_used~0_In607716150) (or .cse1 .cse0)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In607716150, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In607716150} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In607716150, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In607716150, P1Thread1of1ForFork0_#t~ite11=|P1Thread1of1ForFork0_#t~ite11_Out607716150|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite11] because there is no mapped edge [2019-12-27 16:48:42,410 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [827] [827] L782-->L782-2: Formula: (let ((.cse2 (= (mod ~b$r_buff0_thd2~0_In-1162169460 256) 0)) (.cse3 (= (mod ~b$w_buff0_used~0_In-1162169460 256) 0)) (.cse0 (= (mod ~b$r_buff1_thd2~0_In-1162169460 256) 0)) (.cse1 (= 0 (mod ~b$w_buff1_used~0_In-1162169460 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork0_#t~ite12_Out-1162169460| ~b$w_buff1_used~0_In-1162169460) (or .cse2 .cse3)) (and (= 0 |P1Thread1of1ForFork0_#t~ite12_Out-1162169460|) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-1162169460, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In-1162169460, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-1162169460, ~b$r_buff1_thd2~0=~b$r_buff1_thd2~0_In-1162169460} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In-1162169460, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In-1162169460, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-1162169460, P1Thread1of1ForFork0_#t~ite12=|P1Thread1of1ForFork0_#t~ite12_Out-1162169460|, ~b$r_buff1_thd2~0=~b$r_buff1_thd2~0_In-1162169460} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite12] because there is no mapped edge [2019-12-27 16:48:42,411 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [848] [848] L783-->L783-2: Formula: (let ((.cse0 (= 0 (mod ~b$r_buff0_thd2~0_In2100968563 256))) (.cse1 (= 0 (mod ~b$w_buff0_used~0_In2100968563 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork0_#t~ite13_Out2100968563|)) (and (or .cse0 .cse1) (= ~b$r_buff0_thd2~0_In2100968563 |P1Thread1of1ForFork0_#t~ite13_Out2100968563|)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In2100968563, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In2100968563} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In2100968563, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In2100968563, P1Thread1of1ForFork0_#t~ite13=|P1Thread1of1ForFork0_#t~ite13_Out2100968563|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite13] because there is no mapped edge [2019-12-27 16:48:42,412 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [849] [849] L784-->L784-2: Formula: (let ((.cse1 (= 0 (mod ~b$r_buff0_thd2~0_In-1616252275 256))) (.cse0 (= 0 (mod ~b$w_buff0_used~0_In-1616252275 256))) (.cse2 (= 0 (mod ~b$r_buff1_thd2~0_In-1616252275 256))) (.cse3 (= 0 (mod ~b$w_buff1_used~0_In-1616252275 256)))) (or (and (= |P1Thread1of1ForFork0_#t~ite14_Out-1616252275| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P1Thread1of1ForFork0_#t~ite14_Out-1616252275| ~b$r_buff1_thd2~0_In-1616252275) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-1616252275, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In-1616252275, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-1616252275, ~b$r_buff1_thd2~0=~b$r_buff1_thd2~0_In-1616252275} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In-1616252275, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In-1616252275, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-1616252275, P1Thread1of1ForFork0_#t~ite14=|P1Thread1of1ForFork0_#t~ite14_Out-1616252275|, ~b$r_buff1_thd2~0=~b$r_buff1_thd2~0_In-1616252275} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite14] because there is no mapped edge [2019-12-27 16:48:42,412 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [860] [860] L784-2-->P1EXIT: Formula: (and (= v_~__unbuffered_cnt~0_68 (+ v_~__unbuffered_cnt~0_69 1)) (= v_~b$r_buff1_thd2~0_85 |v_P1Thread1of1ForFork0_#t~ite14_32|) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_69, P1Thread1of1ForFork0_#t~ite14=|v_P1Thread1of1ForFork0_#t~ite14_32|} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_68, P1Thread1of1ForFork0_#t~ite14=|v_P1Thread1of1ForFork0_#t~ite14_31|, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_5|, ~b$r_buff1_thd2~0=v_~b$r_buff1_thd2~0_85, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_5|} AuxVars[] AssignedVars[~__unbuffered_cnt~0, P1Thread1of1ForFork0_#t~ite14, P1Thread1of1ForFork0_#res.offset, ~b$r_buff1_thd2~0, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-27 16:48:42,414 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [884] [884] L808-->L808-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In1236068958 256) 0))) (or (and (not .cse0) (= |P2Thread1of1ForFork1_#t~ite20_In1236068958| |P2Thread1of1ForFork1_#t~ite20_Out1236068958|) (= |P2Thread1of1ForFork1_#t~ite21_Out1236068958| ~b$w_buff0~0_In1236068958)) (and (let ((.cse1 (= 0 (mod ~b$r_buff0_thd3~0_In1236068958 256)))) (or (= (mod ~b$w_buff0_used~0_In1236068958 256) 0) (and (= 0 (mod ~b$r_buff1_thd3~0_In1236068958 256)) .cse1) (and .cse1 (= (mod ~b$w_buff1_used~0_In1236068958 256) 0)))) (= ~b$w_buff0~0_In1236068958 |P2Thread1of1ForFork1_#t~ite20_Out1236068958|) (= |P2Thread1of1ForFork1_#t~ite21_Out1236068958| |P2Thread1of1ForFork1_#t~ite20_Out1236068958|) .cse0))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In1236068958, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In1236068958, P2Thread1of1ForFork1_#t~ite20=|P2Thread1of1ForFork1_#t~ite20_In1236068958|, ~b$w_buff1_used~0=~b$w_buff1_used~0_In1236068958, ~b$w_buff0~0=~b$w_buff0~0_In1236068958, ~weak$$choice2~0=~weak$$choice2~0_In1236068958, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In1236068958} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In1236068958, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In1236068958, P2Thread1of1ForFork1_#t~ite20=|P2Thread1of1ForFork1_#t~ite20_Out1236068958|, P2Thread1of1ForFork1_#t~ite21=|P2Thread1of1ForFork1_#t~ite21_Out1236068958|, ~b$w_buff1_used~0=~b$w_buff1_used~0_In1236068958, ~b$w_buff0~0=~b$w_buff0~0_In1236068958, ~weak$$choice2~0=~weak$$choice2~0_In1236068958, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In1236068958} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite20, P2Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-27 16:48:42,416 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [885] [885] L810-->L810-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1344952529 256)))) (or (and (= ~b$w_buff0_used~0_In-1344952529 |P2Thread1of1ForFork1_#t~ite27_Out-1344952529|) (not .cse0) (= |P2Thread1of1ForFork1_#t~ite26_In-1344952529| |P2Thread1of1ForFork1_#t~ite26_Out-1344952529|)) (and .cse0 (= ~b$w_buff0_used~0_In-1344952529 |P2Thread1of1ForFork1_#t~ite26_Out-1344952529|) (let ((.cse1 (= 0 (mod ~b$r_buff0_thd3~0_In-1344952529 256)))) (or (and (= (mod ~b$r_buff1_thd3~0_In-1344952529 256) 0) .cse1) (and (= (mod ~b$w_buff1_used~0_In-1344952529 256) 0) .cse1) (= 0 (mod ~b$w_buff0_used~0_In-1344952529 256)))) (= |P2Thread1of1ForFork1_#t~ite27_Out-1344952529| |P2Thread1of1ForFork1_#t~ite26_Out-1344952529|)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-1344952529, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In-1344952529, P2Thread1of1ForFork1_#t~ite26=|P2Thread1of1ForFork1_#t~ite26_In-1344952529|, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-1344952529, ~weak$$choice2~0=~weak$$choice2~0_In-1344952529, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In-1344952529} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In-1344952529, P2Thread1of1ForFork1_#t~ite26=|P2Thread1of1ForFork1_#t~ite26_Out-1344952529|, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In-1344952529, P2Thread1of1ForFork1_#t~ite27=|P2Thread1of1ForFork1_#t~ite27_Out-1344952529|, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-1344952529, ~weak$$choice2~0=~weak$$choice2~0_In-1344952529, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In-1344952529} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite26, P2Thread1of1ForFork1_#t~ite27] because there is no mapped edge [2019-12-27 16:48:42,417 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [768] [768] L812-->L813: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_15 256))) (= v_~b$r_buff0_thd3~0_79 v_~b$r_buff0_thd3~0_78)) InVars {~b$r_buff0_thd3~0=v_~b$r_buff0_thd3~0_79, ~weak$$choice2~0=v_~weak$$choice2~0_15} OutVars{~b$r_buff0_thd3~0=v_~b$r_buff0_thd3~0_78, P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_9|, P2Thread1of1ForFork1_#t~ite31=|v_P2Thread1of1ForFork1_#t~ite31_8|, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_9|, ~weak$$choice2~0=v_~weak$$choice2~0_15} AuxVars[] AssignedVars[~b$r_buff0_thd3~0, P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite31, P2Thread1of1ForFork1_#t~ite33] because there is no mapped edge [2019-12-27 16:48:42,419 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [791] [791] L815-->L819: Formula: (and (= v_~b$flush_delayed~0_7 0) (not (= (mod v_~b$flush_delayed~0_8 256) 0)) (= v_~b~0_30 v_~b$mem_tmp~0_5)) InVars {~b$mem_tmp~0=v_~b$mem_tmp~0_5, ~b$flush_delayed~0=v_~b$flush_delayed~0_8} OutVars{~b$mem_tmp~0=v_~b$mem_tmp~0_5, P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_7|, ~b~0=v_~b~0_30, ~b$flush_delayed~0=v_~b$flush_delayed~0_7} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37, ~b~0, ~b$flush_delayed~0] because there is no mapped edge [2019-12-27 16:48:42,419 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [844] [844] L819-2-->L819-4: Formula: (let ((.cse0 (= 0 (mod ~b$w_buff1_used~0_In1212403326 256))) (.cse1 (= 0 (mod ~b$r_buff1_thd3~0_In1212403326 256)))) (or (and (= ~b$w_buff1~0_In1212403326 |P2Thread1of1ForFork1_#t~ite38_Out1212403326|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~b~0_In1212403326 |P2Thread1of1ForFork1_#t~ite38_Out1212403326|)))) InVars {~b$w_buff1_used~0=~b$w_buff1_used~0_In1212403326, ~b~0=~b~0_In1212403326, ~b$w_buff1~0=~b$w_buff1~0_In1212403326, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In1212403326} OutVars{P2Thread1of1ForFork1_#t~ite38=|P2Thread1of1ForFork1_#t~ite38_Out1212403326|, ~b$w_buff1_used~0=~b$w_buff1_used~0_In1212403326, ~b~0=~b~0_In1212403326, ~b$w_buff1~0=~b$w_buff1~0_In1212403326, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In1212403326} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite38] because there is no mapped edge [2019-12-27 16:48:42,419 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [795] [795] L819-4-->L820: Formula: (= v_~b~0_46 |v_P2Thread1of1ForFork1_#t~ite38_12|) InVars {P2Thread1of1ForFork1_#t~ite38=|v_P2Thread1of1ForFork1_#t~ite38_12|} OutVars{P2Thread1of1ForFork1_#t~ite38=|v_P2Thread1of1ForFork1_#t~ite38_11|, ~b~0=v_~b~0_46, P2Thread1of1ForFork1_#t~ite39=|v_P2Thread1of1ForFork1_#t~ite39_7|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite38, ~b~0, P2Thread1of1ForFork1_#t~ite39] because there is no mapped edge [2019-12-27 16:48:42,419 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L820-->L820-2: Formula: (let ((.cse1 (= 0 (mod ~b$r_buff0_thd3~0_In1263051736 256))) (.cse0 (= 0 (mod ~b$w_buff0_used~0_In1263051736 256)))) (or (and (not .cse0) (= |P2Thread1of1ForFork1_#t~ite40_Out1263051736| 0) (not .cse1)) (and (= ~b$w_buff0_used~0_In1263051736 |P2Thread1of1ForFork1_#t~ite40_Out1263051736|) (or .cse1 .cse0)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In1263051736, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In1263051736} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In1263051736, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In1263051736, P2Thread1of1ForFork1_#t~ite40=|P2Thread1of1ForFork1_#t~ite40_Out1263051736|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite40] because there is no mapped edge [2019-12-27 16:48:42,420 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [846] [846] L821-->L821-2: Formula: (let ((.cse0 (= (mod ~b$w_buff0_used~0_In-1393615232 256) 0)) (.cse1 (= 0 (mod ~b$r_buff0_thd3~0_In-1393615232 256))) (.cse2 (= 0 (mod ~b$r_buff1_thd3~0_In-1393615232 256))) (.cse3 (= (mod ~b$w_buff1_used~0_In-1393615232 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~b$w_buff1_used~0_In-1393615232 |P2Thread1of1ForFork1_#t~ite41_Out-1393615232|)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork1_#t~ite41_Out-1393615232|)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-1393615232, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In-1393615232, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-1393615232, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In-1393615232} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In-1393615232, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In-1393615232, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-1393615232, P2Thread1of1ForFork1_#t~ite41=|P2Thread1of1ForFork1_#t~ite41_Out-1393615232|, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In-1393615232} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite41] because there is no mapped edge [2019-12-27 16:48:42,421 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [839] [839] L822-->L822-2: Formula: (let ((.cse0 (= 0 (mod ~b$r_buff0_thd3~0_In-1310148038 256))) (.cse1 (= 0 (mod ~b$w_buff0_used~0_In-1310148038 256)))) (or (and (= 0 |P2Thread1of1ForFork1_#t~ite42_Out-1310148038|) (not .cse0) (not .cse1)) (and (= ~b$r_buff0_thd3~0_In-1310148038 |P2Thread1of1ForFork1_#t~ite42_Out-1310148038|) (or .cse0 .cse1)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-1310148038, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In-1310148038} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In-1310148038, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In-1310148038, P2Thread1of1ForFork1_#t~ite42=|P2Thread1of1ForFork1_#t~ite42_Out-1310148038|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite42] because there is no mapped edge [2019-12-27 16:48:42,421 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [829] [829] L823-->L823-2: Formula: (let ((.cse2 (= 0 (mod ~b$r_buff1_thd3~0_In-1487057862 256))) (.cse3 (= (mod ~b$w_buff1_used~0_In-1487057862 256) 0)) (.cse1 (= 0 (mod ~b$r_buff0_thd3~0_In-1487057862 256))) (.cse0 (= 0 (mod ~b$w_buff0_used~0_In-1487057862 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork1_#t~ite43_Out-1487057862| 0)) (and (or .cse2 .cse3) (= |P2Thread1of1ForFork1_#t~ite43_Out-1487057862| ~b$r_buff1_thd3~0_In-1487057862) (or .cse1 .cse0)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-1487057862, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In-1487057862, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-1487057862, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In-1487057862} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In-1487057862, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In-1487057862, P2Thread1of1ForFork1_#t~ite43=|P2Thread1of1ForFork1_#t~ite43_Out-1487057862|, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-1487057862, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In-1487057862} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite43] because there is no mapped edge [2019-12-27 16:48:42,422 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [859] [859] L823-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork1_#res.offset_5|) (= 0 |v_P2Thread1of1ForFork1_#res.base_5|) (= |v_P2Thread1of1ForFork1_#t~ite43_44| v_~b$r_buff1_thd3~0_140) (= (+ v_~__unbuffered_cnt~0_63 1) v_~__unbuffered_cnt~0_62)) InVars {P2Thread1of1ForFork1_#t~ite43=|v_P2Thread1of1ForFork1_#t~ite43_44|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_63} OutVars{P2Thread1of1ForFork1_#t~ite43=|v_P2Thread1of1ForFork1_#t~ite43_43|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_62, ~b$r_buff1_thd3~0=v_~b$r_buff1_thd3~0_140, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite43, P2Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0, ~b$r_buff1_thd3~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-27 16:48:42,422 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [847] [847] L755-->L755-2: Formula: (let ((.cse1 (= 0 (mod ~b$r_buff0_thd1~0_In1848059907 256))) (.cse0 (= (mod ~b$w_buff0_used~0_In1848059907 256) 0))) (or (and (= ~b$w_buff0_used~0_In1848059907 |P0Thread1of1ForFork2_#t~ite5_Out1848059907|) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= 0 |P0Thread1of1ForFork2_#t~ite5_Out1848059907|)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In1848059907, ~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_In1848059907} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In1848059907, ~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_In1848059907, P0Thread1of1ForFork2_#t~ite5=|P0Thread1of1ForFork2_#t~ite5_Out1848059907|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite5] because there is no mapped edge [2019-12-27 16:48:42,422 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L756-->L756-2: Formula: (let ((.cse1 (= 0 (mod ~b$r_buff1_thd1~0_In-19927260 256))) (.cse0 (= (mod ~b$w_buff1_used~0_In-19927260 256) 0)) (.cse3 (= 0 (mod ~b$w_buff0_used~0_In-19927260 256))) (.cse2 (= 0 (mod ~b$r_buff0_thd1~0_In-19927260 256)))) (or (and (or .cse0 .cse1) (= ~b$w_buff1_used~0_In-19927260 |P0Thread1of1ForFork2_#t~ite6_Out-19927260|) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= |P0Thread1of1ForFork2_#t~ite6_Out-19927260| 0)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-19927260, ~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_In-19927260, ~b$r_buff1_thd1~0=~b$r_buff1_thd1~0_In-19927260, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-19927260} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In-19927260, ~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_In-19927260, ~b$r_buff1_thd1~0=~b$r_buff1_thd1~0_In-19927260, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-19927260, P0Thread1of1ForFork2_#t~ite6=|P0Thread1of1ForFork2_#t~ite6_Out-19927260|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite6] because there is no mapped edge [2019-12-27 16:48:42,423 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L757-->L758: Formula: (let ((.cse0 (= 0 (mod ~b$w_buff0_used~0_In1766804788 256))) (.cse1 (= 0 (mod ~b$r_buff0_thd1~0_In1766804788 256)))) (or (and (= ~b$r_buff0_thd1~0_In1766804788 ~b$r_buff0_thd1~0_Out1766804788) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= ~b$r_buff0_thd1~0_Out1766804788 0)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In1766804788, ~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_In1766804788} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In1766804788, ~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_Out1766804788, P0Thread1of1ForFork2_#t~ite7=|P0Thread1of1ForFork2_#t~ite7_Out1766804788|} AuxVars[] AssignedVars[~b$r_buff0_thd1~0, P0Thread1of1ForFork2_#t~ite7] because there is no mapped edge [2019-12-27 16:48:42,423 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L758-->L758-2: Formula: (let ((.cse1 (= 0 (mod ~b$w_buff1_used~0_In-2104780584 256))) (.cse0 (= 0 (mod ~b$r_buff1_thd1~0_In-2104780584 256))) (.cse2 (= 0 (mod ~b$r_buff0_thd1~0_In-2104780584 256))) (.cse3 (= (mod ~b$w_buff0_used~0_In-2104780584 256) 0))) (or (and (= |P0Thread1of1ForFork2_#t~ite8_Out-2104780584| ~b$r_buff1_thd1~0_In-2104780584) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P0Thread1of1ForFork2_#t~ite8_Out-2104780584| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-2104780584, ~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_In-2104780584, ~b$r_buff1_thd1~0=~b$r_buff1_thd1~0_In-2104780584, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-2104780584} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In-2104780584, ~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_In-2104780584, ~b$r_buff1_thd1~0=~b$r_buff1_thd1~0_In-2104780584, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-2104780584, P0Thread1of1ForFork2_#t~ite8=|P0Thread1of1ForFork2_#t~ite8_Out-2104780584|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-27 16:48:42,424 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [868] [868] L758-2-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork2_#res.offset_5| 0) (= 0 |v_P0Thread1of1ForFork2_#res.base_5|) (= |v_P0Thread1of1ForFork2_#t~ite8_36| v_~b$r_buff1_thd1~0_103) (= (+ v_~__unbuffered_cnt~0_81 1) v_~__unbuffered_cnt~0_80)) InVars {P0Thread1of1ForFork2_#t~ite8=|v_P0Thread1of1ForFork2_#t~ite8_36|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_81} OutVars{~b$r_buff1_thd1~0=v_~b$r_buff1_thd1~0_103, P0Thread1of1ForFork2_#t~ite8=|v_P0Thread1of1ForFork2_#t~ite8_35|, P0Thread1of1ForFork2_#res.offset=|v_P0Thread1of1ForFork2_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_80, P0Thread1of1ForFork2_#res.base=|v_P0Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[~b$r_buff1_thd1~0, P0Thread1of1ForFork2_#t~ite8, P0Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-27 16:48:42,424 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L846-1-->L852: Formula: (and (= 3 v_~__unbuffered_cnt~0_33) (= v_~main$tmp_guard0~0_8 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_33} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_33, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 16:48:42,424 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L852-2-->L852-4: Formula: (let ((.cse1 (= (mod ~b$r_buff1_thd0~0_In384933130 256) 0)) (.cse0 (= 0 (mod ~b$w_buff1_used~0_In384933130 256)))) (or (and (not .cse0) (= ~b$w_buff1~0_In384933130 |ULTIMATE.start_main_#t~ite47_Out384933130|) (not .cse1)) (and (or .cse1 .cse0) (= ~b~0_In384933130 |ULTIMATE.start_main_#t~ite47_Out384933130|)))) InVars {~b$r_buff1_thd0~0=~b$r_buff1_thd0~0_In384933130, ~b$w_buff1_used~0=~b$w_buff1_used~0_In384933130, ~b~0=~b~0_In384933130, ~b$w_buff1~0=~b$w_buff1~0_In384933130} OutVars{~b$r_buff1_thd0~0=~b$r_buff1_thd0~0_In384933130, ~b$w_buff1_used~0=~b$w_buff1_used~0_In384933130, ~b~0=~b~0_In384933130, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out384933130|, ~b$w_buff1~0=~b$w_buff1~0_In384933130} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47] because there is no mapped edge [2019-12-27 16:48:42,424 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [798] [798] L852-4-->L853: Formula: (= v_~b~0_51 |v_ULTIMATE.start_main_#t~ite47_11|) InVars {ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_11|} OutVars{~b~0=v_~b~0_51, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_10|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_6|} AuxVars[] AssignedVars[~b~0, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-27 16:48:42,425 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [842] [842] L853-->L853-2: Formula: (let ((.cse0 (= 0 (mod ~b$w_buff0_used~0_In241644208 256))) (.cse1 (= 0 (mod ~b$r_buff0_thd0~0_In241644208 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite49_Out241644208| ~b$w_buff0_used~0_In241644208)) (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite49_Out241644208|)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In241644208, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In241644208} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In241644208, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out241644208|, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In241644208} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-27 16:48:42,425 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [853] [853] L854-->L854-2: Formula: (let ((.cse0 (= 0 (mod ~b$r_buff1_thd0~0_In-428516677 256))) (.cse1 (= (mod ~b$w_buff1_used~0_In-428516677 256) 0)) (.cse2 (= (mod ~b$w_buff0_used~0_In-428516677 256) 0)) (.cse3 (= 0 (mod ~b$r_buff0_thd0~0_In-428516677 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite50_Out-428516677|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= ~b$w_buff1_used~0_In-428516677 |ULTIMATE.start_main_#t~ite50_Out-428516677|) (or .cse2 .cse3)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-428516677, ~b$r_buff1_thd0~0=~b$r_buff1_thd0~0_In-428516677, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-428516677, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In-428516677} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out-428516677|, ~b$w_buff0_used~0=~b$w_buff0_used~0_In-428516677, ~b$r_buff1_thd0~0=~b$r_buff1_thd0~0_In-428516677, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-428516677, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In-428516677} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-27 16:48:42,426 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [843] [843] L855-->L855-2: Formula: (let ((.cse0 (= 0 (mod ~b$w_buff0_used~0_In1471297355 256))) (.cse1 (= 0 (mod ~b$r_buff0_thd0~0_In1471297355 256)))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite51_Out1471297355|)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite51_Out1471297355| ~b$r_buff0_thd0~0_In1471297355)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In1471297355, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In1471297355} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In1471297355, ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out1471297355|, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In1471297355} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-27 16:48:42,427 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L856-->L856-2: Formula: (let ((.cse2 (= 0 (mod ~b$r_buff0_thd0~0_In1845412909 256))) (.cse3 (= (mod ~b$w_buff0_used~0_In1845412909 256) 0)) (.cse1 (= (mod ~b$w_buff1_used~0_In1845412909 256) 0)) (.cse0 (= (mod ~b$r_buff1_thd0~0_In1845412909 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite52_Out1845412909| ~b$r_buff1_thd0~0_In1845412909) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite52_Out1845412909| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In1845412909, ~b$r_buff1_thd0~0=~b$r_buff1_thd0~0_In1845412909, ~b$w_buff1_used~0=~b$w_buff1_used~0_In1845412909, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In1845412909} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In1845412909, ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out1845412909|, ~b$r_buff1_thd0~0=~b$r_buff1_thd0~0_In1845412909, ~b$w_buff1_used~0=~b$w_buff1_used~0_In1845412909, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In1845412909} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-27 16:48:42,427 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [890] [890] L856-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= 1 v_~__unbuffered_p2_EAX~0_19) (= v_~b$r_buff1_thd0~0_185 |v_ULTIMATE.start_main_#t~ite52_39|) (= v_~main$tmp_guard1~0_18 0) (= v_~__unbuffered_p1_EBX~0_20 0) (= 1 v_~__unbuffered_p1_EAX~0_20) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 0) (= 0 v_~__unbuffered_p0_EAX~0_139) (= v_~__unbuffered_p2_EBX~0_26 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11| (mod v_~main$tmp_guard1~0_18 256))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_139, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_39|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_20, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_26, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_20, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_19} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_139, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_38|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_20, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_26, ~b$r_buff1_thd0~0=v_~b$r_buff1_thd0~0_185, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_20, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_18, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_19, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~b$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 16:48:42,532 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 04:48:42 BasicIcfg [2019-12-27 16:48:42,532 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 16:48:42,534 INFO L168 Benchmark]: Toolchain (without parser) took 182073.29 ms. Allocated memory was 138.9 MB in the beginning and 2.9 GB in the end (delta: 2.8 GB). Free memory was 101.0 MB in the beginning and 1.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2019-12-27 16:48:42,534 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 138.9 MB. Free memory is still 120.7 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-12-27 16:48:42,535 INFO L168 Benchmark]: CACSL2BoogieTranslator took 816.57 ms. Allocated memory was 138.9 MB in the beginning and 203.4 MB in the end (delta: 64.5 MB). Free memory was 100.5 MB in the beginning and 155.5 MB in the end (delta: -55.0 MB). Peak memory consumption was 24.5 MB. Max. memory is 7.1 GB. [2019-12-27 16:48:42,535 INFO L168 Benchmark]: Boogie Procedure Inliner took 65.76 ms. Allocated memory is still 203.4 MB. Free memory was 155.5 MB in the beginning and 152.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 16:48:42,536 INFO L168 Benchmark]: Boogie Preprocessor took 39.14 ms. Allocated memory is still 203.4 MB. Free memory was 152.8 MB in the beginning and 150.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-27 16:48:42,536 INFO L168 Benchmark]: RCFGBuilder took 949.06 ms. Allocated memory is still 203.4 MB. Free memory was 150.2 MB in the beginning and 99.3 MB in the end (delta: 50.9 MB). Peak memory consumption was 50.9 MB. Max. memory is 7.1 GB. [2019-12-27 16:48:42,537 INFO L168 Benchmark]: TraceAbstraction took 180197.19 ms. Allocated memory was 203.4 MB in the beginning and 2.9 GB in the end (delta: 2.7 GB). Free memory was 99.3 MB in the beginning and 1.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 1.0 GB. Max. memory is 7.1 GB. [2019-12-27 16:48:42,539 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.19 ms. Allocated memory is still 138.9 MB. Free memory is still 120.7 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 816.57 ms. Allocated memory was 138.9 MB in the beginning and 203.4 MB in the end (delta: 64.5 MB). Free memory was 100.5 MB in the beginning and 155.5 MB in the end (delta: -55.0 MB). Peak memory consumption was 24.5 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 65.76 ms. Allocated memory is still 203.4 MB. Free memory was 155.5 MB in the beginning and 152.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 39.14 ms. Allocated memory is still 203.4 MB. Free memory was 152.8 MB in the beginning and 150.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 949.06 ms. Allocated memory is still 203.4 MB. Free memory was 150.2 MB in the beginning and 99.3 MB in the end (delta: 50.9 MB). Peak memory consumption was 50.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 180197.19 ms. Allocated memory was 203.4 MB in the beginning and 2.9 GB in the end (delta: 2.7 GB). Free memory was 99.3 MB in the beginning and 1.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 1.0 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 6.2s, 180 ProgramPointsBefore, 96 ProgramPointsAfterwards, 217 TransitionsBefore, 105 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 7 FixpointIterations, 37 TrivialSequentialCompositions, 47 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 31 ConcurrentYvCompositions, 32 ChoiceCompositions, 7698 VarBasedMoverChecksPositive, 261 VarBasedMoverChecksNegative, 64 SemBasedMoverChecksPositive, 271 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.9s, 0 MoverChecksTotal, 83556 CheckedPairsTotal, 115 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L842] FCALL, FORK 0 pthread_create(&t855, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L844] FCALL, FORK 0 pthread_create(&t856, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L846] FCALL, FORK 0 pthread_create(&t857, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L739] 1 b$w_buff1 = b$w_buff0 [L740] 1 b$w_buff0 = 1 [L741] 1 b$w_buff1_used = b$w_buff0_used [L742] 1 b$w_buff0_used = (_Bool)1 [L754] EXPR 1 b$w_buff0_used && b$r_buff0_thd1 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd1 ? b$w_buff1 : b) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L768] 2 x = 1 [L771] 2 y = 1 [L774] 2 __unbuffered_p1_EAX = y [L777] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L780] 2 b$w_buff0_used && b$r_buff0_thd2 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd2 ? b$w_buff1 : b) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L754] 1 b = b$w_buff0_used && b$r_buff0_thd1 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd1 ? b$w_buff1 : b) [L781] 2 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$w_buff0_used [L782] 2 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$w_buff1_used [L783] 2 b$r_buff0_thd2 = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$r_buff0_thd2 [L794] 3 z = 1 [L797] 3 a = 1 [L800] 3 __unbuffered_p2_EAX = a [L803] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L804] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L805] 3 b$flush_delayed = weak$$choice2 [L806] 3 b$mem_tmp = b VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=1, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=1] [L807] EXPR 3 !b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : b$w_buff1) VAL [!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : b$w_buff1)=0, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=1, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=1] [L807] 3 b = !b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : b$w_buff1) [L808] 3 b$w_buff0 = weak$$choice2 ? b$w_buff0 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff0 : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : b$w_buff0)) [L809] EXPR 3 weak$$choice2 ? b$w_buff1 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff1 : b$w_buff1)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=1, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? b$w_buff1 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff1 : b$w_buff1))=0, x=1, y=1, z=1] [L809] 3 b$w_buff1 = weak$$choice2 ? b$w_buff1 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff1 : b$w_buff1)) [L810] 3 b$w_buff0_used = weak$$choice2 ? b$w_buff0_used : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff0_used : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used)) [L811] EXPR 3 weak$$choice2 ? b$w_buff1_used : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=1, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? b$w_buff1_used : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=1] [L811] 3 b$w_buff1_used = weak$$choice2 ? b$w_buff1_used : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L813] EXPR 3 weak$$choice2 ? b$r_buff1_thd3 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$r_buff1_thd3 : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=1, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? b$r_buff1_thd3 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$r_buff1_thd3 : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=1] [L813] 3 b$r_buff1_thd3 = weak$$choice2 ? b$r_buff1_thd3 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$r_buff1_thd3 : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L814] 3 __unbuffered_p2_EBX = b VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=1, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=1] [L819] 3 b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd3 ? b$w_buff1 : b) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=1] [L820] 3 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used [L821] 3 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$w_buff1_used [L822] 3 b$r_buff0_thd3 = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$r_buff0_thd3 [L755] 1 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$w_buff0_used [L756] 1 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$w_buff1_used [L852] 0 b$w_buff0_used && b$r_buff0_thd0 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd0 ? b$w_buff1 : b) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=1] [L853] 0 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$w_buff0_used [L854] 0 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$w_buff1_used [L855] 0 b$r_buff0_thd0 = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 171 locations, 2 error locations. Result: UNSAFE, OverallTime: 179.8s, OverallIterations: 32, TraceHistogramMax: 1, AutomataDifference: 88.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 7809 SDtfs, 20058 SDslu, 41257 SDs, 0 SdLazy, 35325 SolverSat, 1380 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 38.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1175 GetRequests, 264 SyntacticMatches, 72 SemanticMatches, 839 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23461 ImplicationChecksByTransitivity, 31.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=171775occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 44.2s AutomataMinimizationTime, 31 MinimizatonAttempts, 292701 StatesRemovedByMinimization, 27 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.5s InterpolantComputationTime, 1578 NumberOfCodeBlocks, 1578 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 1480 ConstructedInterpolants, 0 QuantifiedInterpolants, 337324 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 31 InterpolantComputations, 31 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...