/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/podwr001_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 18:00:25,472 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 18:00:25,474 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 18:00:25,486 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 18:00:25,487 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 18:00:25,488 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 18:00:25,489 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 18:00:25,491 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 18:00:25,493 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 18:00:25,494 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 18:00:25,495 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 18:00:25,496 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 18:00:25,496 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 18:00:25,497 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 18:00:25,498 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 18:00:25,502 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 18:00:25,503 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 18:00:25,503 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 18:00:25,507 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 18:00:25,509 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 18:00:25,513 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 18:00:25,516 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 18:00:25,517 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 18:00:25,518 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 18:00:25,521 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 18:00:25,521 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 18:00:25,521 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 18:00:25,524 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 18:00:25,525 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 18:00:25,527 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 18:00:25,528 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 18:00:25,529 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 18:00:25,529 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 18:00:25,531 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 18:00:25,535 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 18:00:25,535 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 18:00:25,535 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 18:00:25,536 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 18:00:25,536 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 18:00:25,540 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 18:00:25,541 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 18:00:25,542 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf [2019-12-18 18:00:25,564 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 18:00:25,564 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 18:00:25,566 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 18:00:25,566 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 18:00:25,567 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 18:00:25,567 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 18:00:25,567 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 18:00:25,567 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 18:00:25,567 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 18:00:25,568 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 18:00:25,569 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 18:00:25,569 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 18:00:25,569 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 18:00:25,570 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 18:00:25,570 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 18:00:25,570 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 18:00:25,570 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 18:00:25,570 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 18:00:25,571 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 18:00:25,571 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 18:00:25,571 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 18:00:25,571 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 18:00:25,571 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 18:00:25,571 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 18:00:25,572 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 18:00:25,572 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 18:00:25,572 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 18:00:25,572 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 18:00:25,572 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 18:00:25,852 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 18:00:25,869 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 18:00:25,874 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 18:00:25,875 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 18:00:25,876 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 18:00:25,876 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/podwr001_rmo.opt.i [2019-12-18 18:00:25,961 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/29ca66297/24741a464bce4ddc8b3285f361c2dfc7/FLAG6babad508 [2019-12-18 18:00:26,518 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 18:00:26,519 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/podwr001_rmo.opt.i [2019-12-18 18:00:26,547 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/29ca66297/24741a464bce4ddc8b3285f361c2dfc7/FLAG6babad508 [2019-12-18 18:00:26,849 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/29ca66297/24741a464bce4ddc8b3285f361c2dfc7 [2019-12-18 18:00:26,857 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 18:00:26,859 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 18:00:26,860 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 18:00:26,861 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 18:00:26,864 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 18:00:26,865 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 06:00:26" (1/1) ... [2019-12-18 18:00:26,868 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@317ba546 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:00:26, skipping insertion in model container [2019-12-18 18:00:26,869 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 06:00:26" (1/1) ... [2019-12-18 18:00:26,876 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 18:00:26,951 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 18:00:27,465 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 18:00:27,477 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 18:00:27,552 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 18:00:27,636 INFO L208 MainTranslator]: Completed translation [2019-12-18 18:00:27,637 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:00:27 WrapperNode [2019-12-18 18:00:27,638 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 18:00:27,639 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 18:00:27,639 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 18:00:27,639 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 18:00:27,648 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:00:27" (1/1) ... [2019-12-18 18:00:27,687 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:00:27" (1/1) ... [2019-12-18 18:00:27,728 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 18:00:27,729 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 18:00:27,729 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 18:00:27,729 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 18:00:27,738 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:00:27" (1/1) ... [2019-12-18 18:00:27,739 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:00:27" (1/1) ... [2019-12-18 18:00:27,743 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:00:27" (1/1) ... [2019-12-18 18:00:27,743 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:00:27" (1/1) ... [2019-12-18 18:00:27,754 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:00:27" (1/1) ... [2019-12-18 18:00:27,758 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:00:27" (1/1) ... [2019-12-18 18:00:27,762 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:00:27" (1/1) ... [2019-12-18 18:00:27,767 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 18:00:27,768 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 18:00:27,768 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 18:00:27,768 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 18:00:27,769 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:00:27" (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 18:00:27,849 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 18:00:27,849 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 18:00:27,849 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 18:00:27,850 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 18:00:27,850 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 18:00:27,850 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 18:00:27,850 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 18:00:27,850 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 18:00:27,851 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 18:00:27,851 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 18:00:27,851 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 18:00:27,851 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 18:00:27,851 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 18:00:27,856 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 18:00:28,663 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 18:00:28,663 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 18:00:28,664 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 06:00:28 BoogieIcfgContainer [2019-12-18 18:00:28,665 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 18:00:28,666 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 18:00:28,666 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 18:00:28,670 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 18:00:28,670 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 06:00:26" (1/3) ... [2019-12-18 18:00:28,671 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34c095e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 06:00:28, skipping insertion in model container [2019-12-18 18:00:28,671 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:00:27" (2/3) ... [2019-12-18 18:00:28,672 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34c095e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 06:00:28, skipping insertion in model container [2019-12-18 18:00:28,672 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 06:00:28" (3/3) ... [2019-12-18 18:00:28,674 INFO L109 eAbstractionObserver]: Analyzing ICFG podwr001_rmo.opt.i [2019-12-18 18:00:28,684 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 18:00:28,684 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 18:00:28,692 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 18:00:28,693 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 18:00:28,735 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:00:28,736 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:00:28,736 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:00:28,736 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:00:28,737 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:00:28,737 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:00:28,737 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:00:28,738 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:00:28,738 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:00:28,739 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:00:28,739 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:00:28,739 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:00:28,739 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:00:28,740 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:00:28,740 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:00:28,740 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:00:28,740 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:00:28,741 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:00:28,741 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:00:28,741 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:00:28,741 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:00:28,742 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:00:28,742 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:00:28,742 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:00:28,742 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:00:28,743 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:00:28,743 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:00:28,743 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:00:28,743 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:00:28,744 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:00:28,744 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:00:28,744 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:00:28,745 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:00:28,745 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:00:28,745 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:00:28,746 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:00:28,746 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:00:28,746 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:00:28,746 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:00:28,747 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:00:28,747 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:00:28,747 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:00:28,747 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:00:28,748 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:00:28,765 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:00:28,765 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:00:28,765 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:00:28,765 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:00:28,765 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:00:28,766 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:00:28,766 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:00:28,766 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:00:28,766 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:00:28,767 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:00:28,767 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:00:28,767 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:00:28,767 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:00:28,768 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:00:28,768 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:00:28,768 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:00:28,768 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:00:28,769 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:00:28,769 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:00:28,769 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:00:28,770 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:00:28,770 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:00:28,770 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:00:28,771 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:00:28,771 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:00:28,771 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:00:28,771 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:00:28,771 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:00:28,772 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:00:28,772 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:00:28,772 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:00:28,772 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:00:28,772 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:00:28,773 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:00:28,773 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:00:28,773 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:00:28,773 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:00:28,774 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:00:28,774 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:00:28,774 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:00:28,774 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:00:28,774 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:00:28,775 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:00:28,775 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:00:28,775 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:00:28,775 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:00:28,775 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:00:28,776 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:00:28,776 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:00:28,776 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:00:28,776 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:00:28,776 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:00:28,777 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:00:28,777 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:00:28,777 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:00:28,777 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:00:28,778 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:00:28,778 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:00:28,778 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:00:28,780 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:00:28,781 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:00:28,781 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:00:28,781 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:00:28,781 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:00:28,782 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:00:28,782 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:00:28,782 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:00:28,783 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:00:28,783 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:00:28,783 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:00:28,783 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:00:28,783 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:00:28,784 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:00:28,784 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:00:28,784 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:00:28,784 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:00:28,784 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:00:28,786 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:00:28,786 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:00:28,787 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:00:28,787 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:00:28,787 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:00:28,788 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:00:28,788 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:00:28,788 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:00:28,788 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:00:28,788 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:00:28,789 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:00:28,789 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:00:28,789 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:00:28,793 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:00:28,794 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:00:28,794 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:00:28,794 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:00:28,794 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:00:28,795 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:00:28,795 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:00:28,795 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:00:28,795 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:00:28,795 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:00:28,796 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:00:28,796 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:00:28,796 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:00:28,796 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:00:28,796 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:00:28,797 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:00:28,797 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:00:28,797 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:00:28,797 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:00:28,797 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:00:28,798 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:00:28,798 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:00:28,798 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:00:28,798 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:00:28,798 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:00:28,798 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:00:28,799 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:00:28,799 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:00:28,799 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:00:28,799 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:00:28,799 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:00:28,800 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:00:28,800 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:00:28,800 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:00:28,801 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:00:28,801 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:00:28,802 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:00:28,802 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:00:28,802 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:00:28,802 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:00:28,803 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:00:28,803 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:00:28,803 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:00:28,803 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:00:28,804 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:00:28,804 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:00:28,804 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:00:28,804 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:00:28,811 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:00:28,812 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:00:28,812 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:00:28,812 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:00:28,813 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:00:28,813 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:00:28,813 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:00:28,813 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:00:28,813 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:00:28,813 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:00:28,814 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:00:28,814 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:00:28,814 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:00:28,815 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:00:28,815 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:00:28,815 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:00:28,815 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:00:28,816 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:00:28,816 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:00:28,816 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:00:28,816 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:00:28,816 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:00:28,817 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:00:28,817 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:00:28,817 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:00:28,817 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:00:28,817 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:00:28,817 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:00:28,818 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:00:28,818 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:00:28,818 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:00:28,818 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:00:28,819 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:00:28,823 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:00:28,823 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:00:28,823 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:00:28,824 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:00:28,830 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:00:28,831 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:00:28,831 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:00:28,831 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:00:28,831 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:00:28,832 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:00:28,832 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:00:28,832 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:00:28,834 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:00:28,834 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:00:28,835 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:00:28,835 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:00:28,835 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:00:28,835 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:00:28,835 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:00:28,839 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:00:28,840 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:00:28,840 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:00:28,862 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 18:00:28,882 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 18:00:28,883 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 18:00:28,883 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 18:00:28,883 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 18:00:28,883 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 18:00:28,883 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 18:00:28,883 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 18:00:28,884 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 18:00:28,901 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 176 places, 213 transitions [2019-12-18 18:00:28,902 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 176 places, 213 transitions [2019-12-18 18:00:28,998 INFO L126 PetriNetUnfolder]: 47/210 cut-off events. [2019-12-18 18:00:28,998 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 18:00:29,027 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 18:00:29,054 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 176 places, 213 transitions [2019-12-18 18:00:29,117 INFO L126 PetriNetUnfolder]: 47/210 cut-off events. [2019-12-18 18:00:29,117 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 18:00:29,128 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 18:00:29,155 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-18 18:00:29,156 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 18:00:34,677 WARN L192 SmtUtils]: Spent 310.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 89 [2019-12-18 18:00:34,791 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-12-18 18:00:35,150 INFO L206 etLargeBlockEncoding]: Checked pairs total: 130045 [2019-12-18 18:00:35,151 INFO L214 etLargeBlockEncoding]: Total number of compositions: 121 [2019-12-18 18:00:35,154 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 95 places, 107 transitions [2019-12-18 18:00:58,465 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 126452 states. [2019-12-18 18:00:58,467 INFO L276 IsEmpty]: Start isEmpty. Operand 126452 states. [2019-12-18 18:00:58,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-18 18:00:58,472 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:00:58,473 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-18 18:00:58,473 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 18:00:58,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:00:58,478 INFO L82 PathProgramCache]: Analyzing trace with hash 913925, now seen corresponding path program 1 times [2019-12-18 18:00:58,485 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:00:58,486 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350338081] [2019-12-18 18:00:58,486 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:00:58,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:00:58,770 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 18:00:58,771 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350338081] [2019-12-18 18:00:58,772 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:00:58,772 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 18:00:58,773 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860491986] [2019-12-18 18:00:58,778 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 18:00:58,778 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:00:58,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 18:00:58,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:00:58,797 INFO L87 Difference]: Start difference. First operand 126452 states. Second operand 3 states. [2019-12-18 18:01:02,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:01:02,141 INFO L93 Difference]: Finished difference Result 125570 states and 538788 transitions. [2019-12-18 18:01:02,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 18:01:02,142 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-18 18:01:02,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:01:03,055 INFO L225 Difference]: With dead ends: 125570 [2019-12-18 18:01:03,055 INFO L226 Difference]: Without dead ends: 111010 [2019-12-18 18:01:03,056 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 18:01:10,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111010 states. [2019-12-18 18:01:12,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111010 to 111010. [2019-12-18 18:01:12,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111010 states. [2019-12-18 18:01:16,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111010 states to 111010 states and 475060 transitions. [2019-12-18 18:01:16,926 INFO L78 Accepts]: Start accepts. Automaton has 111010 states and 475060 transitions. Word has length 3 [2019-12-18 18:01:16,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:01:16,926 INFO L462 AbstractCegarLoop]: Abstraction has 111010 states and 475060 transitions. [2019-12-18 18:01:16,926 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 18:01:16,926 INFO L276 IsEmpty]: Start isEmpty. Operand 111010 states and 475060 transitions. [2019-12-18 18:01:16,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 18:01:16,931 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:01:16,931 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:01:16,931 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 18:01:16,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:01:16,932 INFO L82 PathProgramCache]: Analyzing trace with hash -1753094800, now seen corresponding path program 1 times [2019-12-18 18:01:16,932 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:01:16,932 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070363057] [2019-12-18 18:01:16,932 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:01:16,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:01:17,041 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 18:01:17,041 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070363057] [2019-12-18 18:01:17,042 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:01:17,042 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 18:01:17,043 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474286278] [2019-12-18 18:01:17,044 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 18:01:17,045 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:01:17,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 18:01:17,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 18:01:17,045 INFO L87 Difference]: Start difference. First operand 111010 states and 475060 transitions. Second operand 4 states. [2019-12-18 18:01:18,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:01:18,223 INFO L93 Difference]: Finished difference Result 172646 states and 710109 transitions. [2019-12-18 18:01:18,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 18:01:18,224 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 18:01:18,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:01:23,927 INFO L225 Difference]: With dead ends: 172646 [2019-12-18 18:01:23,927 INFO L226 Difference]: Without dead ends: 172548 [2019-12-18 18:01:23,928 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 18:01:29,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172548 states. [2019-12-18 18:01:32,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172548 to 158936. [2019-12-18 18:01:32,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158936 states. [2019-12-18 18:01:33,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158936 states to 158936 states and 661803 transitions. [2019-12-18 18:01:33,659 INFO L78 Accepts]: Start accepts. Automaton has 158936 states and 661803 transitions. Word has length 11 [2019-12-18 18:01:33,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:01:33,659 INFO L462 AbstractCegarLoop]: Abstraction has 158936 states and 661803 transitions. [2019-12-18 18:01:33,659 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 18:01:33,659 INFO L276 IsEmpty]: Start isEmpty. Operand 158936 states and 661803 transitions. [2019-12-18 18:01:33,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 18:01:33,665 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:01:33,665 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:01:33,665 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 18:01:33,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:01:33,666 INFO L82 PathProgramCache]: Analyzing trace with hash 216434073, now seen corresponding path program 1 times [2019-12-18 18:01:33,666 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:01:33,666 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85323493] [2019-12-18 18:01:33,666 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:01:33,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:01:33,730 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 18:01:33,731 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85323493] [2019-12-18 18:01:33,731 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:01:33,731 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 18:01:33,732 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267262125] [2019-12-18 18:01:33,732 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 18:01:33,732 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:01:33,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 18:01:33,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:01:33,733 INFO L87 Difference]: Start difference. First operand 158936 states and 661803 transitions. Second operand 3 states. [2019-12-18 18:01:33,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:01:33,864 INFO L93 Difference]: Finished difference Result 34208 states and 111904 transitions. [2019-12-18 18:01:33,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 18:01:33,865 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-18 18:01:33,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:01:33,933 INFO L225 Difference]: With dead ends: 34208 [2019-12-18 18:01:33,934 INFO L226 Difference]: Without dead ends: 34208 [2019-12-18 18:01:33,934 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 18:01:34,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34208 states. [2019-12-18 18:01:34,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34208 to 34208. [2019-12-18 18:01:34,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34208 states. [2019-12-18 18:01:34,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34208 states to 34208 states and 111904 transitions. [2019-12-18 18:01:34,614 INFO L78 Accepts]: Start accepts. Automaton has 34208 states and 111904 transitions. Word has length 13 [2019-12-18 18:01:34,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:01:34,614 INFO L462 AbstractCegarLoop]: Abstraction has 34208 states and 111904 transitions. [2019-12-18 18:01:34,614 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 18:01:34,614 INFO L276 IsEmpty]: Start isEmpty. Operand 34208 states and 111904 transitions. [2019-12-18 18:01:34,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 18:01:34,618 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:01:34,620 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:01:34,620 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 18:01:34,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:01:34,620 INFO L82 PathProgramCache]: Analyzing trace with hash -1948590504, now seen corresponding path program 1 times [2019-12-18 18:01:34,621 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:01:34,621 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992032260] [2019-12-18 18:01:34,621 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:01:34,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:01:34,695 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 18:01:34,696 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992032260] [2019-12-18 18:01:34,696 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:01:34,696 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 18:01:34,697 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508868599] [2019-12-18 18:01:34,697 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 18:01:34,697 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:01:34,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 18:01:34,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:01:34,698 INFO L87 Difference]: Start difference. First operand 34208 states and 111904 transitions. Second operand 3 states. [2019-12-18 18:01:35,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:01:35,374 INFO L93 Difference]: Finished difference Result 51809 states and 168645 transitions. [2019-12-18 18:01:35,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 18:01:35,375 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-18 18:01:35,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:01:35,467 INFO L225 Difference]: With dead ends: 51809 [2019-12-18 18:01:35,467 INFO L226 Difference]: Without dead ends: 51809 [2019-12-18 18:01:35,468 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 18:01:35,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51809 states. [2019-12-18 18:01:36,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51809 to 38969. [2019-12-18 18:01:36,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38969 states. [2019-12-18 18:01:36,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38969 states to 38969 states and 128499 transitions. [2019-12-18 18:01:36,233 INFO L78 Accepts]: Start accepts. Automaton has 38969 states and 128499 transitions. Word has length 16 [2019-12-18 18:01:36,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:01:36,234 INFO L462 AbstractCegarLoop]: Abstraction has 38969 states and 128499 transitions. [2019-12-18 18:01:36,234 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 18:01:36,234 INFO L276 IsEmpty]: Start isEmpty. Operand 38969 states and 128499 transitions. [2019-12-18 18:01:36,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 18:01:36,237 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:01:36,237 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:01:36,238 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 18:01:36,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:01:36,238 INFO L82 PathProgramCache]: Analyzing trace with hash -1821591471, now seen corresponding path program 1 times [2019-12-18 18:01:36,238 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:01:36,239 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211076506] [2019-12-18 18:01:36,239 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:01:36,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:01:36,326 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 18:01:36,327 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211076506] [2019-12-18 18:01:36,327 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:01:36,327 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 18:01:36,327 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237379308] [2019-12-18 18:01:36,328 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 18:01:36,328 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:01:36,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 18:01:36,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 18:01:36,329 INFO L87 Difference]: Start difference. First operand 38969 states and 128499 transitions. Second operand 5 states. [2019-12-18 18:01:36,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:01:36,927 INFO L93 Difference]: Finished difference Result 53507 states and 173644 transitions. [2019-12-18 18:01:36,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 18:01:36,927 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-18 18:01:36,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:01:37,017 INFO L225 Difference]: With dead ends: 53507 [2019-12-18 18:01:37,017 INFO L226 Difference]: Without dead ends: 53507 [2019-12-18 18:01:37,017 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 18:01:37,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53507 states. [2019-12-18 18:01:38,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53507 to 44557. [2019-12-18 18:01:38,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44557 states. [2019-12-18 18:01:38,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44557 states to 44557 states and 146077 transitions. [2019-12-18 18:01:38,316 INFO L78 Accepts]: Start accepts. Automaton has 44557 states and 146077 transitions. Word has length 16 [2019-12-18 18:01:38,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:01:38,316 INFO L462 AbstractCegarLoop]: Abstraction has 44557 states and 146077 transitions. [2019-12-18 18:01:38,316 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 18:01:38,316 INFO L276 IsEmpty]: Start isEmpty. Operand 44557 states and 146077 transitions. [2019-12-18 18:01:38,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 18:01:38,330 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:01:38,330 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 18:01:38,331 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 18:01:38,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:01:38,331 INFO L82 PathProgramCache]: Analyzing trace with hash -187432510, now seen corresponding path program 1 times [2019-12-18 18:01:38,331 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:01:38,331 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705187730] [2019-12-18 18:01:38,332 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:01:38,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:01:38,433 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 18:01:38,434 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705187730] [2019-12-18 18:01:38,434 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:01:38,434 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 18:01:38,435 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668728458] [2019-12-18 18:01:38,435 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 18:01:38,435 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:01:38,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 18:01:38,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 18:01:38,436 INFO L87 Difference]: Start difference. First operand 44557 states and 146077 transitions. Second operand 6 states. [2019-12-18 18:01:39,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:01:39,461 INFO L93 Difference]: Finished difference Result 66834 states and 212729 transitions. [2019-12-18 18:01:39,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 18:01:39,461 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-18 18:01:39,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:01:39,575 INFO L225 Difference]: With dead ends: 66834 [2019-12-18 18:01:39,575 INFO L226 Difference]: Without dead ends: 66820 [2019-12-18 18:01:39,576 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 18:01:39,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66820 states. [2019-12-18 18:01:40,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66820 to 44208. [2019-12-18 18:01:40,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44208 states. [2019-12-18 18:01:40,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44208 states to 44208 states and 144750 transitions. [2019-12-18 18:01:40,973 INFO L78 Accepts]: Start accepts. Automaton has 44208 states and 144750 transitions. Word has length 22 [2019-12-18 18:01:40,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:01:40,974 INFO L462 AbstractCegarLoop]: Abstraction has 44208 states and 144750 transitions. [2019-12-18 18:01:40,974 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 18:01:40,974 INFO L276 IsEmpty]: Start isEmpty. Operand 44208 states and 144750 transitions. [2019-12-18 18:01:40,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 18:01:40,990 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:01:40,991 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:01:40,991 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 18:01:40,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:01:40,991 INFO L82 PathProgramCache]: Analyzing trace with hash -200714255, now seen corresponding path program 1 times [2019-12-18 18:01:40,992 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:01:40,992 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631027050] [2019-12-18 18:01:40,992 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:01:41,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:01:41,037 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 18:01:41,037 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631027050] [2019-12-18 18:01:41,038 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:01:41,038 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 18:01:41,038 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305518815] [2019-12-18 18:01:41,039 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 18:01:41,039 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:01:41,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 18:01:41,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 18:01:41,039 INFO L87 Difference]: Start difference. First operand 44208 states and 144750 transitions. Second operand 4 states. [2019-12-18 18:01:41,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:01:41,112 INFO L93 Difference]: Finished difference Result 18127 states and 56319 transitions. [2019-12-18 18:01:41,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 18:01:41,112 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-18 18:01:41,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:01:41,139 INFO L225 Difference]: With dead ends: 18127 [2019-12-18 18:01:41,140 INFO L226 Difference]: Without dead ends: 18127 [2019-12-18 18:01:41,140 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 18:01:41,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18127 states. [2019-12-18 18:01:41,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18127 to 17799. [2019-12-18 18:01:41,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17799 states. [2019-12-18 18:01:41,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17799 states to 17799 states and 55383 transitions. [2019-12-18 18:01:41,427 INFO L78 Accepts]: Start accepts. Automaton has 17799 states and 55383 transitions. Word has length 25 [2019-12-18 18:01:41,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:01:41,427 INFO L462 AbstractCegarLoop]: Abstraction has 17799 states and 55383 transitions. [2019-12-18 18:01:41,428 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 18:01:41,428 INFO L276 IsEmpty]: Start isEmpty. Operand 17799 states and 55383 transitions. [2019-12-18 18:01:41,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 18:01:41,443 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:01:41,443 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 18:01:41,443 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 18:01:41,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:01:41,443 INFO L82 PathProgramCache]: Analyzing trace with hash 611460705, now seen corresponding path program 1 times [2019-12-18 18:01:41,444 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:01:41,444 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758748447] [2019-12-18 18:01:41,444 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:01:41,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:01:41,533 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 18:01:41,534 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758748447] [2019-12-18 18:01:41,534 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:01:41,534 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 18:01:41,534 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576175274] [2019-12-18 18:01:41,535 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 18:01:41,535 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:01:41,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 18:01:41,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 18:01:41,535 INFO L87 Difference]: Start difference. First operand 17799 states and 55383 transitions. Second operand 6 states. [2019-12-18 18:01:42,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:01:42,137 INFO L93 Difference]: Finished difference Result 25206 states and 75658 transitions. [2019-12-18 18:01:42,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 18:01:42,138 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-18 18:01:42,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:01:42,173 INFO L225 Difference]: With dead ends: 25206 [2019-12-18 18:01:42,173 INFO L226 Difference]: Without dead ends: 25206 [2019-12-18 18:01:42,174 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-18 18:01:42,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25206 states. [2019-12-18 18:01:42,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25206 to 20596. [2019-12-18 18:01:42,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20596 states. [2019-12-18 18:01:42,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20596 states to 20596 states and 63178 transitions. [2019-12-18 18:01:42,525 INFO L78 Accepts]: Start accepts. Automaton has 20596 states and 63178 transitions. Word has length 27 [2019-12-18 18:01:42,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:01:42,525 INFO L462 AbstractCegarLoop]: Abstraction has 20596 states and 63178 transitions. [2019-12-18 18:01:42,525 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 18:01:42,525 INFO L276 IsEmpty]: Start isEmpty. Operand 20596 states and 63178 transitions. [2019-12-18 18:01:42,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-18 18:01:42,547 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:01:42,547 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 18:01:42,547 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 18:01:42,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:01:42,548 INFO L82 PathProgramCache]: Analyzing trace with hash -1170391984, now seen corresponding path program 1 times [2019-12-18 18:01:42,548 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:01:42,548 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487732611] [2019-12-18 18:01:42,548 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:01:42,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:01:42,642 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 18:01:42,642 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487732611] [2019-12-18 18:01:42,643 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:01:42,643 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 18:01:42,643 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003163394] [2019-12-18 18:01:42,643 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 18:01:42,644 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:01:42,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 18:01:42,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 18:01:42,644 INFO L87 Difference]: Start difference. First operand 20596 states and 63178 transitions. Second operand 7 states. [2019-12-18 18:01:44,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:01:44,159 INFO L93 Difference]: Finished difference Result 28185 states and 83945 transitions. [2019-12-18 18:01:44,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-18 18:01:44,159 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-18 18:01:44,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:01:44,202 INFO L225 Difference]: With dead ends: 28185 [2019-12-18 18:01:44,202 INFO L226 Difference]: Without dead ends: 28185 [2019-12-18 18:01:44,203 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2019-12-18 18:01:44,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28185 states. [2019-12-18 18:01:44,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28185 to 19533. [2019-12-18 18:01:44,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19533 states. [2019-12-18 18:01:44,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19533 states to 19533 states and 59996 transitions. [2019-12-18 18:01:44,568 INFO L78 Accepts]: Start accepts. Automaton has 19533 states and 59996 transitions. Word has length 33 [2019-12-18 18:01:44,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:01:44,568 INFO L462 AbstractCegarLoop]: Abstraction has 19533 states and 59996 transitions. [2019-12-18 18:01:44,569 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 18:01:44,569 INFO L276 IsEmpty]: Start isEmpty. Operand 19533 states and 59996 transitions. [2019-12-18 18:01:44,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-18 18:01:44,596 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:01:44,596 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 18:01:44,596 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 18:01:44,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:01:44,597 INFO L82 PathProgramCache]: Analyzing trace with hash -471967596, now seen corresponding path program 1 times [2019-12-18 18:01:44,597 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:01:44,597 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005277765] [2019-12-18 18:01:44,598 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:01:44,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:01:44,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:01:44,670 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005277765] [2019-12-18 18:01:44,670 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:01:44,670 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 18:01:44,670 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755618590] [2019-12-18 18:01:44,671 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 18:01:44,671 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:01:44,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 18:01:44,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 18:01:44,672 INFO L87 Difference]: Start difference. First operand 19533 states and 59996 transitions. Second operand 5 states. [2019-12-18 18:01:45,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:01:45,332 INFO L93 Difference]: Finished difference Result 27820 states and 84657 transitions. [2019-12-18 18:01:45,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 18:01:45,333 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2019-12-18 18:01:45,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:01:45,377 INFO L225 Difference]: With dead ends: 27820 [2019-12-18 18:01:45,377 INFO L226 Difference]: Without dead ends: 27820 [2019-12-18 18:01:45,378 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-18 18:01:45,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27820 states. [2019-12-18 18:01:45,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27820 to 25942. [2019-12-18 18:01:45,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25942 states. [2019-12-18 18:01:45,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25942 states to 25942 states and 79458 transitions. [2019-12-18 18:01:45,812 INFO L78 Accepts]: Start accepts. Automaton has 25942 states and 79458 transitions. Word has length 39 [2019-12-18 18:01:45,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:01:45,812 INFO L462 AbstractCegarLoop]: Abstraction has 25942 states and 79458 transitions. [2019-12-18 18:01:45,812 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 18:01:45,812 INFO L276 IsEmpty]: Start isEmpty. Operand 25942 states and 79458 transitions. [2019-12-18 18:01:45,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-18 18:01:45,845 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:01:45,845 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 18:01:45,845 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 18:01:45,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:01:45,845 INFO L82 PathProgramCache]: Analyzing trace with hash 1070465324, now seen corresponding path program 2 times [2019-12-18 18:01:45,845 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:01:45,846 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836808560] [2019-12-18 18:01:45,846 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:01:45,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:01:45,909 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 18:01:45,909 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836808560] [2019-12-18 18:01:45,910 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:01:45,910 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 18:01:45,910 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644160404] [2019-12-18 18:01:45,910 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 18:01:45,910 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:01:45,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 18:01:45,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 18:01:45,911 INFO L87 Difference]: Start difference. First operand 25942 states and 79458 transitions. Second operand 5 states. [2019-12-18 18:01:46,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:01:46,041 INFO L93 Difference]: Finished difference Result 24570 states and 76229 transitions. [2019-12-18 18:01:46,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 18:01:46,042 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2019-12-18 18:01:46,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:01:46,093 INFO L225 Difference]: With dead ends: 24570 [2019-12-18 18:01:46,093 INFO L226 Difference]: Without dead ends: 24570 [2019-12-18 18:01:46,093 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 18:01:46,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24570 states. [2019-12-18 18:01:46,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24570 to 23604. [2019-12-18 18:01:46,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23604 states. [2019-12-18 18:01:46,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23604 states to 23604 states and 73623 transitions. [2019-12-18 18:01:46,803 INFO L78 Accepts]: Start accepts. Automaton has 23604 states and 73623 transitions. Word has length 39 [2019-12-18 18:01:46,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:01:46,803 INFO L462 AbstractCegarLoop]: Abstraction has 23604 states and 73623 transitions. [2019-12-18 18:01:46,804 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 18:01:46,804 INFO L276 IsEmpty]: Start isEmpty. Operand 23604 states and 73623 transitions. [2019-12-18 18:01:46,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 18:01:46,832 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:01:46,832 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 18:01:46,833 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 18:01:46,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:01:46,833 INFO L82 PathProgramCache]: Analyzing trace with hash 405396675, now seen corresponding path program 1 times [2019-12-18 18:01:46,833 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:01:46,834 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714814258] [2019-12-18 18:01:46,834 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:01:46,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:01:46,968 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 18:01:46,968 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714814258] [2019-12-18 18:01:46,968 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:01:46,969 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 18:01:46,969 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482362170] [2019-12-18 18:01:46,970 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 18:01:46,971 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:01:46,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 18:01:46,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 18:01:46,971 INFO L87 Difference]: Start difference. First operand 23604 states and 73623 transitions. Second operand 7 states. [2019-12-18 18:01:47,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:01:47,515 INFO L93 Difference]: Finished difference Result 66491 states and 206430 transitions. [2019-12-18 18:01:47,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-18 18:01:47,516 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-18 18:01:47,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:01:47,597 INFO L225 Difference]: With dead ends: 66491 [2019-12-18 18:01:47,597 INFO L226 Difference]: Without dead ends: 50962 [2019-12-18 18:01:47,598 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2019-12-18 18:01:47,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50962 states. [2019-12-18 18:01:48,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50962 to 27152. [2019-12-18 18:01:48,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27152 states. [2019-12-18 18:01:48,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27152 states to 27152 states and 85280 transitions. [2019-12-18 18:01:48,212 INFO L78 Accepts]: Start accepts. Automaton has 27152 states and 85280 transitions. Word has length 64 [2019-12-18 18:01:48,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:01:48,213 INFO L462 AbstractCegarLoop]: Abstraction has 27152 states and 85280 transitions. [2019-12-18 18:01:48,213 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 18:01:48,213 INFO L276 IsEmpty]: Start isEmpty. Operand 27152 states and 85280 transitions. [2019-12-18 18:01:48,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 18:01:48,255 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:01:48,255 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 18:01:48,255 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 18:01:48,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:01:48,256 INFO L82 PathProgramCache]: Analyzing trace with hash 1812165217, now seen corresponding path program 2 times [2019-12-18 18:01:48,256 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:01:48,256 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450951674] [2019-12-18 18:01:48,256 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:01:48,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:01:48,383 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 18:01:48,383 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450951674] [2019-12-18 18:01:48,383 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:01:48,384 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 18:01:48,384 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003581130] [2019-12-18 18:01:48,384 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 18:01:48,384 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:01:48,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 18:01:48,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 18:01:48,385 INFO L87 Difference]: Start difference. First operand 27152 states and 85280 transitions. Second operand 7 states. [2019-12-18 18:01:49,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:01:49,032 INFO L93 Difference]: Finished difference Result 75308 states and 232407 transitions. [2019-12-18 18:01:49,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 18:01:49,033 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-18 18:01:49,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:01:49,124 INFO L225 Difference]: With dead ends: 75308 [2019-12-18 18:01:49,125 INFO L226 Difference]: Without dead ends: 53109 [2019-12-18 18:01:49,126 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-18 18:01:49,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53109 states. [2019-12-18 18:01:50,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53109 to 31627. [2019-12-18 18:01:50,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31627 states. [2019-12-18 18:01:50,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31627 states to 31627 states and 99154 transitions. [2019-12-18 18:01:50,170 INFO L78 Accepts]: Start accepts. Automaton has 31627 states and 99154 transitions. Word has length 64 [2019-12-18 18:01:50,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:01:50,170 INFO L462 AbstractCegarLoop]: Abstraction has 31627 states and 99154 transitions. [2019-12-18 18:01:50,170 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 18:01:50,170 INFO L276 IsEmpty]: Start isEmpty. Operand 31627 states and 99154 transitions. [2019-12-18 18:01:50,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 18:01:50,204 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:01:50,204 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 18:01:50,205 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 18:01:50,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:01:50,205 INFO L82 PathProgramCache]: Analyzing trace with hash -665020085, now seen corresponding path program 3 times [2019-12-18 18:01:50,205 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:01:50,206 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054487056] [2019-12-18 18:01:50,206 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:01:50,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:01:50,286 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 18:01:50,286 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054487056] [2019-12-18 18:01:50,286 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:01:50,287 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 18:01:50,287 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753434204] [2019-12-18 18:01:50,288 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 18:01:50,288 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:01:50,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 18:01:50,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 18:01:50,289 INFO L87 Difference]: Start difference. First operand 31627 states and 99154 transitions. Second operand 7 states. [2019-12-18 18:01:51,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:01:51,044 INFO L93 Difference]: Finished difference Result 63972 states and 197886 transitions. [2019-12-18 18:01:51,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 18:01:51,045 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-18 18:01:51,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:01:51,195 INFO L225 Difference]: With dead ends: 63972 [2019-12-18 18:01:51,195 INFO L226 Difference]: Without dead ends: 56757 [2019-12-18 18:01:51,196 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-18 18:01:51,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56757 states. [2019-12-18 18:01:52,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56757 to 31935. [2019-12-18 18:01:52,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31935 states. [2019-12-18 18:01:52,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31935 states to 31935 states and 100105 transitions. [2019-12-18 18:01:52,203 INFO L78 Accepts]: Start accepts. Automaton has 31935 states and 100105 transitions. Word has length 64 [2019-12-18 18:01:52,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:01:52,204 INFO L462 AbstractCegarLoop]: Abstraction has 31935 states and 100105 transitions. [2019-12-18 18:01:52,204 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 18:01:52,204 INFO L276 IsEmpty]: Start isEmpty. Operand 31935 states and 100105 transitions. [2019-12-18 18:01:52,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 18:01:52,240 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:01:52,240 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 18:01:52,241 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 18:01:52,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:01:52,241 INFO L82 PathProgramCache]: Analyzing trace with hash -314768521, now seen corresponding path program 4 times [2019-12-18 18:01:52,241 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:01:52,241 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245038265] [2019-12-18 18:01:52,241 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:01:52,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:01:52,310 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 18:01:52,310 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245038265] [2019-12-18 18:01:52,310 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:01:52,311 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 18:01:52,311 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722572681] [2019-12-18 18:01:52,311 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 18:01:52,311 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:01:52,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 18:01:52,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:01:52,312 INFO L87 Difference]: Start difference. First operand 31935 states and 100105 transitions. Second operand 3 states. [2019-12-18 18:01:52,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:01:52,831 INFO L93 Difference]: Finished difference Result 37968 states and 118161 transitions. [2019-12-18 18:01:52,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 18:01:52,831 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-18 18:01:52,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:01:52,895 INFO L225 Difference]: With dead ends: 37968 [2019-12-18 18:01:52,895 INFO L226 Difference]: Without dead ends: 37968 [2019-12-18 18:01:52,896 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 18:01:53,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37968 states. [2019-12-18 18:01:53,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37968 to 33207. [2019-12-18 18:01:53,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33207 states. [2019-12-18 18:01:53,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33207 states to 33207 states and 104097 transitions. [2019-12-18 18:01:53,429 INFO L78 Accepts]: Start accepts. Automaton has 33207 states and 104097 transitions. Word has length 64 [2019-12-18 18:01:53,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:01:53,429 INFO L462 AbstractCegarLoop]: Abstraction has 33207 states and 104097 transitions. [2019-12-18 18:01:53,430 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 18:01:53,430 INFO L276 IsEmpty]: Start isEmpty. Operand 33207 states and 104097 transitions. [2019-12-18 18:01:53,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 18:01:53,464 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:01:53,464 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 18:01:53,464 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 18:01:53,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:01:53,464 INFO L82 PathProgramCache]: Analyzing trace with hash 1190965355, now seen corresponding path program 1 times [2019-12-18 18:01:53,465 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:01:53,465 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518491597] [2019-12-18 18:01:53,465 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:01:53,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:01:53,549 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 18:01:53,549 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518491597] [2019-12-18 18:01:53,549 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:01:53,550 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 18:01:53,550 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310950811] [2019-12-18 18:01:53,550 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 18:01:53,550 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:01:53,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 18:01:53,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 18:01:53,551 INFO L87 Difference]: Start difference. First operand 33207 states and 104097 transitions. Second operand 7 states. [2019-12-18 18:01:54,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:01:54,063 INFO L93 Difference]: Finished difference Result 68708 states and 212400 transitions. [2019-12-18 18:01:54,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-18 18:01:54,064 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-18 18:01:54,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:01:54,159 INFO L225 Difference]: With dead ends: 68708 [2019-12-18 18:01:54,159 INFO L226 Difference]: Without dead ends: 63685 [2019-12-18 18:01:54,159 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 18:01:54,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63685 states. [2019-12-18 18:01:54,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63685 to 33271. [2019-12-18 18:01:54,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33271 states. [2019-12-18 18:01:55,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33271 states to 33271 states and 104315 transitions. [2019-12-18 18:01:55,521 INFO L78 Accepts]: Start accepts. Automaton has 33271 states and 104315 transitions. Word has length 65 [2019-12-18 18:01:55,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:01:55,521 INFO L462 AbstractCegarLoop]: Abstraction has 33271 states and 104315 transitions. [2019-12-18 18:01:55,521 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 18:01:55,521 INFO L276 IsEmpty]: Start isEmpty. Operand 33271 states and 104315 transitions. [2019-12-18 18:01:55,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 18:01:55,556 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:01:55,557 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:01:55,557 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 18:01:55,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:01:55,557 INFO L82 PathProgramCache]: Analyzing trace with hash 1399950855, now seen corresponding path program 2 times [2019-12-18 18:01:55,557 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:01:55,557 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671792452] [2019-12-18 18:01:55,557 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:01:55,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:01:55,644 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 18:01:55,644 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671792452] [2019-12-18 18:01:55,644 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:01:55,645 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 18:01:55,645 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732376066] [2019-12-18 18:01:55,645 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 18:01:55,645 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:01:55,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 18:01:55,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 18:01:55,646 INFO L87 Difference]: Start difference. First operand 33271 states and 104315 transitions. Second operand 4 states. [2019-12-18 18:01:55,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:01:55,832 INFO L93 Difference]: Finished difference Result 38643 states and 120280 transitions. [2019-12-18 18:01:55,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 18:01:55,833 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-12-18 18:01:55,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:01:55,888 INFO L225 Difference]: With dead ends: 38643 [2019-12-18 18:01:55,888 INFO L226 Difference]: Without dead ends: 38643 [2019-12-18 18:01:55,889 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 18:01:56,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38643 states. [2019-12-18 18:01:56,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38643 to 33436. [2019-12-18 18:01:56,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33436 states. [2019-12-18 18:01:56,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33436 states to 33436 states and 104768 transitions. [2019-12-18 18:01:56,465 INFO L78 Accepts]: Start accepts. Automaton has 33436 states and 104768 transitions. Word has length 65 [2019-12-18 18:01:56,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:01:56,465 INFO L462 AbstractCegarLoop]: Abstraction has 33436 states and 104768 transitions. [2019-12-18 18:01:56,465 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 18:01:56,465 INFO L276 IsEmpty]: Start isEmpty. Operand 33436 states and 104768 transitions. [2019-12-18 18:01:56,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 18:01:56,504 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:01:56,504 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 18:01:56,504 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 18:01:56,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:01:56,505 INFO L82 PathProgramCache]: Analyzing trace with hash 993840143, now seen corresponding path program 1 times [2019-12-18 18:01:56,505 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:01:56,505 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807227222] [2019-12-18 18:01:56,505 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:01:56,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:01:56,671 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 18:01:56,672 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807227222] [2019-12-18 18:01:56,672 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:01:56,672 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 18:01:56,672 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774791690] [2019-12-18 18:01:56,673 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 18:01:56,673 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:01:56,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 18:01:56,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-12-18 18:01:56,674 INFO L87 Difference]: Start difference. First operand 33436 states and 104768 transitions. Second operand 11 states. [2019-12-18 18:01:59,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:02:00,000 INFO L93 Difference]: Finished difference Result 64950 states and 198934 transitions. [2019-12-18 18:02:00,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-12-18 18:02:00,000 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 65 [2019-12-18 18:02:00,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:02:00,101 INFO L225 Difference]: With dead ends: 64950 [2019-12-18 18:02:00,101 INFO L226 Difference]: Without dead ends: 64590 [2019-12-18 18:02:00,102 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 554 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=301, Invalid=1679, Unknown=0, NotChecked=0, Total=1980 [2019-12-18 18:02:00,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64590 states. [2019-12-18 18:02:01,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64590 to 36485. [2019-12-18 18:02:01,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36485 states. [2019-12-18 18:02:01,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36485 states to 36485 states and 113957 transitions. [2019-12-18 18:02:01,372 INFO L78 Accepts]: Start accepts. Automaton has 36485 states and 113957 transitions. Word has length 65 [2019-12-18 18:02:01,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:02:01,372 INFO L462 AbstractCegarLoop]: Abstraction has 36485 states and 113957 transitions. [2019-12-18 18:02:01,372 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 18:02:01,372 INFO L276 IsEmpty]: Start isEmpty. Operand 36485 states and 113957 transitions. [2019-12-18 18:02:01,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 18:02:01,415 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:02:01,415 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 18:02:01,415 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 18:02:01,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:02:01,415 INFO L82 PathProgramCache]: Analyzing trace with hash -1534161877, now seen corresponding path program 2 times [2019-12-18 18:02:01,415 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:02:01,416 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020038755] [2019-12-18 18:02:01,416 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:02:01,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:02:01,656 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 18:02:01,656 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020038755] [2019-12-18 18:02:01,656 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:02:01,656 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 18:02:01,656 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840542873] [2019-12-18 18:02:01,657 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 18:02:01,657 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:02:01,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 18:02:01,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-12-18 18:02:01,658 INFO L87 Difference]: Start difference. First operand 36485 states and 113957 transitions. Second operand 11 states. [2019-12-18 18:02:03,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:02:03,688 INFO L93 Difference]: Finished difference Result 61796 states and 188703 transitions. [2019-12-18 18:02:03,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-18 18:02:03,689 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 65 [2019-12-18 18:02:03,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:02:03,784 INFO L225 Difference]: With dead ends: 61796 [2019-12-18 18:02:03,784 INFO L226 Difference]: Without dead ends: 61768 [2019-12-18 18:02:03,785 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 6 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=281, Unknown=0, NotChecked=0, Total=380 [2019-12-18 18:02:03,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61768 states. [2019-12-18 18:02:05,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61768 to 42119. [2019-12-18 18:02:05,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42119 states. [2019-12-18 18:02:05,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42119 states to 42119 states and 130899 transitions. [2019-12-18 18:02:05,151 INFO L78 Accepts]: Start accepts. Automaton has 42119 states and 130899 transitions. Word has length 65 [2019-12-18 18:02:05,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:02:05,151 INFO L462 AbstractCegarLoop]: Abstraction has 42119 states and 130899 transitions. [2019-12-18 18:02:05,151 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 18:02:05,151 INFO L276 IsEmpty]: Start isEmpty. Operand 42119 states and 130899 transitions. [2019-12-18 18:02:05,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 18:02:05,199 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:02:05,199 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 18:02:05,199 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 18:02:05,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:02:05,199 INFO L82 PathProgramCache]: Analyzing trace with hash -2077960667, now seen corresponding path program 3 times [2019-12-18 18:02:05,199 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:02:05,200 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500864391] [2019-12-18 18:02:05,200 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:02:05,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:02:05,261 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 18:02:05,261 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500864391] [2019-12-18 18:02:05,261 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:02:05,261 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 18:02:05,261 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420772787] [2019-12-18 18:02:05,262 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 18:02:05,262 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:02:05,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 18:02:05,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:02:05,263 INFO L87 Difference]: Start difference. First operand 42119 states and 130899 transitions. Second operand 3 states. [2019-12-18 18:02:05,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:02:05,412 INFO L93 Difference]: Finished difference Result 33672 states and 103565 transitions. [2019-12-18 18:02:05,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 18:02:05,412 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-18 18:02:05,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:02:05,478 INFO L225 Difference]: With dead ends: 33672 [2019-12-18 18:02:05,478 INFO L226 Difference]: Without dead ends: 33672 [2019-12-18 18:02:05,478 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 18:02:05,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33672 states. [2019-12-18 18:02:05,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33672 to 31842. [2019-12-18 18:02:05,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31842 states. [2019-12-18 18:02:05,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31842 states to 31842 states and 97729 transitions. [2019-12-18 18:02:05,962 INFO L78 Accepts]: Start accepts. Automaton has 31842 states and 97729 transitions. Word has length 65 [2019-12-18 18:02:05,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:02:05,962 INFO L462 AbstractCegarLoop]: Abstraction has 31842 states and 97729 transitions. [2019-12-18 18:02:05,962 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 18:02:05,962 INFO L276 IsEmpty]: Start isEmpty. Operand 31842 states and 97729 transitions. [2019-12-18 18:02:05,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 18:02:05,997 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:02:05,997 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 18:02:05,998 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 18:02:05,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:02:05,998 INFO L82 PathProgramCache]: Analyzing trace with hash 745619748, now seen corresponding path program 1 times [2019-12-18 18:02:05,998 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:02:05,998 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93783672] [2019-12-18 18:02:05,998 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:02:06,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:02:06,163 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 18:02:06,163 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93783672] [2019-12-18 18:02:06,163 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:02:06,163 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 18:02:06,164 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651639426] [2019-12-18 18:02:06,164 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 18:02:06,164 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:02:06,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 18:02:06,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-12-18 18:02:06,165 INFO L87 Difference]: Start difference. First operand 31842 states and 97729 transitions. Second operand 10 states. [2019-12-18 18:02:08,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:02:08,067 INFO L93 Difference]: Finished difference Result 55306 states and 169108 transitions. [2019-12-18 18:02:08,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-18 18:02:08,068 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 66 [2019-12-18 18:02:08,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:02:08,133 INFO L225 Difference]: With dead ends: 55306 [2019-12-18 18:02:08,133 INFO L226 Difference]: Without dead ends: 43570 [2019-12-18 18:02:08,134 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 18:02:08,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43570 states. [2019-12-18 18:02:08,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43570 to 32635. [2019-12-18 18:02:08,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32635 states. [2019-12-18 18:02:09,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32635 states to 32635 states and 99868 transitions. [2019-12-18 18:02:09,279 INFO L78 Accepts]: Start accepts. Automaton has 32635 states and 99868 transitions. Word has length 66 [2019-12-18 18:02:09,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:02:09,279 INFO L462 AbstractCegarLoop]: Abstraction has 32635 states and 99868 transitions. [2019-12-18 18:02:09,279 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 18:02:09,279 INFO L276 IsEmpty]: Start isEmpty. Operand 32635 states and 99868 transitions. [2019-12-18 18:02:09,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 18:02:09,314 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:02:09,314 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 18:02:09,314 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 18:02:09,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:02:09,315 INFO L82 PathProgramCache]: Analyzing trace with hash -1421968206, now seen corresponding path program 2 times [2019-12-18 18:02:09,315 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:02:09,315 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177736934] [2019-12-18 18:02:09,315 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:02:09,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:02:09,482 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 18:02:09,482 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177736934] [2019-12-18 18:02:09,483 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:02:09,483 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 18:02:09,483 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525567907] [2019-12-18 18:02:09,483 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 18:02:09,483 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:02:09,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 18:02:09,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-18 18:02:09,486 INFO L87 Difference]: Start difference. First operand 32635 states and 99868 transitions. Second operand 10 states. [2019-12-18 18:02:11,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:02:11,452 INFO L93 Difference]: Finished difference Result 53235 states and 161609 transitions. [2019-12-18 18:02:11,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-18 18:02:11,453 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 66 [2019-12-18 18:02:11,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:02:11,521 INFO L225 Difference]: With dead ends: 53235 [2019-12-18 18:02:11,521 INFO L226 Difference]: Without dead ends: 45535 [2019-12-18 18:02:11,522 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2019-12-18 18:02:11,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45535 states. [2019-12-18 18:02:12,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45535 to 33229. [2019-12-18 18:02:12,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33229 states. [2019-12-18 18:02:12,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33229 states to 33229 states and 101313 transitions. [2019-12-18 18:02:12,129 INFO L78 Accepts]: Start accepts. Automaton has 33229 states and 101313 transitions. Word has length 66 [2019-12-18 18:02:12,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:02:12,129 INFO L462 AbstractCegarLoop]: Abstraction has 33229 states and 101313 transitions. [2019-12-18 18:02:12,129 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 18:02:12,129 INFO L276 IsEmpty]: Start isEmpty. Operand 33229 states and 101313 transitions. [2019-12-18 18:02:12,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 18:02:12,162 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:02:12,162 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 18:02:12,163 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 18:02:12,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:02:12,163 INFO L82 PathProgramCache]: Analyzing trace with hash 765284024, now seen corresponding path program 3 times [2019-12-18 18:02:12,163 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:02:12,163 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362131465] [2019-12-18 18:02:12,164 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:02:12,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:02:12,324 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 18:02:12,326 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362131465] [2019-12-18 18:02:12,327 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:02:12,327 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 18:02:12,327 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479547182] [2019-12-18 18:02:12,327 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 18:02:12,327 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:02:12,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 18:02:12,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 18:02:12,328 INFO L87 Difference]: Start difference. First operand 33229 states and 101313 transitions. Second operand 11 states. [2019-12-18 18:02:14,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:02:14,185 INFO L93 Difference]: Finished difference Result 50350 states and 152756 transitions. [2019-12-18 18:02:14,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-18 18:02:14,186 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 66 [2019-12-18 18:02:14,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:02:14,251 INFO L225 Difference]: With dead ends: 50350 [2019-12-18 18:02:14,251 INFO L226 Difference]: Without dead ends: 44896 [2019-12-18 18:02:14,252 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=341, Unknown=0, NotChecked=0, Total=420 [2019-12-18 18:02:14,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44896 states. [2019-12-18 18:02:15,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44896 to 32653. [2019-12-18 18:02:15,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32653 states. [2019-12-18 18:02:15,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32653 states to 32653 states and 99645 transitions. [2019-12-18 18:02:15,208 INFO L78 Accepts]: Start accepts. Automaton has 32653 states and 99645 transitions. Word has length 66 [2019-12-18 18:02:15,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:02:15,208 INFO L462 AbstractCegarLoop]: Abstraction has 32653 states and 99645 transitions. [2019-12-18 18:02:15,208 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 18:02:15,208 INFO L276 IsEmpty]: Start isEmpty. Operand 32653 states and 99645 transitions. [2019-12-18 18:02:15,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 18:02:15,242 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:02:15,243 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:02:15,243 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 18:02:15,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:02:15,243 INFO L82 PathProgramCache]: Analyzing trace with hash 53330666, now seen corresponding path program 4 times [2019-12-18 18:02:15,243 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:02:15,243 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739454717] [2019-12-18 18:02:15,243 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:02:15,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:02:15,359 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 18:02:15,359 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739454717] [2019-12-18 18:02:15,359 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:02:15,360 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 18:02:15,360 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136412228] [2019-12-18 18:02:15,361 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 18:02:15,362 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:02:15,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 18:02:15,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-18 18:02:15,362 INFO L87 Difference]: Start difference. First operand 32653 states and 99645 transitions. Second operand 9 states. [2019-12-18 18:02:18,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:02:18,426 INFO L93 Difference]: Finished difference Result 48364 states and 143942 transitions. [2019-12-18 18:02:18,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-12-18 18:02:18,427 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 66 [2019-12-18 18:02:18,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:02:18,495 INFO L225 Difference]: With dead ends: 48364 [2019-12-18 18:02:18,495 INFO L226 Difference]: Without dead ends: 48124 [2019-12-18 18:02:18,496 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 547 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=285, Invalid=1607, Unknown=0, NotChecked=0, Total=1892 [2019-12-18 18:02:18,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48124 states. [2019-12-18 18:02:19,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48124 to 31397. [2019-12-18 18:02:19,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31397 states. [2019-12-18 18:02:19,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31397 states to 31397 states and 95532 transitions. [2019-12-18 18:02:19,121 INFO L78 Accepts]: Start accepts. Automaton has 31397 states and 95532 transitions. Word has length 66 [2019-12-18 18:02:19,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:02:19,121 INFO L462 AbstractCegarLoop]: Abstraction has 31397 states and 95532 transitions. [2019-12-18 18:02:19,121 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 18:02:19,121 INFO L276 IsEmpty]: Start isEmpty. Operand 31397 states and 95532 transitions. [2019-12-18 18:02:19,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 18:02:19,158 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:02:19,158 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:02:19,158 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 18:02:19,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:02:19,159 INFO L82 PathProgramCache]: Analyzing trace with hash 1722915508, now seen corresponding path program 5 times [2019-12-18 18:02:19,159 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:02:19,159 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116178922] [2019-12-18 18:02:19,159 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:02:19,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:02:19,321 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 18:02:19,322 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116178922] [2019-12-18 18:02:19,322 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:02:19,322 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 18:02:19,322 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553055190] [2019-12-18 18:02:19,323 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 18:02:19,323 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:02:19,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 18:02:19,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 18:02:19,323 INFO L87 Difference]: Start difference. First operand 31397 states and 95532 transitions. Second operand 11 states. [2019-12-18 18:02:21,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:02:21,533 INFO L93 Difference]: Finished difference Result 49779 states and 150599 transitions. [2019-12-18 18:02:21,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-18 18:02:21,533 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 66 [2019-12-18 18:02:21,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:02:21,596 INFO L225 Difference]: With dead ends: 49779 [2019-12-18 18:02:21,597 INFO L226 Difference]: Without dead ends: 44102 [2019-12-18 18:02:21,597 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=92, Invalid=414, Unknown=0, NotChecked=0, Total=506 [2019-12-18 18:02:21,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44102 states. [2019-12-18 18:02:22,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44102 to 31898. [2019-12-18 18:02:22,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31898 states. [2019-12-18 18:02:22,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31898 states to 31898 states and 96852 transitions. [2019-12-18 18:02:22,177 INFO L78 Accepts]: Start accepts. Automaton has 31898 states and 96852 transitions. Word has length 66 [2019-12-18 18:02:22,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:02:22,177 INFO L462 AbstractCegarLoop]: Abstraction has 31898 states and 96852 transitions. [2019-12-18 18:02:22,177 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 18:02:22,177 INFO L276 IsEmpty]: Start isEmpty. Operand 31898 states and 96852 transitions. [2019-12-18 18:02:22,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 18:02:22,212 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:02:22,212 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 18:02:22,212 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 18:02:22,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:02:22,212 INFO L82 PathProgramCache]: Analyzing trace with hash -1833986216, now seen corresponding path program 6 times [2019-12-18 18:02:22,212 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:02:22,213 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116437902] [2019-12-18 18:02:22,213 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:02:22,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:02:22,382 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 18:02:22,383 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116437902] [2019-12-18 18:02:22,383 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:02:22,383 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 18:02:22,383 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277334396] [2019-12-18 18:02:22,383 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 18:02:22,384 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:02:22,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 18:02:22,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-18 18:02:22,384 INFO L87 Difference]: Start difference. First operand 31898 states and 96852 transitions. Second operand 12 states. [2019-12-18 18:02:24,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:02:24,151 INFO L93 Difference]: Finished difference Result 47580 states and 143592 transitions. [2019-12-18 18:02:24,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-18 18:02:24,152 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 66 [2019-12-18 18:02:24,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:02:24,215 INFO L225 Difference]: With dead ends: 47580 [2019-12-18 18:02:24,215 INFO L226 Difference]: Without dead ends: 45395 [2019-12-18 18:02:24,216 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 18:02:24,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45395 states. [2019-12-18 18:02:24,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45395 to 31652. [2019-12-18 18:02:24,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31652 states. [2019-12-18 18:02:24,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31652 states to 31652 states and 96198 transitions. [2019-12-18 18:02:24,816 INFO L78 Accepts]: Start accepts. Automaton has 31652 states and 96198 transitions. Word has length 66 [2019-12-18 18:02:24,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:02:24,816 INFO L462 AbstractCegarLoop]: Abstraction has 31652 states and 96198 transitions. [2019-12-18 18:02:24,817 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 18:02:24,817 INFO L276 IsEmpty]: Start isEmpty. Operand 31652 states and 96198 transitions. [2019-12-18 18:02:24,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 18:02:24,848 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:02:24,849 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 18:02:24,849 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 18:02:24,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:02:24,849 INFO L82 PathProgramCache]: Analyzing trace with hash 1354348786, now seen corresponding path program 7 times [2019-12-18 18:02:24,849 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:02:24,849 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571230085] [2019-12-18 18:02:24,849 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:02:24,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:02:25,001 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 18:02:25,002 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571230085] [2019-12-18 18:02:25,002 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:02:25,002 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 18:02:25,002 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353249799] [2019-12-18 18:02:25,003 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 18:02:25,003 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:02:25,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 18:02:25,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 18:02:25,003 INFO L87 Difference]: Start difference. First operand 31652 states and 96198 transitions. Second operand 11 states. [2019-12-18 18:02:26,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:02:26,772 INFO L93 Difference]: Finished difference Result 69645 states and 210911 transitions. [2019-12-18 18:02:26,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-18 18:02:26,772 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 66 [2019-12-18 18:02:26,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:02:26,875 INFO L225 Difference]: With dead ends: 69645 [2019-12-18 18:02:26,876 INFO L226 Difference]: Without dead ends: 64794 [2019-12-18 18:02:26,876 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=190, Invalid=802, Unknown=0, NotChecked=0, Total=992 [2019-12-18 18:02:27,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64794 states. [2019-12-18 18:02:27,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64794 to 35461. [2019-12-18 18:02:27,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35461 states. [2019-12-18 18:02:27,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35461 states to 35461 states and 107648 transitions. [2019-12-18 18:02:27,621 INFO L78 Accepts]: Start accepts. Automaton has 35461 states and 107648 transitions. Word has length 66 [2019-12-18 18:02:27,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:02:27,622 INFO L462 AbstractCegarLoop]: Abstraction has 35461 states and 107648 transitions. [2019-12-18 18:02:27,622 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 18:02:27,622 INFO L276 IsEmpty]: Start isEmpty. Operand 35461 states and 107648 transitions. [2019-12-18 18:02:27,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 18:02:27,659 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:02:27,659 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 18:02:27,660 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:02:27,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:02:27,660 INFO L82 PathProgramCache]: Analyzing trace with hash -562556272, now seen corresponding path program 8 times [2019-12-18 18:02:27,660 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:02:27,660 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722371614] [2019-12-18 18:02:27,661 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:02:27,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:02:27,815 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 18:02:27,815 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722371614] [2019-12-18 18:02:27,815 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:02:27,815 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 18:02:27,816 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751953535] [2019-12-18 18:02:27,816 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 18:02:27,816 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:02:27,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 18:02:27,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 18:02:27,817 INFO L87 Difference]: Start difference. First operand 35461 states and 107648 transitions. Second operand 11 states. [2019-12-18 18:02:28,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:02:28,992 INFO L93 Difference]: Finished difference Result 65140 states and 196350 transitions. [2019-12-18 18:02:28,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 18:02:28,992 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 66 [2019-12-18 18:02:28,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:02:29,084 INFO L225 Difference]: With dead ends: 65140 [2019-12-18 18:02:29,085 INFO L226 Difference]: Without dead ends: 54180 [2019-12-18 18:02:29,085 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=141, Invalid=509, Unknown=0, NotChecked=0, Total=650 [2019-12-18 18:02:29,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54180 states. [2019-12-18 18:02:29,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54180 to 29269. [2019-12-18 18:02:29,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29269 states. [2019-12-18 18:02:29,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29269 states to 29269 states and 88948 transitions. [2019-12-18 18:02:29,723 INFO L78 Accepts]: Start accepts. Automaton has 29269 states and 88948 transitions. Word has length 66 [2019-12-18 18:02:29,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:02:29,724 INFO L462 AbstractCegarLoop]: Abstraction has 29269 states and 88948 transitions. [2019-12-18 18:02:29,724 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 18:02:29,724 INFO L276 IsEmpty]: Start isEmpty. Operand 29269 states and 88948 transitions. [2019-12-18 18:02:29,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 18:02:29,756 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:02:29,756 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 18:02:29,756 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:02:29,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:02:29,756 INFO L82 PathProgramCache]: Analyzing trace with hash 1527279588, now seen corresponding path program 9 times [2019-12-18 18:02:29,757 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:02:29,757 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159775884] [2019-12-18 18:02:29,757 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:02:29,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:02:30,458 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 18:02:30,458 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159775884] [2019-12-18 18:02:30,459 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:02:30,459 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 18:02:30,459 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619990258] [2019-12-18 18:02:30,460 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-18 18:02:30,460 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:02:30,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-18 18:02:30,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2019-12-18 18:02:30,461 INFO L87 Difference]: Start difference. First operand 29269 states and 88948 transitions. Second operand 14 states. [2019-12-18 18:02:35,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:02:35,185 INFO L93 Difference]: Finished difference Result 60778 states and 182218 transitions. [2019-12-18 18:02:35,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-12-18 18:02:35,186 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 66 [2019-12-18 18:02:35,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:02:35,278 INFO L225 Difference]: With dead ends: 60778 [2019-12-18 18:02:35,278 INFO L226 Difference]: Without dead ends: 60610 [2019-12-18 18:02:35,279 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 2 SyntacticMatches, 6 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 484 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=397, Invalid=1673, Unknown=0, NotChecked=0, Total=2070 [2019-12-18 18:02:35,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60610 states. [2019-12-18 18:02:35,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60610 to 33917. [2019-12-18 18:02:35,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33917 states. [2019-12-18 18:02:36,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33917 states to 33917 states and 103358 transitions. [2019-12-18 18:02:36,053 INFO L78 Accepts]: Start accepts. Automaton has 33917 states and 103358 transitions. Word has length 66 [2019-12-18 18:02:36,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:02:36,054 INFO L462 AbstractCegarLoop]: Abstraction has 33917 states and 103358 transitions. [2019-12-18 18:02:36,054 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-18 18:02:36,054 INFO L276 IsEmpty]: Start isEmpty. Operand 33917 states and 103358 transitions. [2019-12-18 18:02:36,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 18:02:36,090 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:02:36,090 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 18:02:36,090 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:02:36,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:02:36,090 INFO L82 PathProgramCache]: Analyzing trace with hash 983480798, now seen corresponding path program 10 times [2019-12-18 18:02:36,090 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:02:36,090 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409623519] [2019-12-18 18:02:36,090 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:02:36,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:02:36,139 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 18:02:36,140 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409623519] [2019-12-18 18:02:36,140 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:02:36,140 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 18:02:36,140 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321021394] [2019-12-18 18:02:36,140 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 18:02:36,141 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:02:36,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 18:02:36,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:02:36,141 INFO L87 Difference]: Start difference. First operand 33917 states and 103358 transitions. Second operand 3 states. [2019-12-18 18:02:36,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:02:36,268 INFO L93 Difference]: Finished difference Result 33917 states and 103357 transitions. [2019-12-18 18:02:36,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 18:02:36,268 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-18 18:02:36,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:02:36,318 INFO L225 Difference]: With dead ends: 33917 [2019-12-18 18:02:36,318 INFO L226 Difference]: Without dead ends: 33917 [2019-12-18 18:02:36,318 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 18:02:36,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33917 states. [2019-12-18 18:02:36,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33917 to 27399. [2019-12-18 18:02:36,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27399 states. [2019-12-18 18:02:37,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27399 states to 27399 states and 84701 transitions. [2019-12-18 18:02:37,033 INFO L78 Accepts]: Start accepts. Automaton has 27399 states and 84701 transitions. Word has length 66 [2019-12-18 18:02:37,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:02:37,034 INFO L462 AbstractCegarLoop]: Abstraction has 27399 states and 84701 transitions. [2019-12-18 18:02:37,034 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 18:02:37,034 INFO L276 IsEmpty]: Start isEmpty. Operand 27399 states and 84701 transitions. [2019-12-18 18:02:37,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 18:02:37,063 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:02:37,063 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 18:02:37,064 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:02:37,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:02:37,064 INFO L82 PathProgramCache]: Analyzing trace with hash -300630794, now seen corresponding path program 1 times [2019-12-18 18:02:37,064 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:02:37,064 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227718280] [2019-12-18 18:02:37,064 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:02:37,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:02:37,274 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 18:02:37,275 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227718280] [2019-12-18 18:02:37,275 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:02:37,275 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 18:02:37,275 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354245090] [2019-12-18 18:02:37,276 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 18:02:37,276 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:02:37,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 18:02:37,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-18 18:02:37,276 INFO L87 Difference]: Start difference. First operand 27399 states and 84701 transitions. Second operand 12 states. [2019-12-18 18:02:38,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:02:38,388 INFO L93 Difference]: Finished difference Result 45008 states and 139108 transitions. [2019-12-18 18:02:38,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 18:02:38,389 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 67 [2019-12-18 18:02:38,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:02:38,456 INFO L225 Difference]: With dead ends: 45008 [2019-12-18 18:02:38,456 INFO L226 Difference]: Without dead ends: 44573 [2019-12-18 18:02:38,456 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=133, Invalid=569, Unknown=0, NotChecked=0, Total=702 [2019-12-18 18:02:38,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44573 states. [2019-12-18 18:02:38,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44573 to 27139. [2019-12-18 18:02:38,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27139 states. [2019-12-18 18:02:39,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27139 states to 27139 states and 84035 transitions. [2019-12-18 18:02:39,016 INFO L78 Accepts]: Start accepts. Automaton has 27139 states and 84035 transitions. Word has length 67 [2019-12-18 18:02:39,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:02:39,016 INFO L462 AbstractCegarLoop]: Abstraction has 27139 states and 84035 transitions. [2019-12-18 18:02:39,016 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 18:02:39,016 INFO L276 IsEmpty]: Start isEmpty. Operand 27139 states and 84035 transitions. [2019-12-18 18:02:39,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 18:02:39,044 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:02:39,044 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 18:02:39,044 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:02:39,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:02:39,045 INFO L82 PathProgramCache]: Analyzing trace with hash -1154306208, now seen corresponding path program 2 times [2019-12-18 18:02:39,045 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:02:39,045 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351778167] [2019-12-18 18:02:39,045 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:02:39,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 18:02:39,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 18:02:39,161 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 18:02:39,162 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 18:02:39,166 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) (= v_~main$tmp_guard1~0_48 0) (= 0 v_~z$r_buff0_thd3~0_416) (= 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_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t1576~0.base_23|) (= v_~z$w_buff0_used~0_900 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t1576~0.base_23| 1) |v_#valid_60|) (= (store |v_#length_22| |v_ULTIMATE.start_main_~#t1576~0.base_23| 4) |v_#length_21|) (= |v_ULTIMATE.start_main_~#t1576~0.offset_17| 0) (= 0 v_~__unbuffered_p0_EAX~0_137) (= v_~z$read_delayed~0_7 0) (= v_~z$r_buff1_thd2~0_170 0) (= 0 |v_#NULL.base_7|) (= 0 v_~z$r_buff1_thd3~0_300) (= 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) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1576~0.base_23| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1576~0.base_23|) |v_ULTIMATE.start_main_~#t1576~0.offset_17| 0)) |v_#memory_int_17|) (= v_~z$r_buff0_thd2~0_191 0) (= v_~y~0_31 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t1576~0.base_23|) 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_62|, #memory_int=|v_#memory_int_18|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_~#t1577~0.offset=|v_ULTIMATE.start_main_~#t1577~0.offset_12|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_170, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_29|, ULTIMATE.start_main_~#t1577~0.base=|v_ULTIMATE.start_main_~#t1577~0.base_19|, #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_~#t1578~0.base=|v_ULTIMATE.start_main_~#t1578~0.base_17|, ~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_~#t1576~0.base=|v_ULTIMATE.start_main_~#t1576~0.base_23|, ULTIMATE.start_main_~#t1576~0.offset=|v_ULTIMATE.start_main_~#t1576~0.offset_17|, 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_#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, #NULL.base=|v_#NULL.base_7|, ULTIMATE.start_main_~#t1578~0.offset=|v_ULTIMATE.start_main_~#t1578~0.offset_14|, 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_~#t1577~0.offset, ~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_~#t1577~0.base, #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_~#t1578~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_~#t1576~0.base, ULTIMATE.start_main_~#t1576~0.offset, ULTIMATE.start_main_#t~ite51, ~z$r_buff1_thd0~0, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet46, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_#t~nondet44, ~z$r_buff1_thd3~0, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_~#t1578~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 18:02:39,168 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [874] [874] L822-1-->L824: Formula: (and (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1577~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1577~0.base_11|) |v_ULTIMATE.start_main_~#t1577~0.offset_9| 1)) |v_#memory_int_13|) (= |v_ULTIMATE.start_main_~#t1577~0.offset_9| 0) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t1577~0.base_11| 4) |v_#length_17|) (not (= |v_ULTIMATE.start_main_~#t1577~0.base_11| 0)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1577~0.base_11|) (= (store |v_#valid_39| |v_ULTIMATE.start_main_~#t1577~0.base_11| 1) |v_#valid_38|) (= 0 (select |v_#valid_39| |v_ULTIMATE.start_main_~#t1577~0.base_11|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_~#t1577~0.offset=|v_ULTIMATE.start_main_~#t1577~0.offset_9|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_6|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#t1577~0.base=|v_ULTIMATE.start_main_~#t1577~0.base_11|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1577~0.offset, ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, ULTIMATE.start_main_~#t1577~0.base, #length] because there is no mapped edge [2019-12-18 18:02:39,168 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 18:02:39,173 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L766-2-->L766-4: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff1_used~0_In102759287 256))) (.cse0 (= (mod ~z$r_buff1_thd2~0_In102759287 256) 0))) (or (and (= ~z$w_buff1~0_In102759287 |P1Thread1of1ForFork2_#t~ite9_Out102759287|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~z~0_In102759287 |P1Thread1of1ForFork2_#t~ite9_Out102759287|)))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In102759287, ~z$w_buff1_used~0=~z$w_buff1_used~0_In102759287, ~z$w_buff1~0=~z$w_buff1~0_In102759287, ~z~0=~z~0_In102759287} OutVars{P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out102759287|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In102759287, ~z$w_buff1_used~0=~z$w_buff1_used~0_In102759287, ~z$w_buff1~0=~z$w_buff1~0_In102759287, ~z~0=~z~0_In102759287} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9] because there is no mapped edge [2019-12-18 18:02:39,173 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 18:02:39,173 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [871] [871] L824-1-->L826: Formula: (and (= (store |v_#valid_37| |v_ULTIMATE.start_main_~#t1578~0.base_13| 1) |v_#valid_36|) (not (= 0 |v_ULTIMATE.start_main_~#t1578~0.base_13|)) (= |v_ULTIMATE.start_main_~#t1578~0.offset_11| 0) (= 0 (select |v_#valid_37| |v_ULTIMATE.start_main_~#t1578~0.base_13|)) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t1578~0.base_13| 4)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t1578~0.base_13|) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1578~0.base_13| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1578~0.base_13|) |v_ULTIMATE.start_main_~#t1578~0.offset_11| 2)) |v_#memory_int_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t1578~0.offset=|v_ULTIMATE.start_main_~#t1578~0.offset_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_~#t1578~0.base=|v_ULTIMATE.start_main_~#t1578~0.base_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1578~0.offset, #valid, ULTIMATE.start_main_#t~nondet45, #memory_int, #length, ULTIMATE.start_main_~#t1578~0.base] because there is no mapped edge [2019-12-18 18:02:39,173 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L767-->L767-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In1297609209 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In1297609209 256) 0))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In1297609209 |P1Thread1of1ForFork2_#t~ite11_Out1297609209|)) (and (not .cse1) (= 0 |P1Thread1of1ForFork2_#t~ite11_Out1297609209|) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1297609209, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1297609209} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1297609209, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out1297609209|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1297609209} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-18 18:02:39,175 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [823] [823] L768-->L768-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd2~0_In609091949 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In609091949 256))) (.cse3 (= 0 (mod ~z$r_buff1_thd2~0_In609091949 256))) (.cse2 (= (mod ~z$w_buff1_used~0_In609091949 256) 0))) (or (and (= |P1Thread1of1ForFork2_#t~ite12_Out609091949| ~z$w_buff1_used~0_In609091949) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= |P1Thread1of1ForFork2_#t~ite12_Out609091949| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In609091949, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In609091949, ~z$w_buff1_used~0=~z$w_buff1_used~0_In609091949, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In609091949} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In609091949, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In609091949, ~z$w_buff1_used~0=~z$w_buff1_used~0_In609091949, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out609091949|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In609091949} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-18 18:02:39,182 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [842] [842] L769-->L769-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd2~0_In-137159647 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In-137159647 256) 0))) (or (and (= 0 |P1Thread1of1ForFork2_#t~ite13_Out-137159647|) (not .cse0) (not .cse1)) (and (= ~z$r_buff0_thd2~0_In-137159647 |P1Thread1of1ForFork2_#t~ite13_Out-137159647|) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-137159647, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-137159647} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-137159647, P1Thread1of1ForFork2_#t~ite13=|P1Thread1of1ForFork2_#t~ite13_Out-137159647|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-137159647} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite13] because there is no mapped edge [2019-12-18 18:02:39,186 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [875] [875] L790-->L790-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In-178436303 256)))) (or (and (= ~z$w_buff0_used~0_In-178436303 |P2Thread1of1ForFork0_#t~ite26_Out-178436303|) (let ((.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In-178436303 256)))) (or (and .cse0 (= 0 (mod ~z$w_buff1_used~0_In-178436303 256))) (and .cse0 (= 0 (mod ~z$r_buff1_thd3~0_In-178436303 256))) (= (mod ~z$w_buff0_used~0_In-178436303 256) 0))) .cse1 (= |P2Thread1of1ForFork0_#t~ite26_Out-178436303| |P2Thread1of1ForFork0_#t~ite27_Out-178436303|)) (and (= ~z$w_buff0_used~0_In-178436303 |P2Thread1of1ForFork0_#t~ite27_Out-178436303|) (not .cse1) (= |P2Thread1of1ForFork0_#t~ite26_In-178436303| |P2Thread1of1ForFork0_#t~ite26_Out-178436303|)))) InVars {P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_In-178436303|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-178436303, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-178436303, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-178436303, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-178436303, ~weak$$choice2~0=~weak$$choice2~0_In-178436303} OutVars{P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_Out-178436303|, P2Thread1of1ForFork0_#t~ite27=|P2Thread1of1ForFork0_#t~ite27_Out-178436303|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-178436303, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-178436303, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-178436303, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-178436303, ~weak$$choice2~0=~weak$$choice2~0_In-178436303} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite26, P2Thread1of1ForFork0_#t~ite27] because there is no mapped edge [2019-12-18 18:02:39,190 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 18:02:39,192 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L747-->L747-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In1447513033 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd1~0_In1447513033 256)))) (or (and (not .cse0) (= |P0Thread1of1ForFork1_#t~ite5_Out1447513033| 0) (not .cse1)) (and (or .cse1 .cse0) (= ~z$w_buff0_used~0_In1447513033 |P0Thread1of1ForFork1_#t~ite5_Out1447513033|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1447513033, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1447513033} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out1447513033|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1447513033, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1447513033} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-18 18:02:39,194 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 18:02:39,196 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [827] [827] L799-2-->L799-5: Formula: (let ((.cse1 (= (mod ~z$r_buff1_thd3~0_In1167513280 256) 0)) (.cse0 (= (mod ~z$w_buff1_used~0_In1167513280 256) 0)) (.cse2 (= |P2Thread1of1ForFork0_#t~ite38_Out1167513280| |P2Thread1of1ForFork0_#t~ite39_Out1167513280|))) (or (and (= |P2Thread1of1ForFork0_#t~ite38_Out1167513280| ~z~0_In1167513280) (or .cse0 .cse1) .cse2) (and (not .cse1) (not .cse0) (= |P2Thread1of1ForFork0_#t~ite38_Out1167513280| ~z$w_buff1~0_In1167513280) .cse2))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1167513280, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1167513280, ~z$w_buff1~0=~z$w_buff1~0_In1167513280, ~z~0=~z~0_In1167513280} OutVars{P2Thread1of1ForFork0_#t~ite39=|P2Thread1of1ForFork0_#t~ite39_Out1167513280|, P2Thread1of1ForFork0_#t~ite38=|P2Thread1of1ForFork0_#t~ite38_Out1167513280|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1167513280, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1167513280, ~z$w_buff1~0=~z$w_buff1~0_In1167513280, ~z~0=~z~0_In1167513280} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite39, P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-18 18:02:39,197 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [843] [843] L800-->L800-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In-1839978182 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1839978182 256)))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork0_#t~ite40_Out-1839978182| 0)) (and (= |P2Thread1of1ForFork0_#t~ite40_Out-1839978182| ~z$w_buff0_used~0_In-1839978182) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1839978182, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1839978182} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1839978182, P2Thread1of1ForFork0_#t~ite40=|P2Thread1of1ForFork0_#t~ite40_Out-1839978182|, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1839978182} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite40] because there is no mapped edge [2019-12-18 18:02:39,198 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L801-->L801-2: Formula: (let ((.cse3 (= 0 (mod ~z$r_buff0_thd3~0_In-869146186 256))) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In-869146186 256))) (.cse0 (= (mod ~z$r_buff1_thd3~0_In-869146186 256) 0)) (.cse1 (= (mod ~z$w_buff1_used~0_In-869146186 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork0_#t~ite41_Out-869146186| 0)) (and (= |P2Thread1of1ForFork0_#t~ite41_Out-869146186| ~z$w_buff1_used~0_In-869146186) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-869146186, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-869146186, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-869146186, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-869146186} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-869146186, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-869146186, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-869146186, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-869146186, P2Thread1of1ForFork0_#t~ite41=|P2Thread1of1ForFork0_#t~ite41_Out-869146186|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite41] because there is no mapped edge [2019-12-18 18:02:39,199 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [824] [824] L802-->L802-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-666893180 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In-666893180 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite42_Out-666893180| 0) (not .cse0) (not .cse1)) (and (= |P2Thread1of1ForFork0_#t~ite42_Out-666893180| ~z$r_buff0_thd3~0_In-666893180) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-666893180, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-666893180} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-666893180, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-666893180, P2Thread1of1ForFork0_#t~ite42=|P2Thread1of1ForFork0_#t~ite42_Out-666893180|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-18 18:02:39,200 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [846] [846] L803-->L803-2: Formula: (let ((.cse3 (= (mod ~z$r_buff0_thd3~0_In-19180694 256) 0)) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In-19180694 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd3~0_In-19180694 256))) (.cse0 (= (mod ~z$w_buff1_used~0_In-19180694 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite43_Out-19180694| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse1 .cse0) (= |P2Thread1of1ForFork0_#t~ite43_Out-19180694| ~z$r_buff1_thd3~0_In-19180694)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-19180694, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-19180694, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-19180694, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-19180694} OutVars{P2Thread1of1ForFork0_#t~ite43=|P2Thread1of1ForFork0_#t~ite43_Out-19180694|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-19180694, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-19180694, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-19180694, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-19180694} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite43] because there is no mapped edge [2019-12-18 18:02:39,201 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 18:02:39,201 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [847] [847] L748-->L748-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff1_used~0_In-210347384 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd1~0_In-210347384 256))) (.cse2 (= 0 (mod ~z$r_buff0_thd1~0_In-210347384 256))) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In-210347384 256)))) (or (and (or .cse0 .cse1) (= ~z$w_buff1_used~0_In-210347384 |P0Thread1of1ForFork1_#t~ite6_Out-210347384|) (or .cse2 .cse3)) (and (= 0 |P0Thread1of1ForFork1_#t~ite6_Out-210347384|) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-210347384, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-210347384, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-210347384, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-210347384} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-210347384, P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out-210347384|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-210347384, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-210347384, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-210347384} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-18 18:02:39,202 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [845] [845] L749-->L750: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-564632895 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd1~0_In-564632895 256) 0))) (or (and (not .cse0) (= ~z$r_buff0_thd1~0_Out-564632895 0) (not .cse1)) (and (or .cse1 .cse0) (= ~z$r_buff0_thd1~0_Out-564632895 ~z$r_buff0_thd1~0_In-564632895)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-564632895, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-564632895} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-564632895, P0Thread1of1ForFork1_#t~ite7=|P0Thread1of1ForFork1_#t~ite7_Out-564632895|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out-564632895} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 18:02:39,202 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L750-->L750-2: Formula: (let ((.cse3 (= (mod ~z$r_buff1_thd1~0_In-119607970 256) 0)) (.cse2 (= (mod ~z$w_buff1_used~0_In-119607970 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In-119607970 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd1~0_In-119607970 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork1_#t~ite8_Out-119607970|)) (and (or .cse3 .cse2) (or .cse1 .cse0) (= ~z$r_buff1_thd1~0_In-119607970 |P0Thread1of1ForFork1_#t~ite8_Out-119607970|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-119607970, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-119607970, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-119607970, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-119607970} OutVars{P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out-119607970|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-119607970, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-119607970, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-119607970, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-119607970} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-18 18:02:39,202 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 18:02:39,203 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L770-->L770-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff0_thd2~0_In1351494881 256))) (.cse3 (= (mod ~z$w_buff0_used~0_In1351494881 256) 0)) (.cse1 (= (mod ~z$r_buff1_thd2~0_In1351494881 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In1351494881 256)))) (or (and (= 0 |P1Thread1of1ForFork2_#t~ite14_Out1351494881|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~z$r_buff1_thd2~0_In1351494881 |P1Thread1of1ForFork2_#t~ite14_Out1351494881|) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1351494881, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1351494881, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1351494881, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1351494881} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1351494881, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1351494881, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1351494881, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out1351494881|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1351494881} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-18 18:02:39,203 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 18:02:39,203 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 18:02:39,204 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L832-2-->L832-5: Formula: (let ((.cse0 (= |ULTIMATE.start_main_#t~ite48_Out-1109550061| |ULTIMATE.start_main_#t~ite47_Out-1109550061|)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In-1109550061 256))) (.cse2 (= (mod ~z$r_buff1_thd0~0_In-1109550061 256) 0))) (or (and .cse0 (not .cse1) (= ~z$w_buff1~0_In-1109550061 |ULTIMATE.start_main_#t~ite47_Out-1109550061|) (not .cse2)) (and .cse0 (or .cse1 .cse2) (= ~z~0_In-1109550061 |ULTIMATE.start_main_#t~ite47_Out-1109550061|)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1109550061, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1109550061, ~z$w_buff1~0=~z$w_buff1~0_In-1109550061, ~z~0=~z~0_In-1109550061} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1109550061, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out-1109550061|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1109550061, ~z$w_buff1~0=~z$w_buff1~0_In-1109550061, ULTIMATE.start_main_#t~ite48=|ULTIMATE.start_main_#t~ite48_Out-1109550061|, ~z~0=~z~0_In-1109550061} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-18 18:02:39,205 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [839] [839] L833-->L833-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In1276435502 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In1276435502 256)))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In1276435502 |ULTIMATE.start_main_#t~ite49_Out1276435502|)) (and (= 0 |ULTIMATE.start_main_#t~ite49_Out1276435502|) (not .cse0) (not .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1276435502, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1276435502} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1276435502, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1276435502, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out1276435502|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-18 18:02:39,206 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [830] [830] L834-->L834-2: Formula: (let ((.cse2 (= (mod ~z$r_buff1_thd0~0_In2077767534 256) 0)) (.cse3 (= (mod ~z$w_buff1_used~0_In2077767534 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd0~0_In2077767534 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In2077767534 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite50_Out2077767534| 0)) (and (= ~z$w_buff1_used~0_In2077767534 |ULTIMATE.start_main_#t~ite50_Out2077767534|) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2077767534, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2077767534, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In2077767534, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2077767534} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out2077767534|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2077767534, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2077767534, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In2077767534, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2077767534} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-18 18:02:39,207 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] L835-->L835-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In1515276168 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In1515276168 256)))) (or (and (= ~z$r_buff0_thd0~0_In1515276168 |ULTIMATE.start_main_#t~ite51_Out1515276168|) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite51_Out1515276168|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1515276168, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1515276168} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1515276168, ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out1515276168|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1515276168} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-18 18:02:39,209 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L836-->L836-2: Formula: (let ((.cse3 (= 0 (mod ~z$r_buff1_thd0~0_In-355473050 256))) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In-355473050 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-355473050 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In-355473050 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite52_Out-355473050|)) (and (or .cse3 .cse2) (= ~z$r_buff1_thd0~0_In-355473050 |ULTIMATE.start_main_#t~ite52_Out-355473050|) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-355473050, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-355473050, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-355473050, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-355473050} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out-355473050|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-355473050, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-355473050, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-355473050, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-355473050} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-18 18:02:39,209 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 18:02:39,350 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 06:02:39 BasicIcfg [2019-12-18 18:02:39,351 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 18:02:39,353 INFO L168 Benchmark]: Toolchain (without parser) took 132494.03 ms. Allocated memory was 145.2 MB in the beginning and 3.6 GB in the end (delta: 3.4 GB). Free memory was 99.9 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 2.3 GB. Max. memory is 7.1 GB. [2019-12-18 18:02:39,353 INFO L168 Benchmark]: CDTParser took 0.50 ms. Allocated memory is still 145.2 MB. Free memory is still 120.1 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-12-18 18:02:39,354 INFO L168 Benchmark]: CACSL2BoogieTranslator took 778.24 ms. Allocated memory was 145.2 MB in the beginning and 201.9 MB in the end (delta: 56.6 MB). Free memory was 99.5 MB in the beginning and 155.5 MB in the end (delta: -56.0 MB). Peak memory consumption was 20.9 MB. Max. memory is 7.1 GB. [2019-12-18 18:02:39,354 INFO L168 Benchmark]: Boogie Procedure Inliner took 89.47 ms. Allocated memory is still 201.9 MB. Free memory was 155.5 MB in the beginning and 152.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-18 18:02:39,355 INFO L168 Benchmark]: Boogie Preprocessor took 38.88 ms. Allocated memory is still 201.9 MB. Free memory was 152.9 MB in the beginning and 150.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-18 18:02:39,355 INFO L168 Benchmark]: RCFGBuilder took 896.90 ms. Allocated memory is still 201.9 MB. Free memory was 150.2 MB in the beginning and 100.8 MB in the end (delta: 49.5 MB). Peak memory consumption was 49.5 MB. Max. memory is 7.1 GB. [2019-12-18 18:02:39,362 INFO L168 Benchmark]: TraceAbstraction took 130684.91 ms. Allocated memory was 201.9 MB in the beginning and 3.6 GB in the end (delta: 3.4 GB). Free memory was 100.1 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 2.3 GB. Max. memory is 7.1 GB. [2019-12-18 18:02:39,364 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.50 ms. Allocated memory is still 145.2 MB. Free memory is still 120.1 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 778.24 ms. Allocated memory was 145.2 MB in the beginning and 201.9 MB in the end (delta: 56.6 MB). Free memory was 99.5 MB in the beginning and 155.5 MB in the end (delta: -56.0 MB). Peak memory consumption was 20.9 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 89.47 ms. Allocated memory is still 201.9 MB. Free memory was 155.5 MB in the beginning and 152.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 38.88 ms. Allocated memory is still 201.9 MB. Free memory was 152.9 MB in the beginning and 150.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 896.90 ms. Allocated memory is still 201.9 MB. Free memory was 150.2 MB in the beginning and 100.8 MB in the end (delta: 49.5 MB). Peak memory consumption was 49.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 130684.91 ms. Allocated memory was 201.9 MB in the beginning and 3.6 GB in the end (delta: 3.4 GB). Free memory was 100.1 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 2.3 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 6.2s, 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.1s, 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(&t1576, ((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(&t1577, ((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(&t1578, ((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=8, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [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=8, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [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=8, weak$$choice2=1, 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=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [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=8, weak$$choice2=1, 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=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 ? (_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=8, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 ? (_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=8, weak$$choice2=1, weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 ? (_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=8, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 ? (_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=8, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=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=8, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=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: 130.2s, OverallIterations: 32, TraceHistogramMax: 1, AutomataDifference: 49.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 9160 SDtfs, 11121 SDslu, 39866 SDs, 0 SdLazy, 26161 SolverSat, 511 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 21.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 538 GetRequests, 79 SyntacticMatches, 28 SemanticMatches, 431 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2470 ImplicationChecksByTransitivity, 6.0s 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: 46.0s AutomataMinimizationTime, 31 MinimizatonAttempts, 417575 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.4s InterpolantComputationTime, 1619 NumberOfCodeBlocks, 1619 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 1521 ConstructedInterpolants, 0 QuantifiedInterpolants, 387567 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 31 InterpolantComputations, 31 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...