/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/podwr001_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 14:02:28,452 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 14:02:28,456 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 14:02:28,472 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 14:02:28,472 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 14:02:28,473 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 14:02:28,474 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 14:02:28,476 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 14:02:28,478 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 14:02:28,479 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 14:02:28,480 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 14:02:28,481 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 14:02:28,481 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 14:02:28,482 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 14:02:28,483 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 14:02:28,484 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 14:02:28,485 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 14:02:28,486 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 14:02:28,487 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 14:02:28,489 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 14:02:28,491 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 14:02:28,492 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 14:02:28,493 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 14:02:28,493 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 14:02:28,497 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 14:02:28,498 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 14:02:28,500 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 14:02:28,501 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 14:02:28,501 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 14:02:28,502 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 14:02:28,502 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 14:02:28,503 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 14:02:28,507 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 14:02:28,508 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 14:02:28,508 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 14:02:28,511 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 14:02:28,512 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 14:02:28,512 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 14:02:28,512 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 14:02:28,513 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 14:02:28,514 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 14:02:28,518 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 14:02:28,539 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 14:02:28,539 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 14:02:28,541 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 14:02:28,542 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 14:02:28,542 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 14:02:28,542 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 14:02:28,542 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 14:02:28,543 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 14:02:28,543 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 14:02:28,543 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 14:02:28,544 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 14:02:28,544 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 14:02:28,545 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 14:02:28,545 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 14:02:28,545 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 14:02:28,545 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 14:02:28,546 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 14:02:28,546 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 14:02:28,546 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 14:02:28,546 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 14:02:28,547 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 14:02:28,547 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 14:02:28,547 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 14:02:28,547 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 14:02:28,547 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 14:02:28,548 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 14:02:28,548 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 14:02:28,548 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 14:02:28,548 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-18 14:02:28,548 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 14:02:28,842 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 14:02:28,864 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 14:02:28,870 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 14:02:28,871 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 14:02:28,872 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 14:02:28,873 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/podwr001_power.oepc.i [2019-12-18 14:02:28,945 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7fcc1e771/69aaaa46d9564f59a83cfd2bd29bbd04/FLAGcddc92979 [2019-12-18 14:02:29,517 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 14:02:29,518 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/podwr001_power.oepc.i [2019-12-18 14:02:29,532 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7fcc1e771/69aaaa46d9564f59a83cfd2bd29bbd04/FLAGcddc92979 [2019-12-18 14:02:29,797 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7fcc1e771/69aaaa46d9564f59a83cfd2bd29bbd04 [2019-12-18 14:02:29,806 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 14:02:29,808 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 14:02:29,809 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 14:02:29,809 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 14:02:29,813 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 14:02:29,814 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 02:02:29" (1/1) ... [2019-12-18 14:02:29,817 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@163f1a5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:02:29, skipping insertion in model container [2019-12-18 14:02:29,817 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 02:02:29" (1/1) ... [2019-12-18 14:02:29,825 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 14:02:29,884 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 14:02:30,470 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 14:02:30,486 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 14:02:30,554 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 14:02:30,642 INFO L208 MainTranslator]: Completed translation [2019-12-18 14:02:30,642 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:02:30 WrapperNode [2019-12-18 14:02:30,642 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 14:02:30,643 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 14:02:30,643 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 14:02:30,643 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 14:02:30,651 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:02:30" (1/1) ... [2019-12-18 14:02:30,672 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:02:30" (1/1) ... [2019-12-18 14:02:30,703 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 14:02:30,703 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 14:02:30,703 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 14:02:30,703 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 14:02:30,712 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:02:30" (1/1) ... [2019-12-18 14:02:30,712 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:02:30" (1/1) ... [2019-12-18 14:02:30,717 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:02:30" (1/1) ... [2019-12-18 14:02:30,717 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:02:30" (1/1) ... [2019-12-18 14:02:30,728 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:02:30" (1/1) ... [2019-12-18 14:02:30,733 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:02:30" (1/1) ... [2019-12-18 14:02:30,736 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:02:30" (1/1) ... [2019-12-18 14:02:30,742 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 14:02:30,743 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 14:02:30,743 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 14:02:30,743 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 14:02:30,744 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:02:30" (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 14:02:30,823 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 14:02:30,823 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 14:02:30,823 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 14:02:30,823 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 14:02:30,823 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 14:02:30,824 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 14:02:30,824 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 14:02:30,824 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 14:02:30,824 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 14:02:30,824 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 14:02:30,825 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 14:02:30,825 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 14:02:30,825 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 14:02:30,827 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 14:02:31,651 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 14:02:31,651 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 14:02:31,652 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 02:02:31 BoogieIcfgContainer [2019-12-18 14:02:31,653 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 14:02:31,654 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 14:02:31,654 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 14:02:31,658 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 14:02:31,658 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 02:02:29" (1/3) ... [2019-12-18 14:02:31,660 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@514b9355 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 02:02:31, skipping insertion in model container [2019-12-18 14:02:31,662 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:02:30" (2/3) ... [2019-12-18 14:02:31,662 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@514b9355 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 02:02:31, skipping insertion in model container [2019-12-18 14:02:31,663 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 02:02:31" (3/3) ... [2019-12-18 14:02:31,666 INFO L109 eAbstractionObserver]: Analyzing ICFG podwr001_power.oepc.i [2019-12-18 14:02:31,677 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 14:02:31,678 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 14:02:31,688 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 14:02:31,689 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 14:02:31,731 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:31,732 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:31,732 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:31,732 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:31,732 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:31,732 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:31,733 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:31,733 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:31,734 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:31,735 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:31,735 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:31,735 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:31,735 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:31,736 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:31,736 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:31,736 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:31,736 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:31,737 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:31,737 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:31,737 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:31,737 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:31,738 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:31,738 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:31,738 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:31,738 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:31,739 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:31,739 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:31,739 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:31,739 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:31,740 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:31,741 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:31,741 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:31,742 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:31,742 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:31,745 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:31,745 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:31,746 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:31,747 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:31,749 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:31,750 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:31,751 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:31,768 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:31,768 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:31,769 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:31,769 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:31,770 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:31,770 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:31,770 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:31,770 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:31,771 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:31,771 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:31,771 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:31,771 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:31,771 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:31,772 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:31,772 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:31,772 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:31,772 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:31,772 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:31,773 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:31,773 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:31,773 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:31,773 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:31,773 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:31,774 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:31,775 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:31,775 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:31,775 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:31,775 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:31,775 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:31,776 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:31,776 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:31,776 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:31,776 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:31,777 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:31,777 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:31,777 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:31,777 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:31,777 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:31,778 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:31,778 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:31,778 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:31,778 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:31,779 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:31,779 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:31,779 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:31,779 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:31,780 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:31,780 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:31,780 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:31,780 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:31,780 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:31,781 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:31,781 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:31,781 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:31,781 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:31,781 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:31,782 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:31,782 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:31,782 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:31,782 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:31,782 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:31,783 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:31,783 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:31,783 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:31,783 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:31,783 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:31,784 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:31,784 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:31,784 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:31,784 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:31,785 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:31,785 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:31,785 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:31,785 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:31,785 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:31,786 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:31,786 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:31,786 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:31,786 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:31,786 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:31,787 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:31,787 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:31,787 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:31,787 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:31,787 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:31,788 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:31,788 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:31,788 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:31,788 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:31,788 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:31,789 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:31,789 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:31,789 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:31,789 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:31,789 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:31,790 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:31,790 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:31,790 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:31,790 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:31,790 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:31,791 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:31,791 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:31,791 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:31,791 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:31,791 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:31,792 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:31,792 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:31,792 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:31,792 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:31,792 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:31,793 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:31,793 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:31,793 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:31,793 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:31,793 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:31,793 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:31,794 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:31,794 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:31,794 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:31,794 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:31,794 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:31,795 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:31,795 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:31,795 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:31,795 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:31,795 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:31,796 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:31,796 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:31,796 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:31,796 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:31,796 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:31,797 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:31,797 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:31,797 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:31,797 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:31,797 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:31,798 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:31,798 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:31,798 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:31,798 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:31,798 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:31,802 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:31,802 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:31,803 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:31,803 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:31,803 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:31,803 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:31,803 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:31,804 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:31,804 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:31,804 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:31,804 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:31,804 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:31,804 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:31,805 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:31,805 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:31,805 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:31,805 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:31,805 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:31,806 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:31,806 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:31,806 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:31,806 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:31,806 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:31,806 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:31,807 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:31,807 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:31,807 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:31,807 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:31,807 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:31,808 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:31,808 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:31,808 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:31,808 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:31,811 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:31,811 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:31,811 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:31,812 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:31,812 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:31,812 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:31,812 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:31,813 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:31,813 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:31,813 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:31,813 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:31,813 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:31,818 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:31,819 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:31,819 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:31,819 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:31,819 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:31,819 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:31,820 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:31,820 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:31,820 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:31,820 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:02:31,837 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 14:02:31,857 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 14:02:31,858 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 14:02:31,858 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 14:02:31,858 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 14:02:31,858 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 14:02:31,858 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 14:02:31,858 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 14:02:31,859 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 14:02:31,876 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 176 places, 213 transitions [2019-12-18 14:02:31,878 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 176 places, 213 transitions [2019-12-18 14:02:31,973 INFO L126 PetriNetUnfolder]: 47/210 cut-off events. [2019-12-18 14:02:31,974 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 14:02:31,992 INFO L76 FinitePrefix]: Finished finitePrefix Result has 220 conditions, 210 events. 47/210 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 427 event pairs. 9/170 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 14:02:32,020 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 176 places, 213 transitions [2019-12-18 14:02:32,071 INFO L126 PetriNetUnfolder]: 47/210 cut-off events. [2019-12-18 14:02:32,071 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 14:02:32,087 INFO L76 FinitePrefix]: Finished finitePrefix Result has 220 conditions, 210 events. 47/210 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 427 event pairs. 9/170 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 14:02:32,109 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-18 14:02:32,110 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 14:02:37,202 WARN L192 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 89 [2019-12-18 14:02:37,325 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-12-18 14:02:37,720 INFO L206 etLargeBlockEncoding]: Checked pairs total: 130045 [2019-12-18 14:02:37,720 INFO L214 etLargeBlockEncoding]: Total number of compositions: 121 [2019-12-18 14:02:37,724 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 95 places, 107 transitions [2019-12-18 14:03:00,630 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 126452 states. [2019-12-18 14:03:00,632 INFO L276 IsEmpty]: Start isEmpty. Operand 126452 states. [2019-12-18 14:03:00,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-18 14:03:00,637 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:03:00,638 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-18 14:03:00,638 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 14:03:00,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:03:00,643 INFO L82 PathProgramCache]: Analyzing trace with hash 913925, now seen corresponding path program 1 times [2019-12-18 14:03:00,650 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:03:00,651 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338168573] [2019-12-18 14:03:00,651 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:03:00,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:03:00,945 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 14:03:00,946 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338168573] [2019-12-18 14:03:00,947 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:03:00,947 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 14:03:00,948 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748683020] [2019-12-18 14:03:00,954 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:03:00,955 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:03:00,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:03:00,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:03:00,974 INFO L87 Difference]: Start difference. First operand 126452 states. Second operand 3 states. [2019-12-18 14:03:04,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:03:04,335 INFO L93 Difference]: Finished difference Result 125570 states and 538788 transitions. [2019-12-18 14:03:04,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:03:04,336 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-18 14:03:04,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:03:05,014 INFO L225 Difference]: With dead ends: 125570 [2019-12-18 14:03:05,015 INFO L226 Difference]: Without dead ends: 111010 [2019-12-18 14:03:05,016 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 14:03:11,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111010 states. [2019-12-18 14:03:14,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111010 to 111010. [2019-12-18 14:03:14,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111010 states. [2019-12-18 14:03:19,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111010 states to 111010 states and 475060 transitions. [2019-12-18 14:03:19,015 INFO L78 Accepts]: Start accepts. Automaton has 111010 states and 475060 transitions. Word has length 3 [2019-12-18 14:03:19,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:03:19,015 INFO L462 AbstractCegarLoop]: Abstraction has 111010 states and 475060 transitions. [2019-12-18 14:03:19,016 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:03:19,016 INFO L276 IsEmpty]: Start isEmpty. Operand 111010 states and 475060 transitions. [2019-12-18 14:03:19,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 14:03:19,020 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:03:19,020 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:03:19,021 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 14:03:19,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:03:19,021 INFO L82 PathProgramCache]: Analyzing trace with hash -1753094800, now seen corresponding path program 1 times [2019-12-18 14:03:19,021 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:03:19,022 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585459935] [2019-12-18 14:03:19,022 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:03:19,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:03:19,112 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 14:03:19,113 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585459935] [2019-12-18 14:03:19,113 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:03:19,113 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:03:19,113 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125931597] [2019-12-18 14:03:19,116 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 14:03:19,116 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:03:19,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 14:03:19,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 14:03:19,117 INFO L87 Difference]: Start difference. First operand 111010 states and 475060 transitions. Second operand 4 states. [2019-12-18 14:03:20,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:03:20,455 INFO L93 Difference]: Finished difference Result 172646 states and 710109 transitions. [2019-12-18 14:03:20,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 14:03:20,456 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 14:03:20,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:03:26,122 INFO L225 Difference]: With dead ends: 172646 [2019-12-18 14:03:26,123 INFO L226 Difference]: Without dead ends: 172548 [2019-12-18 14:03:26,124 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 14:03:31,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172548 states. [2019-12-18 14:03:35,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172548 to 158936. [2019-12-18 14:03:35,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158936 states. [2019-12-18 14:03:36,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158936 states to 158936 states and 661803 transitions. [2019-12-18 14:03:36,751 INFO L78 Accepts]: Start accepts. Automaton has 158936 states and 661803 transitions. Word has length 11 [2019-12-18 14:03:36,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:03:36,752 INFO L462 AbstractCegarLoop]: Abstraction has 158936 states and 661803 transitions. [2019-12-18 14:03:36,752 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 14:03:36,752 INFO L276 IsEmpty]: Start isEmpty. Operand 158936 states and 661803 transitions. [2019-12-18 14:03:36,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 14:03:36,760 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:03:36,760 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:03:36,760 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 14:03:36,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:03:36,761 INFO L82 PathProgramCache]: Analyzing trace with hash 216434073, now seen corresponding path program 1 times [2019-12-18 14:03:36,761 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:03:36,761 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912104572] [2019-12-18 14:03:36,761 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:03:36,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:03:36,813 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 14:03:36,813 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912104572] [2019-12-18 14:03:36,813 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:03:36,814 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:03:36,814 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938291746] [2019-12-18 14:03:36,814 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:03:36,814 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:03:36,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:03:36,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:03:36,815 INFO L87 Difference]: Start difference. First operand 158936 states and 661803 transitions. Second operand 3 states. [2019-12-18 14:03:36,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:03:36,967 INFO L93 Difference]: Finished difference Result 34208 states and 111904 transitions. [2019-12-18 14:03:36,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:03:36,967 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-18 14:03:36,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:03:37,039 INFO L225 Difference]: With dead ends: 34208 [2019-12-18 14:03:37,040 INFO L226 Difference]: Without dead ends: 34208 [2019-12-18 14:03:37,040 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:03:37,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34208 states. [2019-12-18 14:03:37,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34208 to 34208. [2019-12-18 14:03:37,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34208 states. [2019-12-18 14:03:37,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34208 states to 34208 states and 111904 transitions. [2019-12-18 14:03:37,711 INFO L78 Accepts]: Start accepts. Automaton has 34208 states and 111904 transitions. Word has length 13 [2019-12-18 14:03:37,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:03:37,712 INFO L462 AbstractCegarLoop]: Abstraction has 34208 states and 111904 transitions. [2019-12-18 14:03:37,712 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:03:37,712 INFO L276 IsEmpty]: Start isEmpty. Operand 34208 states and 111904 transitions. [2019-12-18 14:03:37,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 14:03:37,716 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:03:37,716 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:03:37,716 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 14:03:37,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:03:37,716 INFO L82 PathProgramCache]: Analyzing trace with hash -1948590504, now seen corresponding path program 1 times [2019-12-18 14:03:37,717 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:03:37,717 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783790915] [2019-12-18 14:03:37,717 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:03:37,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:03:37,806 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 14:03:37,806 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783790915] [2019-12-18 14:03:37,806 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:03:37,807 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 14:03:37,807 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136195239] [2019-12-18 14:03:37,807 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:03:37,807 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:03:37,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:03:37,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:03:37,808 INFO L87 Difference]: Start difference. First operand 34208 states and 111904 transitions. Second operand 3 states. [2019-12-18 14:03:38,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:03:38,039 INFO L93 Difference]: Finished difference Result 51809 states and 168645 transitions. [2019-12-18 14:03:38,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:03:38,040 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-18 14:03:38,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:03:38,130 INFO L225 Difference]: With dead ends: 51809 [2019-12-18 14:03:38,130 INFO L226 Difference]: Without dead ends: 51809 [2019-12-18 14:03:38,130 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 14:03:38,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51809 states. [2019-12-18 14:03:39,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51809 to 38969. [2019-12-18 14:03:39,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38969 states. [2019-12-18 14:03:39,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38969 states to 38969 states and 128499 transitions. [2019-12-18 14:03:39,422 INFO L78 Accepts]: Start accepts. Automaton has 38969 states and 128499 transitions. Word has length 16 [2019-12-18 14:03:39,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:03:39,423 INFO L462 AbstractCegarLoop]: Abstraction has 38969 states and 128499 transitions. [2019-12-18 14:03:39,423 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:03:39,424 INFO L276 IsEmpty]: Start isEmpty. Operand 38969 states and 128499 transitions. [2019-12-18 14:03:39,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 14:03:39,427 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:03:39,427 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:03:39,427 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 14:03:39,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:03:39,428 INFO L82 PathProgramCache]: Analyzing trace with hash -1821591471, now seen corresponding path program 1 times [2019-12-18 14:03:39,428 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:03:39,428 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795160432] [2019-12-18 14:03:39,428 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:03:39,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:03:39,527 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 14:03:39,528 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795160432] [2019-12-18 14:03:39,528 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:03:39,528 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 14:03:39,528 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288388606] [2019-12-18 14:03:39,528 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 14:03:39,529 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:03:39,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 14:03:39,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:03:39,529 INFO L87 Difference]: Start difference. First operand 38969 states and 128499 transitions. Second operand 5 states. [2019-12-18 14:03:40,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:03:40,129 INFO L93 Difference]: Finished difference Result 53507 states and 173644 transitions. [2019-12-18 14:03:40,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 14:03:40,130 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-18 14:03:40,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:03:40,223 INFO L225 Difference]: With dead ends: 53507 [2019-12-18 14:03:40,223 INFO L226 Difference]: Without dead ends: 53507 [2019-12-18 14:03:40,224 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 14:03:40,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53507 states. [2019-12-18 14:03:41,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53507 to 44557. [2019-12-18 14:03:41,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44557 states. [2019-12-18 14:03:41,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44557 states to 44557 states and 146077 transitions. [2019-12-18 14:03:41,502 INFO L78 Accepts]: Start accepts. Automaton has 44557 states and 146077 transitions. Word has length 16 [2019-12-18 14:03:41,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:03:41,502 INFO L462 AbstractCegarLoop]: Abstraction has 44557 states and 146077 transitions. [2019-12-18 14:03:41,502 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 14:03:41,503 INFO L276 IsEmpty]: Start isEmpty. Operand 44557 states and 146077 transitions. [2019-12-18 14:03:41,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 14:03:41,516 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:03:41,516 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 14:03:41,517 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 14:03:41,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:03:41,517 INFO L82 PathProgramCache]: Analyzing trace with hash -187432510, now seen corresponding path program 1 times [2019-12-18 14:03:41,517 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:03:41,517 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941786997] [2019-12-18 14:03:41,518 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:03:41,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:03:41,611 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 14:03:41,612 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941786997] [2019-12-18 14:03:41,612 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:03:41,612 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 14:03:41,613 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500125807] [2019-12-18 14:03:41,613 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 14:03:41,613 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:03:41,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 14:03:41,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 14:03:41,614 INFO L87 Difference]: Start difference. First operand 44557 states and 146077 transitions. Second operand 6 states. [2019-12-18 14:03:42,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:03:42,649 INFO L93 Difference]: Finished difference Result 66834 states and 212729 transitions. [2019-12-18 14:03:42,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 14:03:42,650 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-18 14:03:42,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:03:42,764 INFO L225 Difference]: With dead ends: 66834 [2019-12-18 14:03:42,765 INFO L226 Difference]: Without dead ends: 66820 [2019-12-18 14:03:42,765 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-18 14:03:43,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66820 states. [2019-12-18 14:03:44,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66820 to 44208. [2019-12-18 14:03:44,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44208 states. [2019-12-18 14:03:44,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44208 states to 44208 states and 144750 transitions. [2019-12-18 14:03:44,264 INFO L78 Accepts]: Start accepts. Automaton has 44208 states and 144750 transitions. Word has length 22 [2019-12-18 14:03:44,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:03:44,265 INFO L462 AbstractCegarLoop]: Abstraction has 44208 states and 144750 transitions. [2019-12-18 14:03:44,265 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 14:03:44,265 INFO L276 IsEmpty]: Start isEmpty. Operand 44208 states and 144750 transitions. [2019-12-18 14:03:44,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 14:03:44,282 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:03:44,282 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 14:03:44,283 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 14:03:44,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:03:44,283 INFO L82 PathProgramCache]: Analyzing trace with hash -200714255, now seen corresponding path program 1 times [2019-12-18 14:03:44,283 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:03:44,283 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007023493] [2019-12-18 14:03:44,284 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:03:44,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:03:44,341 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 14:03:44,342 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007023493] [2019-12-18 14:03:44,342 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:03:44,342 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 14:03:44,342 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931160960] [2019-12-18 14:03:44,343 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 14:03:44,343 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:03:44,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 14:03:44,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 14:03:44,344 INFO L87 Difference]: Start difference. First operand 44208 states and 144750 transitions. Second operand 4 states. [2019-12-18 14:03:44,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:03:44,422 INFO L93 Difference]: Finished difference Result 18127 states and 56319 transitions. [2019-12-18 14:03:44,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 14:03:44,423 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-18 14:03:44,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:03:44,449 INFO L225 Difference]: With dead ends: 18127 [2019-12-18 14:03:44,449 INFO L226 Difference]: Without dead ends: 18127 [2019-12-18 14:03:44,449 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 14:03:44,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18127 states. [2019-12-18 14:03:44,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18127 to 17799. [2019-12-18 14:03:44,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17799 states. [2019-12-18 14:03:44,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17799 states to 17799 states and 55383 transitions. [2019-12-18 14:03:44,727 INFO L78 Accepts]: Start accepts. Automaton has 17799 states and 55383 transitions. Word has length 25 [2019-12-18 14:03:44,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:03:44,728 INFO L462 AbstractCegarLoop]: Abstraction has 17799 states and 55383 transitions. [2019-12-18 14:03:44,728 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 14:03:44,728 INFO L276 IsEmpty]: Start isEmpty. Operand 17799 states and 55383 transitions. [2019-12-18 14:03:44,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 14:03:44,742 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:03:44,742 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 14:03:44,742 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 14:03:44,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:03:44,743 INFO L82 PathProgramCache]: Analyzing trace with hash 611460705, now seen corresponding path program 1 times [2019-12-18 14:03:44,743 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:03:44,743 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708577191] [2019-12-18 14:03:44,743 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:03:44,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:03:44,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:03:44,847 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708577191] [2019-12-18 14:03:44,847 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:03:44,848 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 14:03:44,848 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790539267] [2019-12-18 14:03:44,848 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 14:03:44,848 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:03:44,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 14:03:44,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 14:03:44,849 INFO L87 Difference]: Start difference. First operand 17799 states and 55383 transitions. Second operand 6 states. [2019-12-18 14:03:45,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:03:45,480 INFO L93 Difference]: Finished difference Result 25206 states and 75658 transitions. [2019-12-18 14:03:45,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 14:03:45,480 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-18 14:03:45,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:03:45,517 INFO L225 Difference]: With dead ends: 25206 [2019-12-18 14:03:45,517 INFO L226 Difference]: Without dead ends: 25206 [2019-12-18 14:03:45,518 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-18 14:03:45,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25206 states. [2019-12-18 14:03:45,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25206 to 20596. [2019-12-18 14:03:45,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20596 states. [2019-12-18 14:03:45,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20596 states to 20596 states and 63178 transitions. [2019-12-18 14:03:45,875 INFO L78 Accepts]: Start accepts. Automaton has 20596 states and 63178 transitions. Word has length 27 [2019-12-18 14:03:45,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:03:45,875 INFO L462 AbstractCegarLoop]: Abstraction has 20596 states and 63178 transitions. [2019-12-18 14:03:45,875 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 14:03:45,875 INFO L276 IsEmpty]: Start isEmpty. Operand 20596 states and 63178 transitions. [2019-12-18 14:03:45,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-18 14:03:45,898 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:03:45,898 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 14:03:45,898 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 14:03:45,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:03:45,899 INFO L82 PathProgramCache]: Analyzing trace with hash -1170391984, now seen corresponding path program 1 times [2019-12-18 14:03:45,899 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:03:45,899 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115337346] [2019-12-18 14:03:45,900 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:03:45,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:03:46,007 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 14:03:46,008 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115337346] [2019-12-18 14:03:46,008 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:03:46,009 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 14:03:46,009 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246342940] [2019-12-18 14:03:46,010 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 14:03:46,010 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:03:46,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 14:03:46,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 14:03:46,011 INFO L87 Difference]: Start difference. First operand 20596 states and 63178 transitions. Second operand 7 states. [2019-12-18 14:03:47,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:03:47,540 INFO L93 Difference]: Finished difference Result 28185 states and 83945 transitions. [2019-12-18 14:03:47,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-18 14:03:47,541 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-18 14:03:47,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:03:47,580 INFO L225 Difference]: With dead ends: 28185 [2019-12-18 14:03:47,580 INFO L226 Difference]: Without dead ends: 28185 [2019-12-18 14:03:47,581 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2019-12-18 14:03:47,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28185 states. [2019-12-18 14:03:47,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28185 to 19533. [2019-12-18 14:03:47,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19533 states. [2019-12-18 14:03:47,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19533 states to 19533 states and 59996 transitions. [2019-12-18 14:03:47,932 INFO L78 Accepts]: Start accepts. Automaton has 19533 states and 59996 transitions. Word has length 33 [2019-12-18 14:03:47,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:03:47,933 INFO L462 AbstractCegarLoop]: Abstraction has 19533 states and 59996 transitions. [2019-12-18 14:03:47,933 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 14:03:47,933 INFO L276 IsEmpty]: Start isEmpty. Operand 19533 states and 59996 transitions. [2019-12-18 14:03:47,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-18 14:03:47,959 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:03:47,959 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:03:47,960 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 14:03:47,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:03:47,960 INFO L82 PathProgramCache]: Analyzing trace with hash -471967596, now seen corresponding path program 1 times [2019-12-18 14:03:47,960 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:03:47,961 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316227922] [2019-12-18 14:03:47,961 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:03:47,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:03:48,062 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 14:03:48,063 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316227922] [2019-12-18 14:03:48,063 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:03:48,063 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 14:03:48,063 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518909684] [2019-12-18 14:03:48,064 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 14:03:48,064 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:03:48,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 14:03:48,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:03:48,064 INFO L87 Difference]: Start difference. First operand 19533 states and 59996 transitions. Second operand 5 states. [2019-12-18 14:03:48,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:03:48,161 INFO L93 Difference]: Finished difference Result 18279 states and 57074 transitions. [2019-12-18 14:03:48,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 14:03:48,162 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2019-12-18 14:03:48,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:03:48,195 INFO L225 Difference]: With dead ends: 18279 [2019-12-18 14:03:48,196 INFO L226 Difference]: Without dead ends: 18279 [2019-12-18 14:03:48,196 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:03:48,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18279 states. [2019-12-18 14:03:48,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18279 to 17698. [2019-12-18 14:03:48,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17698 states. [2019-12-18 14:03:48,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17698 states to 17698 states and 55505 transitions. [2019-12-18 14:03:48,570 INFO L78 Accepts]: Start accepts. Automaton has 17698 states and 55505 transitions. Word has length 39 [2019-12-18 14:03:48,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:03:48,570 INFO L462 AbstractCegarLoop]: Abstraction has 17698 states and 55505 transitions. [2019-12-18 14:03:48,570 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 14:03:48,570 INFO L276 IsEmpty]: Start isEmpty. Operand 17698 states and 55505 transitions. [2019-12-18 14:03:48,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 14:03:48,596 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:03:48,597 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:03:48,597 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 14:03:48,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:03:48,597 INFO L82 PathProgramCache]: Analyzing trace with hash -2116688157, now seen corresponding path program 1 times [2019-12-18 14:03:48,598 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:03:48,598 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324035764] [2019-12-18 14:03:48,598 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:03:48,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:03:48,712 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 14:03:48,712 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324035764] [2019-12-18 14:03:48,713 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:03:48,713 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 14:03:48,713 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675310093] [2019-12-18 14:03:48,715 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 14:03:48,716 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:03:48,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 14:03:48,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 14:03:48,716 INFO L87 Difference]: Start difference. First operand 17698 states and 55505 transitions. Second operand 7 states. [2019-12-18 14:03:49,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:03:49,374 INFO L93 Difference]: Finished difference Result 48537 states and 151835 transitions. [2019-12-18 14:03:49,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 14:03:49,375 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-18 14:03:49,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:03:49,452 INFO L225 Difference]: With dead ends: 48537 [2019-12-18 14:03:49,452 INFO L226 Difference]: Without dead ends: 38006 [2019-12-18 14:03:49,453 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-18 14:03:49,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38006 states. [2019-12-18 14:03:49,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38006 to 21047. [2019-12-18 14:03:49,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21047 states. [2019-12-18 14:03:49,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21047 states to 21047 states and 66538 transitions. [2019-12-18 14:03:49,943 INFO L78 Accepts]: Start accepts. Automaton has 21047 states and 66538 transitions. Word has length 64 [2019-12-18 14:03:49,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:03:49,943 INFO L462 AbstractCegarLoop]: Abstraction has 21047 states and 66538 transitions. [2019-12-18 14:03:49,943 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 14:03:49,943 INFO L276 IsEmpty]: Start isEmpty. Operand 21047 states and 66538 transitions. [2019-12-18 14:03:49,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 14:03:49,970 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:03:49,971 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:03:49,971 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 14:03:49,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:03:49,971 INFO L82 PathProgramCache]: Analyzing trace with hash -978914267, now seen corresponding path program 2 times [2019-12-18 14:03:49,972 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:03:49,972 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357379683] [2019-12-18 14:03:49,972 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:03:49,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:03:50,062 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 14:03:50,063 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357379683] [2019-12-18 14:03:50,063 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:03:50,063 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 14:03:50,063 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271247145] [2019-12-18 14:03:50,064 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 14:03:50,064 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:03:50,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 14:03:50,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 14:03:50,065 INFO L87 Difference]: Start difference. First operand 21047 states and 66538 transitions. Second operand 7 states. [2019-12-18 14:03:50,361 WARN L192 SmtUtils]: Spent 280.00 ms on a formula simplification that was a NOOP. DAG size: 6 [2019-12-18 14:03:50,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:03:50,967 INFO L93 Difference]: Finished difference Result 57554 states and 178145 transitions. [2019-12-18 14:03:50,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 14:03:50,968 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-18 14:03:50,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:03:51,036 INFO L225 Difference]: With dead ends: 57554 [2019-12-18 14:03:51,036 INFO L226 Difference]: Without dead ends: 41745 [2019-12-18 14:03:51,037 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-18 14:03:51,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41745 states. [2019-12-18 14:03:51,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41745 to 24743. [2019-12-18 14:03:51,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24743 states. [2019-12-18 14:03:51,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24743 states to 24743 states and 78318 transitions. [2019-12-18 14:03:51,568 INFO L78 Accepts]: Start accepts. Automaton has 24743 states and 78318 transitions. Word has length 64 [2019-12-18 14:03:51,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:03:51,568 INFO L462 AbstractCegarLoop]: Abstraction has 24743 states and 78318 transitions. [2019-12-18 14:03:51,568 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 14:03:51,568 INFO L276 IsEmpty]: Start isEmpty. Operand 24743 states and 78318 transitions. [2019-12-18 14:03:51,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 14:03:51,601 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:03:51,601 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:03:51,601 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 14:03:51,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:03:51,602 INFO L82 PathProgramCache]: Analyzing trace with hash -423923923, now seen corresponding path program 3 times [2019-12-18 14:03:51,602 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:03:51,602 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967273861] [2019-12-18 14:03:51,602 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:03:51,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:03:51,698 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 14:03:51,698 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967273861] [2019-12-18 14:03:51,698 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:03:51,698 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 14:03:51,699 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139594380] [2019-12-18 14:03:51,699 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 14:03:51,699 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:03:51,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 14:03:51,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 14:03:51,700 INFO L87 Difference]: Start difference. First operand 24743 states and 78318 transitions. Second operand 7 states. [2019-12-18 14:03:52,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:03:52,217 INFO L93 Difference]: Finished difference Result 51247 states and 161421 transitions. [2019-12-18 14:03:52,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-18 14:03:52,218 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-18 14:03:52,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:03:52,288 INFO L225 Difference]: With dead ends: 51247 [2019-12-18 14:03:52,289 INFO L226 Difference]: Without dead ends: 47407 [2019-12-18 14:03:52,289 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2019-12-18 14:03:52,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47407 states. [2019-12-18 14:03:52,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47407 to 24923. [2019-12-18 14:03:52,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24923 states. [2019-12-18 14:03:53,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24923 states to 24923 states and 79050 transitions. [2019-12-18 14:03:53,351 INFO L78 Accepts]: Start accepts. Automaton has 24923 states and 79050 transitions. Word has length 64 [2019-12-18 14:03:53,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:03:53,352 INFO L462 AbstractCegarLoop]: Abstraction has 24923 states and 79050 transitions. [2019-12-18 14:03:53,352 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 14:03:53,352 INFO L276 IsEmpty]: Start isEmpty. Operand 24923 states and 79050 transitions. [2019-12-18 14:03:53,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 14:03:53,395 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:03:53,395 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:03:53,395 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 14:03:53,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:03:53,396 INFO L82 PathProgramCache]: Analyzing trace with hash -314768521, now seen corresponding path program 4 times [2019-12-18 14:03:53,396 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:03:53,396 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961971490] [2019-12-18 14:03:53,396 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:03:53,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:03:53,480 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 14:03:53,480 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961971490] [2019-12-18 14:03:53,481 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:03:53,481 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:03:53,481 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146009427] [2019-12-18 14:03:53,481 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:03:53,482 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:03:53,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:03:53,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:03:53,482 INFO L87 Difference]: Start difference. First operand 24923 states and 79050 transitions. Second operand 3 states. [2019-12-18 14:03:53,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:03:53,580 INFO L93 Difference]: Finished difference Result 20919 states and 64986 transitions. [2019-12-18 14:03:53,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:03:53,580 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-18 14:03:53,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:03:53,622 INFO L225 Difference]: With dead ends: 20919 [2019-12-18 14:03:53,622 INFO L226 Difference]: Without dead ends: 20919 [2019-12-18 14:03:53,623 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 14:03:53,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20919 states. [2019-12-18 14:03:53,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20919 to 19827. [2019-12-18 14:03:53,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19827 states. [2019-12-18 14:03:53,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19827 states to 19827 states and 61272 transitions. [2019-12-18 14:03:53,969 INFO L78 Accepts]: Start accepts. Automaton has 19827 states and 61272 transitions. Word has length 64 [2019-12-18 14:03:53,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:03:53,969 INFO L462 AbstractCegarLoop]: Abstraction has 19827 states and 61272 transitions. [2019-12-18 14:03:53,969 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:03:53,969 INFO L276 IsEmpty]: Start isEmpty. Operand 19827 states and 61272 transitions. [2019-12-18 14:03:53,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 14:03:53,992 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:03:53,992 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 14:03:53,992 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 14:03:53,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:03:53,992 INFO L82 PathProgramCache]: Analyzing trace with hash 231413698, now seen corresponding path program 1 times [2019-12-18 14:03:53,992 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:03:53,992 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809805814] [2019-12-18 14:03:53,993 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:03:54,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:03:54,056 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 14:03:54,056 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809805814] [2019-12-18 14:03:54,057 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:03:54,057 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:03:54,057 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826717152] [2019-12-18 14:03:54,057 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:03:54,058 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:03:54,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:03:54,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:03:54,058 INFO L87 Difference]: Start difference. First operand 19827 states and 61272 transitions. Second operand 3 states. [2019-12-18 14:03:54,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:03:54,220 INFO L93 Difference]: Finished difference Result 24197 states and 74265 transitions. [2019-12-18 14:03:54,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:03:54,221 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-18 14:03:54,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:03:54,264 INFO L225 Difference]: With dead ends: 24197 [2019-12-18 14:03:54,264 INFO L226 Difference]: Without dead ends: 24197 [2019-12-18 14:03:54,267 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 14:03:54,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24197 states. [2019-12-18 14:03:54,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24197 to 21036. [2019-12-18 14:03:54,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21036 states. [2019-12-18 14:03:54,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21036 states to 21036 states and 65069 transitions. [2019-12-18 14:03:54,619 INFO L78 Accepts]: Start accepts. Automaton has 21036 states and 65069 transitions. Word has length 65 [2019-12-18 14:03:54,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:03:54,620 INFO L462 AbstractCegarLoop]: Abstraction has 21036 states and 65069 transitions. [2019-12-18 14:03:54,620 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:03:54,620 INFO L276 IsEmpty]: Start isEmpty. Operand 21036 states and 65069 transitions. [2019-12-18 14:03:54,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 14:03:54,644 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:03:54,644 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 14:03:54,645 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 14:03:54,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:03:54,645 INFO L82 PathProgramCache]: Analyzing trace with hash 198410648, now seen corresponding path program 1 times [2019-12-18 14:03:54,645 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:03:54,645 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469365024] [2019-12-18 14:03:54,645 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:03:54,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:03:54,722 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 14:03:54,722 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469365024] [2019-12-18 14:03:54,722 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:03:54,723 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 14:03:54,723 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573305641] [2019-12-18 14:03:54,723 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 14:03:54,723 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:03:54,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 14:03:54,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 14:03:54,724 INFO L87 Difference]: Start difference. First operand 21036 states and 65069 transitions. Second operand 4 states. [2019-12-18 14:03:54,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:03:54,916 INFO L93 Difference]: Finished difference Result 24621 states and 75632 transitions. [2019-12-18 14:03:54,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 14:03:54,917 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-12-18 14:03:54,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:03:54,960 INFO L225 Difference]: With dead ends: 24621 [2019-12-18 14:03:54,961 INFO L226 Difference]: Without dead ends: 24621 [2019-12-18 14:03:54,961 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 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 14:03:55,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24621 states. [2019-12-18 14:03:55,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24621 to 21144. [2019-12-18 14:03:55,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21144 states. [2019-12-18 14:03:55,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21144 states to 21144 states and 65300 transitions. [2019-12-18 14:03:55,394 INFO L78 Accepts]: Start accepts. Automaton has 21144 states and 65300 transitions. Word has length 66 [2019-12-18 14:03:55,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:03:55,395 INFO L462 AbstractCegarLoop]: Abstraction has 21144 states and 65300 transitions. [2019-12-18 14:03:55,395 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 14:03:55,395 INFO L276 IsEmpty]: Start isEmpty. Operand 21144 states and 65300 transitions. [2019-12-18 14:03:55,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 14:03:55,419 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:03:55,419 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 14:03:55,419 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 14:03:55,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:03:55,419 INFO L82 PathProgramCache]: Analyzing trace with hash 745619748, now seen corresponding path program 1 times [2019-12-18 14:03:55,420 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:03:55,420 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478740599] [2019-12-18 14:03:55,420 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:03:55,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:03:55,600 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 14:03:55,600 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478740599] [2019-12-18 14:03:55,601 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:03:55,601 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 14:03:55,601 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945592847] [2019-12-18 14:03:55,601 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 14:03:55,602 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:03:55,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 14:03:55,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-12-18 14:03:55,602 INFO L87 Difference]: Start difference. First operand 21144 states and 65300 transitions. Second operand 10 states. [2019-12-18 14:03:57,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:03:57,940 INFO L93 Difference]: Finished difference Result 38488 states and 118451 transitions. [2019-12-18 14:03:57,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-18 14:03:57,940 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 66 [2019-12-18 14:03:57,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:03:57,998 INFO L225 Difference]: With dead ends: 38488 [2019-12-18 14:03:57,999 INFO L226 Difference]: Without dead ends: 30672 [2019-12-18 14:03:57,999 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=94, Invalid=368, Unknown=0, NotChecked=0, Total=462 [2019-12-18 14:03:58,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30672 states. [2019-12-18 14:03:58,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30672 to 21745. [2019-12-18 14:03:58,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21745 states. [2019-12-18 14:03:58,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21745 states to 21745 states and 67061 transitions. [2019-12-18 14:03:58,771 INFO L78 Accepts]: Start accepts. Automaton has 21745 states and 67061 transitions. Word has length 66 [2019-12-18 14:03:58,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:03:58,771 INFO L462 AbstractCegarLoop]: Abstraction has 21745 states and 67061 transitions. [2019-12-18 14:03:58,771 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 14:03:58,771 INFO L276 IsEmpty]: Start isEmpty. Operand 21745 states and 67061 transitions. [2019-12-18 14:03:58,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 14:03:58,812 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:03:58,812 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 14:03:58,813 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 14:03:58,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:03:58,813 INFO L82 PathProgramCache]: Analyzing trace with hash -1421968206, now seen corresponding path program 2 times [2019-12-18 14:03:58,813 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:03:58,814 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242133034] [2019-12-18 14:03:58,814 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:03:58,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:03:59,045 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 14:03:59,048 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242133034] [2019-12-18 14:03:59,048 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:03:59,048 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 14:03:59,050 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126087282] [2019-12-18 14:03:59,050 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 14:03:59,051 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:03:59,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 14:03:59,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-18 14:03:59,052 INFO L87 Difference]: Start difference. First operand 21745 states and 67061 transitions. Second operand 10 states. [2019-12-18 14:04:00,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:04:00,844 INFO L93 Difference]: Finished difference Result 37884 states and 115944 transitions. [2019-12-18 14:04:00,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-18 14:04:00,844 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 66 [2019-12-18 14:04:00,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:04:00,890 INFO L225 Difference]: With dead ends: 37884 [2019-12-18 14:04:00,890 INFO L226 Difference]: Without dead ends: 31924 [2019-12-18 14:04:00,890 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2019-12-18 14:04:00,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31924 states. [2019-12-18 14:04:01,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31924 to 22197. [2019-12-18 14:04:01,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22197 states. [2019-12-18 14:04:01,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22197 states to 22197 states and 68309 transitions. [2019-12-18 14:04:01,329 INFO L78 Accepts]: Start accepts. Automaton has 22197 states and 68309 transitions. Word has length 66 [2019-12-18 14:04:01,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:04:01,329 INFO L462 AbstractCegarLoop]: Abstraction has 22197 states and 68309 transitions. [2019-12-18 14:04:01,329 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 14:04:01,329 INFO L276 IsEmpty]: Start isEmpty. Operand 22197 states and 68309 transitions. [2019-12-18 14:04:01,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 14:04:01,357 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:04:01,357 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 14:04:01,357 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 14:04:01,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:04:01,358 INFO L82 PathProgramCache]: Analyzing trace with hash 765284024, now seen corresponding path program 3 times [2019-12-18 14:04:01,358 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:04:01,358 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258111405] [2019-12-18 14:04:01,358 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:04:01,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:04:01,516 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 14:04:01,517 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258111405] [2019-12-18 14:04:01,517 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:04:01,517 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 14:04:01,517 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923744951] [2019-12-18 14:04:01,518 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 14:04:01,518 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:04:01,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 14:04:01,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 14:04:01,519 INFO L87 Difference]: Start difference. First operand 22197 states and 68309 transitions. Second operand 11 states. [2019-12-18 14:04:02,509 WARN L192 SmtUtils]: Spent 266.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2019-12-18 14:04:03,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:04:03,638 INFO L93 Difference]: Finished difference Result 34983 states and 107283 transitions. [2019-12-18 14:04:03,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-18 14:04:03,639 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 66 [2019-12-18 14:04:03,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:04:03,688 INFO L225 Difference]: With dead ends: 34983 [2019-12-18 14:04:03,688 INFO L226 Difference]: Without dead ends: 31500 [2019-12-18 14:04:03,689 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=79, Invalid=341, Unknown=0, NotChecked=0, Total=420 [2019-12-18 14:04:03,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31500 states. [2019-12-18 14:04:04,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31500 to 21765. [2019-12-18 14:04:04,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21765 states. [2019-12-18 14:04:04,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21765 states to 21765 states and 66977 transitions. [2019-12-18 14:04:04,131 INFO L78 Accepts]: Start accepts. Automaton has 21765 states and 66977 transitions. Word has length 66 [2019-12-18 14:04:04,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:04:04,132 INFO L462 AbstractCegarLoop]: Abstraction has 21765 states and 66977 transitions. [2019-12-18 14:04:04,132 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 14:04:04,132 INFO L276 IsEmpty]: Start isEmpty. Operand 21765 states and 66977 transitions. [2019-12-18 14:04:04,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 14:04:04,159 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:04:04,160 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 14:04:04,160 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 14:04:04,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:04:04,160 INFO L82 PathProgramCache]: Analyzing trace with hash 53330666, now seen corresponding path program 4 times [2019-12-18 14:04:04,160 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:04:04,160 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391719470] [2019-12-18 14:04:04,160 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:04:04,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:04:04,327 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 14:04:04,327 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391719470] [2019-12-18 14:04:04,328 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:04:04,328 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 14:04:04,328 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528648076] [2019-12-18 14:04:04,329 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 14:04:04,329 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:04:04,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 14:04:04,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 14:04:04,329 INFO L87 Difference]: Start difference. First operand 21765 states and 66977 transitions. Second operand 11 states. [2019-12-18 14:04:06,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:04:06,124 INFO L93 Difference]: Finished difference Result 35662 states and 109099 transitions. [2019-12-18 14:04:06,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-18 14:04:06,124 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 66 [2019-12-18 14:04:06,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:04:06,169 INFO L225 Difference]: With dead ends: 35662 [2019-12-18 14:04:06,169 INFO L226 Difference]: Without dead ends: 31290 [2019-12-18 14:04:06,169 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=414, Unknown=0, NotChecked=0, Total=506 [2019-12-18 14:04:06,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31290 states. [2019-12-18 14:04:06,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31290 to 21989. [2019-12-18 14:04:06,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21989 states. [2019-12-18 14:04:06,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21989 states to 21989 states and 67561 transitions. [2019-12-18 14:04:06,584 INFO L78 Accepts]: Start accepts. Automaton has 21989 states and 67561 transitions. Word has length 66 [2019-12-18 14:04:06,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:04:06,585 INFO L462 AbstractCegarLoop]: Abstraction has 21989 states and 67561 transitions. [2019-12-18 14:04:06,585 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 14:04:06,585 INFO L276 IsEmpty]: Start isEmpty. Operand 21989 states and 67561 transitions. [2019-12-18 14:04:06,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 14:04:06,611 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:04:06,611 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 14:04:06,611 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 14:04:06,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:04:06,611 INFO L82 PathProgramCache]: Analyzing trace with hash 791396238, now seen corresponding path program 5 times [2019-12-18 14:04:06,612 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:04:06,612 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676510429] [2019-12-18 14:04:06,612 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:04:06,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:04:06,777 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 14:04:06,777 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676510429] [2019-12-18 14:04:06,777 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:04:06,777 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 14:04:06,778 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888975169] [2019-12-18 14:04:06,778 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 14:04:06,778 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:04:06,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 14:04:06,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-18 14:04:06,779 INFO L87 Difference]: Start difference. First operand 21989 states and 67561 transitions. Second operand 12 states. [2019-12-18 14:04:09,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:04:09,276 INFO L93 Difference]: Finished difference Result 33586 states and 102667 transitions. [2019-12-18 14:04:09,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-18 14:04:09,277 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 66 [2019-12-18 14:04:09,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:04:09,322 INFO L225 Difference]: With dead ends: 33586 [2019-12-18 14:04:09,322 INFO L226 Difference]: Without dead ends: 31848 [2019-12-18 14:04:09,322 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=378, Unknown=0, NotChecked=0, Total=462 [2019-12-18 14:04:09,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31848 states. [2019-12-18 14:04:09,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31848 to 21855. [2019-12-18 14:04:09,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21855 states. [2019-12-18 14:04:09,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21855 states to 21855 states and 67213 transitions. [2019-12-18 14:04:09,742 INFO L78 Accepts]: Start accepts. Automaton has 21855 states and 67213 transitions. Word has length 66 [2019-12-18 14:04:09,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:04:09,742 INFO L462 AbstractCegarLoop]: Abstraction has 21855 states and 67213 transitions. [2019-12-18 14:04:09,742 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 14:04:09,743 INFO L276 IsEmpty]: Start isEmpty. Operand 21855 states and 67213 transitions. [2019-12-18 14:04:09,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 14:04:09,768 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:04:09,768 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 14:04:09,768 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 14:04:09,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:04:09,768 INFO L82 PathProgramCache]: Analyzing trace with hash -315236056, now seen corresponding path program 6 times [2019-12-18 14:04:09,769 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:04:09,769 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203768693] [2019-12-18 14:04:09,769 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:04:09,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:04:09,972 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 14:04:09,973 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203768693] [2019-12-18 14:04:09,976 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:04:09,977 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 14:04:09,977 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190403058] [2019-12-18 14:04:09,977 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 14:04:09,977 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:04:09,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 14:04:09,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-18 14:04:09,980 INFO L87 Difference]: Start difference. First operand 21855 states and 67213 transitions. Second operand 12 states. [2019-12-18 14:04:13,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:04:13,057 INFO L93 Difference]: Finished difference Result 40439 states and 122976 transitions. [2019-12-18 14:04:13,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-12-18 14:04:13,057 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 66 [2019-12-18 14:04:13,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:04:13,107 INFO L225 Difference]: With dead ends: 40439 [2019-12-18 14:04:13,107 INFO L226 Difference]: Without dead ends: 34717 [2019-12-18 14:04:13,107 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=215, Invalid=1045, Unknown=0, NotChecked=0, Total=1260 [2019-12-18 14:04:13,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34717 states. [2019-12-18 14:04:13,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34717 to 21642. [2019-12-18 14:04:13,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21642 states. [2019-12-18 14:04:13,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21642 states to 21642 states and 66434 transitions. [2019-12-18 14:04:13,536 INFO L78 Accepts]: Start accepts. Automaton has 21642 states and 66434 transitions. Word has length 66 [2019-12-18 14:04:13,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:04:13,536 INFO L462 AbstractCegarLoop]: Abstraction has 21642 states and 66434 transitions. [2019-12-18 14:04:13,536 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 14:04:13,537 INFO L276 IsEmpty]: Start isEmpty. Operand 21642 states and 66434 transitions. [2019-12-18 14:04:13,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 14:04:13,558 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:04:13,558 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 14:04:13,558 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 14:04:13,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:04:13,558 INFO L82 PathProgramCache]: Analyzing trace with hash 99317356, now seen corresponding path program 7 times [2019-12-18 14:04:13,559 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:04:13,559 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773566456] [2019-12-18 14:04:13,559 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:04:13,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:04:14,101 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 14:04:14,101 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773566456] [2019-12-18 14:04:14,101 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:04:14,101 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 14:04:14,102 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641512345] [2019-12-18 14:04:14,102 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 14:04:14,102 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:04:14,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 14:04:14,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-12-18 14:04:14,103 INFO L87 Difference]: Start difference. First operand 21642 states and 66434 transitions. Second operand 11 states. [2019-12-18 14:04:17,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:04:17,050 INFO L93 Difference]: Finished difference Result 38167 states and 113736 transitions. [2019-12-18 14:04:17,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-12-18 14:04:17,050 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 66 [2019-12-18 14:04:17,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:04:17,102 INFO L225 Difference]: With dead ends: 38167 [2019-12-18 14:04:17,102 INFO L226 Difference]: Without dead ends: 37739 [2019-12-18 14:04:17,103 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 549 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=334, Invalid=1736, Unknown=0, NotChecked=0, Total=2070 [2019-12-18 14:04:17,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37739 states. [2019-12-18 14:04:17,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37739 to 26181. [2019-12-18 14:04:17,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26181 states. [2019-12-18 14:04:17,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26181 states to 26181 states and 79865 transitions. [2019-12-18 14:04:17,634 INFO L78 Accepts]: Start accepts. Automaton has 26181 states and 79865 transitions. Word has length 66 [2019-12-18 14:04:17,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:04:17,634 INFO L462 AbstractCegarLoop]: Abstraction has 26181 states and 79865 transitions. [2019-12-18 14:04:17,634 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 14:04:17,634 INFO L276 IsEmpty]: Start isEmpty. Operand 26181 states and 79865 transitions. [2019-12-18 14:04:17,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 14:04:17,668 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:04:17,668 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 14:04:17,668 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 14:04:17,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:04:17,668 INFO L82 PathProgramCache]: Analyzing trace with hash 1527279588, now seen corresponding path program 8 times [2019-12-18 14:04:17,669 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:04:17,669 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363680255] [2019-12-18 14:04:17,669 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:04:17,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:04:17,891 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 14:04:17,892 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363680255] [2019-12-18 14:04:17,892 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:04:17,892 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 14:04:17,892 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070561961] [2019-12-18 14:04:17,894 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-18 14:04:17,894 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:04:17,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-18 14:04:17,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2019-12-18 14:04:17,895 INFO L87 Difference]: Start difference. First operand 26181 states and 79865 transitions. Second operand 13 states. [2019-12-18 14:04:22,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:04:22,406 INFO L93 Difference]: Finished difference Result 59343 states and 177429 transitions. [2019-12-18 14:04:22,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-12-18 14:04:22,406 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 66 [2019-12-18 14:04:22,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:04:22,486 INFO L225 Difference]: With dead ends: 59343 [2019-12-18 14:04:22,487 INFO L226 Difference]: Without dead ends: 59175 [2019-12-18 14:04:22,487 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 536 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=363, Invalid=1799, Unknown=0, NotChecked=0, Total=2162 [2019-12-18 14:04:22,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59175 states. [2019-12-18 14:04:23,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59175 to 35482. [2019-12-18 14:04:23,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35482 states. [2019-12-18 14:04:23,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35482 states to 35482 states and 108008 transitions. [2019-12-18 14:04:23,208 INFO L78 Accepts]: Start accepts. Automaton has 35482 states and 108008 transitions. Word has length 66 [2019-12-18 14:04:23,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:04:23,208 INFO L462 AbstractCegarLoop]: Abstraction has 35482 states and 108008 transitions. [2019-12-18 14:04:23,208 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-18 14:04:23,208 INFO L276 IsEmpty]: Start isEmpty. Operand 35482 states and 108008 transitions. [2019-12-18 14:04:23,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 14:04:23,247 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:04:23,247 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:04:23,247 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 14:04:23,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:04:23,247 INFO L82 PathProgramCache]: Analyzing trace with hash 983480798, now seen corresponding path program 9 times [2019-12-18 14:04:23,248 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:04:23,248 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532419573] [2019-12-18 14:04:23,248 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:04:23,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:04:23,309 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 14:04:23,309 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532419573] [2019-12-18 14:04:23,309 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:04:23,309 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:04:23,310 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975076996] [2019-12-18 14:04:23,310 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:04:23,310 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:04:23,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:04:23,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:04:23,311 INFO L87 Difference]: Start difference. First operand 35482 states and 108008 transitions. Second operand 3 states. [2019-12-18 14:04:23,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:04:23,469 INFO L93 Difference]: Finished difference Result 35482 states and 108007 transitions. [2019-12-18 14:04:23,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:04:23,469 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-18 14:04:23,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:04:23,547 INFO L225 Difference]: With dead ends: 35482 [2019-12-18 14:04:23,547 INFO L226 Difference]: Without dead ends: 35482 [2019-12-18 14:04:23,547 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 14:04:23,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35482 states. [2019-12-18 14:04:24,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35482 to 29389. [2019-12-18 14:04:24,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29389 states. [2019-12-18 14:04:24,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29389 states to 29389 states and 90656 transitions. [2019-12-18 14:04:24,141 INFO L78 Accepts]: Start accepts. Automaton has 29389 states and 90656 transitions. Word has length 66 [2019-12-18 14:04:24,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:04:24,142 INFO L462 AbstractCegarLoop]: Abstraction has 29389 states and 90656 transitions. [2019-12-18 14:04:24,142 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:04:24,142 INFO L276 IsEmpty]: Start isEmpty. Operand 29389 states and 90656 transitions. [2019-12-18 14:04:24,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 14:04:24,179 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:04:24,179 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 14:04:24,179 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 14:04:24,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:04:24,180 INFO L82 PathProgramCache]: Analyzing trace with hash 1823504856, now seen corresponding path program 1 times [2019-12-18 14:04:24,180 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:04:24,180 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502837045] [2019-12-18 14:04:24,180 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:04:24,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:04:24,344 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 14:04:24,344 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502837045] [2019-12-18 14:04:24,344 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:04:24,345 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 14:04:24,345 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446446707] [2019-12-18 14:04:24,345 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 14:04:24,346 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:04:24,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 14:04:24,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 14:04:24,347 INFO L87 Difference]: Start difference. First operand 29389 states and 90656 transitions. Second operand 11 states. [2019-12-18 14:04:26,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:04:26,655 INFO L93 Difference]: Finished difference Result 43956 states and 134397 transitions. [2019-12-18 14:04:26,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-18 14:04:26,656 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-18 14:04:26,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:04:26,712 INFO L225 Difference]: With dead ends: 43956 [2019-12-18 14:04:26,713 INFO L226 Difference]: Without dead ends: 43029 [2019-12-18 14:04:26,713 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=127, Invalid=523, Unknown=0, NotChecked=0, Total=650 [2019-12-18 14:04:26,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43029 states. [2019-12-18 14:04:27,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43029 to 29293. [2019-12-18 14:04:27,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29293 states. [2019-12-18 14:04:27,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29293 states to 29293 states and 90396 transitions. [2019-12-18 14:04:27,247 INFO L78 Accepts]: Start accepts. Automaton has 29293 states and 90396 transitions. Word has length 67 [2019-12-18 14:04:27,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:04:27,247 INFO L462 AbstractCegarLoop]: Abstraction has 29293 states and 90396 transitions. [2019-12-18 14:04:27,247 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 14:04:27,247 INFO L276 IsEmpty]: Start isEmpty. Operand 29293 states and 90396 transitions. [2019-12-18 14:04:27,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 14:04:27,278 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:04:27,278 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 14:04:27,278 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 14:04:27,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:04:27,279 INFO L82 PathProgramCache]: Analyzing trace with hash -1154306208, now seen corresponding path program 2 times [2019-12-18 14:04:27,279 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:04:27,279 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839901466] [2019-12-18 14:04:27,279 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:04:27,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 14:04:27,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 14:04:27,421 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 14:04:27,421 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 14:04:27,425 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [895] [895] ULTIMATE.startENTRY-->L822: Formula: (let ((.cse0 (store |v_#valid_62| 0 0))) (and (= 0 v_~z$flush_delayed~0_27) (= 0 v_~x~0_129) (= 0 v_~__unbuffered_p1_EAX~0_44) (= v_~weak$$choice2~0_125 0) (= v_~z$read_delayed_var~0.offset_6 0) (= v_~z$r_buff0_thd1~0_274 0) (= |v_#NULL.offset_7| 0) (= v_~z$mem_tmp~0_16 0) (= v_~z$r_buff1_thd0~0_203 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1561~0.base_23|)) (= v_~main$tmp_guard1~0_48 0) (= 0 v_~z$r_buff0_thd3~0_416) (= |v_#valid_60| (store .cse0 |v_ULTIMATE.start_main_~#t1561~0.base_23| 1)) (= v_~z$w_buff1_used~0_618 0) (< 0 |v_#StackHeapBarrier_17|) (= 0 v_~__unbuffered_p2_EAX~0_39) (= v_~z$r_buff0_thd0~0_208 0) (= v_~z$read_delayed_var~0.base_6 0) (= v_~z$w_buff1~0_350 0) (= v_~z$w_buff0_used~0_900 0) (= 0 v_~__unbuffered_p0_EAX~0_137) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t1561~0.base_23|) (= 0 |v_ULTIMATE.start_main_~#t1561~0.offset_17|) (= v_~z$read_delayed~0_7 0) (= v_~z$r_buff1_thd2~0_170 0) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t1561~0.base_23| 4)) (= 0 |v_#NULL.base_7|) (= 0 v_~z$r_buff1_thd3~0_300) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1561~0.base_23| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1561~0.base_23|) |v_ULTIMATE.start_main_~#t1561~0.offset_17| 0)) |v_#memory_int_17|) (= v_~z$r_buff1_thd1~0_166 0) (= v_~z$w_buff0~0_454 0) (= 0 v_~weak$$choice0~0_13) (= v_~z~0_160 0) (= v_~main$tmp_guard0~0_24 0) (= 0 v_~__unbuffered_cnt~0_97) (= v_~z$r_buff0_thd2~0_191 0) (= v_~y~0_31 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_62|, #memory_int=|v_#memory_int_18|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_~#t1562~0.base=|v_ULTIMATE.start_main_~#t1562~0.base_19|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_170, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_29|, #NULL.offset=|v_#NULL.offset_7|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_69|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_175|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_81|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_208, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_137, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_44, #length=|v_#length_21|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_39, ~z$mem_tmp~0=v_~z$mem_tmp~0_16, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_7|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_618, ~z$flush_delayed~0=v_~z$flush_delayed~0_27, ~weak$$choice0~0=v_~weak$$choice0~0_13, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_166, ~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_416, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_97, ~x~0=v_~x~0_129, ULTIMATE.start_main_~#t1561~0.base=|v_ULTIMATE.start_main_~#t1561~0.base_23|, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_350, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_48, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_37|, ~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_52|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_203, ~y~0=v_~y~0_31, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_191, ULTIMATE.start_main_~#t1563~0.offset=|v_ULTIMATE.start_main_~#t1563~0.offset_14|, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_21|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_900, ~z$w_buff0~0=v_~z$w_buff0~0_454, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_8|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_300, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_24, ULTIMATE.start_main_~#t1562~0.offset=|v_ULTIMATE.start_main_~#t1562~0.offset_12|, #NULL.base=|v_#NULL.base_7|, ULTIMATE.start_main_~#t1563~0.base=|v_ULTIMATE.start_main_~#t1563~0.base_17|, ULTIMATE.start_main_~#t1561~0.offset=|v_ULTIMATE.start_main_~#t1561~0.offset_17|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_22|, #valid=|v_#valid_60|, #memory_int=|v_#memory_int_17|, ~z~0=v_~z~0_160, ~weak$$choice2~0=v_~weak$$choice2~0_125, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_274} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1562~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_#t~nondet45, ~z$w_buff1_used~0, ~z$flush_delayed~0, ~weak$$choice0~0, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_~#t1561~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, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_~#t1563~0.offset, 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, ULTIMATE.start_main_~#t1562~0.offset, #NULL.base, ULTIMATE.start_main_~#t1563~0.base, ULTIMATE.start_main_~#t1561~0.offset, 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 14:04:27,426 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [874] [874] L822-1-->L824: Formula: (and (not (= |v_ULTIMATE.start_main_~#t1562~0.base_11| 0)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1562~0.base_11|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1562~0.base_11| 4)) (= |v_ULTIMATE.start_main_~#t1562~0.offset_9| 0) (= |v_#valid_38| (store |v_#valid_39| |v_ULTIMATE.start_main_~#t1562~0.base_11| 1)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1562~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1562~0.base_11|) |v_ULTIMATE.start_main_~#t1562~0.offset_9| 1)) |v_#memory_int_13|) (= 0 (select |v_#valid_39| |v_ULTIMATE.start_main_~#t1562~0.base_11|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t1562~0.base=|v_ULTIMATE.start_main_~#t1562~0.base_11|, #StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_6|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_13|, #length=|v_#length_17|, ULTIMATE.start_main_~#t1562~0.offset=|v_ULTIMATE.start_main_~#t1562~0.offset_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1562~0.base, ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1562~0.offset] because there is no mapped edge [2019-12-18 14:04:27,426 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] L4-->L746: Formula: (and (= v_~z$r_buff0_thd2~0_29 v_~z$r_buff1_thd2~0_21) (= v_~__unbuffered_p0_EAX~0_8 v_~x~0_8) (= v_~z$r_buff0_thd0~0_28 v_~z$r_buff1_thd0~0_16) (= v_~z$r_buff0_thd1~0_26 1) (= v_~z$r_buff0_thd1~0_27 v_~z$r_buff1_thd1~0_15) (not (= v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_20 0)) (= v_~z$r_buff0_thd3~0_67 v_~z$r_buff1_thd3~0_43)) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_28, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_67, P0Thread1of1ForFork1___VERIFIER_assert_~expression=v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_20, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_27, ~x~0=v_~x~0_8, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_29} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_8, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_28, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_43, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_16, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_21, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_15, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_67, P0Thread1of1ForFork1___VERIFIER_assert_~expression=v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_20, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_26, ~x~0=v_~x~0_8, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_29} 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 14:04:27,429 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L766-2-->L766-4: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd2~0_In-2121818841 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-2121818841 256)))) (or (and (= |P1Thread1of1ForFork2_#t~ite9_Out-2121818841| ~z$w_buff1~0_In-2121818841) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork2_#t~ite9_Out-2121818841| ~z~0_In-2121818841)))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-2121818841, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2121818841, ~z$w_buff1~0=~z$w_buff1~0_In-2121818841, ~z~0=~z~0_In-2121818841} OutVars{P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out-2121818841|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-2121818841, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2121818841, ~z$w_buff1~0=~z$w_buff1~0_In-2121818841, ~z~0=~z~0_In-2121818841} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9] because there is no mapped edge [2019-12-18 14:04:27,429 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L766-4-->L767: Formula: (= v_~z~0_16 |v_P1Thread1of1ForFork2_#t~ite9_8|) InVars {P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_8|} OutVars{P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_7|, P1Thread1of1ForFork2_#t~ite10=|v_P1Thread1of1ForFork2_#t~ite10_7|, ~z~0=v_~z~0_16} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite10, ~z~0] because there is no mapped edge [2019-12-18 14:04:27,429 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [871] [871] L824-1-->L826: Formula: (and (= (store |v_#valid_37| |v_ULTIMATE.start_main_~#t1563~0.base_13| 1) |v_#valid_36|) (not (= 0 |v_ULTIMATE.start_main_~#t1563~0.base_13|)) (= |v_ULTIMATE.start_main_~#t1563~0.offset_11| 0) (= 0 (select |v_#valid_37| |v_ULTIMATE.start_main_~#t1563~0.base_13|)) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t1563~0.base_13| 4)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1563~0.base_13| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1563~0.base_13|) |v_ULTIMATE.start_main_~#t1563~0.offset_11| 2)) |v_#memory_int_11|) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t1563~0.base_13|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_36|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_5|, #memory_int=|v_#memory_int_11|, #length=|v_#length_15|, ULTIMATE.start_main_~#t1563~0.base=|v_ULTIMATE.start_main_~#t1563~0.base_13|, ULTIMATE.start_main_~#t1563~0.offset=|v_ULTIMATE.start_main_~#t1563~0.offset_11|} AuxVars[] AssignedVars[#valid, ULTIMATE.start_main_#t~nondet45, #memory_int, #length, ULTIMATE.start_main_~#t1563~0.base, ULTIMATE.start_main_~#t1563~0.offset] because there is no mapped edge [2019-12-18 14:04:27,429 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L767-->L767-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd2~0_In1520943798 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In1520943798 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork2_#t~ite11_Out1520943798| ~z$w_buff0_used~0_In1520943798)) (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork2_#t~ite11_Out1520943798| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1520943798, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1520943798} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1520943798, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out1520943798|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1520943798} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-18 14:04:27,430 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [823] [823] L768-->L768-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In264114810 256))) (.cse0 (= (mod ~z$r_buff0_thd2~0_In264114810 256) 0)) (.cse2 (= (mod ~z$w_buff1_used~0_In264114810 256) 0)) (.cse3 (= (mod ~z$r_buff1_thd2~0_In264114810 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork2_#t~ite12_Out264114810| 0)) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork2_#t~ite12_Out264114810| ~z$w_buff1_used~0_In264114810) (or .cse2 .cse3)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In264114810, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In264114810, ~z$w_buff1_used~0=~z$w_buff1_used~0_In264114810, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In264114810} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In264114810, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In264114810, ~z$w_buff1_used~0=~z$w_buff1_used~0_In264114810, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out264114810|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In264114810} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-18 14:04:27,433 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [842] [842] L769-->L769-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In517553470 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In517553470 256)))) (or (and (= |P1Thread1of1ForFork2_#t~ite13_Out517553470| 0) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~z$r_buff0_thd2~0_In517553470 |P1Thread1of1ForFork2_#t~ite13_Out517553470|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In517553470, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In517553470} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In517553470, P1Thread1of1ForFork2_#t~ite13=|P1Thread1of1ForFork2_#t~ite13_Out517553470|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In517553470} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite13] because there is no mapped edge [2019-12-18 14:04:27,435 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [875] [875] L790-->L790-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In-65656275 256)))) (or (and (let ((.cse0 (= (mod ~z$r_buff0_thd3~0_In-65656275 256) 0))) (or (= (mod ~z$w_buff0_used~0_In-65656275 256) 0) (and .cse0 (= 0 (mod ~z$r_buff1_thd3~0_In-65656275 256))) (and .cse0 (= 0 (mod ~z$w_buff1_used~0_In-65656275 256))))) (= |P2Thread1of1ForFork0_#t~ite26_Out-65656275| ~z$w_buff0_used~0_In-65656275) .cse1 (= |P2Thread1of1ForFork0_#t~ite27_Out-65656275| |P2Thread1of1ForFork0_#t~ite26_Out-65656275|)) (and (= |P2Thread1of1ForFork0_#t~ite27_Out-65656275| ~z$w_buff0_used~0_In-65656275) (= |P2Thread1of1ForFork0_#t~ite26_In-65656275| |P2Thread1of1ForFork0_#t~ite26_Out-65656275|) (not .cse1)))) InVars {P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_In-65656275|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-65656275, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-65656275, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-65656275, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-65656275, ~weak$$choice2~0=~weak$$choice2~0_In-65656275} OutVars{P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_Out-65656275|, P2Thread1of1ForFork0_#t~ite27=|P2Thread1of1ForFork0_#t~ite27_Out-65656275|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-65656275, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-65656275, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-65656275, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-65656275, ~weak$$choice2~0=~weak$$choice2~0_In-65656275} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite26, P2Thread1of1ForFork0_#t~ite27] because there is no mapped edge [2019-12-18 14:04:27,436 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [810] [810] L792-->L793: Formula: (and (= v_~z$r_buff0_thd3~0_99 v_~z$r_buff0_thd3~0_100) (not (= 0 (mod v_~weak$$choice2~0_30 256)))) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_100, ~weak$$choice2~0=v_~weak$$choice2~0_30} OutVars{P2Thread1of1ForFork0_#t~ite33=|v_P2Thread1of1ForFork0_#t~ite33_9|, P2Thread1of1ForFork0_#t~ite32=|v_P2Thread1of1ForFork0_#t~ite32_11|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_99, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_8|, ~weak$$choice2~0=v_~weak$$choice2~0_30} 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 14:04:27,438 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L747-->L747-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-24371176 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd1~0_In-24371176 256)))) (or (and (not .cse0) (not .cse1) (= |P0Thread1of1ForFork1_#t~ite5_Out-24371176| 0)) (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In-24371176 |P0Thread1of1ForFork1_#t~ite5_Out-24371176|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-24371176, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-24371176} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out-24371176|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-24371176, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-24371176} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-18 14:04:27,439 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [814] [814] L795-->L799: Formula: (and (not (= (mod v_~z$flush_delayed~0_8 256) 0)) (= 0 v_~z$flush_delayed~0_7) (= v_~z~0_50 v_~z$mem_tmp~0_5)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~z$flush_delayed~0=v_~z$flush_delayed~0_8} OutVars{P2Thread1of1ForFork0_#t~ite37=|v_P2Thread1of1ForFork0_#t~ite37_7|, ~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~z$flush_delayed~0=v_~z$flush_delayed~0_7, ~z~0=v_~z~0_50} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite37, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-18 14:04:27,439 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [827] [827] L799-2-->L799-5: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff1_thd3~0_In-1151706998 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In-1151706998 256))) (.cse2 (= |P2Thread1of1ForFork0_#t~ite39_Out-1151706998| |P2Thread1of1ForFork0_#t~ite38_Out-1151706998|))) (or (and (or .cse0 .cse1) (= ~z~0_In-1151706998 |P2Thread1of1ForFork0_#t~ite38_Out-1151706998|) .cse2) (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork0_#t~ite38_Out-1151706998| ~z$w_buff1~0_In-1151706998) .cse2))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1151706998, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1151706998, ~z$w_buff1~0=~z$w_buff1~0_In-1151706998, ~z~0=~z~0_In-1151706998} OutVars{P2Thread1of1ForFork0_#t~ite39=|P2Thread1of1ForFork0_#t~ite39_Out-1151706998|, P2Thread1of1ForFork0_#t~ite38=|P2Thread1of1ForFork0_#t~ite38_Out-1151706998|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1151706998, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1151706998, ~z$w_buff1~0=~z$w_buff1~0_In-1151706998, ~z~0=~z~0_In-1151706998} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite39, P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-18 14:04:27,440 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [843] [843] L800-->L800-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In1357140001 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In1357140001 256)))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork0_#t~ite40_Out1357140001| 0)) (and (or .cse1 .cse0) (= |P2Thread1of1ForFork0_#t~ite40_Out1357140001| ~z$w_buff0_used~0_In1357140001)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1357140001, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1357140001} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1357140001, P2Thread1of1ForFork0_#t~ite40=|P2Thread1of1ForFork0_#t~ite40_Out1357140001|, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1357140001} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite40] because there is no mapped edge [2019-12-18 14:04:27,441 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L801-->L801-2: Formula: (let ((.cse3 (= (mod ~z$w_buff0_used~0_In-1853296790 256) 0)) (.cse2 (= 0 (mod ~z$r_buff0_thd3~0_In-1853296790 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd3~0_In-1853296790 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In-1853296790 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite41_Out-1853296790| ~z$w_buff1_used~0_In-1853296790) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P2Thread1of1ForFork0_#t~ite41_Out-1853296790|) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1853296790, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1853296790, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1853296790, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1853296790} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1853296790, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1853296790, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1853296790, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1853296790, P2Thread1of1ForFork0_#t~ite41=|P2Thread1of1ForFork0_#t~ite41_Out-1853296790|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite41] because there is no mapped edge [2019-12-18 14:04:27,441 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [824] [824] L802-->L802-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In107551657 256))) (.cse1 (= (mod ~z$r_buff0_thd3~0_In107551657 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite42_Out107551657| ~z$r_buff0_thd3~0_In107551657) (or .cse0 .cse1)) (and (= 0 |P2Thread1of1ForFork0_#t~ite42_Out107551657|) (not .cse0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In107551657, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In107551657} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In107551657, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In107551657, P2Thread1of1ForFork0_#t~ite42=|P2Thread1of1ForFork0_#t~ite42_Out107551657|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-18 14:04:27,442 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [846] [846] L803-->L803-2: Formula: (let ((.cse0 (= (mod ~z$w_buff1_used~0_In-708664651 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd3~0_In-708664651 256))) (.cse2 (= (mod ~z$r_buff0_thd3~0_In-708664651 256) 0)) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In-708664651 256)))) (or (and (= ~z$r_buff1_thd3~0_In-708664651 |P2Thread1of1ForFork0_#t~ite43_Out-708664651|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P2Thread1of1ForFork0_#t~ite43_Out-708664651|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-708664651, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-708664651, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-708664651, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-708664651} OutVars{P2Thread1of1ForFork0_#t~ite43=|P2Thread1of1ForFork0_#t~ite43_Out-708664651|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-708664651, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-708664651, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-708664651, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-708664651} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite43] because there is no mapped edge [2019-12-18 14:04:27,442 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [859] [859] L803-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= v_~z$r_buff1_thd3~0_143 |v_P2Thread1of1ForFork0_#t~ite43_30|) (= (+ v_~__unbuffered_cnt~0_49 1) v_~__unbuffered_cnt~0_48) (= |v_P2Thread1of1ForFork0_#res.base_5| 0)) InVars {P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_49} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_29|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_143, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_48, 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 14:04:27,442 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [847] [847] L748-->L748-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd1~0_In459099463 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In459099463 256) 0)) (.cse3 (= (mod ~z$r_buff1_thd1~0_In459099463 256) 0)) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In459099463 256)))) (or (and (= |P0Thread1of1ForFork1_#t~ite6_Out459099463| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse3 .cse2) (= ~z$w_buff1_used~0_In459099463 |P0Thread1of1ForFork1_#t~ite6_Out459099463|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In459099463, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In459099463, ~z$w_buff1_used~0=~z$w_buff1_used~0_In459099463, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In459099463} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In459099463, P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out459099463|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In459099463, ~z$w_buff1_used~0=~z$w_buff1_used~0_In459099463, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In459099463} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-18 14:04:27,443 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [845] [845] L749-->L750: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd1~0_In922138995 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In922138995 256)))) (or (and (or .cse0 .cse1) (= ~z$r_buff0_thd1~0_In922138995 ~z$r_buff0_thd1~0_Out922138995)) (and (= 0 ~z$r_buff0_thd1~0_Out922138995) (not .cse0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In922138995, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In922138995} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In922138995, P0Thread1of1ForFork1_#t~ite7=|P0Thread1of1ForFork1_#t~ite7_Out922138995|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out922138995} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 14:04:27,443 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L750-->L750-2: Formula: (let ((.cse2 (= (mod ~z$w_buff1_used~0_In-1952993030 256) 0)) (.cse3 (= 0 (mod ~z$r_buff1_thd1~0_In-1952993030 256))) (.cse1 (= (mod ~z$r_buff0_thd1~0_In-1952993030 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1952993030 256)))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork1_#t~ite8_Out-1952993030| ~z$r_buff1_thd1~0_In-1952993030) (or .cse2 .cse3)) (and (= 0 |P0Thread1of1ForFork1_#t~ite8_Out-1952993030|) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1952993030, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1952993030, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1952993030, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1952993030} OutVars{P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out-1952993030|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1952993030, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1952993030, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1952993030, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1952993030} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-18 14:04:27,443 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [866] [866] L750-2-->P0EXIT: Formula: (and (= v_~z$r_buff1_thd1~0_100 |v_P0Thread1of1ForFork1_#t~ite8_44|) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= (+ v_~__unbuffered_cnt~0_67 1) v_~__unbuffered_cnt~0_66) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_44|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_67} OutVars{P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_43|, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_100, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_66} 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 14:04:27,444 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L770-->L770-2: Formula: (let ((.cse2 (= (mod ~z$r_buff1_thd2~0_In1002817027 256) 0)) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In1002817027 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In1002817027 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In1002817027 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork2_#t~ite14_Out1002817027| ~z$r_buff1_thd2~0_In1002817027) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= |P1Thread1of1ForFork2_#t~ite14_Out1002817027| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1002817027, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1002817027, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1002817027, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1002817027} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1002817027, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1002817027, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1002817027, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out1002817027|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1002817027} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-18 14:04:27,444 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [872] [872] L770-2-->P1EXIT: Formula: (and (= v_~z$r_buff1_thd2~0_120 |v_P1Thread1of1ForFork2_#t~ite14_34|) (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= v_~__unbuffered_cnt~0_76 (+ v_~__unbuffered_cnt~0_77 1)) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_77, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_34|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_120, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_76, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_33|, 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 14:04:27,444 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [799] [799] L826-1-->L832: Formula: (and (= 3 v_~__unbuffered_cnt~0_14) (= v_~main$tmp_guard0~0_7 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-18 14:04:27,445 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L832-2-->L832-5: Formula: (let ((.cse0 (= (mod ~z$w_buff1_used~0_In580989746 256) 0)) (.cse2 (= |ULTIMATE.start_main_#t~ite48_Out580989746| |ULTIMATE.start_main_#t~ite47_Out580989746|)) (.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In580989746 256)))) (or (and (or .cse0 .cse1) (= ~z~0_In580989746 |ULTIMATE.start_main_#t~ite47_Out580989746|) .cse2) (and (not .cse0) .cse2 (= ~z$w_buff1~0_In580989746 |ULTIMATE.start_main_#t~ite47_Out580989746|) (not .cse1)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In580989746, ~z$w_buff1_used~0=~z$w_buff1_used~0_In580989746, ~z$w_buff1~0=~z$w_buff1~0_In580989746, ~z~0=~z~0_In580989746} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In580989746, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out580989746|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In580989746, ~z$w_buff1~0=~z$w_buff1~0_In580989746, ULTIMATE.start_main_#t~ite48=|ULTIMATE.start_main_#t~ite48_Out580989746|, ~z~0=~z~0_In580989746} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-18 14:04:27,446 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [839] [839] L833-->L833-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-1693065378 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd0~0_In-1693065378 256) 0))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In-1693065378 |ULTIMATE.start_main_#t~ite49_Out-1693065378|)) (and (not .cse1) (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite49_Out-1693065378|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1693065378, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1693065378} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1693065378, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1693065378, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out-1693065378|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-18 14:04:27,447 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [830] [830] L834-->L834-2: Formula: (let ((.cse1 (= (mod ~z$r_buff1_thd0~0_In-1760149556 256) 0)) (.cse0 (= (mod ~z$w_buff1_used~0_In-1760149556 256) 0)) (.cse3 (= 0 (mod ~z$r_buff0_thd0~0_In-1760149556 256))) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In-1760149556 256)))) (or (and (= |ULTIMATE.start_main_#t~ite50_Out-1760149556| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse3 .cse2) (= |ULTIMATE.start_main_#t~ite50_Out-1760149556| ~z$w_buff1_used~0_In-1760149556)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1760149556, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1760149556, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1760149556, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1760149556} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out-1760149556|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1760149556, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1760149556, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1760149556, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1760149556} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-18 14:04:27,447 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] L835-->L835-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In2068028392 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In2068028392 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite51_Out2068028392| 0)) (and (or .cse0 .cse1) (= ~z$r_buff0_thd0~0_In2068028392 |ULTIMATE.start_main_#t~ite51_Out2068028392|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2068028392, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2068028392} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2068028392, ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out2068028392|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2068028392} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-18 14:04:27,448 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L836-->L836-2: Formula: (let ((.cse2 (= (mod ~z$w_buff0_used~0_In1094075034 256) 0)) (.cse3 (= (mod ~z$r_buff0_thd0~0_In1094075034 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In1094075034 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In1094075034 256)))) (or (and (= |ULTIMATE.start_main_#t~ite52_Out1094075034| ~z$r_buff1_thd0~0_In1094075034) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite52_Out1094075034| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1094075034, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1094075034, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1094075034, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1094075034} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out1094075034|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1094075034, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1094075034, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1094075034, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1094075034} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-18 14:04:27,448 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [879] [879] L836-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= 0 v_~__unbuffered_p1_EAX~0_25) (= v_~main$tmp_guard1~0_20 0) (= 0 v_~__unbuffered_p0_EAX~0_99) (= 0 v_~__unbuffered_p2_EAX~0_26) (= v_ULTIMATE.start___VERIFIER_assert_~expression_19 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|) (= v_~z$r_buff1_thd0~0_143 |v_ULTIMATE.start_main_#t~ite52_43|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_19 0)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_99, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_43|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_25, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_26} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_99, 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_p1_EAX~0=v_~__unbuffered_p1_EAX~0_25, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_143, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_20, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_26, 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 14:04:27,552 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 02:04:27 BasicIcfg [2019-12-18 14:04:27,552 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 14:04:27,554 INFO L168 Benchmark]: Toolchain (without parser) took 117746.44 ms. Allocated memory was 138.9 MB in the beginning and 3.5 GB in the end (delta: 3.3 GB). Free memory was 100.8 MB in the beginning and 1.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 2.1 GB. Max. memory is 7.1 GB. [2019-12-18 14:04:27,554 INFO L168 Benchmark]: CDTParser took 0.54 ms. Allocated memory is still 138.9 MB. Free memory is still 120.4 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-12-18 14:04:27,555 INFO L168 Benchmark]: CACSL2BoogieTranslator took 833.93 ms. Allocated memory was 138.9 MB in the beginning and 203.9 MB in the end (delta: 65.0 MB). Free memory was 100.5 MB in the beginning and 157.3 MB in the end (delta: -56.8 MB). Peak memory consumption was 24.2 MB. Max. memory is 7.1 GB. [2019-12-18 14:04:27,555 INFO L168 Benchmark]: Boogie Procedure Inliner took 59.67 ms. Allocated memory is still 203.9 MB. Free memory was 157.3 MB in the beginning and 154.5 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-18 14:04:27,560 INFO L168 Benchmark]: Boogie Preprocessor took 39.29 ms. Allocated memory is still 203.9 MB. Free memory was 154.5 MB in the beginning and 152.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-18 14:04:27,561 INFO L168 Benchmark]: RCFGBuilder took 910.33 ms. Allocated memory is still 203.9 MB. Free memory was 152.6 MB in the beginning and 102.4 MB in the end (delta: 50.1 MB). Peak memory consumption was 50.1 MB. Max. memory is 7.1 GB. [2019-12-18 14:04:27,561 INFO L168 Benchmark]: TraceAbstraction took 115898.01 ms. Allocated memory was 203.9 MB in the beginning and 3.5 GB in the end (delta: 3.2 GB). Free memory was 101.8 MB in the beginning and 1.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 GB. [2019-12-18 14:04:27,563 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.54 ms. Allocated memory is still 138.9 MB. Free memory is still 120.4 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 833.93 ms. Allocated memory was 138.9 MB in the beginning and 203.9 MB in the end (delta: 65.0 MB). Free memory was 100.5 MB in the beginning and 157.3 MB in the end (delta: -56.8 MB). Peak memory consumption was 24.2 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 59.67 ms. Allocated memory is still 203.9 MB. Free memory was 157.3 MB in the beginning and 154.5 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 39.29 ms. Allocated memory is still 203.9 MB. Free memory was 154.5 MB in the beginning and 152.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 910.33 ms. Allocated memory is still 203.9 MB. Free memory was 152.6 MB in the beginning and 102.4 MB in the end (delta: 50.1 MB). Peak memory consumption was 50.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 115898.01 ms. Allocated memory was 203.9 MB in the beginning and 3.5 GB in the end (delta: 3.2 GB). Free memory was 101.8 MB in the beginning and 1.3 GB in the end (delta: -1.2 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.8s, 176 ProgramPointsBefore, 95 ProgramPointsAfterwards, 213 TransitionsBefore, 107 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 12 FixpointIterations, 33 TrivialSequentialCompositions, 55 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 33 ConcurrentYvCompositions, 29 ChoiceCompositions, 7276 VarBasedMoverChecksPositive, 432 VarBasedMoverChecksNegative, 272 SemBasedMoverChecksPositive, 254 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.0s, 0 MoverChecksTotal, 130045 CheckedPairsTotal, 121 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L822] FCALL, FORK 0 pthread_create(&t1561, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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] [L731] 1 z$w_buff1 = z$w_buff0 [L732] 1 z$w_buff0 = 1 [L733] 1 z$w_buff1_used = z$w_buff0_used [L734] 1 z$w_buff0_used = (_Bool)1 [L746] 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=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] [L824] FCALL, FORK 0 pthread_create(&t1562, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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] [L760] 2 x = 1 [L763] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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] [L766] 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, 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] [L767] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L826] FCALL, FORK 0 pthread_create(&t1563, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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] [L780] 3 y = 1 [L783] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L784] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L785] 3 z$flush_delayed = weak$$choice2 [L786] 3 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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=7, x=1, y=1, z=0, z$flush_delayed=7, 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] [L787] 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=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=7, x=1, y=1, z=0, z$flush_delayed=7, 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] [L787] 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) [L788] EXPR 3 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)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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=7, 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))=1, x=1, y=1, z=0, z$flush_delayed=7, 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] [L768] 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 [L788] 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)) [L789] EXPR 3 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)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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=7, 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))=0, x=1, y=1, z=0, z$flush_delayed=7, 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 ? (_Bool)0 : z$r_buff0_thd2=0, z$w_buff1=0, z$w_buff1_used=0] [L789] 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)) [L790] 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)) [L791] 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=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=7, 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=7, 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 ? (_Bool)0 : z$r_buff0_thd2=0, z$w_buff1=0, z$w_buff1_used=0] [L791] 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)) [L793] 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=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=7, 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=7, 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 ? (_Bool)0 : z$r_buff0_thd2=0, z$w_buff1=0, z$w_buff1_used=0] [L793] 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)) [L794] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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=7, x=1, y=1, z=0, z$flush_delayed=7, 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 ? (_Bool)0 : z$r_buff0_thd2=0, z$w_buff1=0, z$w_buff1_used=0] [L746] 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) [L747] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L799] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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=7, 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=0, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2=0, z$w_buff1=0, z$w_buff1_used=0] [L799] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L800] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L801] 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 [L802] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L748] 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 [L769] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L832] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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=7, 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=0, z$w_buff1=0, z$w_buff1_used=0] [L832] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L833] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L834] 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 [L835] 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, 167 locations, 2 error locations. Result: UNSAFE, OverallTime: 115.5s, OverallIterations: 27, TraceHistogramMax: 1, AutomataDifference: 42.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 7272 SDtfs, 8049 SDslu, 29062 SDs, 0 SdLazy, 22906 SolverSat, 384 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 19.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 404 GetRequests, 55 SyntacticMatches, 12 SemanticMatches, 337 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1816 ImplicationChecksByTransitivity, 4.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=158936occurred 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: 39.2s AutomataMinimizationTime, 26 MinimizatonAttempts, 252198 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 1320 NumberOfCodeBlocks, 1320 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 1227 ConstructedInterpolants, 0 QuantifiedInterpolants, 277030 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 26 InterpolantComputations, 26 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...