/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-VariableLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe012_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 22:24:59,335 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 22:24:59,338 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 22:24:59,356 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 22:24:59,357 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 22:24:59,359 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 22:24:59,361 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 22:24:59,374 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 22:24:59,376 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 22:24:59,377 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 22:24:59,378 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 22:24:59,381 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 22:24:59,382 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 22:24:59,385 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 22:24:59,388 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 22:24:59,391 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 22:24:59,393 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 22:24:59,394 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 22:24:59,396 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 22:24:59,401 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 22:24:59,406 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 22:24:59,410 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 22:24:59,412 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 22:24:59,412 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 22:24:59,415 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 22:24:59,415 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 22:24:59,415 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 22:24:59,417 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 22:24:59,419 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 22:24:59,420 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 22:24:59,420 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 22:24:59,422 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 22:24:59,423 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 22:24:59,424 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 22:24:59,426 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 22:24:59,426 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 22:24:59,427 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 22:24:59,428 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 22:24:59,428 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 22:24:59,429 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 22:24:59,431 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 22:24:59,431 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-VariableLbe-MCR.epf [2019-12-27 22:24:59,450 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 22:24:59,451 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 22:24:59,453 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 22:24:59,453 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 22:24:59,453 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 22:24:59,453 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 22:24:59,454 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 22:24:59,454 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 22:24:59,454 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 22:24:59,454 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 22:24:59,455 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 22:24:59,456 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 22:24:59,456 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 22:24:59,456 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 22:24:59,456 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 22:24:59,457 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 22:24:59,457 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 22:24:59,457 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 22:24:59,457 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 22:24:59,457 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 22:24:59,458 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 22:24:59,458 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 22:24:59,458 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 22:24:59,458 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 22:24:59,458 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 22:24:59,459 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 22:24:59,459 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 22:24:59,459 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 22:24:59,459 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 22:24:59,459 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 22:24:59,461 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 22:24:59,461 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 22:24:59,746 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 22:24:59,760 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 22:24:59,763 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 22:24:59,765 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 22:24:59,765 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 22:24:59,766 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe012_pso.oepc.i [2019-12-27 22:24:59,827 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/992b70023/c0f3d681bddb4df4a751372aad5139ba/FLAG3afb6eefe [2019-12-27 22:25:00,306 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 22:25:00,307 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe012_pso.oepc.i [2019-12-27 22:25:00,331 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/992b70023/c0f3d681bddb4df4a751372aad5139ba/FLAG3afb6eefe [2019-12-27 22:25:00,638 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/992b70023/c0f3d681bddb4df4a751372aad5139ba [2019-12-27 22:25:00,646 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 22:25:00,648 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 22:25:00,649 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 22:25:00,649 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 22:25:00,653 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 22:25:00,654 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 10:25:00" (1/1) ... [2019-12-27 22:25:00,657 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ce4072b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:25:00, skipping insertion in model container [2019-12-27 22:25:00,657 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 10:25:00" (1/1) ... [2019-12-27 22:25:00,665 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 22:25:00,719 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 22:25:01,281 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 22:25:01,294 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 22:25:01,356 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 22:25:01,429 INFO L208 MainTranslator]: Completed translation [2019-12-27 22:25:01,429 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:25:01 WrapperNode [2019-12-27 22:25:01,429 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 22:25:01,430 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 22:25:01,430 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 22:25:01,431 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 22:25:01,440 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:25:01" (1/1) ... [2019-12-27 22:25:01,460 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:25:01" (1/1) ... [2019-12-27 22:25:01,495 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 22:25:01,496 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 22:25:01,496 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 22:25:01,496 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 22:25:01,507 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:25:01" (1/1) ... [2019-12-27 22:25:01,507 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:25:01" (1/1) ... [2019-12-27 22:25:01,512 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:25:01" (1/1) ... [2019-12-27 22:25:01,513 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:25:01" (1/1) ... [2019-12-27 22:25:01,526 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:25:01" (1/1) ... [2019-12-27 22:25:01,532 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:25:01" (1/1) ... [2019-12-27 22:25:01,536 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:25:01" (1/1) ... [2019-12-27 22:25:01,541 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 22:25:01,541 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 22:25:01,542 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 22:25:01,542 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 22:25:01,543 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:25:01" (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 22:25:01,612 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 22:25:01,613 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 22:25:01,613 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 22:25:01,613 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 22:25:01,613 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 22:25:01,613 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 22:25:01,614 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 22:25:01,614 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 22:25:01,614 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 22:25:01,614 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 22:25:01,614 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 22:25:01,614 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 22:25:01,615 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 22:25:01,617 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 22:25:02,363 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 22:25:02,363 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 22:25:02,365 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 10:25:02 BoogieIcfgContainer [2019-12-27 22:25:02,365 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 22:25:02,367 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 22:25:02,368 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 22:25:02,372 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 22:25:02,372 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 10:25:00" (1/3) ... [2019-12-27 22:25:02,373 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b0437ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 10:25:02, skipping insertion in model container [2019-12-27 22:25:02,374 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:25:01" (2/3) ... [2019-12-27 22:25:02,374 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b0437ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 10:25:02, skipping insertion in model container [2019-12-27 22:25:02,375 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 10:25:02" (3/3) ... [2019-12-27 22:25:02,377 INFO L109 eAbstractionObserver]: Analyzing ICFG safe012_pso.oepc.i [2019-12-27 22:25:02,388 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 22:25:02,388 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 22:25:02,400 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 22:25:02,401 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 22:25:02,463 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:02,464 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:02,464 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:02,464 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:02,465 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:02,465 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:02,465 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:02,465 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:02,466 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:02,467 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:02,468 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:02,468 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:02,468 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:02,469 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:02,469 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:02,470 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:02,470 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:02,470 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:02,470 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:02,471 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:02,471 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:02,471 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:02,472 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:02,472 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:02,472 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:02,473 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:02,473 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:02,473 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:02,474 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:02,474 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:02,474 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:02,474 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:02,475 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:02,475 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:02,476 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:02,476 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:02,477 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:02,478 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:02,478 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:02,478 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:02,479 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:02,479 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:02,479 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:02,479 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:02,480 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:02,480 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:02,482 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:02,483 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:02,483 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:02,484 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:02,484 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:02,484 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:02,484 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:02,485 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:02,485 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:02,485 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:02,485 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:02,486 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:02,486 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:02,486 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:02,486 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:02,487 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:02,487 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:02,488 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:02,488 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:02,488 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:02,488 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:02,489 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:02,489 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:02,489 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:02,489 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:02,490 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:02,490 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:02,490 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:02,490 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:02,491 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:02,491 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:02,491 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:02,491 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:02,509 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:02,509 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:02,510 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:02,510 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:02,510 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:02,510 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:02,511 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:02,511 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:02,511 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:02,511 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:02,512 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:02,512 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:02,512 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:02,512 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:02,512 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:02,513 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:02,513 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:02,514 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:02,514 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:02,514 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:02,514 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:02,515 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:02,515 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:02,515 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:02,515 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:02,516 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:02,516 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:02,516 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:02,516 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:02,516 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:02,517 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:02,517 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:02,517 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:02,517 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:02,517 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:02,518 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:02,518 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:02,518 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:02,518 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:02,518 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:02,519 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:02,519 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:02,519 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:02,519 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:02,519 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:02,520 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:02,520 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:02,520 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:02,520 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:02,521 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:02,521 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:02,521 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:02,521 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:02,521 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:02,522 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:02,522 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:02,522 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:02,522 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:02,522 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:02,523 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:02,523 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:02,523 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:02,523 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:02,523 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:02,524 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:02,524 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:02,524 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:02,524 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:02,524 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:02,525 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:02,525 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:02,525 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:02,525 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:02,525 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:02,526 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:02,526 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:02,526 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:02,526 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:02,526 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:02,530 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:02,530 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:02,530 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:02,531 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:02,531 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:02,531 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:02,531 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:02,531 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:02,532 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:02,532 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:02,532 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:02,532 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:02,535 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:02,535 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:02,536 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:02,536 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:02,536 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:02,536 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:02,536 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:02,537 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:02,537 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:02,537 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:02,539 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:02,539 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:02,540 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:02,540 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:02,540 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:02,540 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:02,540 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:02,541 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:02,541 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:02,541 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:02,541 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:02,541 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:02,542 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:02,542 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:02,542 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:02,542 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:02,542 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:02,542 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:02,543 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:02,543 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:02,543 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:02,543 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:02,543 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:02,543 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:02,544 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:02,544 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:02,544 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:02,560 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 22:25:02,581 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 22:25:02,581 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 22:25:02,581 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 22:25:02,582 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 22:25:02,582 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 22:25:02,582 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 22:25:02,582 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 22:25:02,582 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 22:25:02,599 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 164 places, 195 transitions [2019-12-27 22:25:02,601 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 164 places, 195 transitions [2019-12-27 22:25:02,705 INFO L132 PetriNetUnfolder]: 41/192 cut-off events. [2019-12-27 22:25:02,705 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 22:25:02,724 INFO L76 FinitePrefix]: Finished finitePrefix Result has 202 conditions, 192 events. 41/192 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 449 event pairs. 0/149 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-27 22:25:02,752 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 164 places, 195 transitions [2019-12-27 22:25:02,804 INFO L132 PetriNetUnfolder]: 41/192 cut-off events. [2019-12-27 22:25:02,805 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 22:25:02,813 INFO L76 FinitePrefix]: Finished finitePrefix Result has 202 conditions, 192 events. 41/192 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 449 event pairs. 0/149 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-27 22:25:02,834 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 16696 [2019-12-27 22:25:02,835 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 22:25:06,606 WARN L192 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 89 [2019-12-27 22:25:06,729 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-12-27 22:25:06,795 INFO L206 etLargeBlockEncoding]: Checked pairs total: 67273 [2019-12-27 22:25:06,795 INFO L214 etLargeBlockEncoding]: Total number of compositions: 114 [2019-12-27 22:25:06,799 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 82 places, 89 transitions [2019-12-27 22:25:17,932 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 85916 states. [2019-12-27 22:25:17,934 INFO L276 IsEmpty]: Start isEmpty. Operand 85916 states. [2019-12-27 22:25:17,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-27 22:25:17,939 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:25:17,940 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-27 22:25:17,940 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:25:17,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:25:17,946 INFO L82 PathProgramCache]: Analyzing trace with hash 800242347, now seen corresponding path program 1 times [2019-12-27 22:25:17,954 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:25:17,954 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464022787] [2019-12-27 22:25:17,954 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:25:18,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:25:18,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 22:25:18,262 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464022787] [2019-12-27 22:25:18,263 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:25:18,263 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 22:25:18,264 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [276874308] [2019-12-27 22:25:18,265 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:25:18,272 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:25:18,288 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 6 states and 5 transitions. [2019-12-27 22:25:18,289 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:25:18,293 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:25:18,293 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 22:25:18,293 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:25:18,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 22:25:18,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:25:18,311 INFO L87 Difference]: Start difference. First operand 85916 states. Second operand 3 states. [2019-12-27 22:25:21,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:25:21,035 INFO L93 Difference]: Finished difference Result 84146 states and 359873 transitions. [2019-12-27 22:25:21,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 22:25:21,037 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-27 22:25:21,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:25:21,591 INFO L225 Difference]: With dead ends: 84146 [2019-12-27 22:25:21,591 INFO L226 Difference]: Without dead ends: 79232 [2019-12-27 22:25:21,592 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 22:25:26,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79232 states. [2019-12-27 22:25:28,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79232 to 79232. [2019-12-27 22:25:28,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79232 states. [2019-12-27 22:25:32,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79232 states to 79232 states and 338383 transitions. [2019-12-27 22:25:32,310 INFO L78 Accepts]: Start accepts. Automaton has 79232 states and 338383 transitions. Word has length 5 [2019-12-27 22:25:32,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:25:32,310 INFO L462 AbstractCegarLoop]: Abstraction has 79232 states and 338383 transitions. [2019-12-27 22:25:32,310 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 22:25:32,310 INFO L276 IsEmpty]: Start isEmpty. Operand 79232 states and 338383 transitions. [2019-12-27 22:25:32,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 22:25:32,319 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:25:32,319 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:25:32,319 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:25:32,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:25:32,320 INFO L82 PathProgramCache]: Analyzing trace with hash 438269963, now seen corresponding path program 1 times [2019-12-27 22:25:32,320 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:25:32,321 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668439895] [2019-12-27 22:25:32,321 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:25:32,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:25:32,405 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 22:25:32,405 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668439895] [2019-12-27 22:25:32,406 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:25:32,406 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 22:25:32,406 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [671798141] [2019-12-27 22:25:32,407 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:25:32,408 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:25:32,413 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 22:25:32,413 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:25:32,413 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:25:32,415 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 22:25:32,415 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:25:32,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 22:25:32,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 22:25:32,416 INFO L87 Difference]: Start difference. First operand 79232 states and 338383 transitions. Second operand 4 states. [2019-12-27 22:25:33,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:25:33,346 INFO L93 Difference]: Finished difference Result 121026 states and 493729 transitions. [2019-12-27 22:25:33,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 22:25:33,346 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-27 22:25:33,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:25:34,769 INFO L225 Difference]: With dead ends: 121026 [2019-12-27 22:25:34,769 INFO L226 Difference]: Without dead ends: 120935 [2019-12-27 22:25:34,770 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 22:25:40,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120935 states. [2019-12-27 22:25:43,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120935 to 109733. [2019-12-27 22:25:43,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109733 states. [2019-12-27 22:25:44,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109733 states to 109733 states and 453798 transitions. [2019-12-27 22:25:44,202 INFO L78 Accepts]: Start accepts. Automaton has 109733 states and 453798 transitions. Word has length 13 [2019-12-27 22:25:44,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:25:44,204 INFO L462 AbstractCegarLoop]: Abstraction has 109733 states and 453798 transitions. [2019-12-27 22:25:44,204 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 22:25:44,204 INFO L276 IsEmpty]: Start isEmpty. Operand 109733 states and 453798 transitions. [2019-12-27 22:25:44,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 22:25:44,207 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:25:44,207 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:25:44,207 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:25:44,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:25:44,208 INFO L82 PathProgramCache]: Analyzing trace with hash 777110306, now seen corresponding path program 1 times [2019-12-27 22:25:44,208 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:25:44,208 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595777029] [2019-12-27 22:25:44,208 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:25:44,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:25:44,331 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 22:25:44,332 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595777029] [2019-12-27 22:25:44,332 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:25:44,332 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 22:25:44,332 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1099220201] [2019-12-27 22:25:44,333 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:25:44,334 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:25:44,336 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 22:25:44,336 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:25:44,336 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:25:44,336 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 22:25:44,337 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:25:44,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 22:25:44,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 22:25:44,337 INFO L87 Difference]: Start difference. First operand 109733 states and 453798 transitions. Second operand 4 states. [2019-12-27 22:25:49,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:25:49,509 INFO L93 Difference]: Finished difference Result 151774 states and 613241 transitions. [2019-12-27 22:25:49,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 22:25:49,509 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-27 22:25:49,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:25:49,969 INFO L225 Difference]: With dead ends: 151774 [2019-12-27 22:25:49,969 INFO L226 Difference]: Without dead ends: 151670 [2019-12-27 22:25:49,970 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 22:25:53,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151670 states. [2019-12-27 22:25:55,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151670 to 127872. [2019-12-27 22:25:55,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127872 states. [2019-12-27 22:25:56,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127872 states to 127872 states and 526262 transitions. [2019-12-27 22:25:56,361 INFO L78 Accepts]: Start accepts. Automaton has 127872 states and 526262 transitions. Word has length 13 [2019-12-27 22:25:56,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:25:56,362 INFO L462 AbstractCegarLoop]: Abstraction has 127872 states and 526262 transitions. [2019-12-27 22:25:56,362 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 22:25:56,362 INFO L276 IsEmpty]: Start isEmpty. Operand 127872 states and 526262 transitions. [2019-12-27 22:25:56,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 22:25:56,366 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:25:56,367 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:25:56,367 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:25:56,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:25:56,367 INFO L82 PathProgramCache]: Analyzing trace with hash -2011904106, now seen corresponding path program 1 times [2019-12-27 22:25:56,368 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:25:56,368 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73995190] [2019-12-27 22:25:56,374 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:25:56,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:25:56,493 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 22:25:56,496 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73995190] [2019-12-27 22:25:56,496 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:25:56,496 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 22:25:56,496 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1524346510] [2019-12-27 22:25:56,496 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:25:56,498 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:25:56,502 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 33 states and 50 transitions. [2019-12-27 22:25:56,502 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:25:56,598 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 22:25:56,599 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 22:25:56,599 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:25:56,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 22:25:56,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 22:25:56,600 INFO L87 Difference]: Start difference. First operand 127872 states and 526262 transitions. Second operand 7 states. [2019-12-27 22:26:02,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:26:02,460 INFO L93 Difference]: Finished difference Result 172642 states and 696404 transitions. [2019-12-27 22:26:02,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 22:26:02,460 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2019-12-27 22:26:02,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:26:03,236 INFO L225 Difference]: With dead ends: 172642 [2019-12-27 22:26:03,236 INFO L226 Difference]: Without dead ends: 172506 [2019-12-27 22:26:03,237 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 22:26:06,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172506 states. [2019-12-27 22:26:08,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172506 to 133126. [2019-12-27 22:26:08,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133126 states. [2019-12-27 22:26:10,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133126 states to 133126 states and 547571 transitions. [2019-12-27 22:26:10,422 INFO L78 Accepts]: Start accepts. Automaton has 133126 states and 547571 transitions. Word has length 14 [2019-12-27 22:26:10,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:26:10,423 INFO L462 AbstractCegarLoop]: Abstraction has 133126 states and 547571 transitions. [2019-12-27 22:26:10,423 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 22:26:10,423 INFO L276 IsEmpty]: Start isEmpty. Operand 133126 states and 547571 transitions. [2019-12-27 22:26:10,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-27 22:26:10,445 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:26:10,445 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:26:10,446 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:26:10,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:26:10,446 INFO L82 PathProgramCache]: Analyzing trace with hash 548423730, now seen corresponding path program 1 times [2019-12-27 22:26:10,446 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:26:10,447 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494678235] [2019-12-27 22:26:10,447 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:26:10,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:26:10,502 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 22:26:10,502 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494678235] [2019-12-27 22:26:10,502 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:26:10,503 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 22:26:10,503 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2011293605] [2019-12-27 22:26:10,503 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:26:10,505 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:26:10,507 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 22 states and 24 transitions. [2019-12-27 22:26:10,507 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:26:10,507 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:26:10,508 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 22:26:10,508 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:26:10,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 22:26:10,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:26:10,509 INFO L87 Difference]: Start difference. First operand 133126 states and 547571 transitions. Second operand 3 states. [2019-12-27 22:26:11,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:26:11,141 INFO L93 Difference]: Finished difference Result 132731 states and 546022 transitions. [2019-12-27 22:26:11,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 22:26:11,142 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-27 22:26:11,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:26:11,500 INFO L225 Difference]: With dead ends: 132731 [2019-12-27 22:26:11,500 INFO L226 Difference]: Without dead ends: 132731 [2019-12-27 22:26:11,501 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 22:26:20,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132731 states. [2019-12-27 22:26:22,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132731 to 132731. [2019-12-27 22:26:22,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132731 states. [2019-12-27 22:26:22,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132731 states to 132731 states and 546022 transitions. [2019-12-27 22:26:22,691 INFO L78 Accepts]: Start accepts. Automaton has 132731 states and 546022 transitions. Word has length 18 [2019-12-27 22:26:22,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:26:22,692 INFO L462 AbstractCegarLoop]: Abstraction has 132731 states and 546022 transitions. [2019-12-27 22:26:22,692 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 22:26:22,692 INFO L276 IsEmpty]: Start isEmpty. Operand 132731 states and 546022 transitions. [2019-12-27 22:26:22,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 22:26:22,714 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:26:22,715 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:26:22,715 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:26:22,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:26:22,715 INFO L82 PathProgramCache]: Analyzing trace with hash -300265676, now seen corresponding path program 1 times [2019-12-27 22:26:22,716 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:26:22,716 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071008004] [2019-12-27 22:26:22,716 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:26:22,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:26:22,773 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 22:26:22,773 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071008004] [2019-12-27 22:26:22,774 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:26:22,774 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 22:26:22,774 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1712750860] [2019-12-27 22:26:22,774 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:26:22,777 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:26:22,781 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 33 states and 48 transitions. [2019-12-27 22:26:22,781 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:26:22,782 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:26:22,782 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 22:26:22,782 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:26:22,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 22:26:22,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:26:22,783 INFO L87 Difference]: Start difference. First operand 132731 states and 546022 transitions. Second operand 3 states. [2019-12-27 22:26:24,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:26:24,601 INFO L93 Difference]: Finished difference Result 132024 states and 543090 transitions. [2019-12-27 22:26:24,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 22:26:24,601 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-12-27 22:26:24,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:26:25,005 INFO L225 Difference]: With dead ends: 132024 [2019-12-27 22:26:25,006 INFO L226 Difference]: Without dead ends: 132024 [2019-12-27 22:26:25,006 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 22:26:28,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132024 states. [2019-12-27 22:26:35,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132024 to 132024. [2019-12-27 22:26:35,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132024 states. [2019-12-27 22:26:36,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132024 states to 132024 states and 543090 transitions. [2019-12-27 22:26:36,872 INFO L78 Accepts]: Start accepts. Automaton has 132024 states and 543090 transitions. Word has length 19 [2019-12-27 22:26:36,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:26:36,872 INFO L462 AbstractCegarLoop]: Abstraction has 132024 states and 543090 transitions. [2019-12-27 22:26:36,872 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 22:26:36,872 INFO L276 IsEmpty]: Start isEmpty. Operand 132024 states and 543090 transitions. [2019-12-27 22:26:36,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 22:26:36,889 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:26:36,889 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:26:36,889 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:26:36,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:26:36,890 INFO L82 PathProgramCache]: Analyzing trace with hash -1452908293, now seen corresponding path program 1 times [2019-12-27 22:26:36,890 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:26:36,891 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443277740] [2019-12-27 22:26:36,891 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:26:36,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:26:37,009 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 22:26:37,010 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443277740] [2019-12-27 22:26:37,010 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:26:37,010 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 22:26:37,011 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1995760591] [2019-12-27 22:26:37,011 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:26:37,013 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:26:37,018 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 26 states and 31 transitions. [2019-12-27 22:26:37,018 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:26:37,019 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 22:26:37,019 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 22:26:37,019 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:26:37,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 22:26:37,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 22:26:37,020 INFO L87 Difference]: Start difference. First operand 132024 states and 543090 transitions. Second operand 5 states. [2019-12-27 22:26:43,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:26:43,502 INFO L93 Difference]: Finished difference Result 180078 states and 725535 transitions. [2019-12-27 22:26:43,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 22:26:43,502 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-12-27 22:26:43,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:26:44,019 INFO L225 Difference]: With dead ends: 180078 [2019-12-27 22:26:44,020 INFO L226 Difference]: Without dead ends: 179909 [2019-12-27 22:26:44,020 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 22:26:47,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179909 states. [2019-12-27 22:26:50,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179909 to 135986. [2019-12-27 22:26:50,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135986 states. [2019-12-27 22:26:50,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135986 states to 135986 states and 558627 transitions. [2019-12-27 22:26:50,590 INFO L78 Accepts]: Start accepts. Automaton has 135986 states and 558627 transitions. Word has length 19 [2019-12-27 22:26:50,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:26:50,591 INFO L462 AbstractCegarLoop]: Abstraction has 135986 states and 558627 transitions. [2019-12-27 22:26:50,591 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 22:26:50,591 INFO L276 IsEmpty]: Start isEmpty. Operand 135986 states and 558627 transitions. [2019-12-27 22:26:50,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-27 22:26:50,613 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:26:50,613 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] [2019-12-27 22:26:50,614 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:26:50,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:26:50,614 INFO L82 PathProgramCache]: Analyzing trace with hash -587248710, now seen corresponding path program 1 times [2019-12-27 22:26:50,614 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:26:50,614 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873771643] [2019-12-27 22:26:50,615 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:26:50,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:26:50,669 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 22:26:50,670 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873771643] [2019-12-27 22:26:50,670 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:26:50,670 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 22:26:50,671 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [884797700] [2019-12-27 22:26:50,671 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:26:50,673 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:26:50,679 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 46 states and 74 transitions. [2019-12-27 22:26:50,680 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:26:50,752 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 22:26:50,752 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 22:26:50,752 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:26:50,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 22:26:50,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-27 22:26:50,753 INFO L87 Difference]: Start difference. First operand 135986 states and 558627 transitions. Second operand 8 states. [2019-12-27 22:27:00,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:27:00,742 INFO L93 Difference]: Finished difference Result 351138 states and 1445141 transitions. [2019-12-27 22:27:00,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 22:27:00,743 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2019-12-27 22:27:00,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:27:01,474 INFO L225 Difference]: With dead ends: 351138 [2019-12-27 22:27:01,474 INFO L226 Difference]: Without dead ends: 240662 [2019-12-27 22:27:01,474 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2019-12-27 22:27:05,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240662 states. [2019-12-27 22:27:08,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240662 to 105432. [2019-12-27 22:27:08,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105432 states. [2019-12-27 22:27:08,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105432 states to 105432 states and 429848 transitions. [2019-12-27 22:27:08,496 INFO L78 Accepts]: Start accepts. Automaton has 105432 states and 429848 transitions. Word has length 20 [2019-12-27 22:27:08,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:27:08,496 INFO L462 AbstractCegarLoop]: Abstraction has 105432 states and 429848 transitions. [2019-12-27 22:27:08,496 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 22:27:08,496 INFO L276 IsEmpty]: Start isEmpty. Operand 105432 states and 429848 transitions. [2019-12-27 22:27:08,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 22:27:08,518 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:27:08,518 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:27:08,518 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:27:08,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:27:08,518 INFO L82 PathProgramCache]: Analyzing trace with hash 402034233, now seen corresponding path program 1 times [2019-12-27 22:27:08,519 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:27:08,519 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010831268] [2019-12-27 22:27:08,519 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:27:08,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:27:08,569 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 22:27:08,570 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010831268] [2019-12-27 22:27:08,570 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:27:08,570 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 22:27:08,571 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1617130654] [2019-12-27 22:27:08,571 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:27:08,573 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:27:08,582 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 57 states and 98 transitions. [2019-12-27 22:27:08,582 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:27:08,583 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:27:08,583 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 22:27:08,583 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:27:08,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 22:27:08,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 22:27:08,584 INFO L87 Difference]: Start difference. First operand 105432 states and 429848 transitions. Second operand 4 states. [2019-12-27 22:27:10,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:27:10,448 INFO L93 Difference]: Finished difference Result 180669 states and 738829 transitions. [2019-12-27 22:27:10,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 22:27:10,448 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2019-12-27 22:27:10,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:27:10,724 INFO L225 Difference]: With dead ends: 180669 [2019-12-27 22:27:10,724 INFO L226 Difference]: Without dead ends: 93245 [2019-12-27 22:27:10,724 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 22:27:14,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93245 states. [2019-12-27 22:27:20,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93245 to 86281. [2019-12-27 22:27:20,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86281 states. [2019-12-27 22:27:20,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86281 states to 86281 states and 352873 transitions. [2019-12-27 22:27:20,743 INFO L78 Accepts]: Start accepts. Automaton has 86281 states and 352873 transitions. Word has length 21 [2019-12-27 22:27:20,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:27:20,744 INFO L462 AbstractCegarLoop]: Abstraction has 86281 states and 352873 transitions. [2019-12-27 22:27:20,744 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 22:27:20,744 INFO L276 IsEmpty]: Start isEmpty. Operand 86281 states and 352873 transitions. [2019-12-27 22:27:20,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 22:27:20,759 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:27:20,759 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:27:20,759 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:27:20,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:27:20,760 INFO L82 PathProgramCache]: Analyzing trace with hash 1125330895, now seen corresponding path program 2 times [2019-12-27 22:27:20,760 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:27:20,760 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496638011] [2019-12-27 22:27:20,760 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:27:20,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:27:20,827 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 22:27:20,827 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496638011] [2019-12-27 22:27:20,827 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:27:20,828 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 22:27:20,828 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [334417] [2019-12-27 22:27:20,828 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:27:20,831 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:27:20,840 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 49 states and 75 transitions. [2019-12-27 22:27:20,840 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:27:20,859 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 22:27:20,859 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 22:27:20,860 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:27:20,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 22:27:20,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 22:27:20,860 INFO L87 Difference]: Start difference. First operand 86281 states and 352873 transitions. Second operand 5 states. [2019-12-27 22:27:21,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:27:21,124 INFO L93 Difference]: Finished difference Result 30753 states and 105714 transitions. [2019-12-27 22:27:21,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 22:27:21,125 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-12-27 22:27:21,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:27:21,170 INFO L225 Difference]: With dead ends: 30753 [2019-12-27 22:27:21,170 INFO L226 Difference]: Without dead ends: 26788 [2019-12-27 22:27:21,170 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-27 22:27:21,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26788 states. [2019-12-27 22:27:22,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26788 to 17289. [2019-12-27 22:27:22,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17289 states. [2019-12-27 22:27:22,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17289 states to 17289 states and 57966 transitions. [2019-12-27 22:27:22,130 INFO L78 Accepts]: Start accepts. Automaton has 17289 states and 57966 transitions. Word has length 21 [2019-12-27 22:27:22,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:27:22,130 INFO L462 AbstractCegarLoop]: Abstraction has 17289 states and 57966 transitions. [2019-12-27 22:27:22,131 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 22:27:22,131 INFO L276 IsEmpty]: Start isEmpty. Operand 17289 states and 57966 transitions. [2019-12-27 22:27:22,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 22:27:22,133 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:27:22,134 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 22:27:22,134 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:27:22,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:27:22,134 INFO L82 PathProgramCache]: Analyzing trace with hash 308223967, now seen corresponding path program 1 times [2019-12-27 22:27:22,134 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:27:22,135 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699986594] [2019-12-27 22:27:22,135 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:27:22,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:27:22,212 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 22:27:22,213 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699986594] [2019-12-27 22:27:22,213 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:27:22,213 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 22:27:22,213 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1875926100] [2019-12-27 22:27:22,213 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:27:22,217 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:27:22,230 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 67 states and 110 transitions. [2019-12-27 22:27:22,230 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:27:22,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 22:27:22,383 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 22:27:22,384 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 22:27:22,384 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:27:22,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 22:27:22,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-12-27 22:27:22,385 INFO L87 Difference]: Start difference. First operand 17289 states and 57966 transitions. Second operand 10 states. [2019-12-27 22:27:23,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:27:23,041 INFO L93 Difference]: Finished difference Result 17791 states and 58588 transitions. [2019-12-27 22:27:23,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 22:27:23,042 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2019-12-27 22:27:23,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:27:23,069 INFO L225 Difference]: With dead ends: 17791 [2019-12-27 22:27:23,069 INFO L226 Difference]: Without dead ends: 17166 [2019-12-27 22:27:23,070 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=164, Unknown=0, NotChecked=0, Total=240 [2019-12-27 22:27:23,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17166 states. [2019-12-27 22:27:23,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17166 to 16399. [2019-12-27 22:27:23,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16399 states. [2019-12-27 22:27:23,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16399 states to 16399 states and 55269 transitions. [2019-12-27 22:27:23,357 INFO L78 Accepts]: Start accepts. Automaton has 16399 states and 55269 transitions. Word has length 22 [2019-12-27 22:27:23,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:27:23,357 INFO L462 AbstractCegarLoop]: Abstraction has 16399 states and 55269 transitions. [2019-12-27 22:27:23,357 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 22:27:23,357 INFO L276 IsEmpty]: Start isEmpty. Operand 16399 states and 55269 transitions. [2019-12-27 22:27:23,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-27 22:27:23,364 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:27:23,364 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] [2019-12-27 22:27:23,364 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:27:23,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:27:23,364 INFO L82 PathProgramCache]: Analyzing trace with hash 436815580, now seen corresponding path program 1 times [2019-12-27 22:27:23,365 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:27:23,365 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611345496] [2019-12-27 22:27:23,365 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:27:23,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:27:23,439 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 22:27:23,440 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611345496] [2019-12-27 22:27:23,440 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:27:23,440 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 22:27:23,440 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [121896411] [2019-12-27 22:27:23,441 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:27:23,445 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:27:23,470 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 89 states and 148 transitions. [2019-12-27 22:27:23,471 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:27:23,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 22:27:23,604 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 22:27:23,605 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 22:27:23,605 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:27:23,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 22:27:23,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-12-27 22:27:23,606 INFO L87 Difference]: Start difference. First operand 16399 states and 55269 transitions. Second operand 10 states. [2019-12-27 22:27:24,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:27:24,297 INFO L93 Difference]: Finished difference Result 17183 states and 56862 transitions. [2019-12-27 22:27:24,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 22:27:24,297 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 28 [2019-12-27 22:27:24,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:27:24,325 INFO L225 Difference]: With dead ends: 17183 [2019-12-27 22:27:24,325 INFO L226 Difference]: Without dead ends: 16450 [2019-12-27 22:27:24,325 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2019-12-27 22:27:24,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16450 states. [2019-12-27 22:27:25,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16450 to 16248. [2019-12-27 22:27:25,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16248 states. [2019-12-27 22:27:25,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16248 states to 16248 states and 54801 transitions. [2019-12-27 22:27:25,149 INFO L78 Accepts]: Start accepts. Automaton has 16248 states and 54801 transitions. Word has length 28 [2019-12-27 22:27:25,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:27:25,149 INFO L462 AbstractCegarLoop]: Abstraction has 16248 states and 54801 transitions. [2019-12-27 22:27:25,149 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 22:27:25,149 INFO L276 IsEmpty]: Start isEmpty. Operand 16248 states and 54801 transitions. [2019-12-27 22:27:25,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-27 22:27:25,158 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:27:25,158 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:27:25,159 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:27:25,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:27:25,162 INFO L82 PathProgramCache]: Analyzing trace with hash -644546207, now seen corresponding path program 1 times [2019-12-27 22:27:25,163 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:27:25,163 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907695133] [2019-12-27 22:27:25,163 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:27:25,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:27:25,243 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 22:27:25,243 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907695133] [2019-12-27 22:27:25,243 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:27:25,244 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 22:27:25,244 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1215372595] [2019-12-27 22:27:25,244 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:27:25,249 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:27:25,269 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 73 states and 114 transitions. [2019-12-27 22:27:25,269 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:27:25,345 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 22:27:25,345 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 22:27:25,345 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:27:25,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 22:27:25,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-27 22:27:25,346 INFO L87 Difference]: Start difference. First operand 16248 states and 54801 transitions. Second operand 8 states. [2019-12-27 22:27:26,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:27:26,229 INFO L93 Difference]: Finished difference Result 27826 states and 91774 transitions. [2019-12-27 22:27:26,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 22:27:26,229 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 30 [2019-12-27 22:27:26,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:27:26,281 INFO L225 Difference]: With dead ends: 27826 [2019-12-27 22:27:26,282 INFO L226 Difference]: Without dead ends: 27826 [2019-12-27 22:27:26,282 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-12-27 22:27:26,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27826 states. [2019-12-27 22:27:26,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27826 to 23161. [2019-12-27 22:27:26,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23161 states. [2019-12-27 22:27:26,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23161 states to 23161 states and 76816 transitions. [2019-12-27 22:27:26,711 INFO L78 Accepts]: Start accepts. Automaton has 23161 states and 76816 transitions. Word has length 30 [2019-12-27 22:27:26,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:27:26,711 INFO L462 AbstractCegarLoop]: Abstraction has 23161 states and 76816 transitions. [2019-12-27 22:27:26,711 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 22:27:26,711 INFO L276 IsEmpty]: Start isEmpty. Operand 23161 states and 76816 transitions. [2019-12-27 22:27:26,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-27 22:27:26,727 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:27:26,727 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:27:26,727 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:27:26,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:27:26,727 INFO L82 PathProgramCache]: Analyzing trace with hash -1317217445, now seen corresponding path program 1 times [2019-12-27 22:27:26,728 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:27:26,728 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947464106] [2019-12-27 22:27:26,728 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:27:26,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:27:26,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:27:26,790 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947464106] [2019-12-27 22:27:26,790 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:27:26,790 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 22:27:26,791 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [475375542] [2019-12-27 22:27:26,791 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:27:26,796 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:27:26,817 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 76 states and 119 transitions. [2019-12-27 22:27:26,817 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:27:26,853 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 22:27:26,853 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 22:27:26,853 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:27:26,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 22:27:26,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-27 22:27:26,854 INFO L87 Difference]: Start difference. First operand 23161 states and 76816 transitions. Second operand 6 states. [2019-12-27 22:27:26,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:27:26,967 INFO L93 Difference]: Finished difference Result 10282 states and 31302 transitions. [2019-12-27 22:27:26,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 22:27:26,967 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2019-12-27 22:27:26,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:27:26,983 INFO L225 Difference]: With dead ends: 10282 [2019-12-27 22:27:26,983 INFO L226 Difference]: Without dead ends: 8611 [2019-12-27 22:27:26,984 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-12-27 22:27:27,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8611 states. [2019-12-27 22:27:27,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8611 to 8551. [2019-12-27 22:27:27,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8551 states. [2019-12-27 22:27:27,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8551 states to 8551 states and 25786 transitions. [2019-12-27 22:27:27,103 INFO L78 Accepts]: Start accepts. Automaton has 8551 states and 25786 transitions. Word has length 31 [2019-12-27 22:27:27,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:27:27,103 INFO L462 AbstractCegarLoop]: Abstraction has 8551 states and 25786 transitions. [2019-12-27 22:27:27,103 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 22:27:27,103 INFO L276 IsEmpty]: Start isEmpty. Operand 8551 states and 25786 transitions. [2019-12-27 22:27:27,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 22:27:27,112 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:27:27,112 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 22:27:27,113 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:27:27,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:27:27,113 INFO L82 PathProgramCache]: Analyzing trace with hash -1811345120, now seen corresponding path program 1 times [2019-12-27 22:27:27,113 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:27:27,114 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893981030] [2019-12-27 22:27:27,114 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:27:27,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:27:27,216 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 22:27:27,217 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893981030] [2019-12-27 22:27:27,217 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:27:27,217 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 22:27:27,217 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [235224744] [2019-12-27 22:27:27,218 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:27:27,226 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:27:27,342 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 123 states and 204 transitions. [2019-12-27 22:27:27,342 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:27:27,343 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:27:27,343 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 22:27:27,343 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:27:27,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 22:27:27,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-27 22:27:27,344 INFO L87 Difference]: Start difference. First operand 8551 states and 25786 transitions. Second operand 6 states. [2019-12-27 22:27:27,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:27:27,433 INFO L93 Difference]: Finished difference Result 7616 states and 23344 transitions. [2019-12-27 22:27:27,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 22:27:27,434 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2019-12-27 22:27:27,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:27:27,445 INFO L225 Difference]: With dead ends: 7616 [2019-12-27 22:27:27,445 INFO L226 Difference]: Without dead ends: 7058 [2019-12-27 22:27:27,446 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-27 22:27:27,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7058 states. [2019-12-27 22:27:27,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7058 to 6734. [2019-12-27 22:27:27,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6734 states. [2019-12-27 22:27:27,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6734 states to 6734 states and 21260 transitions. [2019-12-27 22:27:27,542 INFO L78 Accepts]: Start accepts. Automaton has 6734 states and 21260 transitions. Word has length 40 [2019-12-27 22:27:27,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:27:27,542 INFO L462 AbstractCegarLoop]: Abstraction has 6734 states and 21260 transitions. [2019-12-27 22:27:27,542 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 22:27:27,542 INFO L276 IsEmpty]: Start isEmpty. Operand 6734 states and 21260 transitions. [2019-12-27 22:27:27,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 22:27:27,549 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:27:27,549 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] [2019-12-27 22:27:27,549 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:27:27,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:27:27,550 INFO L82 PathProgramCache]: Analyzing trace with hash -1310502252, now seen corresponding path program 1 times [2019-12-27 22:27:27,550 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:27:27,550 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760212570] [2019-12-27 22:27:27,550 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:27:27,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:27:27,659 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 22:27:27,659 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760212570] [2019-12-27 22:27:27,659 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:27:27,660 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 22:27:27,660 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [150321256] [2019-12-27 22:27:27,660 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:27:27,677 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:27:27,783 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 124 states and 202 transitions. [2019-12-27 22:27:27,783 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:27:27,973 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 13 times. [2019-12-27 22:27:27,973 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 22:27:27,974 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:27:27,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 22:27:27,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-12-27 22:27:27,974 INFO L87 Difference]: Start difference. First operand 6734 states and 21260 transitions. Second operand 10 states. [2019-12-27 22:27:30,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:27:30,124 INFO L93 Difference]: Finished difference Result 33683 states and 105081 transitions. [2019-12-27 22:27:30,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-12-27 22:27:30,125 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 54 [2019-12-27 22:27:30,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:27:30,159 INFO L225 Difference]: With dead ends: 33683 [2019-12-27 22:27:30,160 INFO L226 Difference]: Without dead ends: 23268 [2019-12-27 22:27:30,161 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 8 SyntacticMatches, 6 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 405 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=409, Invalid=1231, Unknown=0, NotChecked=0, Total=1640 [2019-12-27 22:27:30,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23268 states. [2019-12-27 22:27:30,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23268 to 10173. [2019-12-27 22:27:30,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10173 states. [2019-12-27 22:27:30,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10173 states to 10173 states and 32578 transitions. [2019-12-27 22:27:30,397 INFO L78 Accepts]: Start accepts. Automaton has 10173 states and 32578 transitions. Word has length 54 [2019-12-27 22:27:30,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:27:30,398 INFO L462 AbstractCegarLoop]: Abstraction has 10173 states and 32578 transitions. [2019-12-27 22:27:30,398 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 22:27:30,398 INFO L276 IsEmpty]: Start isEmpty. Operand 10173 states and 32578 transitions. [2019-12-27 22:27:30,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 22:27:30,409 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:27:30,410 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] [2019-12-27 22:27:30,410 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:27:30,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:27:30,410 INFO L82 PathProgramCache]: Analyzing trace with hash 852703704, now seen corresponding path program 2 times [2019-12-27 22:27:30,410 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:27:30,411 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859063978] [2019-12-27 22:27:30,411 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:27:30,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:27:30,508 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 22:27:30,508 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859063978] [2019-12-27 22:27:30,508 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:27:30,508 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 22:27:30,509 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [307610927] [2019-12-27 22:27:30,509 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:27:30,593 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:27:30,722 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 132 states and 219 transitions. [2019-12-27 22:27:30,722 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:27:30,810 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 22:27:30,810 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 22:27:30,811 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:27:30,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 22:27:30,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-12-27 22:27:30,811 INFO L87 Difference]: Start difference. First operand 10173 states and 32578 transitions. Second operand 11 states. [2019-12-27 22:27:32,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:27:32,018 INFO L93 Difference]: Finished difference Result 21081 states and 66065 transitions. [2019-12-27 22:27:32,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 22:27:32,018 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 54 [2019-12-27 22:27:32,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:27:32,043 INFO L225 Difference]: With dead ends: 21081 [2019-12-27 22:27:32,043 INFO L226 Difference]: Without dead ends: 16329 [2019-12-27 22:27:32,043 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=392, Unknown=0, NotChecked=0, Total=506 [2019-12-27 22:27:32,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16329 states. [2019-12-27 22:27:32,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16329 to 10837. [2019-12-27 22:27:32,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10837 states. [2019-12-27 22:27:32,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10837 states to 10837 states and 34353 transitions. [2019-12-27 22:27:32,226 INFO L78 Accepts]: Start accepts. Automaton has 10837 states and 34353 transitions. Word has length 54 [2019-12-27 22:27:32,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:27:32,226 INFO L462 AbstractCegarLoop]: Abstraction has 10837 states and 34353 transitions. [2019-12-27 22:27:32,226 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 22:27:32,226 INFO L276 IsEmpty]: Start isEmpty. Operand 10837 states and 34353 transitions. [2019-12-27 22:27:32,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 22:27:32,238 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:27:32,239 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] [2019-12-27 22:27:32,239 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:27:32,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:27:32,239 INFO L82 PathProgramCache]: Analyzing trace with hash 790126390, now seen corresponding path program 1 times [2019-12-27 22:27:32,240 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:27:32,240 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892262736] [2019-12-27 22:27:32,240 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:27:32,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:27:32,285 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 22:27:32,286 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892262736] [2019-12-27 22:27:32,286 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:27:32,286 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 22:27:32,287 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1438634915] [2019-12-27 22:27:32,287 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:27:32,304 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:27:32,403 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 124 states and 202 transitions. [2019-12-27 22:27:32,403 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:27:32,424 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 22:27:32,425 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 22:27:32,425 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:27:32,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 22:27:32,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 22:27:32,426 INFO L87 Difference]: Start difference. First operand 10837 states and 34353 transitions. Second operand 4 states. [2019-12-27 22:27:32,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:27:32,712 INFO L93 Difference]: Finished difference Result 18212 states and 57219 transitions. [2019-12-27 22:27:32,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 22:27:32,713 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2019-12-27 22:27:32,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:27:32,738 INFO L225 Difference]: With dead ends: 18212 [2019-12-27 22:27:32,739 INFO L226 Difference]: Without dead ends: 18212 [2019-12-27 22:27:32,739 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 22:27:32,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18212 states. [2019-12-27 22:27:33,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18212 to 13118. [2019-12-27 22:27:33,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13118 states. [2019-12-27 22:27:33,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13118 states to 13118 states and 41651 transitions. [2019-12-27 22:27:33,064 INFO L78 Accepts]: Start accepts. Automaton has 13118 states and 41651 transitions. Word has length 54 [2019-12-27 22:27:33,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:27:33,064 INFO L462 AbstractCegarLoop]: Abstraction has 13118 states and 41651 transitions. [2019-12-27 22:27:33,064 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 22:27:33,064 INFO L276 IsEmpty]: Start isEmpty. Operand 13118 states and 41651 transitions. [2019-12-27 22:27:33,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 22:27:33,082 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:27:33,082 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] [2019-12-27 22:27:33,083 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:27:33,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:27:33,083 INFO L82 PathProgramCache]: Analyzing trace with hash -1420258542, now seen corresponding path program 3 times [2019-12-27 22:27:33,084 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:27:33,084 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358026383] [2019-12-27 22:27:33,084 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:27:33,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:27:33,176 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 22:27:33,178 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358026383] [2019-12-27 22:27:33,178 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:27:33,178 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 22:27:33,178 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1161959747] [2019-12-27 22:27:33,178 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:27:33,217 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:27:33,309 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 123 states and 196 transitions. [2019-12-27 22:27:33,309 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:27:33,439 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 17 times. [2019-12-27 22:27:33,440 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 22:27:33,440 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:27:33,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 22:27:33,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 22:27:33,440 INFO L87 Difference]: Start difference. First operand 13118 states and 41651 transitions. Second operand 9 states. [2019-12-27 22:27:34,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:27:34,394 INFO L93 Difference]: Finished difference Result 29812 states and 92895 transitions. [2019-12-27 22:27:34,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 22:27:34,395 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 54 [2019-12-27 22:27:34,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:27:34,429 INFO L225 Difference]: With dead ends: 29812 [2019-12-27 22:27:34,429 INFO L226 Difference]: Without dead ends: 22693 [2019-12-27 22:27:34,430 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 10 SyntacticMatches, 8 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=98, Invalid=322, Unknown=0, NotChecked=0, Total=420 [2019-12-27 22:27:34,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22693 states. [2019-12-27 22:27:34,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22693 to 13263. [2019-12-27 22:27:34,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13263 states. [2019-12-27 22:27:34,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13263 states to 13263 states and 42105 transitions. [2019-12-27 22:27:34,679 INFO L78 Accepts]: Start accepts. Automaton has 13263 states and 42105 transitions. Word has length 54 [2019-12-27 22:27:34,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:27:34,679 INFO L462 AbstractCegarLoop]: Abstraction has 13263 states and 42105 transitions. [2019-12-27 22:27:34,679 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 22:27:34,679 INFO L276 IsEmpty]: Start isEmpty. Operand 13263 states and 42105 transitions. [2019-12-27 22:27:34,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 22:27:34,694 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:27:34,694 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] [2019-12-27 22:27:34,694 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:27:34,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:27:34,695 INFO L82 PathProgramCache]: Analyzing trace with hash 1006929596, now seen corresponding path program 4 times [2019-12-27 22:27:34,695 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:27:34,695 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621160974] [2019-12-27 22:27:34,695 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:27:34,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:27:34,799 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 22:27:34,800 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621160974] [2019-12-27 22:27:34,800 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:27:34,800 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 22:27:34,800 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1078805727] [2019-12-27 22:27:34,800 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:27:34,816 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:27:34,918 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 147 states and 243 transitions. [2019-12-27 22:27:34,918 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:27:35,090 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 21 times. [2019-12-27 22:27:35,090 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 22:27:35,090 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:27:35,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 22:27:35,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-12-27 22:27:35,091 INFO L87 Difference]: Start difference. First operand 13263 states and 42105 transitions. Second operand 12 states. [2019-12-27 22:27:37,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:27:37,455 INFO L93 Difference]: Finished difference Result 52419 states and 159312 transitions. [2019-12-27 22:27:37,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-12-27 22:27:37,456 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 54 [2019-12-27 22:27:37,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:27:37,521 INFO L225 Difference]: With dead ends: 52419 [2019-12-27 22:27:37,521 INFO L226 Difference]: Without dead ends: 45266 [2019-12-27 22:27:37,523 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 12 SyntacticMatches, 12 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 893 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=608, Invalid=2148, Unknown=0, NotChecked=0, Total=2756 [2019-12-27 22:27:37,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45266 states. [2019-12-27 22:27:37,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45266 to 13102. [2019-12-27 22:27:37,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13102 states. [2019-12-27 22:27:37,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13102 states to 13102 states and 41603 transitions. [2019-12-27 22:27:37,932 INFO L78 Accepts]: Start accepts. Automaton has 13102 states and 41603 transitions. Word has length 54 [2019-12-27 22:27:37,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:27:37,932 INFO L462 AbstractCegarLoop]: Abstraction has 13102 states and 41603 transitions. [2019-12-27 22:27:37,932 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 22:27:37,933 INFO L276 IsEmpty]: Start isEmpty. Operand 13102 states and 41603 transitions. [2019-12-27 22:27:37,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 22:27:37,948 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:27:37,948 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] [2019-12-27 22:27:37,948 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:27:37,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:27:37,948 INFO L82 PathProgramCache]: Analyzing trace with hash 10868734, now seen corresponding path program 5 times [2019-12-27 22:27:37,949 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:27:37,949 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153415956] [2019-12-27 22:27:37,949 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:27:37,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:27:38,036 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 22:27:38,036 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153415956] [2019-12-27 22:27:38,036 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:27:38,036 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 22:27:38,037 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [797016749] [2019-12-27 22:27:38,037 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:27:38,052 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:27:38,145 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 129 states and 212 transitions. [2019-12-27 22:27:38,145 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:27:38,206 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 22:27:38,206 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 22:27:38,207 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:27:38,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 22:27:38,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-12-27 22:27:38,207 INFO L87 Difference]: Start difference. First operand 13102 states and 41603 transitions. Second operand 9 states. [2019-12-27 22:27:39,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:27:39,945 INFO L93 Difference]: Finished difference Result 37523 states and 115482 transitions. [2019-12-27 22:27:39,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 22:27:39,946 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 54 [2019-12-27 22:27:39,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:27:40,017 INFO L225 Difference]: With dead ends: 37523 [2019-12-27 22:27:40,017 INFO L226 Difference]: Without dead ends: 37413 [2019-12-27 22:27:40,018 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=100, Invalid=206, Unknown=0, NotChecked=0, Total=306 [2019-12-27 22:27:40,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37413 states. [2019-12-27 22:27:40,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37413 to 16407. [2019-12-27 22:27:40,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16407 states. [2019-12-27 22:27:40,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16407 states to 16407 states and 51408 transitions. [2019-12-27 22:27:40,445 INFO L78 Accepts]: Start accepts. Automaton has 16407 states and 51408 transitions. Word has length 54 [2019-12-27 22:27:40,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:27:40,446 INFO L462 AbstractCegarLoop]: Abstraction has 16407 states and 51408 transitions. [2019-12-27 22:27:40,446 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 22:27:40,446 INFO L276 IsEmpty]: Start isEmpty. Operand 16407 states and 51408 transitions. [2019-12-27 22:27:40,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 22:27:40,466 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:27:40,466 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] [2019-12-27 22:27:40,467 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:27:40,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:27:40,467 INFO L82 PathProgramCache]: Analyzing trace with hash -2135249694, now seen corresponding path program 6 times [2019-12-27 22:27:40,467 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:27:40,468 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273455331] [2019-12-27 22:27:40,468 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:27:40,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:27:40,570 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 22:27:40,571 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273455331] [2019-12-27 22:27:40,571 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:27:40,571 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 22:27:40,571 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [832211780] [2019-12-27 22:27:40,572 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:27:40,586 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:27:40,703 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 164 states and 300 transitions. [2019-12-27 22:27:40,703 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:27:40,762 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 22:27:40,763 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 22:27:40,763 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:27:40,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 22:27:40,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-12-27 22:27:40,764 INFO L87 Difference]: Start difference. First operand 16407 states and 51408 transitions. Second operand 9 states. [2019-12-27 22:27:42,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:27:42,149 INFO L93 Difference]: Finished difference Result 23952 states and 73288 transitions. [2019-12-27 22:27:42,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 22:27:42,150 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 54 [2019-12-27 22:27:42,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:27:42,318 INFO L225 Difference]: With dead ends: 23952 [2019-12-27 22:27:42,319 INFO L226 Difference]: Without dead ends: 23952 [2019-12-27 22:27:42,324 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 9 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2019-12-27 22:27:42,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23952 states. [2019-12-27 22:27:42,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23952 to 17955. [2019-12-27 22:27:42,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17955 states. [2019-12-27 22:27:42,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17955 states to 17955 states and 55638 transitions. [2019-12-27 22:27:42,624 INFO L78 Accepts]: Start accepts. Automaton has 17955 states and 55638 transitions. Word has length 54 [2019-12-27 22:27:42,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:27:42,624 INFO L462 AbstractCegarLoop]: Abstraction has 17955 states and 55638 transitions. [2019-12-27 22:27:42,624 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 22:27:42,624 INFO L276 IsEmpty]: Start isEmpty. Operand 17955 states and 55638 transitions. [2019-12-27 22:27:42,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 22:27:42,647 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:27:42,647 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] [2019-12-27 22:27:42,647 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:27:42,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:27:42,647 INFO L82 PathProgramCache]: Analyzing trace with hash -40975946, now seen corresponding path program 7 times [2019-12-27 22:27:42,648 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:27:42,648 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751864069] [2019-12-27 22:27:42,648 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:27:42,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:27:42,773 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 22:27:42,774 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751864069] [2019-12-27 22:27:42,774 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:27:42,774 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 22:27:42,774 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [381716021] [2019-12-27 22:27:42,774 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:27:42,788 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:27:42,910 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 169 states and 312 transitions. [2019-12-27 22:27:42,911 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:27:43,004 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 22:27:43,005 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 22:27:43,005 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:27:43,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 22:27:43,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2019-12-27 22:27:43,006 INFO L87 Difference]: Start difference. First operand 17955 states and 55638 transitions. Second operand 13 states. [2019-12-27 22:27:46,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:27:46,767 INFO L93 Difference]: Finished difference Result 49287 states and 148655 transitions. [2019-12-27 22:27:46,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-12-27 22:27:46,767 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 54 [2019-12-27 22:27:46,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:27:46,836 INFO L225 Difference]: With dead ends: 49287 [2019-12-27 22:27:46,837 INFO L226 Difference]: Without dead ends: 49287 [2019-12-27 22:27:46,837 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 421 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=366, Invalid=1356, Unknown=0, NotChecked=0, Total=1722 [2019-12-27 22:27:46,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49287 states. [2019-12-27 22:27:47,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49287 to 18037. [2019-12-27 22:27:47,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18037 states. [2019-12-27 22:27:47,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18037 states to 18037 states and 55889 transitions. [2019-12-27 22:27:47,306 INFO L78 Accepts]: Start accepts. Automaton has 18037 states and 55889 transitions. Word has length 54 [2019-12-27 22:27:47,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:27:47,306 INFO L462 AbstractCegarLoop]: Abstraction has 18037 states and 55889 transitions. [2019-12-27 22:27:47,306 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 22:27:47,306 INFO L276 IsEmpty]: Start isEmpty. Operand 18037 states and 55889 transitions. [2019-12-27 22:27:47,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 22:27:47,324 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:27:47,324 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] [2019-12-27 22:27:47,324 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:27:47,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:27:47,324 INFO L82 PathProgramCache]: Analyzing trace with hash -615002602, now seen corresponding path program 8 times [2019-12-27 22:27:47,325 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:27:47,325 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606694343] [2019-12-27 22:27:47,325 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:27:47,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:27:47,376 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 22:27:47,377 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606694343] [2019-12-27 22:27:47,377 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:27:47,377 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 22:27:47,377 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [958306384] [2019-12-27 22:27:47,377 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:27:47,392 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:27:47,535 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 210 states and 384 transitions. [2019-12-27 22:27:47,535 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:27:47,542 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 22:27:47,543 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 22:27:47,543 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:27:47,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 22:27:47,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 22:27:47,544 INFO L87 Difference]: Start difference. First operand 18037 states and 55889 transitions. Second operand 4 states. [2019-12-27 22:27:47,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:27:47,759 INFO L93 Difference]: Finished difference Result 15588 states and 47636 transitions. [2019-12-27 22:27:47,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 22:27:47,760 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2019-12-27 22:27:47,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:27:47,781 INFO L225 Difference]: With dead ends: 15588 [2019-12-27 22:27:47,782 INFO L226 Difference]: Without dead ends: 15588 [2019-12-27 22:27:47,782 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 22:27:47,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15588 states. [2019-12-27 22:27:47,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15588 to 11599. [2019-12-27 22:27:47,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11599 states. [2019-12-27 22:27:47,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11599 states to 11599 states and 35739 transitions. [2019-12-27 22:27:47,973 INFO L78 Accepts]: Start accepts. Automaton has 11599 states and 35739 transitions. Word has length 54 [2019-12-27 22:27:47,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:27:47,973 INFO L462 AbstractCegarLoop]: Abstraction has 11599 states and 35739 transitions. [2019-12-27 22:27:47,974 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 22:27:47,974 INFO L276 IsEmpty]: Start isEmpty. Operand 11599 states and 35739 transitions. [2019-12-27 22:27:47,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 22:27:47,987 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:27:47,987 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] [2019-12-27 22:27:47,987 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:27:47,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:27:47,987 INFO L82 PathProgramCache]: Analyzing trace with hash 229584518, now seen corresponding path program 1 times [2019-12-27 22:27:47,988 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:27:47,988 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13027676] [2019-12-27 22:27:47,988 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:27:48,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:27:48,095 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 22:27:48,095 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13027676] [2019-12-27 22:27:48,096 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:27:48,096 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 22:27:48,096 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [247560837] [2019-12-27 22:27:48,096 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:27:48,175 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:27:48,291 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 120 states and 191 transitions. [2019-12-27 22:27:48,291 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:27:48,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 22:27:48,413 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 22:27:48,413 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 22:27:48,413 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:27:48,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 22:27:48,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-12-27 22:27:48,414 INFO L87 Difference]: Start difference. First operand 11599 states and 35739 transitions. Second operand 11 states. [2019-12-27 22:27:49,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:27:49,520 INFO L93 Difference]: Finished difference Result 15321 states and 46137 transitions. [2019-12-27 22:27:49,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 22:27:49,520 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 55 [2019-12-27 22:27:49,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:27:49,542 INFO L225 Difference]: With dead ends: 15321 [2019-12-27 22:27:49,542 INFO L226 Difference]: Without dead ends: 15213 [2019-12-27 22:27:49,542 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2019-12-27 22:27:49,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15213 states. [2019-12-27 22:27:49,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15213 to 13099. [2019-12-27 22:27:49,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13099 states. [2019-12-27 22:27:49,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13099 states to 13099 states and 40011 transitions. [2019-12-27 22:27:49,729 INFO L78 Accepts]: Start accepts. Automaton has 13099 states and 40011 transitions. Word has length 55 [2019-12-27 22:27:49,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:27:49,729 INFO L462 AbstractCegarLoop]: Abstraction has 13099 states and 40011 transitions. [2019-12-27 22:27:49,729 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 22:27:49,729 INFO L276 IsEmpty]: Start isEmpty. Operand 13099 states and 40011 transitions. [2019-12-27 22:27:49,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 22:27:49,743 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:27:49,743 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] [2019-12-27 22:27:49,743 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:27:49,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:27:49,744 INFO L82 PathProgramCache]: Analyzing trace with hash 177739838, now seen corresponding path program 2 times [2019-12-27 22:27:49,744 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:27:49,744 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476791599] [2019-12-27 22:27:49,745 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:27:49,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:27:49,898 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 22:27:49,898 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476791599] [2019-12-27 22:27:49,899 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:27:49,899 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 22:27:49,899 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2001070761] [2019-12-27 22:27:49,899 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:27:49,914 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:27:50,075 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 159 states and 289 transitions. [2019-12-27 22:27:50,076 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:27:50,293 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 12 times. [2019-12-27 22:27:50,294 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 22:27:50,294 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:27:50,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 22:27:50,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2019-12-27 22:27:50,295 INFO L87 Difference]: Start difference. First operand 13099 states and 40011 transitions. Second operand 15 states. [2019-12-27 22:27:51,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:27:51,267 INFO L93 Difference]: Finished difference Result 21643 states and 64887 transitions. [2019-12-27 22:27:51,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-27 22:27:51,267 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 55 [2019-12-27 22:27:51,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:27:51,289 INFO L225 Difference]: With dead ends: 21643 [2019-12-27 22:27:51,289 INFO L226 Difference]: Without dead ends: 14944 [2019-12-27 22:27:51,289 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 3 SyntacticMatches, 7 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 207 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=203, Invalid=853, Unknown=0, NotChecked=0, Total=1056 [2019-12-27 22:27:51,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14944 states. [2019-12-27 22:27:51,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14944 to 13569. [2019-12-27 22:27:51,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13569 states. [2019-12-27 22:27:51,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13569 states to 13569 states and 40745 transitions. [2019-12-27 22:27:51,573 INFO L78 Accepts]: Start accepts. Automaton has 13569 states and 40745 transitions. Word has length 55 [2019-12-27 22:27:51,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:27:51,573 INFO L462 AbstractCegarLoop]: Abstraction has 13569 states and 40745 transitions. [2019-12-27 22:27:51,573 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 22:27:51,573 INFO L276 IsEmpty]: Start isEmpty. Operand 13569 states and 40745 transitions. [2019-12-27 22:27:51,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 22:27:51,587 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:27:51,587 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] [2019-12-27 22:27:51,587 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:27:51,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:27:51,587 INFO L82 PathProgramCache]: Analyzing trace with hash 156067680, now seen corresponding path program 3 times [2019-12-27 22:27:51,588 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:27:51,588 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959271435] [2019-12-27 22:27:51,588 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:27:51,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:27:51,893 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 22:27:51,894 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959271435] [2019-12-27 22:27:51,894 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:27:51,894 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-27 22:27:51,894 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [693973366] [2019-12-27 22:27:51,894 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:27:51,909 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:27:52,037 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 137 states and 225 transitions. [2019-12-27 22:27:52,037 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:27:52,528 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 23 times. [2019-12-27 22:27:52,528 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-27 22:27:52,529 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:27:52,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-27 22:27:52,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2019-12-27 22:27:52,530 INFO L87 Difference]: Start difference. First operand 13569 states and 40745 transitions. Second operand 19 states. [2019-12-27 22:27:57,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:27:57,344 INFO L93 Difference]: Finished difference Result 27733 states and 83370 transitions. [2019-12-27 22:27:57,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-12-27 22:27:57,345 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 55 [2019-12-27 22:27:57,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:27:57,386 INFO L225 Difference]: With dead ends: 27733 [2019-12-27 22:27:57,386 INFO L226 Difference]: Without dead ends: 27647 [2019-12-27 22:27:57,387 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 9 SyntacticMatches, 11 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1337 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=627, Invalid=3929, Unknown=0, NotChecked=0, Total=4556 [2019-12-27 22:27:57,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27647 states. [2019-12-27 22:27:57,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27647 to 13910. [2019-12-27 22:27:57,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13910 states. [2019-12-27 22:27:57,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13910 states to 13910 states and 41507 transitions. [2019-12-27 22:27:57,660 INFO L78 Accepts]: Start accepts. Automaton has 13910 states and 41507 transitions. Word has length 55 [2019-12-27 22:27:57,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:27:57,660 INFO L462 AbstractCegarLoop]: Abstraction has 13910 states and 41507 transitions. [2019-12-27 22:27:57,660 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-27 22:27:57,660 INFO L276 IsEmpty]: Start isEmpty. Operand 13910 states and 41507 transitions. [2019-12-27 22:27:57,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 22:27:57,673 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:27:57,673 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] [2019-12-27 22:27:57,674 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:27:57,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:27:57,674 INFO L82 PathProgramCache]: Analyzing trace with hash -2082454770, now seen corresponding path program 4 times [2019-12-27 22:27:57,674 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:27:57,674 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955008523] [2019-12-27 22:27:57,675 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:27:57,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:27:57,847 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 22:27:57,848 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955008523] [2019-12-27 22:27:57,848 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:27:57,848 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 22:27:57,848 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1649367462] [2019-12-27 22:27:57,848 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:27:57,862 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:27:57,992 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 162 states and 294 transitions. [2019-12-27 22:27:57,992 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:27:58,205 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 22:27:58,206 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 22:27:58,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 22:27:58,322 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 22:27:58,449 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 22:27:58,470 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 21 times. [2019-12-27 22:27:58,470 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-12-27 22:27:58,470 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:27:58,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-12-27 22:27:58,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2019-12-27 22:27:58,471 INFO L87 Difference]: Start difference. First operand 13910 states and 41507 transitions. Second operand 21 states. [2019-12-27 22:27:59,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:27:59,617 INFO L93 Difference]: Finished difference Result 16204 states and 47085 transitions. [2019-12-27 22:27:59,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-27 22:27:59,617 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 55 [2019-12-27 22:27:59,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:27:59,641 INFO L225 Difference]: With dead ends: 16204 [2019-12-27 22:27:59,641 INFO L226 Difference]: Without dead ends: 14553 [2019-12-27 22:27:59,642 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 7 SyntacticMatches, 7 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 337 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=263, Invalid=1297, Unknown=0, NotChecked=0, Total=1560 [2019-12-27 22:27:59,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14553 states. [2019-12-27 22:27:59,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14553 to 13071. [2019-12-27 22:27:59,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13071 states. [2019-12-27 22:27:59,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13071 states to 13071 states and 39440 transitions. [2019-12-27 22:27:59,858 INFO L78 Accepts]: Start accepts. Automaton has 13071 states and 39440 transitions. Word has length 55 [2019-12-27 22:27:59,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:27:59,859 INFO L462 AbstractCegarLoop]: Abstraction has 13071 states and 39440 transitions. [2019-12-27 22:27:59,859 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-12-27 22:27:59,859 INFO L276 IsEmpty]: Start isEmpty. Operand 13071 states and 39440 transitions. [2019-12-27 22:27:59,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 22:27:59,875 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:27:59,875 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] [2019-12-27 22:27:59,875 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:27:59,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:27:59,875 INFO L82 PathProgramCache]: Analyzing trace with hash 594712828, now seen corresponding path program 5 times [2019-12-27 22:27:59,876 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:27:59,876 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126189232] [2019-12-27 22:27:59,876 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:27:59,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:27:59,936 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 22:27:59,937 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126189232] [2019-12-27 22:27:59,937 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:27:59,937 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 22:27:59,937 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1374681247] [2019-12-27 22:27:59,937 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:27:59,951 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:28:00,155 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 117 states and 183 transitions. [2019-12-27 22:28:00,156 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:28:00,156 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:28:00,156 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 22:28:00,157 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:28:00,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 22:28:00,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:28:00,157 INFO L87 Difference]: Start difference. First operand 13071 states and 39440 transitions. Second operand 3 states. [2019-12-27 22:28:00,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:28:00,215 INFO L93 Difference]: Finished difference Result 13069 states and 39435 transitions. [2019-12-27 22:28:00,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 22:28:00,216 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-27 22:28:00,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:28:00,238 INFO L225 Difference]: With dead ends: 13069 [2019-12-27 22:28:00,238 INFO L226 Difference]: Without dead ends: 13069 [2019-12-27 22:28:00,240 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 22:28:00,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13069 states. [2019-12-27 22:28:00,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13069 to 12007. [2019-12-27 22:28:00,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12007 states. [2019-12-27 22:28:00,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12007 states to 12007 states and 36535 transitions. [2019-12-27 22:28:00,425 INFO L78 Accepts]: Start accepts. Automaton has 12007 states and 36535 transitions. Word has length 55 [2019-12-27 22:28:00,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:28:00,425 INFO L462 AbstractCegarLoop]: Abstraction has 12007 states and 36535 transitions. [2019-12-27 22:28:00,425 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 22:28:00,425 INFO L276 IsEmpty]: Start isEmpty. Operand 12007 states and 36535 transitions. [2019-12-27 22:28:00,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 22:28:00,437 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:28:00,438 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] [2019-12-27 22:28:00,438 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:28:00,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:28:00,438 INFO L82 PathProgramCache]: Analyzing trace with hash -1554893024, now seen corresponding path program 1 times [2019-12-27 22:28:00,438 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:28:00,439 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607679888] [2019-12-27 22:28:00,439 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:28:00,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 22:28:00,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 22:28:00,556 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 22:28:00,557 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 22:28:00,561 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [813] [813] ULTIMATE.startENTRY-->L818: Formula: (let ((.cse0 (store |v_#valid_64| 0 0))) (and (= v_~main$tmp_guard0~0_10 0) (= v_~main$tmp_guard1~0_16 0) (= v_~x$r_buff1_thd1~0_42 0) (= 0 v_~__unbuffered_cnt~0_20) (= 0 v_~x$w_buff1~0_25) (= 0 v_~x$r_buff0_thd1~0_72) (= 0 v_~__unbuffered_p0_EAX~0_12) (= 0 v_~x$r_buff0_thd0~0_21) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t2055~0.base_25|)) (= v_~x$r_buff1_thd2~0_18 0) (= |v_#valid_62| (store .cse0 |v_ULTIMATE.start_main_~#t2055~0.base_25| 1)) (= v_~x$mem_tmp~0_9 0) (= 0 v_~x$read_delayed_var~0.base_7) (< 0 |v_#StackHeapBarrier_18|) (= 0 |v_#NULL.base_4|) (= 0 v_~weak$$choice2~0_33) (= 0 v_~weak$$choice0~0_7) (= 0 v_~x$read_delayed~0_7) (= v_~x$flush_delayed~0_12 0) (= 0 |v_ULTIMATE.start_main_~#t2055~0.offset_19|) (= 0 v_~__unbuffered_p2_EAX~0_12) (= v_~__unbuffered_p0_EBX~0_12 0) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t2055~0.base_25| 4)) (= |v_#NULL.offset_4| 0) (= 0 v_~x$w_buff0_used~0_114) (= v_~x~0_22 0) (= 0 v_~x$r_buff0_thd2~0_25) (= v_~y~0_10 0) (= 0 v_~x$r_buff0_thd3~0_19) (= 0 v_~x$read_delayed_var~0.offset_7) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2055~0.base_25| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2055~0.base_25|) |v_ULTIMATE.start_main_~#t2055~0.offset_19| 0)) |v_#memory_int_23|) (= 0 v_~z~0_8) (= 0 v_~x$w_buff0~0_31) (= v_~x$r_buff1_thd0~0_19 0) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t2055~0.base_25|) (= v_~x$r_buff1_thd3~0_16 0) (= v_~x$w_buff1_used~0_69 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_64|, #memory_int=|v_#memory_int_24|, #length=|v_#length_24|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_31, ~x$flush_delayed~0=v_~x$flush_delayed~0_12, #NULL.offset=|v_#NULL.offset_4|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_42, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_19, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_10|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_10|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_12, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_12, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_21, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_12, ~x$w_buff1~0=v_~x$w_buff1~0_25, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_69, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_18, ULTIMATE.start_main_~#t2056~0.base=|v_ULTIMATE.start_main_~#t2056~0.base_26|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, ~weak$$choice0~0=v_~weak$$choice0~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ULTIMATE.start_main_~#t2057~0.base=|v_ULTIMATE.start_main_~#t2057~0.base_21|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_20, ~x~0=v_~x~0_22, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_72, ULTIMATE.start_main_~#t2055~0.base=|v_ULTIMATE.start_main_~#t2055~0.base_25|, ULTIMATE.start_main_~#t2055~0.offset=|v_ULTIMATE.start_main_~#t2055~0.offset_19|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_17|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_16, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_16, ~x$mem_tmp~0=v_~x$mem_tmp~0_9, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_13|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_10|, ~y~0=v_~y~0_10, ULTIMATE.start_main_~#t2057~0.offset=|v_ULTIMATE.start_main_~#t2057~0.offset_14|, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_7|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_19, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_25, #NULL.base=|v_#NULL.base_4|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_114, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_12|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_~#t2056~0.offset=|v_ULTIMATE.start_main_~#t2056~0.offset_19|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_20|, #valid=|v_#valid_62|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_8|, ~z~0=v_~z~0_8, ~weak$$choice2~0=v_~weak$$choice2~0_33, ~x$read_delayed~0=v_~x$read_delayed~0_7} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$flush_delayed~0, #NULL.offset, ~x$r_buff1_thd1~0, ~x$r_buff0_thd3~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ~__unbuffered_p0_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~x$r_buff0_thd0~0, ~__unbuffered_p0_EBX~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_~#t2056~0.base, ~x$read_delayed_var~0.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~nondet38, ULTIMATE.start_main_~#t2057~0.base, ~__unbuffered_cnt~0, ~x~0, ~x$r_buff0_thd1~0, ULTIMATE.start_main_~#t2055~0.base, ULTIMATE.start_main_~#t2055~0.offset, ULTIMATE.start_main_#t~ite46, ~x$r_buff1_thd3~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ~y~0, ULTIMATE.start_main_~#t2057~0.offset, ULTIMATE.start_main_#t~nondet40, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, #NULL.base, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite41, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_~#t2056~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet39, ~z~0, ~weak$$choice2~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-27 22:28:00,562 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [780] [780] L818-1-->L820: Formula: (and (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t2056~0.base_10|) (= |v_#valid_31| (store |v_#valid_32| |v_ULTIMATE.start_main_~#t2056~0.base_10| 1)) (not (= 0 |v_ULTIMATE.start_main_~#t2056~0.base_10|)) (= |v_ULTIMATE.start_main_~#t2056~0.offset_9| 0) (= 0 (select |v_#valid_32| |v_ULTIMATE.start_main_~#t2056~0.base_10|)) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t2056~0.base_10| 4) |v_#length_15|) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2056~0.base_10| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2056~0.base_10|) |v_ULTIMATE.start_main_~#t2056~0.offset_9| 1)) |v_#memory_int_15|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t2056~0.offset=|v_ULTIMATE.start_main_~#t2056~0.offset_9|, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_4|, #length=|v_#length_15|, ULTIMATE.start_main_~#t2056~0.base=|v_ULTIMATE.start_main_~#t2056~0.base_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2056~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t2056~0.base] because there is no mapped edge [2019-12-27 22:28:00,563 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] L820-1-->L822: Formula: (and (= (store |v_#valid_30| |v_ULTIMATE.start_main_~#t2057~0.base_11| 1) |v_#valid_29|) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t2057~0.base_11|) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2057~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2057~0.base_11|) |v_ULTIMATE.start_main_~#t2057~0.offset_10| 2)) |v_#memory_int_13|) (not (= |v_ULTIMATE.start_main_~#t2057~0.base_11| 0)) (= (select |v_#valid_30| |v_ULTIMATE.start_main_~#t2057~0.base_11|) 0) (= |v_ULTIMATE.start_main_~#t2057~0.offset_10| 0) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t2057~0.base_11| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_30|, #memory_int=|v_#memory_int_14|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_~#t2057~0.offset=|v_ULTIMATE.start_main_~#t2057~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#t2057~0.base=|v_ULTIMATE.start_main_~#t2057~0.base_11|, #length=|v_#length_13|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2057~0.offset, #valid, #memory_int, ULTIMATE.start_main_~#t2057~0.base, #length, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-27 22:28:00,563 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [679] [679] P1ENTRY-->L5-3: Formula: (and (= v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_7 |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_5|) (= v_P1Thread1of1ForFork0_~arg.offset_5 |v_P1Thread1of1ForFork0_#in~arg.offset_5|) (= v_~x$w_buff1_used~0_42 v_~x$w_buff0_used~0_72) (= 0 (mod v_~x$w_buff1_used~0_42 256)) (= 1 v_~x$w_buff0_used~0_71) (= 1 v_~x$w_buff0~0_16) (= 1 |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_5|) (= v_~x$w_buff0~0_17 v_~x$w_buff1~0_13) (= v_P1Thread1of1ForFork0_~arg.base_5 |v_P1Thread1of1ForFork0_#in~arg.base_5|)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_17, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_5|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_5|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_72} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_16, P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_7, P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_5, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_5, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_5|, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_5|, ~x$w_buff1~0=v_~x$w_buff1~0_13, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_5|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_42, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_71} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression, P1Thread1of1ForFork0_~arg.offset, P1Thread1of1ForFork0_~arg.base, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$w_buff0_used~0] because there is no mapped edge [2019-12-27 22:28:00,566 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] L795-2-->L795-4: Formula: (let ((.cse0 (= (mod ~x$r_buff1_thd3~0_In267255739 256) 0)) (.cse1 (= (mod ~x$w_buff1_used~0_In267255739 256) 0))) (or (and (or .cse0 .cse1) (= ~x~0_In267255739 |P2Thread1of1ForFork1_#t~ite32_Out267255739|)) (and (not .cse0) (not .cse1) (= ~x$w_buff1~0_In267255739 |P2Thread1of1ForFork1_#t~ite32_Out267255739|)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In267255739, ~x$w_buff1_used~0=~x$w_buff1_used~0_In267255739, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In267255739, ~x~0=~x~0_In267255739} OutVars{P2Thread1of1ForFork1_#t~ite32=|P2Thread1of1ForFork1_#t~ite32_Out267255739|, ~x$w_buff1~0=~x$w_buff1~0_In267255739, ~x$w_buff1_used~0=~x$w_buff1_used~0_In267255739, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In267255739, ~x~0=~x~0_In267255739} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-27 22:28:00,567 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [680] [680] L795-4-->L796: Formula: (= v_~x~0_14 |v_P2Thread1of1ForFork1_#t~ite32_8|) InVars {P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_8|} OutVars{P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_7|, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_7|, ~x~0=v_~x~0_14} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite33, ~x~0] because there is no mapped edge [2019-12-27 22:28:00,567 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] L796-->L796-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd3~0_In166847850 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In166847850 256)))) (or (and (= ~x$w_buff0_used~0_In166847850 |P2Thread1of1ForFork1_#t~ite34_Out166847850|) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork1_#t~ite34_Out166847850|)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In166847850, ~x$w_buff0_used~0=~x$w_buff0_used~0_In166847850} OutVars{P2Thread1of1ForFork1_#t~ite34=|P2Thread1of1ForFork1_#t~ite34_Out166847850|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In166847850, ~x$w_buff0_used~0=~x$w_buff0_used~0_In166847850} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-27 22:28:00,568 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] L776-->L776-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd2~0_In-1843932393 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-1843932393 256)))) (or (and (= |P1Thread1of1ForFork0_#t~ite28_Out-1843932393| ~x$w_buff0_used~0_In-1843932393) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork0_#t~ite28_Out-1843932393|)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1843932393, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1843932393} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1843932393, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out-1843932393|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1843932393} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-27 22:28:00,568 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [742] [742] L777-->L777-2: Formula: (let ((.cse3 (= 0 (mod ~x$w_buff1_used~0_In402649809 256))) (.cse2 (= (mod ~x$r_buff1_thd2~0_In402649809 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In402649809 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In402649809 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork0_#t~ite29_Out402649809| 0)) (and (= |P1Thread1of1ForFork0_#t~ite29_Out402649809| ~x$w_buff1_used~0_In402649809) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In402649809, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In402649809, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In402649809, ~x$w_buff0_used~0=~x$w_buff0_used~0_In402649809} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In402649809, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In402649809, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In402649809, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out402649809|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In402649809} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-27 22:28:00,571 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [790] [790] L740-->L740-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1811447814 256)))) (or (and (= |P0Thread1of1ForFork2_#t~ite9_Out-1811447814| ~x$w_buff0~0_In-1811447814) (= |P0Thread1of1ForFork2_#t~ite8_In-1811447814| |P0Thread1of1ForFork2_#t~ite8_Out-1811447814|) (not .cse0)) (and .cse0 (let ((.cse1 (= (mod ~x$r_buff0_thd1~0_In-1811447814 256) 0))) (or (= 0 (mod ~x$w_buff0_used~0_In-1811447814 256)) (and .cse1 (= (mod ~x$r_buff1_thd1~0_In-1811447814 256) 0)) (and .cse1 (= (mod ~x$w_buff1_used~0_In-1811447814 256) 0)))) (= |P0Thread1of1ForFork2_#t~ite9_Out-1811447814| |P0Thread1of1ForFork2_#t~ite8_Out-1811447814|) (= ~x$w_buff0~0_In-1811447814 |P0Thread1of1ForFork2_#t~ite8_Out-1811447814|)))) InVars {~x$w_buff0~0=~x$w_buff0~0_In-1811447814, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1811447814, P0Thread1of1ForFork2_#t~ite8=|P0Thread1of1ForFork2_#t~ite8_In-1811447814|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1811447814, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1811447814, ~weak$$choice2~0=~weak$$choice2~0_In-1811447814, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1811447814} OutVars{~x$w_buff0~0=~x$w_buff0~0_In-1811447814, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1811447814, P0Thread1of1ForFork2_#t~ite8=|P0Thread1of1ForFork2_#t~ite8_Out-1811447814|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1811447814, P0Thread1of1ForFork2_#t~ite9=|P0Thread1of1ForFork2_#t~ite9_Out-1811447814|, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1811447814, ~weak$$choice2~0=~weak$$choice2~0_In-1811447814, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1811447814} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite8, P0Thread1of1ForFork2_#t~ite9] because there is no mapped edge [2019-12-27 22:28:00,572 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L742-->L742-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1933800339 256)))) (or (and (= |P0Thread1of1ForFork2_#t~ite15_Out-1933800339| |P0Thread1of1ForFork2_#t~ite14_Out-1933800339|) (= ~x$w_buff0_used~0_In-1933800339 |P0Thread1of1ForFork2_#t~ite14_Out-1933800339|) .cse0 (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In-1933800339 256)))) (or (= 0 (mod ~x$w_buff0_used~0_In-1933800339 256)) (and (= 0 (mod ~x$r_buff1_thd1~0_In-1933800339 256)) .cse1) (and (= 0 (mod ~x$w_buff1_used~0_In-1933800339 256)) .cse1)))) (and (= |P0Thread1of1ForFork2_#t~ite14_In-1933800339| |P0Thread1of1ForFork2_#t~ite14_Out-1933800339|) (= ~x$w_buff0_used~0_In-1933800339 |P0Thread1of1ForFork2_#t~ite15_Out-1933800339|) (not .cse0)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1933800339, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1933800339, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1933800339, P0Thread1of1ForFork2_#t~ite14=|P0Thread1of1ForFork2_#t~ite14_In-1933800339|, ~weak$$choice2~0=~weak$$choice2~0_In-1933800339, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1933800339} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1933800339, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1933800339, P0Thread1of1ForFork2_#t~ite15=|P0Thread1of1ForFork2_#t~ite15_Out-1933800339|, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1933800339, P0Thread1of1ForFork2_#t~ite14=|P0Thread1of1ForFork2_#t~ite14_Out-1933800339|, ~weak$$choice2~0=~weak$$choice2~0_In-1933800339, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1933800339} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite15, P0Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-27 22:28:00,573 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [791] [791] L743-->L743-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In211435653 256)))) (or (and (= ~x$w_buff1_used~0_In211435653 |P0Thread1of1ForFork2_#t~ite18_Out211435653|) (not .cse0) (= |P0Thread1of1ForFork2_#t~ite17_In211435653| |P0Thread1of1ForFork2_#t~ite17_Out211435653|)) (and (= ~x$w_buff1_used~0_In211435653 |P0Thread1of1ForFork2_#t~ite17_Out211435653|) .cse0 (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In211435653 256)))) (or (and (= (mod ~x$w_buff1_used~0_In211435653 256) 0) .cse1) (= 0 (mod ~x$w_buff0_used~0_In211435653 256)) (and (= (mod ~x$r_buff1_thd1~0_In211435653 256) 0) .cse1))) (= |P0Thread1of1ForFork2_#t~ite18_Out211435653| |P0Thread1of1ForFork2_#t~ite17_Out211435653|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In211435653, P0Thread1of1ForFork2_#t~ite17=|P0Thread1of1ForFork2_#t~ite17_In211435653|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In211435653, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In211435653, ~weak$$choice2~0=~weak$$choice2~0_In211435653, ~x$w_buff0_used~0=~x$w_buff0_used~0_In211435653} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In211435653, P0Thread1of1ForFork2_#t~ite18=|P0Thread1of1ForFork2_#t~ite18_Out211435653|, P0Thread1of1ForFork2_#t~ite17=|P0Thread1of1ForFork2_#t~ite17_Out211435653|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In211435653, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In211435653, ~weak$$choice2~0=~weak$$choice2~0_In211435653, ~x$w_buff0_used~0=~x$w_buff0_used~0_In211435653} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite18, P0Thread1of1ForFork2_#t~ite17] because there is no mapped edge [2019-12-27 22:28:00,574 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [734] [734] L744-->L745: Formula: (and (= v_~x$r_buff0_thd1~0_58 v_~x$r_buff0_thd1~0_57) (not (= (mod v_~weak$$choice2~0_23 256) 0))) InVars {~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_58, ~weak$$choice2~0=v_~weak$$choice2~0_23} OutVars{P0Thread1of1ForFork2_#t~ite20=|v_P0Thread1of1ForFork2_#t~ite20_10|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_57, P0Thread1of1ForFork2_#t~ite19=|v_P0Thread1of1ForFork2_#t~ite19_9|, ~weak$$choice2~0=v_~weak$$choice2~0_23, P0Thread1of1ForFork2_#t~ite21=|v_P0Thread1of1ForFork2_#t~ite21_8|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite20, ~x$r_buff0_thd1~0, P0Thread1of1ForFork2_#t~ite19, P0Thread1of1ForFork2_#t~ite21] because there is no mapped edge [2019-12-27 22:28:00,574 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [802] [802] L745-->L745-8: Formula: (let ((.cse4 (= |P0Thread1of1ForFork2_#t~ite24_Out824688624| |P0Thread1of1ForFork2_#t~ite23_Out824688624|)) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In824688624 256))) (.cse3 (= (mod ~x$r_buff1_thd1~0_In824688624 256) 0)) (.cse5 (= 0 (mod ~weak$$choice2~0_In824688624 256))) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In824688624 256))) (.cse1 (= (mod ~x$r_buff0_thd1~0_In824688624 256) 0))) (or (and (or (and (or (and .cse0 .cse1) .cse2 (and .cse1 .cse3)) .cse4 .cse5 (= ~x$r_buff1_thd1~0_In824688624 |P0Thread1of1ForFork2_#t~ite23_Out824688624|)) (and (= |P0Thread1of1ForFork2_#t~ite23_In824688624| |P0Thread1of1ForFork2_#t~ite23_Out824688624|) (= ~x$r_buff1_thd1~0_In824688624 |P0Thread1of1ForFork2_#t~ite24_Out824688624|) (not .cse5))) (= |P0Thread1of1ForFork2_#t~ite22_In824688624| |P0Thread1of1ForFork2_#t~ite22_Out824688624|)) (let ((.cse6 (not .cse1))) (and .cse4 (not .cse2) (or .cse6 (not .cse3)) .cse5 (or (not .cse0) .cse6) (= |P0Thread1of1ForFork2_#t~ite23_Out824688624| |P0Thread1of1ForFork2_#t~ite22_Out824688624|) (= 0 |P0Thread1of1ForFork2_#t~ite22_Out824688624|))))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In824688624, ~x$w_buff1_used~0=~x$w_buff1_used~0_In824688624, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In824688624, ~weak$$choice2~0=~weak$$choice2~0_In824688624, P0Thread1of1ForFork2_#t~ite23=|P0Thread1of1ForFork2_#t~ite23_In824688624|, P0Thread1of1ForFork2_#t~ite22=|P0Thread1of1ForFork2_#t~ite22_In824688624|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In824688624} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In824688624, ~x$w_buff1_used~0=~x$w_buff1_used~0_In824688624, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In824688624, P0Thread1of1ForFork2_#t~ite24=|P0Thread1of1ForFork2_#t~ite24_Out824688624|, ~weak$$choice2~0=~weak$$choice2~0_In824688624, P0Thread1of1ForFork2_#t~ite23=|P0Thread1of1ForFork2_#t~ite23_Out824688624|, P0Thread1of1ForFork2_#t~ite22=|P0Thread1of1ForFork2_#t~ite22_Out824688624|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In824688624} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite24, P0Thread1of1ForFork2_#t~ite23, P0Thread1of1ForFork2_#t~ite22] because there is no mapped edge [2019-12-27 22:28:00,575 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [738] [738] L797-->L797-2: Formula: (let ((.cse3 (= (mod ~x$r_buff1_thd3~0_In-1784525651 256) 0)) (.cse2 (= (mod ~x$w_buff1_used~0_In-1784525651 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In-1784525651 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd3~0_In-1784525651 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork1_#t~ite35_Out-1784525651| 0)) (and (or .cse3 .cse2) (= |P2Thread1of1ForFork1_#t~ite35_Out-1784525651| ~x$w_buff1_used~0_In-1784525651) (or .cse0 .cse1)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1784525651, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1784525651, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1784525651, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1784525651} OutVars{P2Thread1of1ForFork1_#t~ite35=|P2Thread1of1ForFork1_#t~ite35_Out-1784525651|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1784525651, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1784525651, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1784525651, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1784525651} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-27 22:28:00,576 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [744] [744] L798-->L798-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd3~0_In1629373109 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In1629373109 256)))) (or (and (= |P2Thread1of1ForFork1_#t~ite36_Out1629373109| ~x$r_buff0_thd3~0_In1629373109) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork1_#t~ite36_Out1629373109| 0)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1629373109, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1629373109} OutVars{P2Thread1of1ForFork1_#t~ite36=|P2Thread1of1ForFork1_#t~ite36_Out1629373109|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1629373109, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1629373109} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-27 22:28:00,577 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L799-->L799-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In452730106 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd3~0_In452730106 256) 0)) (.cse3 (= (mod ~x$w_buff1_used~0_In452730106 256) 0)) (.cse2 (= 0 (mod ~x$r_buff1_thd3~0_In452730106 256)))) (or (and (= 0 |P2Thread1of1ForFork1_#t~ite37_Out452730106|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse3 .cse2) (= ~x$r_buff1_thd3~0_In452730106 |P2Thread1of1ForFork1_#t~ite37_Out452730106|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In452730106, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In452730106, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In452730106, ~x$w_buff0_used~0=~x$w_buff0_used~0_In452730106} OutVars{P2Thread1of1ForFork1_#t~ite37=|P2Thread1of1ForFork1_#t~ite37_Out452730106|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In452730106, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In452730106, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In452730106, ~x$w_buff0_used~0=~x$w_buff0_used~0_In452730106} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-27 22:28:00,578 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L799-2-->P2EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_13 1) v_~__unbuffered_cnt~0_12) (= 0 |v_P2Thread1of1ForFork1_#res.offset_5|) (= 0 |v_P2Thread1of1ForFork1_#res.base_5|) (= v_~x$r_buff1_thd3~0_12 |v_P2Thread1of1ForFork1_#t~ite37_8|)) InVars {P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} OutVars{P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_7|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_5|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_12, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37, P2Thread1of1ForFork1_#res.base, ~x$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-27 22:28:00,578 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L778-->L779: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In291041392 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In291041392 256)))) (or (and (not .cse0) (= 0 ~x$r_buff0_thd2~0_Out291041392) (not .cse1)) (and (= ~x$r_buff0_thd2~0_In291041392 ~x$r_buff0_thd2~0_Out291041392) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In291041392, ~x$w_buff0_used~0=~x$w_buff0_used~0_In291041392} OutVars{P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out291041392|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out291041392, ~x$w_buff0_used~0=~x$w_buff0_used~0_In291041392} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-27 22:28:00,578 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L779-->L779-2: Formula: (let ((.cse2 (= 0 (mod ~x$w_buff1_used~0_In1406220233 256))) (.cse3 (= 0 (mod ~x$r_buff1_thd2~0_In1406220233 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In1406220233 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In1406220233 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork0_#t~ite31_Out1406220233|)) (and (or .cse2 .cse3) (or .cse1 .cse0) (= ~x$r_buff1_thd2~0_In1406220233 |P1Thread1of1ForFork0_#t~ite31_Out1406220233|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1406220233, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1406220233, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1406220233, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1406220233} OutVars{P1Thread1of1ForFork0_#t~ite31=|P1Thread1of1ForFork0_#t~ite31_Out1406220233|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1406220233, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1406220233, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1406220233, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1406220233} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-27 22:28:00,578 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L779-2-->P1EXIT: Formula: (and (= v_~__unbuffered_cnt~0_14 (+ v_~__unbuffered_cnt~0_15 1)) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|) (= v_~x$r_buff1_thd2~0_14 |v_P1Thread1of1ForFork0_#t~ite31_8|)) InVars {P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15} OutVars{P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_7|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_14, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_5|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-27 22:28:00,580 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L747-->L755: Formula: (and (= 0 v_~x$flush_delayed~0_6) (= v_~x$mem_tmp~0_4 v_~x~0_16) (not (= 0 (mod v_~x$flush_delayed~0_7 256))) (= (+ v_~__unbuffered_cnt~0_11 1) v_~__unbuffered_cnt~0_10)) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_7, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, ~x$mem_tmp~0=v_~x$mem_tmp~0_4} OutVars{P0Thread1of1ForFork2_#t~ite25=|v_P0Thread1of1ForFork2_#t~ite25_7|, ~x$flush_delayed~0=v_~x$flush_delayed~0_6, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10, ~x$mem_tmp~0=v_~x$mem_tmp~0_4, ~x~0=v_~x~0_16} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite25, ~x$flush_delayed~0, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-12-27 22:28:00,581 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L826-->L828-2: Formula: (and (or (= (mod v_~x$r_buff0_thd0~0_15 256) 0) (= 0 (mod v_~x$w_buff0_used~0_86 256))) (not (= (mod v_~main$tmp_guard0~0_4 256) 0))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_15, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_86} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_15, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_86} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-27 22:28:00,581 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] L828-2-->L828-4: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff1_thd0~0_In1214280787 256))) (.cse0 (= (mod ~x$w_buff1_used~0_In1214280787 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite41_Out1214280787| ~x~0_In1214280787) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= ~x$w_buff1~0_In1214280787 |ULTIMATE.start_main_#t~ite41_Out1214280787|)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In1214280787, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1214280787, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1214280787, ~x~0=~x~0_In1214280787} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out1214280787|, ~x$w_buff1~0=~x$w_buff1~0_In1214280787, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1214280787, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1214280787, ~x~0=~x~0_In1214280787} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41] because there is no mapped edge [2019-12-27 22:28:00,581 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [693] [693] L828-4-->L829: Formula: (= v_~x~0_15 |v_ULTIMATE.start_main_#t~ite41_7|) InVars {ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_7|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_6|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_6|, ~x~0=v_~x~0_15} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite42, ~x~0] because there is no mapped edge [2019-12-27 22:28:00,582 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [743] [743] L829-->L829-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In1832296787 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In1832296787 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite43_Out1832296787| ~x$w_buff0_used~0_In1832296787)) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite43_Out1832296787| 0) (not .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1832296787, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1832296787} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1832296787, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out1832296787|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1832296787} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-27 22:28:00,583 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] L830-->L830-2: Formula: (let ((.cse1 (= (mod ~x$r_buff1_thd0~0_In534998676 256) 0)) (.cse0 (= (mod ~x$w_buff1_used~0_In534998676 256) 0)) (.cse3 (= 0 (mod ~x$r_buff0_thd0~0_In534998676 256))) (.cse2 (= (mod ~x$w_buff0_used~0_In534998676 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite44_Out534998676| ~x$w_buff1_used~0_In534998676)) (and (= |ULTIMATE.start_main_#t~ite44_Out534998676| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In534998676, ~x$w_buff1_used~0=~x$w_buff1_used~0_In534998676, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In534998676, ~x$w_buff0_used~0=~x$w_buff0_used~0_In534998676} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In534998676, ~x$w_buff1_used~0=~x$w_buff1_used~0_In534998676, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In534998676, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out534998676|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In534998676} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-27 22:28:00,584 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L831-->L831-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In2129325763 256))) (.cse0 (= (mod ~x$r_buff0_thd0~0_In2129325763 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite45_Out2129325763| ~x$r_buff0_thd0~0_In2129325763) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |ULTIMATE.start_main_#t~ite45_Out2129325763| 0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In2129325763, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2129325763} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In2129325763, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out2129325763|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2129325763} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-27 22:28:00,586 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [740] [740] L832-->L832-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In1280788763 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In1280788763 256))) (.cse2 (= (mod ~x$r_buff1_thd0~0_In1280788763 256) 0)) (.cse3 (= (mod ~x$w_buff1_used~0_In1280788763 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite46_Out1280788763|)) (and (= ~x$r_buff1_thd0~0_In1280788763 |ULTIMATE.start_main_#t~ite46_Out1280788763|) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1280788763, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1280788763, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1280788763, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1280788763} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1280788763, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out1280788763|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1280788763, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1280788763, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1280788763} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-27 22:28:00,586 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [804] [804] L832-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8| (mod v_~main$tmp_guard1~0_11 256)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 0) (= v_~x$r_buff1_thd0~0_13 |v_ULTIMATE.start_main_#t~ite46_10|) (= v_~__unbuffered_p0_EBX~0_7 0) (= v_~main$tmp_guard1~0_11 0) (= v_~__unbuffered_p2_EAX~0_7 1) (= v_~__unbuffered_p0_EAX~0_7 1)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_7, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_7, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_10|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_7} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_7, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_7, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_9|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_11, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_7, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_13, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 22:28:00,712 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 10:28:00 BasicIcfg [2019-12-27 22:28:00,712 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 22:28:00,714 INFO L168 Benchmark]: Toolchain (without parser) took 180066.28 ms. Allocated memory was 139.5 MB in the beginning and 3.8 GB in the end (delta: 3.7 GB). Free memory was 103.0 MB in the beginning and 2.0 GB in the end (delta: -1.9 GB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. [2019-12-27 22:28:00,714 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 139.5 MB. Free memory was 122.6 MB in the beginning and 122.4 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2019-12-27 22:28:00,715 INFO L168 Benchmark]: CACSL2BoogieTranslator took 780.67 ms. Allocated memory was 139.5 MB in the beginning and 203.9 MB in the end (delta: 64.5 MB). Free memory was 102.8 MB in the beginning and 158.1 MB in the end (delta: -55.3 MB). Peak memory consumption was 26.1 MB. Max. memory is 7.1 GB. [2019-12-27 22:28:00,715 INFO L168 Benchmark]: Boogie Procedure Inliner took 65.49 ms. Allocated memory is still 203.9 MB. Free memory was 158.1 MB in the beginning and 155.5 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 22:28:00,721 INFO L168 Benchmark]: Boogie Preprocessor took 45.05 ms. Allocated memory is still 203.9 MB. Free memory was 155.5 MB in the beginning and 152.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 22:28:00,722 INFO L168 Benchmark]: RCFGBuilder took 823.79 ms. Allocated memory is still 203.9 MB. Free memory was 152.9 MB in the beginning and 106.1 MB in the end (delta: 46.8 MB). Peak memory consumption was 46.8 MB. Max. memory is 7.1 GB. [2019-12-27 22:28:00,722 INFO L168 Benchmark]: TraceAbstraction took 178344.74 ms. Allocated memory was 203.9 MB in the beginning and 3.8 GB in the end (delta: 3.6 GB). Free memory was 105.4 MB in the beginning and 2.0 GB in the end (delta: -1.9 GB). Peak memory consumption was 1.7 GB. Max. memory is 7.1 GB. [2019-12-27 22:28:00,725 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.22 ms. Allocated memory is still 139.5 MB. Free memory was 122.6 MB in the beginning and 122.4 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 780.67 ms. Allocated memory was 139.5 MB in the beginning and 203.9 MB in the end (delta: 64.5 MB). Free memory was 102.8 MB in the beginning and 158.1 MB in the end (delta: -55.3 MB). Peak memory consumption was 26.1 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 65.49 ms. Allocated memory is still 203.9 MB. Free memory was 158.1 MB in the beginning and 155.5 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 45.05 ms. Allocated memory is still 203.9 MB. Free memory was 155.5 MB in the beginning and 152.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 823.79 ms. Allocated memory is still 203.9 MB. Free memory was 152.9 MB in the beginning and 106.1 MB in the end (delta: 46.8 MB). Peak memory consumption was 46.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 178344.74 ms. Allocated memory was 203.9 MB in the beginning and 3.8 GB in the end (delta: 3.6 GB). Free memory was 105.4 MB in the beginning and 2.0 GB in the end (delta: -1.9 GB). Peak memory consumption was 1.7 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.1s, 164 ProgramPointsBefore, 82 ProgramPointsAfterwards, 195 TransitionsBefore, 89 TransitionsAfterwards, 16696 CoEnabledTransitionPairs, 7 FixpointIterations, 33 TrivialSequentialCompositions, 49 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 32 ConcurrentYvCompositions, 28 ChoiceCompositions, 6736 VarBasedMoverChecksPositive, 197 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 67273 CheckedPairsTotal, 114 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L818] FCALL, FORK 0 pthread_create(&t2055, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L820] FCALL, FORK 0 pthread_create(&t2056, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L765] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L766] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L767] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L768] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L769] 2 x$r_buff0_thd2 = (_Bool)1 [L772] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L775] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L822] FCALL, FORK 0 pthread_create(&t2057, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L789] 3 __unbuffered_p2_EAX = y [L792] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L795] 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L775] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L776] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L732] 1 __unbuffered_p0_EAX = z [L735] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L736] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L737] 1 x$flush_delayed = weak$$choice2 [L738] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L739] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L777] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L739] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L740] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L741] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L741] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L742] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L743] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L796] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L797] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L798] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L745] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L746] 1 __unbuffered_p0_EBX = x VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L824] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L829] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L830] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L831] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 155 locations, 2 error locations. Result: UNSAFE, OverallTime: 177.9s, OverallIterations: 30, TraceHistogramMax: 1, AutomataDifference: 66.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 5118 SDtfs, 11564 SDslu, 21087 SDs, 0 SdLazy, 16482 SolverSat, 740 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 17.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 631 GetRequests, 124 SyntacticMatches, 70 SemanticMatches, 437 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3887 ImplicationChecksByTransitivity, 8.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=135986occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 87.0s AutomataMinimizationTime, 29 MinimizatonAttempts, 423301 StatesRemovedByMinimization, 26 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 1131 NumberOfCodeBlocks, 1131 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 1046 ConstructedInterpolants, 0 QuantifiedInterpolants, 173023 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 29 InterpolantComputations, 29 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...