/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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix016_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 12:33:37,576 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 12:33:37,579 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 12:33:37,591 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 12:33:37,591 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 12:33:37,592 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 12:33:37,593 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 12:33:37,595 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 12:33:37,597 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 12:33:37,598 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 12:33:37,599 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 12:33:37,600 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 12:33:37,600 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 12:33:37,601 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 12:33:37,602 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 12:33:37,603 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 12:33:37,604 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 12:33:37,605 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 12:33:37,607 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 12:33:37,609 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 12:33:37,610 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 12:33:37,611 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 12:33:37,612 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 12:33:37,615 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 12:33:37,618 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 12:33:37,618 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 12:33:37,618 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 12:33:37,622 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 12:33:37,622 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 12:33:37,623 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 12:33:37,623 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 12:33:37,626 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 12:33:37,628 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 12:33:37,629 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 12:33:37,632 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 12:33:37,634 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 12:33:37,635 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 12:33:37,635 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 12:33:37,635 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 12:33:37,636 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 12:33:37,637 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 12:33:37,638 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-18 12:33:37,663 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 12:33:37,663 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 12:33:37,667 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 12:33:37,667 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 12:33:37,668 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 12:33:37,668 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 12:33:37,668 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 12:33:37,668 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 12:33:37,668 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 12:33:37,669 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 12:33:37,670 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 12:33:37,670 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 12:33:37,671 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 12:33:37,671 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 12:33:37,671 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 12:33:37,671 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 12:33:37,672 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 12:33:37,672 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 12:33:37,672 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 12:33:37,672 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 12:33:37,674 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 12:33:37,674 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 12:33:37,675 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 12:33:37,675 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 12:33:37,675 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 12:33:37,675 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 12:33:37,675 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 12:33:37,675 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 12:33:37,676 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-18 12:33:37,676 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 12:33:37,944 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 12:33:37,964 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 12:33:37,967 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 12:33:37,969 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 12:33:37,969 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 12:33:37,970 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix016_power.oepc.i [2019-12-18 12:33:38,046 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6838e7303/8d8db2c7392f4a72b7f3a362213d1fb2/FLAGb80592d0c [2019-12-18 12:33:38,637 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 12:33:38,638 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix016_power.oepc.i [2019-12-18 12:33:38,652 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6838e7303/8d8db2c7392f4a72b7f3a362213d1fb2/FLAGb80592d0c [2019-12-18 12:33:38,896 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6838e7303/8d8db2c7392f4a72b7f3a362213d1fb2 [2019-12-18 12:33:38,905 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 12:33:38,907 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 12:33:38,908 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 12:33:38,908 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 12:33:38,912 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 12:33:38,913 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 12:33:38" (1/1) ... [2019-12-18 12:33:38,916 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b69d69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:33:38, skipping insertion in model container [2019-12-18 12:33:38,916 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 12:33:38" (1/1) ... [2019-12-18 12:33:38,924 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 12:33:38,977 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 12:33:39,528 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 12:33:39,546 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 12:33:39,645 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 12:33:39,725 INFO L208 MainTranslator]: Completed translation [2019-12-18 12:33:39,725 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:33:39 WrapperNode [2019-12-18 12:33:39,726 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 12:33:39,726 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 12:33:39,726 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 12:33:39,726 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 12:33:39,733 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:33:39" (1/1) ... [2019-12-18 12:33:39,757 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:33:39" (1/1) ... [2019-12-18 12:33:39,785 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 12:33:39,786 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 12:33:39,786 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 12:33:39,786 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 12:33:39,795 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:33:39" (1/1) ... [2019-12-18 12:33:39,796 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:33:39" (1/1) ... [2019-12-18 12:33:39,800 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:33:39" (1/1) ... [2019-12-18 12:33:39,801 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:33:39" (1/1) ... [2019-12-18 12:33:39,812 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:33:39" (1/1) ... [2019-12-18 12:33:39,816 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:33:39" (1/1) ... [2019-12-18 12:33:39,820 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:33:39" (1/1) ... [2019-12-18 12:33:39,825 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 12:33:39,825 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 12:33:39,825 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 12:33:39,826 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 12:33:39,827 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:33:39" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 12:33:39,905 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 12:33:39,905 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 12:33:39,905 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 12:33:39,905 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 12:33:39,906 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 12:33:39,906 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 12:33:39,906 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 12:33:39,906 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 12:33:39,906 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 12:33:39,906 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 12:33:39,907 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 12:33:39,907 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 12:33:39,907 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 12:33:39,909 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 12:33:40,660 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 12:33:40,660 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 12:33:40,662 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 12:33:40 BoogieIcfgContainer [2019-12-18 12:33:40,662 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 12:33:40,663 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 12:33:40,664 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 12:33:40,667 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 12:33:40,667 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 12:33:38" (1/3) ... [2019-12-18 12:33:40,668 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17624db8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 12:33:40, skipping insertion in model container [2019-12-18 12:33:40,668 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:33:39" (2/3) ... [2019-12-18 12:33:40,669 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17624db8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 12:33:40, skipping insertion in model container [2019-12-18 12:33:40,669 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 12:33:40" (3/3) ... [2019-12-18 12:33:40,671 INFO L109 eAbstractionObserver]: Analyzing ICFG mix016_power.oepc.i [2019-12-18 12:33:40,681 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 12:33:40,682 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 12:33:40,690 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 12:33:40,691 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 12:33:40,734 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:40,734 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:40,734 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:40,735 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:40,735 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:40,735 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:40,736 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:40,736 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:40,736 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:40,737 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:40,737 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:40,737 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:40,737 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:40,738 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:40,738 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:40,738 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:40,739 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:40,739 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:40,739 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:40,739 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:40,740 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:40,740 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:40,740 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:40,741 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:40,741 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:40,741 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:40,741 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:40,742 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:40,742 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:40,742 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:40,742 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:40,743 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:40,743 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:40,743 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:40,744 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:40,744 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:40,744 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:40,744 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:40,745 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:40,745 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:40,745 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:40,746 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:40,746 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:40,763 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:40,764 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:40,764 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:40,764 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:40,765 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:40,765 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:40,765 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:40,765 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:40,765 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:40,766 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:40,766 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:40,766 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:40,766 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:40,767 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:40,767 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:40,767 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:40,767 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:40,767 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:40,768 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:40,768 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:40,768 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:40,769 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:40,769 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:40,769 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:40,770 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:40,770 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:40,770 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:40,770 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:40,770 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:40,771 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:40,771 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:40,771 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:40,771 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:40,771 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:40,772 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:40,772 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:40,772 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:40,772 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:40,773 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:40,773 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:40,773 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:40,773 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:40,773 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:40,774 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:40,774 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:40,774 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:40,774 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:40,775 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:40,775 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:40,775 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:40,775 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:40,775 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:40,775 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:40,776 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:40,776 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:40,776 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:40,776 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:40,777 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:40,777 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:40,777 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:40,777 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:40,777 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:40,778 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:40,778 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:40,778 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:40,778 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:40,779 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:40,779 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:40,779 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:40,779 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:40,779 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:40,780 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:40,780 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:40,780 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:40,780 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:40,780 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:40,780 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:40,781 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:40,781 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:40,781 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:40,781 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:40,781 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:40,782 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:40,782 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:40,782 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:40,782 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:40,782 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:40,783 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:40,783 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:40,783 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:40,783 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:40,783 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:40,784 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:40,784 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:40,784 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:40,784 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:40,784 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:40,785 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:40,785 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:40,785 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:40,785 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:40,785 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:40,786 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:40,786 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:40,786 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:40,786 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:40,786 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:40,787 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:40,787 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:40,787 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:40,787 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:40,787 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:40,788 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:40,788 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:40,788 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:40,788 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:40,788 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:40,788 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:40,789 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:40,789 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:40,789 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:40,789 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:40,790 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:40,790 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:40,790 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:40,790 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:40,790 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:40,791 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:40,791 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:40,791 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:40,791 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:40,791 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:40,792 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:40,792 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:40,792 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:40,792 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:40,792 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:40,793 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:40,793 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:40,796 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:40,797 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:40,797 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:40,797 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:40,797 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:40,797 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:40,798 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:40,798 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:40,798 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:40,798 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:40,798 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:40,799 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:40,799 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:40,799 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:40,799 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:40,799 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:40,799 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:40,800 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:40,800 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:40,800 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:40,800 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:40,800 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:40,800 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:40,801 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:40,801 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:40,801 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:40,801 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:40,801 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:40,802 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:40,802 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:40,802 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:40,802 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:40,802 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:40,806 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:40,806 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:40,806 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:40,806 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:40,807 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:40,807 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:40,807 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:40,807 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:40,807 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:40,808 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:40,808 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:40,808 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:40,813 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:40,814 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:40,814 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:40,814 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:40,814 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:40,815 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:40,815 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:40,815 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:40,815 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:40,815 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:33:40,833 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 12:33:40,854 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 12:33:40,854 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 12:33:40,854 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 12:33:40,854 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 12:33:40,854 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 12:33:40,854 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 12:33:40,855 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 12:33:40,855 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 12:33:40,872 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 177 places, 214 transitions [2019-12-18 12:33:40,874 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 177 places, 214 transitions [2019-12-18 12:33:40,961 INFO L126 PetriNetUnfolder]: 47/211 cut-off events. [2019-12-18 12:33:40,962 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 12:33:40,980 INFO L76 FinitePrefix]: Finished finitePrefix Result has 221 conditions, 211 events. 47/211 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 436 event pairs. 9/171 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 12:33:41,008 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 177 places, 214 transitions [2019-12-18 12:33:41,061 INFO L126 PetriNetUnfolder]: 47/211 cut-off events. [2019-12-18 12:33:41,061 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 12:33:41,069 INFO L76 FinitePrefix]: Finished finitePrefix Result has 221 conditions, 211 events. 47/211 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 436 event pairs. 9/171 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 12:33:41,091 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-18 12:33:41,092 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 12:33:46,108 WARN L192 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 84 [2019-12-18 12:33:46,229 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2019-12-18 12:33:46,455 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2019-12-18 12:33:46,582 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-12-18 12:33:46,609 INFO L206 etLargeBlockEncoding]: Checked pairs total: 89688 [2019-12-18 12:33:46,609 INFO L214 etLargeBlockEncoding]: Total number of compositions: 119 [2019-12-18 12:33:46,613 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 92 places, 101 transitions [2019-12-18 12:34:03,129 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 106864 states. [2019-12-18 12:34:03,131 INFO L276 IsEmpty]: Start isEmpty. Operand 106864 states. [2019-12-18 12:34:03,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-18 12:34:03,136 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:34:03,136 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-18 12:34:03,137 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:34:03,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:34:03,143 INFO L82 PathProgramCache]: Analyzing trace with hash 921701, now seen corresponding path program 1 times [2019-12-18 12:34:03,151 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:34:03,152 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302704591] [2019-12-18 12:34:03,152 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:34:03,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:34:03,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:34:03,352 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302704591] [2019-12-18 12:34:03,353 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:34:03,353 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 12:34:03,354 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797791758] [2019-12-18 12:34:03,359 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:34:03,359 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:34:03,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:34:03,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:34:03,376 INFO L87 Difference]: Start difference. First operand 106864 states. Second operand 3 states. [2019-12-18 12:34:07,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:34:07,084 INFO L93 Difference]: Finished difference Result 106034 states and 453004 transitions. [2019-12-18 12:34:07,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:34:07,086 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-18 12:34:07,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:34:07,780 INFO L225 Difference]: With dead ends: 106034 [2019-12-18 12:34:07,780 INFO L226 Difference]: Without dead ends: 99950 [2019-12-18 12:34:07,781 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:34:11,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99950 states. [2019-12-18 12:34:14,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99950 to 99950. [2019-12-18 12:34:14,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99950 states. [2019-12-18 12:34:18,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99950 states to 99950 states and 426445 transitions. [2019-12-18 12:34:18,674 INFO L78 Accepts]: Start accepts. Automaton has 99950 states and 426445 transitions. Word has length 3 [2019-12-18 12:34:18,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:34:18,675 INFO L462 AbstractCegarLoop]: Abstraction has 99950 states and 426445 transitions. [2019-12-18 12:34:18,675 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:34:18,675 INFO L276 IsEmpty]: Start isEmpty. Operand 99950 states and 426445 transitions. [2019-12-18 12:34:18,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 12:34:18,687 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:34:18,687 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:34:18,688 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:34:18,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:34:18,688 INFO L82 PathProgramCache]: Analyzing trace with hash 1680645281, now seen corresponding path program 1 times [2019-12-18 12:34:18,689 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:34:18,689 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802174680] [2019-12-18 12:34:18,689 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:34:18,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:34:18,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:34:18,819 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802174680] [2019-12-18 12:34:18,819 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:34:18,819 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:34:18,819 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946067751] [2019-12-18 12:34:18,821 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 12:34:18,821 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:34:18,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 12:34:18,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 12:34:18,822 INFO L87 Difference]: Start difference. First operand 99950 states and 426445 transitions. Second operand 4 states. [2019-12-18 12:34:19,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:34:19,926 INFO L93 Difference]: Finished difference Result 159384 states and 652094 transitions. [2019-12-18 12:34:19,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 12:34:19,927 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 12:34:19,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:34:24,948 INFO L225 Difference]: With dead ends: 159384 [2019-12-18 12:34:24,948 INFO L226 Difference]: Without dead ends: 159335 [2019-12-18 12:34:24,949 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:34:28,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159335 states. [2019-12-18 12:34:31,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159335 to 143879. [2019-12-18 12:34:31,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143879 states. [2019-12-18 12:34:38,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143879 states to 143879 states and 597281 transitions. [2019-12-18 12:34:38,283 INFO L78 Accepts]: Start accepts. Automaton has 143879 states and 597281 transitions. Word has length 11 [2019-12-18 12:34:38,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:34:38,284 INFO L462 AbstractCegarLoop]: Abstraction has 143879 states and 597281 transitions. [2019-12-18 12:34:38,284 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 12:34:38,284 INFO L276 IsEmpty]: Start isEmpty. Operand 143879 states and 597281 transitions. [2019-12-18 12:34:38,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 12:34:38,288 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:34:38,288 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:34:38,288 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:34:38,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:34:38,289 INFO L82 PathProgramCache]: Analyzing trace with hash -1535099311, now seen corresponding path program 1 times [2019-12-18 12:34:38,289 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:34:38,289 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531974971] [2019-12-18 12:34:38,289 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:34:38,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:34:38,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:34:38,395 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531974971] [2019-12-18 12:34:38,395 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:34:38,395 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:34:38,395 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393981691] [2019-12-18 12:34:38,396 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 12:34:38,396 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:34:38,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 12:34:38,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 12:34:38,397 INFO L87 Difference]: Start difference. First operand 143879 states and 597281 transitions. Second operand 4 states. [2019-12-18 12:34:38,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:34:38,654 INFO L93 Difference]: Finished difference Result 42595 states and 146341 transitions. [2019-12-18 12:34:38,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 12:34:38,655 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-18 12:34:38,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:34:38,718 INFO L225 Difference]: With dead ends: 42595 [2019-12-18 12:34:38,718 INFO L226 Difference]: Without dead ends: 32718 [2019-12-18 12:34:38,718 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:34:38,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32718 states. [2019-12-18 12:34:39,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32718 to 32622. [2019-12-18 12:34:39,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32622 states. [2019-12-18 12:34:39,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32622 states to 32622 states and 106518 transitions. [2019-12-18 12:34:39,295 INFO L78 Accepts]: Start accepts. Automaton has 32622 states and 106518 transitions. Word has length 13 [2019-12-18 12:34:39,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:34:39,297 INFO L462 AbstractCegarLoop]: Abstraction has 32622 states and 106518 transitions. [2019-12-18 12:34:39,297 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 12:34:39,297 INFO L276 IsEmpty]: Start isEmpty. Operand 32622 states and 106518 transitions. [2019-12-18 12:34:39,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 12:34:39,300 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:34:39,300 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:34:39,300 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:34:39,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:34:39,301 INFO L82 PathProgramCache]: Analyzing trace with hash 1228744872, now seen corresponding path program 1 times [2019-12-18 12:34:39,301 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:34:39,301 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547145635] [2019-12-18 12:34:39,301 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:34:39,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:34:39,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:34:39,441 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547145635] [2019-12-18 12:34:39,441 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:34:39,441 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:34:39,441 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601951436] [2019-12-18 12:34:39,442 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 12:34:39,445 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:34:39,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 12:34:39,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 12:34:39,447 INFO L87 Difference]: Start difference. First operand 32622 states and 106518 transitions. Second operand 4 states. [2019-12-18 12:34:39,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:34:39,801 INFO L93 Difference]: Finished difference Result 41342 states and 134101 transitions. [2019-12-18 12:34:39,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 12:34:39,801 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-18 12:34:39,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:34:40,844 INFO L225 Difference]: With dead ends: 41342 [2019-12-18 12:34:40,844 INFO L226 Difference]: Without dead ends: 41342 [2019-12-18 12:34:40,844 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:34:41,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41342 states. [2019-12-18 12:34:41,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41342 to 37015. [2019-12-18 12:34:41,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37015 states. [2019-12-18 12:34:41,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37015 states to 37015 states and 120557 transitions. [2019-12-18 12:34:41,450 INFO L78 Accepts]: Start accepts. Automaton has 37015 states and 120557 transitions. Word has length 16 [2019-12-18 12:34:41,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:34:41,450 INFO L462 AbstractCegarLoop]: Abstraction has 37015 states and 120557 transitions. [2019-12-18 12:34:41,451 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 12:34:41,451 INFO L276 IsEmpty]: Start isEmpty. Operand 37015 states and 120557 transitions. [2019-12-18 12:34:41,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 12:34:41,453 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:34:41,453 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:34:41,453 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:34:41,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:34:41,453 INFO L82 PathProgramCache]: Analyzing trace with hash 1228651655, now seen corresponding path program 1 times [2019-12-18 12:34:41,454 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:34:41,454 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194641984] [2019-12-18 12:34:41,454 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:34:41,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:34:41,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:34:41,531 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194641984] [2019-12-18 12:34:41,531 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:34:41,531 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:34:41,532 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250174355] [2019-12-18 12:34:41,532 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 12:34:41,532 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:34:41,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 12:34:41,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 12:34:41,533 INFO L87 Difference]: Start difference. First operand 37015 states and 120557 transitions. Second operand 4 states. [2019-12-18 12:34:41,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:34:41,912 INFO L93 Difference]: Finished difference Result 44892 states and 145334 transitions. [2019-12-18 12:34:41,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 12:34:41,912 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-18 12:34:41,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:34:41,985 INFO L225 Difference]: With dead ends: 44892 [2019-12-18 12:34:41,985 INFO L226 Difference]: Without dead ends: 44892 [2019-12-18 12:34:41,986 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:34:42,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44892 states. [2019-12-18 12:34:43,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44892 to 36810. [2019-12-18 12:34:43,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36810 states. [2019-12-18 12:34:43,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36810 states to 36810 states and 119696 transitions. [2019-12-18 12:34:43,180 INFO L78 Accepts]: Start accepts. Automaton has 36810 states and 119696 transitions. Word has length 16 [2019-12-18 12:34:43,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:34:43,180 INFO L462 AbstractCegarLoop]: Abstraction has 36810 states and 119696 transitions. [2019-12-18 12:34:43,180 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 12:34:43,180 INFO L276 IsEmpty]: Start isEmpty. Operand 36810 states and 119696 transitions. [2019-12-18 12:34:43,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 12:34:43,190 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:34:43,190 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-18 12:34:43,191 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:34:43,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:34:43,191 INFO L82 PathProgramCache]: Analyzing trace with hash -1838789338, now seen corresponding path program 1 times [2019-12-18 12:34:43,191 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:34:43,192 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441511713] [2019-12-18 12:34:43,192 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:34:43,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:34:43,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:34:43,318 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441511713] [2019-12-18 12:34:43,318 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:34:43,318 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:34:43,318 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996688164] [2019-12-18 12:34:43,319 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 12:34:43,319 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:34:43,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 12:34:43,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:34:43,320 INFO L87 Difference]: Start difference. First operand 36810 states and 119696 transitions. Second operand 5 states. [2019-12-18 12:34:43,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:34:43,989 INFO L93 Difference]: Finished difference Result 55448 states and 177239 transitions. [2019-12-18 12:34:43,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 12:34:43,990 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-18 12:34:43,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:34:44,088 INFO L225 Difference]: With dead ends: 55448 [2019-12-18 12:34:44,088 INFO L226 Difference]: Without dead ends: 55392 [2019-12-18 12:34:44,088 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-18 12:34:44,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55392 states. [2019-12-18 12:34:45,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55392 to 38696. [2019-12-18 12:34:45,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38696 states. [2019-12-18 12:34:45,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38696 states to 38696 states and 125822 transitions. [2019-12-18 12:34:45,425 INFO L78 Accepts]: Start accepts. Automaton has 38696 states and 125822 transitions. Word has length 22 [2019-12-18 12:34:45,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:34:45,425 INFO L462 AbstractCegarLoop]: Abstraction has 38696 states and 125822 transitions. [2019-12-18 12:34:45,426 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 12:34:45,426 INFO L276 IsEmpty]: Start isEmpty. Operand 38696 states and 125822 transitions. [2019-12-18 12:34:45,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 12:34:45,434 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:34:45,434 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-18 12:34:45,434 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:34:45,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:34:45,435 INFO L82 PathProgramCache]: Analyzing trace with hash -1838882555, now seen corresponding path program 1 times [2019-12-18 12:34:45,435 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:34:45,435 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458978018] [2019-12-18 12:34:45,435 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:34:45,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:34:45,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:34:45,541 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458978018] [2019-12-18 12:34:45,542 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:34:45,542 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:34:45,542 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758569870] [2019-12-18 12:34:45,542 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 12:34:45,542 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:34:45,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 12:34:45,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:34:45,544 INFO L87 Difference]: Start difference. First operand 38696 states and 125822 transitions. Second operand 5 states. [2019-12-18 12:34:46,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:34:46,201 INFO L93 Difference]: Finished difference Result 57418 states and 182937 transitions. [2019-12-18 12:34:46,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 12:34:46,201 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-18 12:34:46,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:34:46,333 INFO L225 Difference]: With dead ends: 57418 [2019-12-18 12:34:46,334 INFO L226 Difference]: Without dead ends: 57362 [2019-12-18 12:34:46,334 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-18 12:34:46,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57362 states. [2019-12-18 12:34:46,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57362 to 36190. [2019-12-18 12:34:46,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36190 states. [2019-12-18 12:34:47,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36190 states to 36190 states and 117443 transitions. [2019-12-18 12:34:47,793 INFO L78 Accepts]: Start accepts. Automaton has 36190 states and 117443 transitions. Word has length 22 [2019-12-18 12:34:47,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:34:47,794 INFO L462 AbstractCegarLoop]: Abstraction has 36190 states and 117443 transitions. [2019-12-18 12:34:47,794 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 12:34:47,794 INFO L276 IsEmpty]: Start isEmpty. Operand 36190 states and 117443 transitions. [2019-12-18 12:34:47,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 12:34:47,805 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:34:47,805 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:34:47,805 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:34:47,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:34:47,805 INFO L82 PathProgramCache]: Analyzing trace with hash 320469370, now seen corresponding path program 1 times [2019-12-18 12:34:47,806 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:34:47,806 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246114304] [2019-12-18 12:34:47,806 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:34:47,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:34:47,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:34:47,945 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246114304] [2019-12-18 12:34:47,945 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:34:47,945 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 12:34:47,946 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683871743] [2019-12-18 12:34:47,946 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 12:34:47,946 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:34:47,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 12:34:47,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 12:34:47,947 INFO L87 Difference]: Start difference. First operand 36190 states and 117443 transitions. Second operand 6 states. [2019-12-18 12:34:48,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:34:48,729 INFO L93 Difference]: Finished difference Result 51968 states and 164745 transitions. [2019-12-18 12:34:48,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 12:34:48,731 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-12-18 12:34:48,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:34:48,823 INFO L225 Difference]: With dead ends: 51968 [2019-12-18 12:34:48,824 INFO L226 Difference]: Without dead ends: 51955 [2019-12-18 12:34:48,824 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-12-18 12:34:49,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51955 states. [2019-12-18 12:34:49,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51955 to 41982. [2019-12-18 12:34:49,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41982 states. [2019-12-18 12:34:49,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41982 states to 41982 states and 135844 transitions. [2019-12-18 12:34:49,551 INFO L78 Accepts]: Start accepts. Automaton has 41982 states and 135844 transitions. Word has length 25 [2019-12-18 12:34:49,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:34:49,552 INFO L462 AbstractCegarLoop]: Abstraction has 41982 states and 135844 transitions. [2019-12-18 12:34:49,552 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 12:34:49,552 INFO L276 IsEmpty]: Start isEmpty. Operand 41982 states and 135844 transitions. [2019-12-18 12:34:49,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 12:34:49,564 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:34:49,564 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:34:49,564 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:34:49,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:34:49,564 INFO L82 PathProgramCache]: Analyzing trace with hash 270212897, now seen corresponding path program 1 times [2019-12-18 12:34:49,565 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:34:49,565 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440016323] [2019-12-18 12:34:49,565 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:34:49,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:34:49,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:34:49,599 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440016323] [2019-12-18 12:34:49,599 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:34:49,600 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:34:49,600 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792601989] [2019-12-18 12:34:49,600 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:34:49,600 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:34:49,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:34:49,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:34:49,601 INFO L87 Difference]: Start difference. First operand 41982 states and 135844 transitions. Second operand 3 states. [2019-12-18 12:34:50,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:34:50,397 INFO L93 Difference]: Finished difference Result 64909 states and 208822 transitions. [2019-12-18 12:34:50,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:34:50,398 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-12-18 12:34:50,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:34:50,577 INFO L225 Difference]: With dead ends: 64909 [2019-12-18 12:34:50,578 INFO L226 Difference]: Without dead ends: 64909 [2019-12-18 12:34:50,578 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:34:50,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64909 states. [2019-12-18 12:34:51,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64909 to 49315. [2019-12-18 12:34:51,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49315 states. [2019-12-18 12:34:51,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49315 states to 49315 states and 159887 transitions. [2019-12-18 12:34:51,586 INFO L78 Accepts]: Start accepts. Automaton has 49315 states and 159887 transitions. Word has length 27 [2019-12-18 12:34:51,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:34:51,586 INFO L462 AbstractCegarLoop]: Abstraction has 49315 states and 159887 transitions. [2019-12-18 12:34:51,586 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:34:51,586 INFO L276 IsEmpty]: Start isEmpty. Operand 49315 states and 159887 transitions. [2019-12-18 12:34:51,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 12:34:51,601 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:34:51,602 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:34:51,602 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:34:51,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:34:51,602 INFO L82 PathProgramCache]: Analyzing trace with hash 2064759266, now seen corresponding path program 1 times [2019-12-18 12:34:51,602 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:34:51,603 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180527156] [2019-12-18 12:34:51,603 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:34:51,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:34:51,636 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:34:51,636 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180527156] [2019-12-18 12:34:51,637 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:34:51,637 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:34:51,637 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557911558] [2019-12-18 12:34:51,637 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:34:51,638 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:34:51,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:34:51,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:34:51,638 INFO L87 Difference]: Start difference. First operand 49315 states and 159887 transitions. Second operand 3 states. [2019-12-18 12:34:52,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:34:52,417 INFO L93 Difference]: Finished difference Result 64909 states and 203873 transitions. [2019-12-18 12:34:52,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:34:52,417 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-12-18 12:34:52,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:34:52,519 INFO L225 Difference]: With dead ends: 64909 [2019-12-18 12:34:52,519 INFO L226 Difference]: Without dead ends: 64909 [2019-12-18 12:34:52,519 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:34:52,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64909 states. [2019-12-18 12:34:53,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64909 to 49315. [2019-12-18 12:34:53,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49315 states. [2019-12-18 12:34:53,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49315 states to 49315 states and 154938 transitions. [2019-12-18 12:34:53,386 INFO L78 Accepts]: Start accepts. Automaton has 49315 states and 154938 transitions. Word has length 27 [2019-12-18 12:34:53,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:34:53,386 INFO L462 AbstractCegarLoop]: Abstraction has 49315 states and 154938 transitions. [2019-12-18 12:34:53,386 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:34:53,386 INFO L276 IsEmpty]: Start isEmpty. Operand 49315 states and 154938 transitions. [2019-12-18 12:34:53,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 12:34:53,400 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:34:53,400 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:34:53,400 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:34:53,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:34:53,401 INFO L82 PathProgramCache]: Analyzing trace with hash 2010439622, now seen corresponding path program 1 times [2019-12-18 12:34:53,401 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:34:53,401 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592749267] [2019-12-18 12:34:53,401 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:34:53,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:34:53,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:34:53,495 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592749267] [2019-12-18 12:34:53,496 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:34:53,496 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:34:53,496 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133271568] [2019-12-18 12:34:53,496 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 12:34:53,497 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:34:53,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 12:34:53,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:34:53,497 INFO L87 Difference]: Start difference. First operand 49315 states and 154938 transitions. Second operand 5 states. [2019-12-18 12:34:53,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:34:53,943 INFO L93 Difference]: Finished difference Result 60684 states and 188418 transitions. [2019-12-18 12:34:53,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 12:34:53,944 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-18 12:34:53,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:34:54,076 INFO L225 Difference]: With dead ends: 60684 [2019-12-18 12:34:54,076 INFO L226 Difference]: Without dead ends: 60508 [2019-12-18 12:34:54,077 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 12:34:54,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60508 states. [2019-12-18 12:34:55,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60508 to 53763. [2019-12-18 12:34:55,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53763 states. [2019-12-18 12:34:55,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53763 states to 53763 states and 168544 transitions. [2019-12-18 12:34:55,524 INFO L78 Accepts]: Start accepts. Automaton has 53763 states and 168544 transitions. Word has length 27 [2019-12-18 12:34:55,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:34:55,524 INFO L462 AbstractCegarLoop]: Abstraction has 53763 states and 168544 transitions. [2019-12-18 12:34:55,524 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 12:34:55,524 INFO L276 IsEmpty]: Start isEmpty. Operand 53763 states and 168544 transitions. [2019-12-18 12:34:55,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-18 12:34:55,540 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:34:55,540 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-18 12:34:55,540 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:34:55,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:34:55,541 INFO L82 PathProgramCache]: Analyzing trace with hash -782285250, now seen corresponding path program 1 times [2019-12-18 12:34:55,541 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:34:55,541 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806315780] [2019-12-18 12:34:55,541 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:34:55,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:34:55,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:34:55,578 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806315780] [2019-12-18 12:34:55,578 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:34:55,579 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 12:34:55,579 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92103260] [2019-12-18 12:34:55,579 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:34:55,579 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:34:55,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:34:55,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:34:55,580 INFO L87 Difference]: Start difference. First operand 53763 states and 168544 transitions. Second operand 3 states. [2019-12-18 12:34:55,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:34:55,751 INFO L93 Difference]: Finished difference Result 53712 states and 168392 transitions. [2019-12-18 12:34:55,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:34:55,752 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-12-18 12:34:55,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:34:55,837 INFO L225 Difference]: With dead ends: 53712 [2019-12-18 12:34:55,837 INFO L226 Difference]: Without dead ends: 53712 [2019-12-18 12:34:55,837 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:34:56,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53712 states. [2019-12-18 12:34:57,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53712 to 53712. [2019-12-18 12:34:57,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53712 states. [2019-12-18 12:34:57,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53712 states to 53712 states and 168392 transitions. [2019-12-18 12:34:57,236 INFO L78 Accepts]: Start accepts. Automaton has 53712 states and 168392 transitions. Word has length 28 [2019-12-18 12:34:57,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:34:57,236 INFO L462 AbstractCegarLoop]: Abstraction has 53712 states and 168392 transitions. [2019-12-18 12:34:57,237 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:34:57,237 INFO L276 IsEmpty]: Start isEmpty. Operand 53712 states and 168392 transitions. [2019-12-18 12:34:57,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-18 12:34:57,254 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:34:57,254 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-18 12:34:57,254 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:34:57,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:34:57,255 INFO L82 PathProgramCache]: Analyzing trace with hash 773295241, now seen corresponding path program 1 times [2019-12-18 12:34:57,255 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:34:57,255 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52683285] [2019-12-18 12:34:57,255 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:34:57,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:34:57,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-18 12:34:57,377 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52683285] [2019-12-18 12:34:57,377 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:34:57,377 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 12:34:57,377 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52509449] [2019-12-18 12:34:57,378 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 12:34:57,378 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:34:57,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 12:34:57,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-18 12:34:57,378 INFO L87 Difference]: Start difference. First operand 53712 states and 168392 transitions. Second operand 6 states. [2019-12-18 12:34:57,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:34:57,774 INFO L93 Difference]: Finished difference Result 69752 states and 217160 transitions. [2019-12-18 12:34:57,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 12:34:57,775 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2019-12-18 12:34:57,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:34:57,930 INFO L225 Difference]: With dead ends: 69752 [2019-12-18 12:34:57,930 INFO L226 Difference]: Without dead ends: 69752 [2019-12-18 12:34:57,931 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 12:34:58,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69752 states. [2019-12-18 12:34:59,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69752 to 54858. [2019-12-18 12:34:59,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54858 states. [2019-12-18 12:34:59,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54858 states to 54858 states and 171684 transitions. [2019-12-18 12:34:59,630 INFO L78 Accepts]: Start accepts. Automaton has 54858 states and 171684 transitions. Word has length 28 [2019-12-18 12:34:59,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:34:59,630 INFO L462 AbstractCegarLoop]: Abstraction has 54858 states and 171684 transitions. [2019-12-18 12:34:59,630 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 12:34:59,630 INFO L276 IsEmpty]: Start isEmpty. Operand 54858 states and 171684 transitions. [2019-12-18 12:34:59,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-18 12:34:59,649 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:34:59,649 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:34:59,649 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:34:59,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:34:59,650 INFO L82 PathProgramCache]: Analyzing trace with hash -340313241, now seen corresponding path program 1 times [2019-12-18 12:34:59,650 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:34:59,650 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581602219] [2019-12-18 12:34:59,650 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:34:59,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:34:59,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:34:59,721 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581602219] [2019-12-18 12:34:59,721 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:34:59,721 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 12:34:59,721 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901925814] [2019-12-18 12:34:59,722 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 12:34:59,722 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:34:59,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 12:34:59,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:34:59,723 INFO L87 Difference]: Start difference. First operand 54858 states and 171684 transitions. Second operand 5 states. [2019-12-18 12:35:00,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:35:00,416 INFO L93 Difference]: Finished difference Result 75035 states and 232688 transitions. [2019-12-18 12:35:00,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 12:35:00,416 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2019-12-18 12:35:00,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:35:00,540 INFO L225 Difference]: With dead ends: 75035 [2019-12-18 12:35:00,540 INFO L226 Difference]: Without dead ends: 75035 [2019-12-18 12:35:00,540 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-18 12:35:00,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75035 states. [2019-12-18 12:35:02,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75035 to 65273. [2019-12-18 12:35:02,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65273 states. [2019-12-18 12:35:02,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65273 states to 65273 states and 204219 transitions. [2019-12-18 12:35:02,483 INFO L78 Accepts]: Start accepts. Automaton has 65273 states and 204219 transitions. Word has length 29 [2019-12-18 12:35:02,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:35:02,484 INFO L462 AbstractCegarLoop]: Abstraction has 65273 states and 204219 transitions. [2019-12-18 12:35:02,484 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 12:35:02,484 INFO L276 IsEmpty]: Start isEmpty. Operand 65273 states and 204219 transitions. [2019-12-18 12:35:02,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-18 12:35:02,506 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:35:02,506 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:35:02,506 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:35:02,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:35:02,506 INFO L82 PathProgramCache]: Analyzing trace with hash -1192824778, now seen corresponding path program 1 times [2019-12-18 12:35:02,507 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:35:02,507 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493095668] [2019-12-18 12:35:02,507 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:35:02,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:35:02,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:35:02,578 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493095668] [2019-12-18 12:35:02,578 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:35:02,578 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:35:02,578 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976331268] [2019-12-18 12:35:02,579 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 12:35:02,579 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:35:02,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 12:35:02,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:35:02,579 INFO L87 Difference]: Start difference. First operand 65273 states and 204219 transitions. Second operand 5 states. [2019-12-18 12:35:03,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:35:03,248 INFO L93 Difference]: Finished difference Result 76622 states and 236968 transitions. [2019-12-18 12:35:03,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 12:35:03,248 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2019-12-18 12:35:03,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:35:03,390 INFO L225 Difference]: With dead ends: 76622 [2019-12-18 12:35:03,390 INFO L226 Difference]: Without dead ends: 76438 [2019-12-18 12:35:03,391 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 12:35:03,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76438 states. [2019-12-18 12:35:05,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76438 to 65837. [2019-12-18 12:35:05,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65837 states. [2019-12-18 12:35:05,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65837 states to 65837 states and 205842 transitions. [2019-12-18 12:35:05,332 INFO L78 Accepts]: Start accepts. Automaton has 65837 states and 205842 transitions. Word has length 29 [2019-12-18 12:35:05,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:35:05,333 INFO L462 AbstractCegarLoop]: Abstraction has 65837 states and 205842 transitions. [2019-12-18 12:35:05,333 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 12:35:05,333 INFO L276 IsEmpty]: Start isEmpty. Operand 65837 states and 205842 transitions. [2019-12-18 12:35:05,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-18 12:35:05,358 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:35:05,358 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:35:05,359 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:35:05,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:35:05,359 INFO L82 PathProgramCache]: Analyzing trace with hash 1820575072, now seen corresponding path program 1 times [2019-12-18 12:35:05,359 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:35:05,359 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610172915] [2019-12-18 12:35:05,360 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:35:05,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:35:05,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-18 12:35:05,440 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610172915] [2019-12-18 12:35:05,440 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:35:05,440 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 12:35:05,440 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61384179] [2019-12-18 12:35:05,441 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 12:35:05,441 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:35:05,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 12:35:05,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:35:05,441 INFO L87 Difference]: Start difference. First operand 65837 states and 205842 transitions. Second operand 5 states. [2019-12-18 12:35:05,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:35:05,625 INFO L93 Difference]: Finished difference Result 32869 states and 97248 transitions. [2019-12-18 12:35:05,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 12:35:05,626 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-12-18 12:35:05,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:35:05,685 INFO L225 Difference]: With dead ends: 32869 [2019-12-18 12:35:05,686 INFO L226 Difference]: Without dead ends: 28550 [2019-12-18 12:35:05,686 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 12:35:05,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28550 states. [2019-12-18 12:35:06,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28550 to 26488. [2019-12-18 12:35:06,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26488 states. [2019-12-18 12:35:06,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26488 states to 26488 states and 78168 transitions. [2019-12-18 12:35:06,112 INFO L78 Accepts]: Start accepts. Automaton has 26488 states and 78168 transitions. Word has length 30 [2019-12-18 12:35:06,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:35:06,112 INFO L462 AbstractCegarLoop]: Abstraction has 26488 states and 78168 transitions. [2019-12-18 12:35:06,112 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 12:35:06,113 INFO L276 IsEmpty]: Start isEmpty. Operand 26488 states and 78168 transitions. [2019-12-18 12:35:06,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-18 12:35:06,136 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:35:06,136 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:35:06,136 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:35:06,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:35:06,137 INFO L82 PathProgramCache]: Analyzing trace with hash -809721720, now seen corresponding path program 1 times [2019-12-18 12:35:06,137 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:35:06,137 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672674670] [2019-12-18 12:35:06,137 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:35:06,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:35:06,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:35:06,226 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672674670] [2019-12-18 12:35:06,226 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:35:06,226 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 12:35:06,227 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352579257] [2019-12-18 12:35:06,227 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 12:35:06,227 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:35:06,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 12:35:06,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 12:35:06,228 INFO L87 Difference]: Start difference. First operand 26488 states and 78168 transitions. Second operand 6 states. [2019-12-18 12:35:06,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:35:06,972 INFO L93 Difference]: Finished difference Result 33299 states and 96867 transitions. [2019-12-18 12:35:06,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 12:35:06,972 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2019-12-18 12:35:06,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:35:07,018 INFO L225 Difference]: With dead ends: 33299 [2019-12-18 12:35:07,019 INFO L226 Difference]: Without dead ends: 32978 [2019-12-18 12:35:07,019 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-12-18 12:35:07,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32978 states. [2019-12-18 12:35:07,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32978 to 27211. [2019-12-18 12:35:07,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27211 states. [2019-12-18 12:35:07,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27211 states to 27211 states and 80187 transitions. [2019-12-18 12:35:07,985 INFO L78 Accepts]: Start accepts. Automaton has 27211 states and 80187 transitions. Word has length 33 [2019-12-18 12:35:07,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:35:07,985 INFO L462 AbstractCegarLoop]: Abstraction has 27211 states and 80187 transitions. [2019-12-18 12:35:07,985 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 12:35:07,985 INFO L276 IsEmpty]: Start isEmpty. Operand 27211 states and 80187 transitions. [2019-12-18 12:35:08,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-18 12:35:08,006 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:35:08,006 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] [2019-12-18 12:35:08,006 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:35:08,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:35:08,007 INFO L82 PathProgramCache]: Analyzing trace with hash -1243510664, now seen corresponding path program 1 times [2019-12-18 12:35:08,007 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:35:08,007 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88634045] [2019-12-18 12:35:08,007 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:35:08,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:35:08,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:35:08,111 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88634045] [2019-12-18 12:35:08,111 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:35:08,111 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 12:35:08,111 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583394922] [2019-12-18 12:35:08,112 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 12:35:08,116 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:35:08,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 12:35:08,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 12:35:08,116 INFO L87 Difference]: Start difference. First operand 27211 states and 80187 transitions. Second operand 6 states. [2019-12-18 12:35:08,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:35:08,855 INFO L93 Difference]: Finished difference Result 32712 states and 95010 transitions. [2019-12-18 12:35:08,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 12:35:08,856 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 35 [2019-12-18 12:35:08,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:35:08,898 INFO L225 Difference]: With dead ends: 32712 [2019-12-18 12:35:08,898 INFO L226 Difference]: Without dead ends: 32337 [2019-12-18 12:35:08,898 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-12-18 12:35:08,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32337 states. [2019-12-18 12:35:09,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32337 to 25003. [2019-12-18 12:35:09,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25003 states. [2019-12-18 12:35:09,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25003 states to 25003 states and 73762 transitions. [2019-12-18 12:35:09,291 INFO L78 Accepts]: Start accepts. Automaton has 25003 states and 73762 transitions. Word has length 35 [2019-12-18 12:35:09,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:35:09,291 INFO L462 AbstractCegarLoop]: Abstraction has 25003 states and 73762 transitions. [2019-12-18 12:35:09,291 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 12:35:09,291 INFO L276 IsEmpty]: Start isEmpty. Operand 25003 states and 73762 transitions. [2019-12-18 12:35:09,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 12:35:09,320 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:35:09,320 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-18 12:35:09,320 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:35:09,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:35:09,320 INFO L82 PathProgramCache]: Analyzing trace with hash 202654059, now seen corresponding path program 1 times [2019-12-18 12:35:09,320 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:35:09,320 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650287522] [2019-12-18 12:35:09,321 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:35:09,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:35:09,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:35:09,391 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650287522] [2019-12-18 12:35:09,391 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:35:09,391 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 12:35:09,391 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451291330] [2019-12-18 12:35:09,392 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 12:35:09,392 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:35:09,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 12:35:09,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:35:09,392 INFO L87 Difference]: Start difference. First operand 25003 states and 73762 transitions. Second operand 5 states. [2019-12-18 12:35:10,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:35:10,060 INFO L93 Difference]: Finished difference Result 35861 states and 105030 transitions. [2019-12-18 12:35:10,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 12:35:10,060 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-18 12:35:10,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:35:10,109 INFO L225 Difference]: With dead ends: 35861 [2019-12-18 12:35:10,109 INFO L226 Difference]: Without dead ends: 35861 [2019-12-18 12:35:10,109 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 12:35:10,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35861 states. [2019-12-18 12:35:10,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35861 to 29292. [2019-12-18 12:35:10,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29292 states. [2019-12-18 12:35:11,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29292 states to 29292 states and 86931 transitions. [2019-12-18 12:35:11,086 INFO L78 Accepts]: Start accepts. Automaton has 29292 states and 86931 transitions. Word has length 40 [2019-12-18 12:35:11,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:35:11,086 INFO L462 AbstractCegarLoop]: Abstraction has 29292 states and 86931 transitions. [2019-12-18 12:35:11,086 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 12:35:11,086 INFO L276 IsEmpty]: Start isEmpty. Operand 29292 states and 86931 transitions. [2019-12-18 12:35:11,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 12:35:11,111 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:35:11,111 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-18 12:35:11,112 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:35:11,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:35:11,112 INFO L82 PathProgramCache]: Analyzing trace with hash -1689924949, now seen corresponding path program 2 times [2019-12-18 12:35:11,112 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:35:11,112 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943212920] [2019-12-18 12:35:11,112 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:35:11,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:35:11,172 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:35:11,172 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943212920] [2019-12-18 12:35:11,172 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:35:11,172 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:35:11,173 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124649677] [2019-12-18 12:35:11,173 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:35:11,173 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:35:11,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:35:11,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:35:11,174 INFO L87 Difference]: Start difference. First operand 29292 states and 86931 transitions. Second operand 3 states. [2019-12-18 12:35:11,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:35:11,292 INFO L93 Difference]: Finished difference Result 29205 states and 86665 transitions. [2019-12-18 12:35:11,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:35:11,292 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-12-18 12:35:11,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:35:11,346 INFO L225 Difference]: With dead ends: 29205 [2019-12-18 12:35:11,347 INFO L226 Difference]: Without dead ends: 29205 [2019-12-18 12:35:11,347 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:35:11,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29205 states. [2019-12-18 12:35:11,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29205 to 23983. [2019-12-18 12:35:11,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23983 states. [2019-12-18 12:35:12,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23983 states to 23983 states and 71984 transitions. [2019-12-18 12:35:12,031 INFO L78 Accepts]: Start accepts. Automaton has 23983 states and 71984 transitions. Word has length 40 [2019-12-18 12:35:12,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:35:12,031 INFO L462 AbstractCegarLoop]: Abstraction has 23983 states and 71984 transitions. [2019-12-18 12:35:12,031 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:35:12,031 INFO L276 IsEmpty]: Start isEmpty. Operand 23983 states and 71984 transitions. [2019-12-18 12:35:12,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-18 12:35:12,087 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:35:12,087 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] [2019-12-18 12:35:12,087 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:35:12,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:35:12,088 INFO L82 PathProgramCache]: Analyzing trace with hash 1472692188, now seen corresponding path program 1 times [2019-12-18 12:35:12,089 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:35:12,089 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975208828] [2019-12-18 12:35:12,090 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:35:12,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:35:12,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:35:12,221 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975208828] [2019-12-18 12:35:12,223 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:35:12,223 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 12:35:12,223 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99603213] [2019-12-18 12:35:12,225 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 12:35:12,225 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:35:12,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 12:35:12,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-18 12:35:12,226 INFO L87 Difference]: Start difference. First operand 23983 states and 71984 transitions. Second operand 6 states. [2019-12-18 12:35:12,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:35:12,408 INFO L93 Difference]: Finished difference Result 22617 states and 69033 transitions. [2019-12-18 12:35:12,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 12:35:12,409 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2019-12-18 12:35:12,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:35:12,450 INFO L225 Difference]: With dead ends: 22617 [2019-12-18 12:35:12,451 INFO L226 Difference]: Without dead ends: 22468 [2019-12-18 12:35:12,451 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-18 12:35:12,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22468 states. [2019-12-18 12:35:12,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22468 to 20851. [2019-12-18 12:35:12,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20851 states. [2019-12-18 12:35:12,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20851 states to 20851 states and 64081 transitions. [2019-12-18 12:35:12,841 INFO L78 Accepts]: Start accepts. Automaton has 20851 states and 64081 transitions. Word has length 41 [2019-12-18 12:35:12,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:35:12,841 INFO L462 AbstractCegarLoop]: Abstraction has 20851 states and 64081 transitions. [2019-12-18 12:35:12,841 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 12:35:12,841 INFO L276 IsEmpty]: Start isEmpty. Operand 20851 states and 64081 transitions. [2019-12-18 12:35:12,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 12:35:12,865 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:35:12,865 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:35:12,865 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:35:12,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:35:12,865 INFO L82 PathProgramCache]: Analyzing trace with hash -1424537019, now seen corresponding path program 1 times [2019-12-18 12:35:12,865 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:35:12,866 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896433790] [2019-12-18 12:35:12,866 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:35:12,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:35:12,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:35:12,942 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896433790] [2019-12-18 12:35:12,943 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:35:12,943 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 12:35:12,943 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078668756] [2019-12-18 12:35:12,943 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 12:35:12,944 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:35:12,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 12:35:12,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 12:35:12,944 INFO L87 Difference]: Start difference. First operand 20851 states and 64081 transitions. Second operand 7 states. [2019-12-18 12:35:13,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:35:13,457 INFO L93 Difference]: Finished difference Result 58761 states and 178850 transitions. [2019-12-18 12:35:13,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 12:35:13,458 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-18 12:35:13,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:35:13,543 INFO L225 Difference]: With dead ends: 58761 [2019-12-18 12:35:13,544 INFO L226 Difference]: Without dead ends: 43614 [2019-12-18 12:35:13,546 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-18 12:35:14,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43614 states. [2019-12-18 12:35:14,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43614 to 24645. [2019-12-18 12:35:14,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24645 states. [2019-12-18 12:35:14,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24645 states to 24645 states and 75170 transitions. [2019-12-18 12:35:14,476 INFO L78 Accepts]: Start accepts. Automaton has 24645 states and 75170 transitions. Word has length 65 [2019-12-18 12:35:14,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:35:14,476 INFO L462 AbstractCegarLoop]: Abstraction has 24645 states and 75170 transitions. [2019-12-18 12:35:14,476 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 12:35:14,476 INFO L276 IsEmpty]: Start isEmpty. Operand 24645 states and 75170 transitions. [2019-12-18 12:35:14,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 12:35:14,501 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:35:14,502 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:35:14,502 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:35:14,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:35:14,502 INFO L82 PathProgramCache]: Analyzing trace with hash 872536213, now seen corresponding path program 2 times [2019-12-18 12:35:14,502 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:35:14,502 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579387925] [2019-12-18 12:35:14,502 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:35:14,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:35:14,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:35:14,604 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579387925] [2019-12-18 12:35:14,604 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:35:14,604 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 12:35:14,604 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823783731] [2019-12-18 12:35:14,604 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 12:35:14,605 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:35:14,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 12:35:14,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-18 12:35:14,605 INFO L87 Difference]: Start difference. First operand 24645 states and 75170 transitions. Second operand 8 states. [2019-12-18 12:35:15,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:35:15,783 INFO L93 Difference]: Finished difference Result 85886 states and 258153 transitions. [2019-12-18 12:35:15,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 12:35:15,783 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 65 [2019-12-18 12:35:15,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:35:15,873 INFO L225 Difference]: With dead ends: 85886 [2019-12-18 12:35:15,873 INFO L226 Difference]: Without dead ends: 62131 [2019-12-18 12:35:15,874 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=145, Invalid=455, Unknown=0, NotChecked=0, Total=600 [2019-12-18 12:35:16,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62131 states. [2019-12-18 12:35:17,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62131 to 28948. [2019-12-18 12:35:17,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28948 states. [2019-12-18 12:35:17,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28948 states to 28948 states and 87618 transitions. [2019-12-18 12:35:17,070 INFO L78 Accepts]: Start accepts. Automaton has 28948 states and 87618 transitions. Word has length 65 [2019-12-18 12:35:17,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:35:17,070 INFO L462 AbstractCegarLoop]: Abstraction has 28948 states and 87618 transitions. [2019-12-18 12:35:17,070 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 12:35:17,070 INFO L276 IsEmpty]: Start isEmpty. Operand 28948 states and 87618 transitions. [2019-12-18 12:35:17,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 12:35:17,099 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:35:17,099 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:35:17,099 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:35:17,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:35:17,099 INFO L82 PathProgramCache]: Analyzing trace with hash 45765331, now seen corresponding path program 3 times [2019-12-18 12:35:17,099 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:35:17,099 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478229458] [2019-12-18 12:35:17,100 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:35:17,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:35:17,224 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:35:17,224 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478229458] [2019-12-18 12:35:17,224 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:35:17,225 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 12:35:17,225 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487633245] [2019-12-18 12:35:17,227 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 12:35:17,227 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:35:17,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 12:35:17,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 12:35:17,227 INFO L87 Difference]: Start difference. First operand 28948 states and 87618 transitions. Second operand 9 states. [2019-12-18 12:35:18,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:35:18,678 INFO L93 Difference]: Finished difference Result 104220 states and 310078 transitions. [2019-12-18 12:35:18,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 12:35:18,679 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-18 12:35:18,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:35:18,825 INFO L225 Difference]: With dead ends: 104220 [2019-12-18 12:35:18,825 INFO L226 Difference]: Without dead ends: 99809 [2019-12-18 12:35:18,826 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=157, Invalid=493, Unknown=0, NotChecked=0, Total=650 [2019-12-18 12:35:19,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99809 states. [2019-12-18 12:35:20,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99809 to 29391. [2019-12-18 12:35:20,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29391 states. [2019-12-18 12:35:20,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29391 states to 29391 states and 88899 transitions. [2019-12-18 12:35:20,175 INFO L78 Accepts]: Start accepts. Automaton has 29391 states and 88899 transitions. Word has length 65 [2019-12-18 12:35:20,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:35:20,175 INFO L462 AbstractCegarLoop]: Abstraction has 29391 states and 88899 transitions. [2019-12-18 12:35:20,175 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 12:35:20,176 INFO L276 IsEmpty]: Start isEmpty. Operand 29391 states and 88899 transitions. [2019-12-18 12:35:20,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 12:35:20,209 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:35:20,209 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:35:20,209 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:35:20,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:35:20,209 INFO L82 PathProgramCache]: Analyzing trace with hash 1660891443, now seen corresponding path program 4 times [2019-12-18 12:35:20,209 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:35:20,209 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177774648] [2019-12-18 12:35:20,210 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:35:20,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:35:20,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:35:20,306 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177774648] [2019-12-18 12:35:20,307 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:35:20,307 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 12:35:20,307 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330551651] [2019-12-18 12:35:20,307 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 12:35:20,307 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:35:20,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 12:35:20,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 12:35:20,308 INFO L87 Difference]: Start difference. First operand 29391 states and 88899 transitions. Second operand 9 states. [2019-12-18 12:35:21,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:35:21,611 INFO L93 Difference]: Finished difference Result 80796 states and 241185 transitions. [2019-12-18 12:35:21,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 12:35:21,612 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-18 12:35:21,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:35:21,722 INFO L225 Difference]: With dead ends: 80796 [2019-12-18 12:35:21,722 INFO L226 Difference]: Without dead ends: 78469 [2019-12-18 12:35:21,723 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=166, Invalid=536, Unknown=0, NotChecked=0, Total=702 [2019-12-18 12:35:21,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78469 states. [2019-12-18 12:35:22,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78469 to 29167. [2019-12-18 12:35:22,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29167 states. [2019-12-18 12:35:22,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29167 states to 29167 states and 88403 transitions. [2019-12-18 12:35:22,538 INFO L78 Accepts]: Start accepts. Automaton has 29167 states and 88403 transitions. Word has length 65 [2019-12-18 12:35:22,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:35:22,538 INFO L462 AbstractCegarLoop]: Abstraction has 29167 states and 88403 transitions. [2019-12-18 12:35:22,538 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 12:35:22,538 INFO L276 IsEmpty]: Start isEmpty. Operand 29167 states and 88403 transitions. [2019-12-18 12:35:22,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 12:35:22,834 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:35:22,834 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:35:22,834 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:35:22,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:35:22,835 INFO L82 PathProgramCache]: Analyzing trace with hash 937822065, now seen corresponding path program 5 times [2019-12-18 12:35:22,835 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:35:22,835 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190371258] [2019-12-18 12:35:22,835 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:35:22,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:35:22,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:35:22,914 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190371258] [2019-12-18 12:35:22,914 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:35:22,914 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 12:35:22,915 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681297850] [2019-12-18 12:35:22,915 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 12:35:22,915 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:35:22,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 12:35:22,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 12:35:22,916 INFO L87 Difference]: Start difference. First operand 29167 states and 88403 transitions. Second operand 7 states. [2019-12-18 12:35:23,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:35:23,575 INFO L93 Difference]: Finished difference Result 58137 states and 173502 transitions. [2019-12-18 12:35:23,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 12:35:23,575 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-18 12:35:23,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:35:23,668 INFO L225 Difference]: With dead ends: 58137 [2019-12-18 12:35:23,668 INFO L226 Difference]: Without dead ends: 48826 [2019-12-18 12:35:23,669 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-18 12:35:23,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48826 states. [2019-12-18 12:35:24,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48826 to 29179. [2019-12-18 12:35:24,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29179 states. [2019-12-18 12:35:24,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29179 states to 29179 states and 88374 transitions. [2019-12-18 12:35:24,349 INFO L78 Accepts]: Start accepts. Automaton has 29179 states and 88374 transitions. Word has length 65 [2019-12-18 12:35:24,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:35:24,349 INFO L462 AbstractCegarLoop]: Abstraction has 29179 states and 88374 transitions. [2019-12-18 12:35:24,349 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 12:35:24,349 INFO L276 IsEmpty]: Start isEmpty. Operand 29179 states and 88374 transitions. [2019-12-18 12:35:24,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 12:35:24,382 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:35:24,382 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:35:24,382 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:35:24,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:35:24,383 INFO L82 PathProgramCache]: Analyzing trace with hash -1903736173, now seen corresponding path program 6 times [2019-12-18 12:35:24,383 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:35:24,383 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954895982] [2019-12-18 12:35:24,383 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:35:24,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:35:24,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-18 12:35:24,439 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954895982] [2019-12-18 12:35:24,439 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:35:24,439 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:35:24,440 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829352817] [2019-12-18 12:35:24,440 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:35:24,440 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:35:24,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:35:24,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:35:24,440 INFO L87 Difference]: Start difference. First operand 29179 states and 88374 transitions. Second operand 3 states. [2019-12-18 12:35:24,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:35:24,615 INFO L93 Difference]: Finished difference Result 32141 states and 97214 transitions. [2019-12-18 12:35:24,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:35:24,616 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-18 12:35:24,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:35:24,669 INFO L225 Difference]: With dead ends: 32141 [2019-12-18 12:35:24,670 INFO L226 Difference]: Without dead ends: 32141 [2019-12-18 12:35:24,670 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:35:24,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32141 states. [2019-12-18 12:35:25,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32141 to 26925. [2019-12-18 12:35:25,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26925 states. [2019-12-18 12:35:25,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26925 states to 26925 states and 82185 transitions. [2019-12-18 12:35:25,099 INFO L78 Accepts]: Start accepts. Automaton has 26925 states and 82185 transitions. Word has length 65 [2019-12-18 12:35:25,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:35:25,099 INFO L462 AbstractCegarLoop]: Abstraction has 26925 states and 82185 transitions. [2019-12-18 12:35:25,099 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:35:25,099 INFO L276 IsEmpty]: Start isEmpty. Operand 26925 states and 82185 transitions. [2019-12-18 12:35:25,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 12:35:25,128 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:35:25,128 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:35:25,128 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:35:25,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:35:25,128 INFO L82 PathProgramCache]: Analyzing trace with hash -243481851, now seen corresponding path program 1 times [2019-12-18 12:35:25,128 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:35:25,128 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642844784] [2019-12-18 12:35:25,129 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:35:25,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:35:25,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:35:25,197 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642844784] [2019-12-18 12:35:25,197 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:35:25,198 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 12:35:25,198 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535987882] [2019-12-18 12:35:25,198 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 12:35:25,199 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:35:25,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 12:35:25,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 12:35:25,199 INFO L87 Difference]: Start difference. First operand 26925 states and 82185 transitions. Second operand 6 states. [2019-12-18 12:35:26,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:35:26,189 INFO L93 Difference]: Finished difference Result 34530 states and 103452 transitions. [2019-12-18 12:35:26,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 12:35:26,190 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2019-12-18 12:35:26,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:35:26,237 INFO L225 Difference]: With dead ends: 34530 [2019-12-18 12:35:26,237 INFO L226 Difference]: Without dead ends: 34530 [2019-12-18 12:35:26,237 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-12-18 12:35:26,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34530 states. [2019-12-18 12:35:26,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34530 to 26841. [2019-12-18 12:35:26,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26841 states. [2019-12-18 12:35:26,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26841 states to 26841 states and 81917 transitions. [2019-12-18 12:35:26,690 INFO L78 Accepts]: Start accepts. Automaton has 26841 states and 81917 transitions. Word has length 66 [2019-12-18 12:35:26,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:35:26,691 INFO L462 AbstractCegarLoop]: Abstraction has 26841 states and 81917 transitions. [2019-12-18 12:35:26,691 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 12:35:26,691 INFO L276 IsEmpty]: Start isEmpty. Operand 26841 states and 81917 transitions. [2019-12-18 12:35:26,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 12:35:26,720 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:35:26,720 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:35:26,720 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:35:26,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:35:26,721 INFO L82 PathProgramCache]: Analyzing trace with hash -44744943, now seen corresponding path program 2 times [2019-12-18 12:35:26,721 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:35:26,721 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580989980] [2019-12-18 12:35:26,721 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:35:26,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:35:26,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:35:26,846 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580989980] [2019-12-18 12:35:26,846 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:35:26,846 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 12:35:26,847 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528450681] [2019-12-18 12:35:26,847 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 12:35:26,847 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:35:26,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 12:35:26,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-18 12:35:26,848 INFO L87 Difference]: Start difference. First operand 26841 states and 81917 transitions. Second operand 8 states. [2019-12-18 12:35:28,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:35:28,073 INFO L93 Difference]: Finished difference Result 35165 states and 105201 transitions. [2019-12-18 12:35:28,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-18 12:35:28,074 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 66 [2019-12-18 12:35:28,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:35:28,121 INFO L225 Difference]: With dead ends: 35165 [2019-12-18 12:35:28,122 INFO L226 Difference]: Without dead ends: 35165 [2019-12-18 12:35:28,122 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 14 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=267, Unknown=0, NotChecked=0, Total=342 [2019-12-18 12:35:28,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35165 states. [2019-12-18 12:35:28,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35165 to 26443. [2019-12-18 12:35:28,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26443 states. [2019-12-18 12:35:28,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26443 states to 26443 states and 80718 transitions. [2019-12-18 12:35:28,578 INFO L78 Accepts]: Start accepts. Automaton has 26443 states and 80718 transitions. Word has length 66 [2019-12-18 12:35:28,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:35:28,579 INFO L462 AbstractCegarLoop]: Abstraction has 26443 states and 80718 transitions. [2019-12-18 12:35:28,579 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 12:35:28,579 INFO L276 IsEmpty]: Start isEmpty. Operand 26443 states and 80718 transitions. [2019-12-18 12:35:28,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 12:35:28,612 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:35:28,612 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:35:28,612 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:35:28,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:35:28,613 INFO L82 PathProgramCache]: Analyzing trace with hash -1480053167, now seen corresponding path program 3 times [2019-12-18 12:35:28,613 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:35:28,613 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300770881] [2019-12-18 12:35:28,613 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:35:28,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:35:28,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:35:28,678 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300770881] [2019-12-18 12:35:28,678 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:35:28,678 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:35:28,678 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270275432] [2019-12-18 12:35:28,679 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:35:28,679 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:35:28,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:35:28,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:35:28,679 INFO L87 Difference]: Start difference. First operand 26443 states and 80718 transitions. Second operand 3 states. [2019-12-18 12:35:28,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:35:28,916 INFO L93 Difference]: Finished difference Result 21129 states and 63693 transitions. [2019-12-18 12:35:28,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:35:28,916 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-18 12:35:28,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:35:28,959 INFO L225 Difference]: With dead ends: 21129 [2019-12-18 12:35:28,960 INFO L226 Difference]: Without dead ends: 21129 [2019-12-18 12:35:28,962 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:35:29,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21129 states. [2019-12-18 12:35:29,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21129 to 19443. [2019-12-18 12:35:29,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19443 states. [2019-12-18 12:35:29,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19443 states to 19443 states and 58635 transitions. [2019-12-18 12:35:29,462 INFO L78 Accepts]: Start accepts. Automaton has 19443 states and 58635 transitions. Word has length 66 [2019-12-18 12:35:29,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:35:29,462 INFO L462 AbstractCegarLoop]: Abstraction has 19443 states and 58635 transitions. [2019-12-18 12:35:29,462 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:35:29,462 INFO L276 IsEmpty]: Start isEmpty. Operand 19443 states and 58635 transitions. [2019-12-18 12:35:29,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 12:35:29,492 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:35:29,492 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:35:29,492 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:35:29,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:35:29,493 INFO L82 PathProgramCache]: Analyzing trace with hash 817808390, now seen corresponding path program 1 times [2019-12-18 12:35:29,493 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:35:29,493 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363485101] [2019-12-18 12:35:29,493 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:35:29,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 12:35:29,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 12:35:29,655 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 12:35:29,655 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 12:35:29,659 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [903] [903] ULTIMATE.startENTRY-->L827: Formula: (let ((.cse0 (store |v_#valid_73| 0 0))) (and (= 0 v_~z$flush_delayed~0_27) (= v_~z$r_buff1_thd1~0_114 0) (= v_~main$tmp_guard1~0_44 0) (= v_~z$read_delayed_var~0.offset_6 0) (= 0 v_~z$r_buff0_thd3~0_325) (= v_~z$mem_tmp~0_16 0) (= 0 v_~z$r_buff1_thd3~0_218) (= |v_#NULL.offset_3| 0) (= v_~z$read_delayed~0_8 0) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t409~0.base_44| 4)) (= 0 v_~weak$$choice0~0_15) (= v_~z$w_buff1~0_167 0) (= v_~z$r_buff0_thd0~0_136 0) (= v_~x~0_84 0) (= v_~z$r_buff0_thd1~0_185 0) (< 0 |v_#StackHeapBarrier_18|) (= v_~z$read_delayed_var~0.base_6 0) (= 0 v_~__unbuffered_p2_EAX~0_46) (= 0 v_~weak$$choice2~0_93) (= 0 v_~__unbuffered_p1_EAX~0_60) (= v_~z$w_buff0~0_229 0) (= 0 v_~__unbuffered_p0_EAX~0_95) (= 0 v_~__unbuffered_cnt~0_63) (= v_~z$r_buff0_thd2~0_132 0) (= v_~z~0_167 0) (= |v_#valid_71| (store .cse0 |v_ULTIMATE.start_main_~#t409~0.base_44| 1)) (= v_~main$tmp_guard0~0_44 0) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t409~0.base_44| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t409~0.base_44|) |v_ULTIMATE.start_main_~#t409~0.offset_30| 0)) |v_#memory_int_21|) (= v_~y~0_39 0) (= v_~z$w_buff1_used~0_386 0) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t409~0.base_44|) (= (select .cse0 |v_ULTIMATE.start_main_~#t409~0.base_44|) 0) (= v_~__unbuffered_p2_EBX~0_54 0) (= v_~z$r_buff1_thd0~0_148 0) (= 0 |v_#NULL.base_3|) (= v_~z$w_buff0_used~0_680 0) (= v_~z$r_buff1_thd2~0_108 0) (= 0 |v_ULTIMATE.start_main_~#t409~0.offset_30|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_73|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_~#t411~0.base=|v_ULTIMATE.start_main_~#t411~0.base_24|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_108, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_86|, #NULL.offset=|v_#NULL.offset_3|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_44|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_140|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_82|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_136, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_95, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_60, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_46, ~z$mem_tmp~0=v_~z$mem_tmp~0_16, ULTIMATE.start_main_~#t410~0.offset=|v_ULTIMATE.start_main_~#t410~0.offset_30|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_54, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_11|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_386, ~z$flush_delayed~0=v_~z$flush_delayed~0_27, ~weak$$choice0~0=v_~weak$$choice0~0_15, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ULTIMATE.start_main_~#t410~0.base=|v_ULTIMATE.start_main_~#t410~0.base_44|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_114, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_6, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_325, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_63, ~x~0=v_~x~0_84, ULTIMATE.start_main_~#t409~0.base=|v_ULTIMATE.start_main_~#t409~0.base_44|, ~z$read_delayed~0=v_~z$read_delayed~0_8, ~z$w_buff1~0=v_~z$w_buff1~0_167, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_44, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_103|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_6, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_42|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_148, ULTIMATE.start_main_~#t409~0.offset=|v_ULTIMATE.start_main_~#t409~0.offset_30|, ULTIMATE.start_main_~#t411~0.offset=|v_ULTIMATE.start_main_~#t411~0.offset_19|, ~y~0=v_~y~0_39, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_132, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_27|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_680, ~z$w_buff0~0=v_~z$w_buff0~0_229, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_10|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_218, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_44, #NULL.base=|v_#NULL.base_3|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_27|, #valid=|v_#valid_71|, #memory_int=|v_#memory_int_21|, ~z~0=v_~z~0_167, ~weak$$choice2~0=v_~weak$$choice2~0_93, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_185} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t411~0.base, ~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ULTIMATE.start_main_~#t410~0.offset, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~nondet45, ~z$w_buff1_used~0, ~z$flush_delayed~0, ~weak$$choice0~0, ULTIMATE.start_main_~#t410~0.base, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_~#t409~0.base, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite51, ~z$r_buff1_thd0~0, ULTIMATE.start_main_~#t409~0.offset, ULTIMATE.start_main_~#t411~0.offset, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet46, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_#t~nondet44, ~z$r_buff1_thd3~0, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 12:35:29,661 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [881] [881] L4-->L748: Formula: (and (= ~z$r_buff1_thd2~0_Out-2095936658 ~z$r_buff0_thd2~0_In-2095936658) (= ~x~0_In-2095936658 ~__unbuffered_p0_EAX~0_Out-2095936658) (not (= P0Thread1of1ForFork1___VERIFIER_assert_~expression_In-2095936658 0)) (= 1 ~z$r_buff0_thd1~0_Out-2095936658) (= ~z$r_buff0_thd1~0_In-2095936658 ~z$r_buff1_thd1~0_Out-2095936658) (= ~z$r_buff0_thd0~0_In-2095936658 ~z$r_buff1_thd0~0_Out-2095936658) (= ~z$r_buff1_thd3~0_Out-2095936658 ~z$r_buff0_thd3~0_In-2095936658)) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-2095936658, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-2095936658, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In-2095936658, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-2095936658, ~x~0=~x~0_In-2095936658, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-2095936658} OutVars{~__unbuffered_p0_EAX~0=~__unbuffered_p0_EAX~0_Out-2095936658, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-2095936658, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_Out-2095936658, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_Out-2095936658, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_Out-2095936658, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_Out-2095936658, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-2095936658, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In-2095936658, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out-2095936658, ~x~0=~x~0_In-2095936658, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-2095936658} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 12:35:29,662 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [874] [874] L827-1-->L829: Formula: (and (= (select |v_#valid_37| |v_ULTIMATE.start_main_~#t410~0.base_13|) 0) (= |v_#valid_36| (store |v_#valid_37| |v_ULTIMATE.start_main_~#t410~0.base_13| 1)) (not (= |v_ULTIMATE.start_main_~#t410~0.base_13| 0)) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t410~0.base_13| 4)) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t410~0.base_13|) (= |v_#memory_int_13| (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t410~0.base_13| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t410~0.base_13|) |v_ULTIMATE.start_main_~#t410~0.offset_11| 1))) (= |v_ULTIMATE.start_main_~#t410~0.offset_11| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_~#t410~0.offset=|v_ULTIMATE.start_main_~#t410~0.offset_11|, ULTIMATE.start_main_~#t410~0.base=|v_ULTIMATE.start_main_~#t410~0.base_13|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_5|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_13|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t410~0.offset, ULTIMATE.start_main_~#t410~0.base, ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, #length] because there is no mapped edge [2019-12-18 12:35:29,665 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L768-2-->L768-5: Formula: (let ((.cse0 (= (mod ~z$r_buff1_thd2~0_In1495543308 256) 0)) (.cse2 (= |P1Thread1of1ForFork2_#t~ite9_Out1495543308| |P1Thread1of1ForFork2_#t~ite10_Out1495543308|)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In1495543308 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork2_#t~ite9_Out1495543308| ~z~0_In1495543308) .cse2) (and (not .cse0) (= |P1Thread1of1ForFork2_#t~ite9_Out1495543308| ~z$w_buff1~0_In1495543308) .cse2 (not .cse1)))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1495543308, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1495543308, ~z$w_buff1~0=~z$w_buff1~0_In1495543308, ~z~0=~z~0_In1495543308} OutVars{P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out1495543308|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1495543308, P1Thread1of1ForFork2_#t~ite10=|P1Thread1of1ForFork2_#t~ite10_Out1495543308|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1495543308, ~z$w_buff1~0=~z$w_buff1~0_In1495543308, ~z~0=~z~0_In1495543308} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite10] because there is no mapped edge [2019-12-18 12:35:29,666 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [848] [848] L769-->L769-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In-225587511 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-225587511 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork2_#t~ite11_Out-225587511|)) (and (= |P1Thread1of1ForFork2_#t~ite11_Out-225587511| ~z$w_buff0_used~0_In-225587511) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-225587511, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-225587511} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-225587511, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out-225587511|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-225587511} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-18 12:35:29,667 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L770-->L770-2: Formula: (let ((.cse3 (= 0 (mod ~z$r_buff1_thd2~0_In-2113646781 256))) (.cse2 (= (mod ~z$w_buff1_used~0_In-2113646781 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-2113646781 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In-2113646781 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork2_#t~ite12_Out-2113646781|)) (and (or .cse3 .cse2) (or .cse0 .cse1) (= ~z$w_buff1_used~0_In-2113646781 |P1Thread1of1ForFork2_#t~ite12_Out-2113646781|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-2113646781, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-2113646781, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2113646781, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-2113646781} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-2113646781, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-2113646781, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2113646781, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out-2113646781|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-2113646781} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-18 12:35:29,668 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [860] [860] L829-1-->L831: Formula: (and (not (= 0 |v_ULTIMATE.start_main_~#t411~0.base_10|)) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t411~0.base_10|) (= |v_#valid_32| (store |v_#valid_33| |v_ULTIMATE.start_main_~#t411~0.base_10| 1)) (= (select |v_#valid_33| |v_ULTIMATE.start_main_~#t411~0.base_10|) 0) (= (store |v_#length_14| |v_ULTIMATE.start_main_~#t411~0.base_10| 4) |v_#length_13|) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t411~0.base_10| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t411~0.base_10|) |v_ULTIMATE.start_main_~#t411~0.offset_9| 2)) |v_#memory_int_11|) (= |v_ULTIMATE.start_main_~#t411~0.offset_9| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_~#t411~0.base=|v_ULTIMATE.start_main_~#t411~0.base_10|, #StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_32|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_5|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t411~0.offset=|v_ULTIMATE.start_main_~#t411~0.offset_9|, #length=|v_#length_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t411~0.base, #valid, ULTIMATE.start_main_#t~nondet45, #memory_int, ULTIMATE.start_main_~#t411~0.offset, #length] because there is no mapped edge [2019-12-18 12:35:29,671 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [882] [882] L793-->L793-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In-504609466 256)))) (or (and (let ((.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In-504609466 256)))) (or (and (= (mod ~z$r_buff1_thd3~0_In-504609466 256) 0) .cse0) (and (= (mod ~z$w_buff1_used~0_In-504609466 256) 0) .cse0) (= (mod ~z$w_buff0_used~0_In-504609466 256) 0))) (= |P2Thread1of1ForFork0_#t~ite20_Out-504609466| ~z$w_buff0~0_In-504609466) (= |P2Thread1of1ForFork0_#t~ite20_Out-504609466| |P2Thread1of1ForFork0_#t~ite21_Out-504609466|) .cse1) (and (not .cse1) (= |P2Thread1of1ForFork0_#t~ite20_In-504609466| |P2Thread1of1ForFork0_#t~ite20_Out-504609466|) (= ~z$w_buff0~0_In-504609466 |P2Thread1of1ForFork0_#t~ite21_Out-504609466|)))) InVars {~z$w_buff0~0=~z$w_buff0~0_In-504609466, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-504609466, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-504609466, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-504609466, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-504609466, P2Thread1of1ForFork0_#t~ite20=|P2Thread1of1ForFork0_#t~ite20_In-504609466|, ~weak$$choice2~0=~weak$$choice2~0_In-504609466} OutVars{P2Thread1of1ForFork0_#t~ite21=|P2Thread1of1ForFork0_#t~ite21_Out-504609466|, ~z$w_buff0~0=~z$w_buff0~0_In-504609466, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-504609466, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-504609466, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-504609466, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-504609466, P2Thread1of1ForFork0_#t~ite20=|P2Thread1of1ForFork0_#t~ite20_Out-504609466|, ~weak$$choice2~0=~weak$$choice2~0_In-504609466} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite21, P2Thread1of1ForFork0_#t~ite20] because there is no mapped edge [2019-12-18 12:35:29,672 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [880] [880] L794-->L794-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-236089518 256)))) (or (and .cse0 (= |P2Thread1of1ForFork0_#t~ite23_Out-236089518| ~z$w_buff1~0_In-236089518) (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In-236089518 256) 0))) (or (and (= 0 (mod ~z$w_buff1_used~0_In-236089518 256)) .cse1) (= (mod ~z$w_buff0_used~0_In-236089518 256) 0) (and (= 0 (mod ~z$r_buff1_thd3~0_In-236089518 256)) .cse1))) (= |P2Thread1of1ForFork0_#t~ite23_Out-236089518| |P2Thread1of1ForFork0_#t~ite24_Out-236089518|)) (and (= |P2Thread1of1ForFork0_#t~ite23_In-236089518| |P2Thread1of1ForFork0_#t~ite23_Out-236089518|) (not .cse0) (= |P2Thread1of1ForFork0_#t~ite24_Out-236089518| ~z$w_buff1~0_In-236089518)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-236089518, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-236089518, P2Thread1of1ForFork0_#t~ite23=|P2Thread1of1ForFork0_#t~ite23_In-236089518|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-236089518, ~z$w_buff1~0=~z$w_buff1~0_In-236089518, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-236089518, ~weak$$choice2~0=~weak$$choice2~0_In-236089518} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-236089518, P2Thread1of1ForFork0_#t~ite23=|P2Thread1of1ForFork0_#t~ite23_Out-236089518|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-236089518, P2Thread1of1ForFork0_#t~ite24=|P2Thread1of1ForFork0_#t~ite24_Out-236089518|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-236089518, ~z$w_buff1~0=~z$w_buff1~0_In-236089518, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-236089518, ~weak$$choice2~0=~weak$$choice2~0_In-236089518} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite23, P2Thread1of1ForFork0_#t~ite24] because there is no mapped edge [2019-12-18 12:35:29,676 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [824] [824] L797-->L798: Formula: (and (not (= (mod v_~weak$$choice2~0_37 256) 0)) (= v_~z$r_buff0_thd3~0_160 v_~z$r_buff0_thd3~0_161)) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_161, ~weak$$choice2~0=v_~weak$$choice2~0_37} OutVars{P2Thread1of1ForFork0_#t~ite33=|v_P2Thread1of1ForFork0_#t~ite33_8|, P2Thread1of1ForFork0_#t~ite32=|v_P2Thread1of1ForFork0_#t~ite32_9|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_160, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_12|, ~weak$$choice2~0=v_~weak$$choice2~0_37} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite33, P2Thread1of1ForFork0_#t~ite32, ~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-18 12:35:29,678 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] L800-->L804: Formula: (and (= v_~z~0_54 v_~z$mem_tmp~0_7) (not (= 0 (mod v_~z$flush_delayed~0_10 256))) (= 0 v_~z$flush_delayed~0_9)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_7, ~z$flush_delayed~0=v_~z$flush_delayed~0_10} OutVars{P2Thread1of1ForFork0_#t~ite37=|v_P2Thread1of1ForFork0_#t~ite37_7|, ~z$mem_tmp~0=v_~z$mem_tmp~0_7, ~z$flush_delayed~0=v_~z$flush_delayed~0_9, ~z~0=v_~z~0_54} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite37, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-18 12:35:29,679 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [829] [829] L804-2-->L804-4: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd3~0_In901564695 256))) (.cse0 (= (mod ~z$w_buff1_used~0_In901564695 256) 0))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork0_#t~ite38_Out901564695| ~z$w_buff1~0_In901564695)) (and (or .cse1 .cse0) (= |P2Thread1of1ForFork0_#t~ite38_Out901564695| ~z~0_In901564695)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In901564695, ~z$w_buff1_used~0=~z$w_buff1_used~0_In901564695, ~z$w_buff1~0=~z$w_buff1~0_In901564695, ~z~0=~z~0_In901564695} OutVars{P2Thread1of1ForFork0_#t~ite38=|P2Thread1of1ForFork0_#t~ite38_Out901564695|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In901564695, ~z$w_buff1_used~0=~z$w_buff1_used~0_In901564695, ~z$w_buff1~0=~z$w_buff1~0_In901564695, ~z~0=~z~0_In901564695} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-18 12:35:29,680 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [771] [771] L804-4-->L805: Formula: (= v_~z~0_30 |v_P2Thread1of1ForFork0_#t~ite38_10|) InVars {P2Thread1of1ForFork0_#t~ite38=|v_P2Thread1of1ForFork0_#t~ite38_10|} OutVars{P2Thread1of1ForFork0_#t~ite39=|v_P2Thread1of1ForFork0_#t~ite39_13|, P2Thread1of1ForFork0_#t~ite38=|v_P2Thread1of1ForFork0_#t~ite38_9|, ~z~0=v_~z~0_30} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite39, P2Thread1of1ForFork0_#t~ite38, ~z~0] because there is no mapped edge [2019-12-18 12:35:29,680 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [851] [851] L805-->L805-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-234966527 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-234966527 256)))) (or (and (= ~z$w_buff0_used~0_In-234966527 |P2Thread1of1ForFork0_#t~ite40_Out-234966527|) (or .cse0 .cse1)) (and (= |P2Thread1of1ForFork0_#t~ite40_Out-234966527| 0) (not .cse1) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-234966527, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-234966527} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-234966527, P2Thread1of1ForFork0_#t~ite40=|P2Thread1of1ForFork0_#t~ite40_Out-234966527|, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-234966527} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite40] because there is no mapped edge [2019-12-18 12:35:29,681 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L771-->L771-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd2~0_In725644379 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In725644379 256)))) (or (and (or .cse0 .cse1) (= ~z$r_buff0_thd2~0_In725644379 |P1Thread1of1ForFork2_#t~ite13_Out725644379|)) (and (= 0 |P1Thread1of1ForFork2_#t~ite13_Out725644379|) (not .cse1) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In725644379, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In725644379} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In725644379, P1Thread1of1ForFork2_#t~ite13=|P1Thread1of1ForFork2_#t~ite13_Out725644379|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In725644379} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite13] because there is no mapped edge [2019-12-18 12:35:29,683 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [839] [839] L749-->L749-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd1~0_In600450080 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In600450080 256)))) (or (and (= ~z$w_buff0_used~0_In600450080 |P0Thread1of1ForFork1_#t~ite5_Out600450080|) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= 0 |P0Thread1of1ForFork1_#t~ite5_Out600450080|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In600450080, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In600450080} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out600450080|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In600450080, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In600450080} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-18 12:35:29,684 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L750-->L750-2: Formula: (let ((.cse2 (= (mod ~z$r_buff1_thd1~0_In-933362778 256) 0)) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In-933362778 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-933362778 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd1~0_In-933362778 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$w_buff1_used~0_In-933362778 |P0Thread1of1ForFork1_#t~ite6_Out-933362778|)) (and (= |P0Thread1of1ForFork1_#t~ite6_Out-933362778| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-933362778, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-933362778, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-933362778, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-933362778} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-933362778, P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out-933362778|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-933362778, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-933362778, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-933362778} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-18 12:35:29,685 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L751-->L752: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In276894558 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd1~0_In276894558 256)))) (or (and (= ~z$r_buff0_thd1~0_In276894558 ~z$r_buff0_thd1~0_Out276894558) (or .cse0 .cse1)) (and (not .cse0) (= 0 ~z$r_buff0_thd1~0_Out276894558) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In276894558, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In276894558} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In276894558, P0Thread1of1ForFork1_#t~ite7=|P0Thread1of1ForFork1_#t~ite7_Out276894558|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out276894558} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 12:35:29,686 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L752-->L752-2: Formula: (let ((.cse3 (= 0 (mod ~z$r_buff0_thd1~0_In531531072 256))) (.cse2 (= (mod ~z$w_buff0_used~0_In531531072 256) 0)) (.cse0 (= (mod ~z$r_buff1_thd1~0_In531531072 256) 0)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In531531072 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P0Thread1of1ForFork1_#t~ite8_Out531531072| ~z$r_buff1_thd1~0_In531531072)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= |P0Thread1of1ForFork1_#t~ite8_Out531531072| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In531531072, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In531531072, ~z$w_buff1_used~0=~z$w_buff1_used~0_In531531072, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In531531072} OutVars{P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out531531072|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In531531072, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In531531072, ~z$w_buff1_used~0=~z$w_buff1_used~0_In531531072, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In531531072} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-18 12:35:29,686 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [878] [878] L752-2-->P0EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_46 1) v_~__unbuffered_cnt~0_45) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= v_~z$r_buff1_thd1~0_77 |v_P0Thread1of1ForFork1_#t~ite8_24|) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_24|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_46} OutVars{P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_23|, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_77, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_45} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8, P0Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd1~0, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-18 12:35:29,687 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [843] [843] L806-->L806-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1323384202 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In-1323384202 256))) (.cse2 (= 0 (mod ~z$r_buff1_thd3~0_In-1323384202 256))) (.cse3 (= (mod ~z$w_buff1_used~0_In-1323384202 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite41_Out-1323384202| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= |P2Thread1of1ForFork0_#t~ite41_Out-1323384202| ~z$w_buff1_used~0_In-1323384202) (or .cse2 .cse3)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1323384202, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1323384202, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1323384202, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1323384202} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1323384202, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1323384202, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1323384202, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1323384202, P2Thread1of1ForFork0_#t~ite41=|P2Thread1of1ForFork0_#t~ite41_Out-1323384202|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite41] because there is no mapped edge [2019-12-18 12:35:29,688 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [847] [847] L807-->L807-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd3~0_In1192083077 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In1192083077 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite42_Out1192083077| 0) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite42_Out1192083077| ~z$r_buff0_thd3~0_In1192083077)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1192083077, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1192083077} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1192083077, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1192083077, P2Thread1of1ForFork0_#t~ite42=|P2Thread1of1ForFork0_#t~ite42_Out1192083077|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-18 12:35:29,689 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L808-->L808-2: Formula: (let ((.cse1 (= (mod ~z$w_buff1_used~0_In234675291 256) 0)) (.cse0 (= 0 (mod ~z$r_buff1_thd3~0_In234675291 256))) (.cse2 (= 0 (mod ~z$r_buff0_thd3~0_In234675291 256))) (.cse3 (= (mod ~z$w_buff0_used~0_In234675291 256) 0))) (or (and (= 0 |P2Thread1of1ForFork0_#t~ite43_Out234675291|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse2 .cse3) (= |P2Thread1of1ForFork0_#t~ite43_Out234675291| ~z$r_buff1_thd3~0_In234675291)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In234675291, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In234675291, ~z$w_buff1_used~0=~z$w_buff1_used~0_In234675291, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In234675291} OutVars{P2Thread1of1ForFork0_#t~ite43=|P2Thread1of1ForFork0_#t~ite43_Out234675291|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In234675291, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In234675291, ~z$w_buff1_used~0=~z$w_buff1_used~0_In234675291, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In234675291} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite43] because there is no mapped edge [2019-12-18 12:35:29,689 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [873] [873] L808-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_39 1) v_~__unbuffered_cnt~0_38) (= v_~z$r_buff1_thd3~0_131 |v_P2Thread1of1ForFork0_#t~ite43_26|) (= |v_P2Thread1of1ForFork0_#res.base_5| 0)) InVars {P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_26|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_25|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_131, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_38, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite43, ~z$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-18 12:35:29,689 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L772-->L772-2: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff1_used~0_In-1333043369 256))) (.cse3 (= (mod ~z$r_buff1_thd2~0_In-1333043369 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In-1333043369 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1333043369 256)))) (or (and (= 0 |P1Thread1of1ForFork2_#t~ite14_Out-1333043369|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse0 .cse1) (= ~z$r_buff1_thd2~0_In-1333043369 |P1Thread1of1ForFork2_#t~ite14_Out-1333043369|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1333043369, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1333043369, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1333043369, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1333043369} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1333043369, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1333043369, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1333043369, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out-1333043369|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1333043369} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-18 12:35:29,689 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [867] [867] L772-2-->P1EXIT: Formula: (and (= v_~__unbuffered_cnt~0_32 (+ v_~__unbuffered_cnt~0_33 1)) (= |v_P1Thread1of1ForFork2_#t~ite14_26| v_~z$r_buff1_thd2~0_56) (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_33, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_26|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_56, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_32, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_25|, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-18 12:35:29,690 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [800] [800] L835-->L837-2: Formula: (and (or (= 0 (mod v_~z$r_buff0_thd0~0_51 256)) (= 0 (mod v_~z$w_buff0_used~0_293 256))) (not (= (mod v_~main$tmp_guard0~0_8 256) 0))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_51, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_293, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_51, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_293, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-18 12:35:29,690 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L837-2-->L837-4: Formula: (let ((.cse1 (= (mod ~z$r_buff1_thd0~0_In1545291948 256) 0)) (.cse0 (= (mod ~z$w_buff1_used~0_In1545291948 256) 0))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite47_Out1545291948| ~z$w_buff1~0_In1545291948)) (and (= |ULTIMATE.start_main_#t~ite47_Out1545291948| ~z~0_In1545291948) (or .cse1 .cse0)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1545291948, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1545291948, ~z$w_buff1~0=~z$w_buff1~0_In1545291948, ~z~0=~z~0_In1545291948} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1545291948, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out1545291948|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1545291948, ~z$w_buff1~0=~z$w_buff1~0_In1545291948, ~z~0=~z~0_In1545291948} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47] because there is no mapped edge [2019-12-18 12:35:29,691 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [762] [762] L837-4-->L838: Formula: (= v_~z~0_20 |v_ULTIMATE.start_main_#t~ite47_11|) InVars {ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_11|} OutVars{ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_10|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_14|, ~z~0=v_~z~0_20} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48, ~z~0] because there is no mapped edge [2019-12-18 12:35:29,691 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [842] [842] L838-->L838-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-884223819 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In-884223819 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite49_Out-884223819| ~z$w_buff0_used~0_In-884223819)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite49_Out-884223819| 0) (not .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-884223819, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-884223819} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-884223819, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-884223819, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out-884223819|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-18 12:35:29,692 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [835] [835] L839-->L839-2: Formula: (let ((.cse3 (= 0 (mod ~z$r_buff1_thd0~0_In1723172719 256))) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In1723172719 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In1723172719 256))) (.cse0 (= (mod ~z$r_buff0_thd0~0_In1723172719 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite50_Out1723172719| 0)) (and (or .cse3 .cse2) (= ~z$w_buff1_used~0_In1723172719 |ULTIMATE.start_main_#t~ite50_Out1723172719|) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1723172719, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1723172719, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1723172719, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1723172719} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out1723172719|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1723172719, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1723172719, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1723172719, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1723172719} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-18 12:35:29,693 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [846] [846] L840-->L840-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In-953410543 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In-953410543 256) 0))) (or (and (or .cse0 .cse1) (= ~z$r_buff0_thd0~0_In-953410543 |ULTIMATE.start_main_#t~ite51_Out-953410543|)) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite51_Out-953410543| 0) (not .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-953410543, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-953410543} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-953410543, ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out-953410543|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-953410543} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-18 12:35:29,694 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L841-->L841-2: Formula: (let ((.cse3 (= (mod ~z$r_buff0_thd0~0_In-1436625343 256) 0)) (.cse2 (= (mod ~z$w_buff0_used~0_In-1436625343 256) 0)) (.cse1 (= (mod ~z$r_buff1_thd0~0_In-1436625343 256) 0)) (.cse0 (= (mod ~z$w_buff1_used~0_In-1436625343 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite52_Out-1436625343| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite52_Out-1436625343| ~z$r_buff1_thd0~0_In-1436625343)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1436625343, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1436625343, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1436625343, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1436625343} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out-1436625343|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1436625343, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1436625343, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1436625343, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1436625343} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-18 12:35:29,694 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [896] [896] L841-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= 0 v_~__unbuffered_p0_EAX~0_72) (= v_~z$r_buff1_thd0~0_123 |v_ULTIMATE.start_main_#t~ite52_43|) (= v_~__unbuffered_p2_EBX~0_32 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_19 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|) (= 0 v_~__unbuffered_p1_EAX~0_34) (= v_~main$tmp_guard1~0_23 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_19 0) (= 1 v_~__unbuffered_p2_EAX~0_25)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_72, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_43|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_32, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_34, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_25} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_72, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_42|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_19, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_32, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_34, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_123, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_23, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_25, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 12:35:29,826 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 12:35:29 BasicIcfg [2019-12-18 12:35:29,826 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 12:35:29,827 INFO L168 Benchmark]: Toolchain (without parser) took 110921.28 ms. Allocated memory was 140.5 MB in the beginning and 3.9 GB in the end (delta: 3.7 GB). Free memory was 101.1 MB in the beginning and 1.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 2.1 GB. Max. memory is 7.1 GB. [2019-12-18 12:35:29,828 INFO L168 Benchmark]: CDTParser took 0.55 ms. Allocated memory is still 140.5 MB. Free memory was 121.3 MB in the beginning and 121.1 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-18 12:35:29,828 INFO L168 Benchmark]: CACSL2BoogieTranslator took 817.94 ms. Allocated memory was 140.5 MB in the beginning and 202.9 MB in the end (delta: 62.4 MB). Free memory was 100.6 MB in the beginning and 156.1 MB in the end (delta: -55.5 MB). Peak memory consumption was 23.9 MB. Max. memory is 7.1 GB. [2019-12-18 12:35:29,829 INFO L168 Benchmark]: Boogie Procedure Inliner took 59.23 ms. Allocated memory is still 202.9 MB. Free memory was 156.1 MB in the beginning and 153.5 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-18 12:35:29,829 INFO L168 Benchmark]: Boogie Preprocessor took 39.22 ms. Allocated memory is still 202.9 MB. Free memory was 153.5 MB in the beginning and 151.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-18 12:35:29,829 INFO L168 Benchmark]: RCFGBuilder took 837.01 ms. Allocated memory is still 202.9 MB. Free memory was 151.0 MB in the beginning and 100.9 MB in the end (delta: 50.0 MB). Peak memory consumption was 50.0 MB. Max. memory is 7.1 GB. [2019-12-18 12:35:29,834 INFO L168 Benchmark]: TraceAbstraction took 109162.72 ms. Allocated memory was 202.9 MB in the beginning and 3.9 GB in the end (delta: 3.7 GB). Free memory was 100.3 MB in the beginning and 1.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 GB. [2019-12-18 12:35:29,837 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.55 ms. Allocated memory is still 140.5 MB. Free memory was 121.3 MB in the beginning and 121.1 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 817.94 ms. Allocated memory was 140.5 MB in the beginning and 202.9 MB in the end (delta: 62.4 MB). Free memory was 100.6 MB in the beginning and 156.1 MB in the end (delta: -55.5 MB). Peak memory consumption was 23.9 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 59.23 ms. Allocated memory is still 202.9 MB. Free memory was 156.1 MB in the beginning and 153.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 39.22 ms. Allocated memory is still 202.9 MB. Free memory was 153.5 MB in the beginning and 151.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 837.01 ms. Allocated memory is still 202.9 MB. Free memory was 151.0 MB in the beginning and 100.9 MB in the end (delta: 50.0 MB). Peak memory consumption was 50.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 109162.72 ms. Allocated memory was 202.9 MB in the beginning and 3.9 GB in the end (delta: 3.7 GB). Free memory was 100.3 MB in the beginning and 1.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.7s, 177 ProgramPointsBefore, 92 ProgramPointsAfterwards, 214 TransitionsBefore, 101 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 8 FixpointIterations, 34 TrivialSequentialCompositions, 51 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 34 ConcurrentYvCompositions, 32 ChoiceCompositions, 7082 VarBasedMoverChecksPositive, 219 VarBasedMoverChecksNegative, 19 SemBasedMoverChecksPositive, 262 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.6s, 0 MoverChecksTotal, 89688 CheckedPairsTotal, 119 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L827] FCALL, FORK 0 pthread_create(&t409, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L733] 1 z$w_buff1 = z$w_buff0 [L734] 1 z$w_buff0 = 1 [L735] 1 z$w_buff1_used = z$w_buff0_used [L736] 1 z$w_buff0_used = (_Bool)1 [L829] FCALL, FORK 0 pthread_create(&t410, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L762] 2 x = 1 [L765] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L768] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L768] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L769] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L831] FCALL, FORK 0 pthread_create(&t411, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L782] 3 y = 1 [L785] 3 __unbuffered_p2_EAX = y [L788] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L789] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L790] 3 z$flush_delayed = weak$$choice2 [L791] 3 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L792] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L792] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L793] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L794] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L795] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used))=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L795] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L796] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L796] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L798] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L798] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L799] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L804] 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L770] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L771] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L748] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L748] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L749] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L750] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L805] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L806] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L807] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L833] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L838] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L839] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L840] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 168 locations, 2 error locations. Result: UNSAFE, OverallTime: 108.8s, OverallIterations: 31, TraceHistogramMax: 1, AutomataDifference: 31.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 6544 SDtfs, 8519 SDslu, 15884 SDs, 0 SdLazy, 8192 SolverSat, 384 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 310 GetRequests, 69 SyntacticMatches, 21 SemanticMatches, 220 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 569 ImplicationChecksByTransitivity, 2.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=143879occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 51.0s AutomataMinimizationTime, 30 MinimizatonAttempts, 392395 StatesRemovedByMinimization, 28 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 1197 NumberOfCodeBlocks, 1197 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 1100 ConstructedInterpolants, 0 QuantifiedInterpolants, 180162 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 30 InterpolantComputations, 30 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...