/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe013_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 22:33:22,515 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 22:33:22,518 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 22:33:22,530 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 22:33:22,531 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 22:33:22,532 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 22:33:22,533 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 22:33:22,535 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 22:33:22,537 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 22:33:22,538 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 22:33:22,539 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 22:33:22,540 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 22:33:22,540 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 22:33:22,541 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 22:33:22,542 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 22:33:22,544 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 22:33:22,544 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 22:33:22,545 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 22:33:22,547 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 22:33:22,549 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 22:33:22,551 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 22:33:22,553 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 22:33:22,554 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 22:33:22,555 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 22:33:22,557 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 22:33:22,558 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 22:33:22,558 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 22:33:22,559 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 22:33:22,559 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 22:33:22,560 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 22:33:22,561 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 22:33:22,562 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 22:33:22,562 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 22:33:22,563 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 22:33:22,564 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 22:33:22,565 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 22:33:22,565 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 22:33:22,566 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 22:33:22,566 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 22:33:22,567 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 22:33:22,568 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 22:33:22,568 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf [2019-12-18 22:33:22,583 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 22:33:22,584 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 22:33:22,585 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 22:33:22,585 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 22:33:22,586 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 22:33:22,586 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 22:33:22,586 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 22:33:22,586 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 22:33:22,586 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 22:33:22,587 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 22:33:22,587 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 22:33:22,587 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 22:33:22,587 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 22:33:22,587 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 22:33:22,588 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 22:33:22,588 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 22:33:22,588 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 22:33:22,588 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 22:33:22,588 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 22:33:22,589 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 22:33:22,590 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 22:33:22,590 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 22:33:22,590 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 22:33:22,591 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 22:33:22,591 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 22:33:22,591 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 22:33:22,591 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 22:33:22,591 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-18 22:33:22,591 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 22:33:22,592 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 22:33:22,868 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 22:33:22,884 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 22:33:22,889 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 22:33:22,890 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 22:33:22,891 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 22:33:22,892 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe013_pso.oepc.i [2019-12-18 22:33:22,971 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/97425afb0/6487dd1746ec4bed88fa743b6c68ec42/FLAG8060371d5 [2019-12-18 22:33:23,538 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 22:33:23,539 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe013_pso.oepc.i [2019-12-18 22:33:23,560 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/97425afb0/6487dd1746ec4bed88fa743b6c68ec42/FLAG8060371d5 [2019-12-18 22:33:23,789 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/97425afb0/6487dd1746ec4bed88fa743b6c68ec42 [2019-12-18 22:33:23,799 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 22:33:23,802 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 22:33:23,803 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 22:33:23,803 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 22:33:23,808 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 22:33:23,808 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 10:33:23" (1/1) ... [2019-12-18 22:33:23,814 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d449861 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:33:23, skipping insertion in model container [2019-12-18 22:33:23,815 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 10:33:23" (1/1) ... [2019-12-18 22:33:23,822 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 22:33:23,880 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 22:33:24,442 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 22:33:24,455 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 22:33:24,527 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 22:33:24,626 INFO L208 MainTranslator]: Completed translation [2019-12-18 22:33:24,627 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:33:24 WrapperNode [2019-12-18 22:33:24,627 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 22:33:24,628 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 22:33:24,628 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 22:33:24,628 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 22:33:24,634 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:33:24" (1/1) ... [2019-12-18 22:33:24,659 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:33:24" (1/1) ... [2019-12-18 22:33:24,700 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 22:33:24,701 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 22:33:24,701 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 22:33:24,701 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 22:33:24,710 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:33:24" (1/1) ... [2019-12-18 22:33:24,710 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:33:24" (1/1) ... [2019-12-18 22:33:24,714 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:33:24" (1/1) ... [2019-12-18 22:33:24,715 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:33:24" (1/1) ... [2019-12-18 22:33:24,727 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:33:24" (1/1) ... [2019-12-18 22:33:24,733 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:33:24" (1/1) ... [2019-12-18 22:33:24,737 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:33:24" (1/1) ... [2019-12-18 22:33:24,742 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 22:33:24,743 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 22:33:24,743 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 22:33:24,743 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 22:33:24,744 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:33:24" (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 22:33:24,815 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 22:33:24,816 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 22:33:24,816 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 22:33:24,816 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 22:33:24,816 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 22:33:24,816 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 22:33:24,817 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 22:33:24,817 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 22:33:24,817 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 22:33:24,817 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 22:33:24,817 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 22:33:24,818 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 22:33:24,818 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 22:33:24,822 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 22:33:25,575 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 22:33:25,576 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 22:33:25,577 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 10:33:25 BoogieIcfgContainer [2019-12-18 22:33:25,577 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 22:33:25,578 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 22:33:25,578 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 22:33:25,582 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 22:33:25,582 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 10:33:23" (1/3) ... [2019-12-18 22:33:25,583 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68a0c1f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 10:33:25, skipping insertion in model container [2019-12-18 22:33:25,583 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:33:24" (2/3) ... [2019-12-18 22:33:25,583 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68a0c1f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 10:33:25, skipping insertion in model container [2019-12-18 22:33:25,584 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 10:33:25" (3/3) ... [2019-12-18 22:33:25,585 INFO L109 eAbstractionObserver]: Analyzing ICFG safe013_pso.oepc.i [2019-12-18 22:33:25,595 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 22:33:25,596 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 22:33:25,604 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 22:33:25,605 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 22:33:25,645 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,645 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,646 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,646 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,646 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,646 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,646 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,646 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,647 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,647 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,647 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,648 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,648 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,648 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,648 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,649 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,649 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,649 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,649 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,650 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,650 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,650 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,651 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,654 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,655 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,655 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,655 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,655 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,656 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,656 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,656 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,656 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,657 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,657 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,657 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,657 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,658 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,658 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,658 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,658 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,659 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,659 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,659 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,659 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,660 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,660 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,660 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,660 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,661 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,661 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,661 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,661 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,662 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,662 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,662 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,662 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,663 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,663 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,663 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,663 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,664 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,664 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,664 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,664 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,664 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,665 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,665 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,665 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,665 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,666 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,666 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,666 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,666 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,667 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,667 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,667 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,667 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,667 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,668 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,668 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,668 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,668 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,669 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,669 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,669 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,669 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,670 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,670 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,670 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,670 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,671 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,671 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,690 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,690 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,691 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,692 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,692 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,692 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,692 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,692 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,693 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,693 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,693 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,693 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,694 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,694 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,694 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,694 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,695 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,695 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,695 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,695 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,695 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,696 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,696 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,696 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,696 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,696 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,697 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,697 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,697 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,697 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,697 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,698 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,698 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,698 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,698 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,698 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,699 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,699 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,699 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,699 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,700 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,700 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,700 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,700 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,700 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,701 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,701 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,701 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,701 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,702 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,702 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,702 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,702 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,702 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,703 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,703 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,703 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,703 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,703 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,704 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,704 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,704 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,704 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,704 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,705 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,705 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,708 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,708 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,709 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,709 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,709 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,709 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,709 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,709 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,710 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,710 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,710 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,710 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,713 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,713 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,713 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,713 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,714 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,714 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,714 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,714 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,714 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,715 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,719 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,720 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,720 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,720 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,720 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,720 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,721 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,721 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,721 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,721 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,721 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,722 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,722 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,722 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,722 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,722 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,722 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,723 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,723 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,723 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,723 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,723 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,724 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,724 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,724 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,724 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,724 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:33:25,740 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 22:33:25,760 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 22:33:25,760 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 22:33:25,760 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 22:33:25,760 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 22:33:25,761 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 22:33:25,761 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 22:33:25,761 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 22:33:25,761 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 22:33:25,777 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 163 places, 194 transitions [2019-12-18 22:33:25,779 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 163 places, 194 transitions [2019-12-18 22:33:25,863 INFO L126 PetriNetUnfolder]: 41/191 cut-off events. [2019-12-18 22:33:25,863 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 22:33:25,881 INFO L76 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 191 events. 41/191 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 447 event pairs. 9/157 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-18 22:33:25,908 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 163 places, 194 transitions [2019-12-18 22:33:25,975 INFO L126 PetriNetUnfolder]: 41/191 cut-off events. [2019-12-18 22:33:25,975 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 22:33:25,985 INFO L76 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 191 events. 41/191 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 447 event pairs. 9/157 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-18 22:33:26,004 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 16696 [2019-12-18 22:33:26,005 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-18 22:33:29,338 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2019-12-18 22:33:29,694 WARN L192 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2019-12-18 22:33:29,815 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-12-18 22:33:29,895 INFO L206 etLargeBlockEncoding]: Checked pairs total: 68909 [2019-12-18 22:33:29,896 INFO L214 etLargeBlockEncoding]: Total number of compositions: 110 [2019-12-18 22:33:29,899 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 84 places, 92 transitions [2019-12-18 22:33:41,901 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 92280 states. [2019-12-18 22:33:41,903 INFO L276 IsEmpty]: Start isEmpty. Operand 92280 states. [2019-12-18 22:33:41,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-18 22:33:41,910 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:33:41,911 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-18 22:33:41,911 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:33:41,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:33:41,916 INFO L82 PathProgramCache]: Analyzing trace with hash 793714210, now seen corresponding path program 1 times [2019-12-18 22:33:41,924 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:33:41,925 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252310527] [2019-12-18 22:33:41,925 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:33:42,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:33:42,160 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 22:33:42,161 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252310527] [2019-12-18 22:33:42,162 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:33:42,162 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 22:33:42,165 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613715210] [2019-12-18 22:33:42,170 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 22:33:42,171 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:33:42,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 22:33:42,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:33:42,188 INFO L87 Difference]: Start difference. First operand 92280 states. Second operand 3 states. [2019-12-18 22:33:45,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:33:45,022 INFO L93 Difference]: Finished difference Result 90395 states and 387830 transitions. [2019-12-18 22:33:45,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 22:33:45,024 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-18 22:33:45,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:33:45,627 INFO L225 Difference]: With dead ends: 90395 [2019-12-18 22:33:45,627 INFO L226 Difference]: Without dead ends: 85117 [2019-12-18 22:33:45,631 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 22:33:50,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85117 states. [2019-12-18 22:33:52,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85117 to 85117. [2019-12-18 22:33:52,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85117 states. [2019-12-18 22:33:56,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85117 states to 85117 states and 364674 transitions. [2019-12-18 22:33:56,073 INFO L78 Accepts]: Start accepts. Automaton has 85117 states and 364674 transitions. Word has length 5 [2019-12-18 22:33:56,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:33:56,073 INFO L462 AbstractCegarLoop]: Abstraction has 85117 states and 364674 transitions. [2019-12-18 22:33:56,073 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 22:33:56,074 INFO L276 IsEmpty]: Start isEmpty. Operand 85117 states and 364674 transitions. [2019-12-18 22:33:56,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 22:33:56,082 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:33:56,082 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:33:56,082 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:33:56,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:33:56,083 INFO L82 PathProgramCache]: Analyzing trace with hash -1502291338, now seen corresponding path program 1 times [2019-12-18 22:33:56,083 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:33:56,083 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725953942] [2019-12-18 22:33:56,083 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:33:56,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:33:56,231 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 22:33:56,232 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725953942] [2019-12-18 22:33:56,232 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:33:56,232 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 22:33:56,233 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37685138] [2019-12-18 22:33:56,235 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 22:33:56,235 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:33:56,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 22:33:56,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 22:33:56,236 INFO L87 Difference]: Start difference. First operand 85117 states and 364674 transitions. Second operand 4 states. [2019-12-18 22:34:00,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:34:00,827 INFO L93 Difference]: Finished difference Result 130038 states and 533020 transitions. [2019-12-18 22:34:00,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 22:34:00,827 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-18 22:34:00,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:34:01,472 INFO L225 Difference]: With dead ends: 130038 [2019-12-18 22:34:01,472 INFO L226 Difference]: Without dead ends: 129940 [2019-12-18 22:34:01,473 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 22:34:04,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129940 states. [2019-12-18 22:34:07,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129940 to 116665. [2019-12-18 22:34:07,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116665 states. [2019-12-18 22:34:07,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116665 states to 116665 states and 485676 transitions. [2019-12-18 22:34:07,748 INFO L78 Accepts]: Start accepts. Automaton has 116665 states and 485676 transitions. Word has length 13 [2019-12-18 22:34:12,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:34:12,080 INFO L462 AbstractCegarLoop]: Abstraction has 116665 states and 485676 transitions. [2019-12-18 22:34:12,080 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 22:34:12,080 INFO L276 IsEmpty]: Start isEmpty. Operand 116665 states and 485676 transitions. [2019-12-18 22:34:12,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 22:34:12,083 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:34:12,083 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:34:12,083 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:34:12,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:34:12,084 INFO L82 PathProgramCache]: Analyzing trace with hash -1013715486, now seen corresponding path program 1 times [2019-12-18 22:34:12,084 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:34:12,084 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625709075] [2019-12-18 22:34:12,084 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:34:12,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:34:12,181 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 22:34:12,182 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625709075] [2019-12-18 22:34:12,182 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:34:12,182 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 22:34:12,182 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106599121] [2019-12-18 22:34:12,183 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 22:34:12,183 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:34:12,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 22:34:12,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 22:34:12,184 INFO L87 Difference]: Start difference. First operand 116665 states and 485676 transitions. Second operand 4 states. [2019-12-18 22:34:13,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:34:13,248 INFO L93 Difference]: Finished difference Result 161841 states and 657746 transitions. [2019-12-18 22:34:13,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 22:34:13,249 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-18 22:34:13,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:34:14,464 INFO L225 Difference]: With dead ends: 161841 [2019-12-18 22:34:14,464 INFO L226 Difference]: Without dead ends: 161729 [2019-12-18 22:34:14,465 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 22:34:18,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161729 states. [2019-12-18 22:34:22,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161729 to 135524. [2019-12-18 22:34:22,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135524 states. [2019-12-18 22:34:22,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135524 states to 135524 states and 561455 transitions. [2019-12-18 22:34:22,624 INFO L78 Accepts]: Start accepts. Automaton has 135524 states and 561455 transitions. Word has length 13 [2019-12-18 22:34:22,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:34:22,624 INFO L462 AbstractCegarLoop]: Abstraction has 135524 states and 561455 transitions. [2019-12-18 22:34:22,624 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 22:34:22,624 INFO L276 IsEmpty]: Start isEmpty. Operand 135524 states and 561455 transitions. [2019-12-18 22:34:22,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 22:34:22,627 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:34:22,628 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:34:22,628 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:34:22,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:34:22,628 INFO L82 PathProgramCache]: Analyzing trace with hash -19781077, now seen corresponding path program 1 times [2019-12-18 22:34:22,628 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:34:22,629 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146699302] [2019-12-18 22:34:22,629 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:34:22,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:34:22,723 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 22:34:22,723 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146699302] [2019-12-18 22:34:22,723 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:34:22,724 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 22:34:22,724 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040017607] [2019-12-18 22:34:22,724 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 22:34:22,725 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:34:22,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 22:34:22,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:34:22,725 INFO L87 Difference]: Start difference. First operand 135524 states and 561455 transitions. Second operand 3 states. [2019-12-18 22:34:24,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:34:24,865 INFO L93 Difference]: Finished difference Result 181948 states and 742402 transitions. [2019-12-18 22:34:24,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 22:34:24,866 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-12-18 22:34:24,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:34:25,401 INFO L225 Difference]: With dead ends: 181948 [2019-12-18 22:34:25,402 INFO L226 Difference]: Without dead ends: 181948 [2019-12-18 22:34:25,402 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 22:34:30,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181948 states. [2019-12-18 22:34:38,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181948 to 149024. [2019-12-18 22:34:38,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149024 states. [2019-12-18 22:34:38,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149024 states to 149024 states and 615188 transitions. [2019-12-18 22:34:38,731 INFO L78 Accepts]: Start accepts. Automaton has 149024 states and 615188 transitions. Word has length 14 [2019-12-18 22:34:38,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:34:38,731 INFO L462 AbstractCegarLoop]: Abstraction has 149024 states and 615188 transitions. [2019-12-18 22:34:39,691 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 22:34:39,692 INFO L276 IsEmpty]: Start isEmpty. Operand 149024 states and 615188 transitions. [2019-12-18 22:34:39,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 22:34:39,695 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:34:39,695 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:34:39,695 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:34:39,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:34:39,695 INFO L82 PathProgramCache]: Analyzing trace with hash -19914749, now seen corresponding path program 1 times [2019-12-18 22:34:39,695 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:34:39,696 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747976153] [2019-12-18 22:34:39,696 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:34:39,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:34:39,761 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 22:34:39,762 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747976153] [2019-12-18 22:34:39,762 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:34:39,762 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 22:34:39,762 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229319495] [2019-12-18 22:34:39,763 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 22:34:39,763 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:34:39,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 22:34:39,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 22:34:39,764 INFO L87 Difference]: Start difference. First operand 149024 states and 615188 transitions. Second operand 4 states. [2019-12-18 22:34:40,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:34:40,836 INFO L93 Difference]: Finished difference Result 176806 states and 719392 transitions. [2019-12-18 22:34:40,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 22:34:40,837 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-18 22:34:40,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:34:41,362 INFO L225 Difference]: With dead ends: 176806 [2019-12-18 22:34:41,362 INFO L226 Difference]: Without dead ends: 176726 [2019-12-18 22:34:41,362 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 22:34:51,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176726 states. [2019-12-18 22:34:54,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176726 to 154481. [2019-12-18 22:34:54,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154481 states. [2019-12-18 22:34:54,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154481 states to 154481 states and 636822 transitions. [2019-12-18 22:34:54,751 INFO L78 Accepts]: Start accepts. Automaton has 154481 states and 636822 transitions. Word has length 14 [2019-12-18 22:34:54,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:34:54,751 INFO L462 AbstractCegarLoop]: Abstraction has 154481 states and 636822 transitions. [2019-12-18 22:34:54,751 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 22:34:54,751 INFO L276 IsEmpty]: Start isEmpty. Operand 154481 states and 636822 transitions. [2019-12-18 22:34:54,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 22:34:54,755 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:34:54,755 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:34:54,756 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:34:54,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:34:54,756 INFO L82 PathProgramCache]: Analyzing trace with hash 140256175, now seen corresponding path program 1 times [2019-12-18 22:34:54,756 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:34:54,757 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263137738] [2019-12-18 22:34:54,757 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:34:54,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:34:54,883 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 22:34:54,883 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263137738] [2019-12-18 22:34:54,884 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:34:54,884 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 22:34:54,884 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130874887] [2019-12-18 22:34:54,884 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 22:34:54,885 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:34:54,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 22:34:54,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 22:34:54,885 INFO L87 Difference]: Start difference. First operand 154481 states and 636822 transitions. Second operand 4 states. [2019-12-18 22:35:01,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:35:01,164 INFO L93 Difference]: Finished difference Result 181899 states and 742115 transitions. [2019-12-18 22:35:01,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 22:35:01,165 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-18 22:35:01,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:35:01,786 INFO L225 Difference]: With dead ends: 181899 [2019-12-18 22:35:01,786 INFO L226 Difference]: Without dead ends: 181811 [2019-12-18 22:35:01,787 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 22:35:05,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181811 states. [2019-12-18 22:35:08,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181811 to 156231. [2019-12-18 22:35:08,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156231 states. [2019-12-18 22:35:09,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156231 states to 156231 states and 644534 transitions. [2019-12-18 22:35:09,831 INFO L78 Accepts]: Start accepts. Automaton has 156231 states and 644534 transitions. Word has length 14 [2019-12-18 22:35:09,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:35:09,832 INFO L462 AbstractCegarLoop]: Abstraction has 156231 states and 644534 transitions. [2019-12-18 22:35:09,832 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 22:35:09,832 INFO L276 IsEmpty]: Start isEmpty. Operand 156231 states and 644534 transitions. [2019-12-18 22:35:09,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-18 22:35:09,854 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:35:09,854 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:35:09,854 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:35:09,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:35:09,854 INFO L82 PathProgramCache]: Analyzing trace with hash -757674417, now seen corresponding path program 1 times [2019-12-18 22:35:09,855 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:35:09,855 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348408512] [2019-12-18 22:35:09,855 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:35:09,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:35:09,925 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 22:35:09,925 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348408512] [2019-12-18 22:35:09,926 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:35:09,926 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 22:35:09,926 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846573367] [2019-12-18 22:35:09,926 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 22:35:09,927 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:35:09,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 22:35:09,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:35:09,927 INFO L87 Difference]: Start difference. First operand 156231 states and 644534 transitions. Second operand 3 states. [2019-12-18 22:35:10,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:35:10,707 INFO L93 Difference]: Finished difference Result 155313 states and 640741 transitions. [2019-12-18 22:35:10,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 22:35:10,707 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-18 22:35:10,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:35:11,179 INFO L225 Difference]: With dead ends: 155313 [2019-12-18 22:35:11,179 INFO L226 Difference]: Without dead ends: 155313 [2019-12-18 22:35:11,179 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 22:35:20,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155313 states. [2019-12-18 22:35:22,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155313 to 155313. [2019-12-18 22:35:22,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155313 states. [2019-12-18 22:35:24,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155313 states to 155313 states and 640741 transitions. [2019-12-18 22:35:24,051 INFO L78 Accepts]: Start accepts. Automaton has 155313 states and 640741 transitions. Word has length 18 [2019-12-18 22:35:24,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:35:24,051 INFO L462 AbstractCegarLoop]: Abstraction has 155313 states and 640741 transitions. [2019-12-18 22:35:24,051 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 22:35:24,052 INFO L276 IsEmpty]: Start isEmpty. Operand 155313 states and 640741 transitions. [2019-12-18 22:35:24,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-18 22:35:24,073 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:35:24,073 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:35:24,073 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:35:24,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:35:24,073 INFO L82 PathProgramCache]: Analyzing trace with hash -562123947, now seen corresponding path program 1 times [2019-12-18 22:35:24,074 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:35:24,074 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617315395] [2019-12-18 22:35:24,074 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:35:24,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:35:24,131 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 22:35:24,132 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617315395] [2019-12-18 22:35:24,132 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:35:24,132 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 22:35:24,132 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662249036] [2019-12-18 22:35:24,133 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 22:35:24,133 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:35:24,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 22:35:24,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 22:35:24,133 INFO L87 Difference]: Start difference. First operand 155313 states and 640741 transitions. Second operand 4 states. [2019-12-18 22:35:31,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:35:31,008 INFO L93 Difference]: Finished difference Result 243262 states and 1008109 transitions. [2019-12-18 22:35:31,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 22:35:31,008 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-12-18 22:35:31,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:35:31,384 INFO L225 Difference]: With dead ends: 243262 [2019-12-18 22:35:31,384 INFO L226 Difference]: Without dead ends: 120708 [2019-12-18 22:35:31,384 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 22:35:34,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120708 states. [2019-12-18 22:35:36,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120708 to 120708. [2019-12-18 22:35:36,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120708 states. [2019-12-18 22:35:37,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120708 states to 120708 states and 492233 transitions. [2019-12-18 22:35:37,729 INFO L78 Accepts]: Start accepts. Automaton has 120708 states and 492233 transitions. Word has length 19 [2019-12-18 22:35:37,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:35:37,729 INFO L462 AbstractCegarLoop]: Abstraction has 120708 states and 492233 transitions. [2019-12-18 22:35:37,729 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 22:35:37,729 INFO L276 IsEmpty]: Start isEmpty. Operand 120708 states and 492233 transitions. [2019-12-18 22:35:37,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-18 22:35:37,744 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:35:37,744 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:35:37,744 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:35:37,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:35:37,744 INFO L82 PathProgramCache]: Analyzing trace with hash -1224805741, now seen corresponding path program 1 times [2019-12-18 22:35:37,745 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:35:37,745 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295182915] [2019-12-18 22:35:37,745 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:35:37,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:35:37,822 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 22:35:37,823 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295182915] [2019-12-18 22:35:37,823 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:35:37,823 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 22:35:37,824 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070725519] [2019-12-18 22:35:37,824 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 22:35:37,824 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:35:37,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 22:35:37,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 22:35:37,825 INFO L87 Difference]: Start difference. First operand 120708 states and 492233 transitions. Second operand 5 states. [2019-12-18 22:35:38,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:35:38,975 INFO L93 Difference]: Finished difference Result 160250 states and 638617 transitions. [2019-12-18 22:35:38,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-18 22:35:38,976 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-12-18 22:35:38,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:35:40,854 INFO L225 Difference]: With dead ends: 160250 [2019-12-18 22:35:40,854 INFO L226 Difference]: Without dead ends: 158095 [2019-12-18 22:35:40,854 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-18 22:35:45,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158095 states. [2019-12-18 22:35:52,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158095 to 124062. [2019-12-18 22:35:52,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124062 states. [2019-12-18 22:35:53,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124062 states to 124062 states and 506459 transitions. [2019-12-18 22:35:53,433 INFO L78 Accepts]: Start accepts. Automaton has 124062 states and 506459 transitions. Word has length 19 [2019-12-18 22:35:53,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:35:53,433 INFO L462 AbstractCegarLoop]: Abstraction has 124062 states and 506459 transitions. [2019-12-18 22:35:53,434 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 22:35:53,434 INFO L276 IsEmpty]: Start isEmpty. Operand 124062 states and 506459 transitions. [2019-12-18 22:35:53,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-18 22:35:53,454 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:35:53,454 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:35:53,454 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:35:53,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:35:53,454 INFO L82 PathProgramCache]: Analyzing trace with hash 1903443732, now seen corresponding path program 1 times [2019-12-18 22:35:53,454 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:35:53,455 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516756883] [2019-12-18 22:35:53,455 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:35:53,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:35:53,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:35:53,496 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516756883] [2019-12-18 22:35:53,496 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:35:53,496 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 22:35:53,497 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265964937] [2019-12-18 22:35:53,497 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 22:35:53,497 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:35:53,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 22:35:53,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:35:53,498 INFO L87 Difference]: Start difference. First operand 124062 states and 506459 transitions. Second operand 3 states. [2019-12-18 22:35:55,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:35:55,592 INFO L93 Difference]: Finished difference Result 211901 states and 867827 transitions. [2019-12-18 22:35:55,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 22:35:55,592 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-12-18 22:35:55,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:35:55,912 INFO L225 Difference]: With dead ends: 211901 [2019-12-18 22:35:55,912 INFO L226 Difference]: Without dead ends: 108903 [2019-12-18 22:35:55,913 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 22:36:04,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108903 states. [2019-12-18 22:36:05,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108903 to 100216. [2019-12-18 22:36:05,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100216 states. [2019-12-18 22:36:05,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100216 states to 100216 states and 410838 transitions. [2019-12-18 22:36:05,967 INFO L78 Accepts]: Start accepts. Automaton has 100216 states and 410838 transitions. Word has length 20 [2019-12-18 22:36:05,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:36:05,968 INFO L462 AbstractCegarLoop]: Abstraction has 100216 states and 410838 transitions. [2019-12-18 22:36:05,968 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 22:36:05,968 INFO L276 IsEmpty]: Start isEmpty. Operand 100216 states and 410838 transitions. [2019-12-18 22:36:05,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 22:36:05,985 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:36:05,985 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:36:05,985 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:36:05,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:36:05,985 INFO L82 PathProgramCache]: Analyzing trace with hash 1337451788, now seen corresponding path program 1 times [2019-12-18 22:36:05,985 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:36:05,986 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863020800] [2019-12-18 22:36:05,986 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:36:05,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:36:06,054 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 22:36:06,055 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863020800] [2019-12-18 22:36:06,055 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:36:06,055 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 22:36:06,055 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206498481] [2019-12-18 22:36:06,056 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 22:36:06,056 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:36:06,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 22:36:06,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 22:36:06,056 INFO L87 Difference]: Start difference. First operand 100216 states and 410838 transitions. Second operand 4 states. [2019-12-18 22:36:06,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:36:06,235 INFO L93 Difference]: Finished difference Result 25112 states and 86930 transitions. [2019-12-18 22:36:06,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 22:36:06,236 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2019-12-18 22:36:06,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:36:06,285 INFO L225 Difference]: With dead ends: 25112 [2019-12-18 22:36:06,286 INFO L226 Difference]: Without dead ends: 20261 [2019-12-18 22:36:06,286 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 22:36:07,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20261 states. [2019-12-18 22:36:07,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20261 to 20261. [2019-12-18 22:36:07,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20261 states. [2019-12-18 22:36:07,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20261 states to 20261 states and 67415 transitions. [2019-12-18 22:36:07,444 INFO L78 Accepts]: Start accepts. Automaton has 20261 states and 67415 transitions. Word has length 21 [2019-12-18 22:36:07,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:36:07,444 INFO L462 AbstractCegarLoop]: Abstraction has 20261 states and 67415 transitions. [2019-12-18 22:36:07,444 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 22:36:07,444 INFO L276 IsEmpty]: Start isEmpty. Operand 20261 states and 67415 transitions. [2019-12-18 22:36:07,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 22:36:07,447 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:36:07,447 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 22:36:07,448 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:36:07,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:36:07,448 INFO L82 PathProgramCache]: Analyzing trace with hash -108369065, now seen corresponding path program 1 times [2019-12-18 22:36:07,448 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:36:07,448 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764519966] [2019-12-18 22:36:07,449 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:36:07,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:36:07,526 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 22:36:07,526 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764519966] [2019-12-18 22:36:07,526 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:36:07,527 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 22:36:07,527 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302264599] [2019-12-18 22:36:07,527 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 22:36:07,527 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:36:07,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 22:36:07,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 22:36:07,528 INFO L87 Difference]: Start difference. First operand 20261 states and 67415 transitions. Second operand 5 states. [2019-12-18 22:36:07,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:36:07,830 INFO L93 Difference]: Finished difference Result 20962 states and 68953 transitions. [2019-12-18 22:36:07,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-18 22:36:07,831 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-18 22:36:07,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:36:07,864 INFO L225 Difference]: With dead ends: 20962 [2019-12-18 22:36:07,864 INFO L226 Difference]: Without dead ends: 20643 [2019-12-18 22:36:07,865 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-18 22:36:07,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20643 states. [2019-12-18 22:36:08,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20643 to 20188. [2019-12-18 22:36:08,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20188 states. [2019-12-18 22:36:08,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20188 states to 20188 states and 67139 transitions. [2019-12-18 22:36:08,214 INFO L78 Accepts]: Start accepts. Automaton has 20188 states and 67139 transitions. Word has length 22 [2019-12-18 22:36:08,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:36:08,215 INFO L462 AbstractCegarLoop]: Abstraction has 20188 states and 67139 transitions. [2019-12-18 22:36:08,215 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 22:36:08,215 INFO L276 IsEmpty]: Start isEmpty. Operand 20188 states and 67139 transitions. [2019-12-18 22:36:08,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 22:36:08,219 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:36:08,219 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 22:36:08,219 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:36:08,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:36:08,220 INFO L82 PathProgramCache]: Analyzing trace with hash 576586499, now seen corresponding path program 1 times [2019-12-18 22:36:08,220 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:36:08,220 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242908528] [2019-12-18 22:36:08,220 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:36:08,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:36:08,287 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 22:36:08,287 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242908528] [2019-12-18 22:36:08,288 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:36:08,288 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 22:36:08,288 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478233838] [2019-12-18 22:36:08,288 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 22:36:08,289 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:36:08,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 22:36:08,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 22:36:08,289 INFO L87 Difference]: Start difference. First operand 20188 states and 67139 transitions. Second operand 5 states. [2019-12-18 22:36:08,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:36:08,593 INFO L93 Difference]: Finished difference Result 20141 states and 66503 transitions. [2019-12-18 22:36:08,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-18 22:36:08,593 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-18 22:36:08,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:36:08,626 INFO L225 Difference]: With dead ends: 20141 [2019-12-18 22:36:08,626 INFO L226 Difference]: Without dead ends: 19723 [2019-12-18 22:36:08,627 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-18 22:36:08,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19723 states. [2019-12-18 22:36:09,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19723 to 19122. [2019-12-18 22:36:09,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19122 states. [2019-12-18 22:36:09,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19122 states to 19122 states and 64070 transitions. [2019-12-18 22:36:09,610 INFO L78 Accepts]: Start accepts. Automaton has 19122 states and 64070 transitions. Word has length 22 [2019-12-18 22:36:09,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:36:09,610 INFO L462 AbstractCegarLoop]: Abstraction has 19122 states and 64070 transitions. [2019-12-18 22:36:09,610 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 22:36:09,610 INFO L276 IsEmpty]: Start isEmpty. Operand 19122 states and 64070 transitions. [2019-12-18 22:36:09,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-18 22:36:09,617 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:36:09,617 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:36:09,618 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:36:09,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:36:09,618 INFO L82 PathProgramCache]: Analyzing trace with hash 40947621, now seen corresponding path program 1 times [2019-12-18 22:36:09,618 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:36:09,619 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071119114] [2019-12-18 22:36:09,619 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:36:09,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:36:09,689 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 22:36:09,691 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071119114] [2019-12-18 22:36:09,691 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:36:09,691 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 22:36:09,691 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750745244] [2019-12-18 22:36:09,692 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 22:36:09,692 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:36:09,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 22:36:09,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 22:36:09,692 INFO L87 Difference]: Start difference. First operand 19122 states and 64070 transitions. Second operand 5 states. [2019-12-18 22:36:09,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:36:09,788 INFO L93 Difference]: Finished difference Result 7284 states and 22451 transitions. [2019-12-18 22:36:09,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 22:36:09,789 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-18 22:36:09,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:36:09,804 INFO L225 Difference]: With dead ends: 7284 [2019-12-18 22:36:09,805 INFO L226 Difference]: Without dead ends: 6220 [2019-12-18 22:36:09,806 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 22:36:09,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6220 states. [2019-12-18 22:36:09,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6220 to 6220. [2019-12-18 22:36:09,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6220 states. [2019-12-18 22:36:09,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6220 states to 6220 states and 18995 transitions. [2019-12-18 22:36:09,981 INFO L78 Accepts]: Start accepts. Automaton has 6220 states and 18995 transitions. Word has length 28 [2019-12-18 22:36:09,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:36:09,981 INFO L462 AbstractCegarLoop]: Abstraction has 6220 states and 18995 transitions. [2019-12-18 22:36:09,981 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 22:36:09,981 INFO L276 IsEmpty]: Start isEmpty. Operand 6220 states and 18995 transitions. [2019-12-18 22:36:09,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 22:36:09,994 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:36:09,995 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:36:09,995 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:36:09,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:36:09,996 INFO L82 PathProgramCache]: Analyzing trace with hash -2009375071, now seen corresponding path program 1 times [2019-12-18 22:36:09,996 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:36:09,996 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447232979] [2019-12-18 22:36:09,996 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:36:10,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:36:10,102 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 22:36:10,102 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447232979] [2019-12-18 22:36:10,105 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:36:10,105 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 22:36:10,106 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354954897] [2019-12-18 22:36:10,106 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 22:36:10,106 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:36:10,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 22:36:10,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-18 22:36:10,108 INFO L87 Difference]: Start difference. First operand 6220 states and 18995 transitions. Second operand 6 states. [2019-12-18 22:36:10,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:36:10,207 INFO L93 Difference]: Finished difference Result 5287 states and 16625 transitions. [2019-12-18 22:36:10,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 22:36:10,207 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2019-12-18 22:36:10,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:36:10,218 INFO L225 Difference]: With dead ends: 5287 [2019-12-18 22:36:10,218 INFO L226 Difference]: Without dead ends: 4788 [2019-12-18 22:36:10,220 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-18 22:36:10,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4788 states. [2019-12-18 22:36:10,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4788 to 4788. [2019-12-18 22:36:10,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4788 states. [2019-12-18 22:36:10,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4788 states to 4788 states and 15565 transitions. [2019-12-18 22:36:10,329 INFO L78 Accepts]: Start accepts. Automaton has 4788 states and 15565 transitions. Word has length 40 [2019-12-18 22:36:10,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:36:10,329 INFO L462 AbstractCegarLoop]: Abstraction has 4788 states and 15565 transitions. [2019-12-18 22:36:10,329 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 22:36:10,329 INFO L276 IsEmpty]: Start isEmpty. Operand 4788 states and 15565 transitions. [2019-12-18 22:36:10,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 22:36:10,336 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:36:10,336 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:36:10,336 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:36:10,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:36:10,337 INFO L82 PathProgramCache]: Analyzing trace with hash -26633300, now seen corresponding path program 1 times [2019-12-18 22:36:10,337 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:36:10,337 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614883178] [2019-12-18 22:36:10,337 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:36:10,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:36:10,427 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 22:36:10,427 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614883178] [2019-12-18 22:36:10,428 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:36:10,430 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 22:36:10,431 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904346599] [2019-12-18 22:36:10,431 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 22:36:10,431 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:36:10,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 22:36:10,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 22:36:10,432 INFO L87 Difference]: Start difference. First operand 4788 states and 15565 transitions. Second operand 7 states. [2019-12-18 22:36:10,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:36:10,717 INFO L93 Difference]: Finished difference Result 9084 states and 28982 transitions. [2019-12-18 22:36:10,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 22:36:10,718 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-12-18 22:36:10,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:36:10,736 INFO L225 Difference]: With dead ends: 9084 [2019-12-18 22:36:10,736 INFO L226 Difference]: Without dead ends: 6576 [2019-12-18 22:36:10,737 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 22:36:10,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6576 states. [2019-12-18 22:36:10,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6576 to 5930. [2019-12-18 22:36:10,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5930 states. [2019-12-18 22:36:10,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5930 states to 5930 states and 19209 transitions. [2019-12-18 22:36:10,934 INFO L78 Accepts]: Start accepts. Automaton has 5930 states and 19209 transitions. Word has length 54 [2019-12-18 22:36:10,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:36:10,934 INFO L462 AbstractCegarLoop]: Abstraction has 5930 states and 19209 transitions. [2019-12-18 22:36:10,934 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 22:36:10,934 INFO L276 IsEmpty]: Start isEmpty. Operand 5930 states and 19209 transitions. [2019-12-18 22:36:10,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 22:36:10,957 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:36:10,957 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:36:10,957 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:36:10,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:36:10,958 INFO L82 PathProgramCache]: Analyzing trace with hash 219895980, now seen corresponding path program 2 times [2019-12-18 22:36:10,958 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:36:10,959 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764043029] [2019-12-18 22:36:10,959 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:36:10,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:36:11,085 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 22:36:11,086 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764043029] [2019-12-18 22:36:11,086 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:36:11,086 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 22:36:11,087 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973394651] [2019-12-18 22:36:11,088 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 22:36:11,088 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:36:11,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 22:36:11,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 22:36:11,089 INFO L87 Difference]: Start difference. First operand 5930 states and 19209 transitions. Second operand 7 states. [2019-12-18 22:36:11,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:36:11,375 INFO L93 Difference]: Finished difference Result 11036 states and 34911 transitions. [2019-12-18 22:36:11,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 22:36:11,375 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-12-18 22:36:11,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:36:11,391 INFO L225 Difference]: With dead ends: 11036 [2019-12-18 22:36:11,392 INFO L226 Difference]: Without dead ends: 8066 [2019-12-18 22:36:11,392 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 22:36:11,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8066 states. [2019-12-18 22:36:11,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8066 to 7238. [2019-12-18 22:36:11,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7238 states. [2019-12-18 22:36:11,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7238 states to 7238 states and 23230 transitions. [2019-12-18 22:36:11,573 INFO L78 Accepts]: Start accepts. Automaton has 7238 states and 23230 transitions. Word has length 54 [2019-12-18 22:36:11,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:36:11,574 INFO L462 AbstractCegarLoop]: Abstraction has 7238 states and 23230 transitions. [2019-12-18 22:36:11,574 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 22:36:11,575 INFO L276 IsEmpty]: Start isEmpty. Operand 7238 states and 23230 transitions. [2019-12-18 22:36:11,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 22:36:11,586 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:36:11,587 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:36:11,587 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:36:11,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:36:11,587 INFO L82 PathProgramCache]: Analyzing trace with hash 625959458, now seen corresponding path program 3 times [2019-12-18 22:36:11,587 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:36:11,588 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26033850] [2019-12-18 22:36:11,588 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:36:11,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:36:11,683 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 22:36:11,684 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26033850] [2019-12-18 22:36:11,684 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:36:11,684 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 22:36:11,684 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091437791] [2019-12-18 22:36:11,688 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 22:36:11,688 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:36:11,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 22:36:11,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-18 22:36:11,689 INFO L87 Difference]: Start difference. First operand 7238 states and 23230 transitions. Second operand 8 states. [2019-12-18 22:36:12,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:36:12,481 INFO L93 Difference]: Finished difference Result 15765 states and 48235 transitions. [2019-12-18 22:36:12,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-18 22:36:12,482 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 54 [2019-12-18 22:36:12,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:36:12,501 INFO L225 Difference]: With dead ends: 15765 [2019-12-18 22:36:12,502 INFO L226 Difference]: Without dead ends: 13391 [2019-12-18 22:36:12,502 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=119, Invalid=343, Unknown=0, NotChecked=0, Total=462 [2019-12-18 22:36:12,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13391 states. [2019-12-18 22:36:12,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13391 to 7278. [2019-12-18 22:36:12,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7278 states. [2019-12-18 22:36:12,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7278 states to 7278 states and 23316 transitions. [2019-12-18 22:36:12,656 INFO L78 Accepts]: Start accepts. Automaton has 7278 states and 23316 transitions. Word has length 54 [2019-12-18 22:36:12,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:36:12,656 INFO L462 AbstractCegarLoop]: Abstraction has 7278 states and 23316 transitions. [2019-12-18 22:36:12,656 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 22:36:12,656 INFO L276 IsEmpty]: Start isEmpty. Operand 7278 states and 23316 transitions. [2019-12-18 22:36:12,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 22:36:12,665 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:36:12,665 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:36:12,665 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:36:12,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:36:12,665 INFO L82 PathProgramCache]: Analyzing trace with hash -1940623004, now seen corresponding path program 4 times [2019-12-18 22:36:12,665 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:36:12,666 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082276292] [2019-12-18 22:36:12,666 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:36:12,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:36:12,841 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 22:36:12,841 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082276292] [2019-12-18 22:36:12,841 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:36:12,841 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 22:36:12,842 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698032323] [2019-12-18 22:36:12,842 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 22:36:12,842 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:36:12,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 22:36:12,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 22:36:12,843 INFO L87 Difference]: Start difference. First operand 7278 states and 23316 transitions. Second operand 9 states. [2019-12-18 22:36:13,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:36:13,890 INFO L93 Difference]: Finished difference Result 21985 states and 67252 transitions. [2019-12-18 22:36:13,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-18 22:36:13,890 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 54 [2019-12-18 22:36:13,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:36:13,917 INFO L225 Difference]: With dead ends: 21985 [2019-12-18 22:36:13,917 INFO L226 Difference]: Without dead ends: 19611 [2019-12-18 22:36:13,918 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=241, Invalid=751, Unknown=0, NotChecked=0, Total=992 [2019-12-18 22:36:13,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19611 states. [2019-12-18 22:36:14,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19611 to 7158. [2019-12-18 22:36:14,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7158 states. [2019-12-18 22:36:14,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7158 states to 7158 states and 22938 transitions. [2019-12-18 22:36:14,107 INFO L78 Accepts]: Start accepts. Automaton has 7158 states and 22938 transitions. Word has length 54 [2019-12-18 22:36:14,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:36:14,107 INFO L462 AbstractCegarLoop]: Abstraction has 7158 states and 22938 transitions. [2019-12-18 22:36:14,107 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 22:36:14,107 INFO L276 IsEmpty]: Start isEmpty. Operand 7158 states and 22938 transitions. [2019-12-18 22:36:14,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 22:36:14,115 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:36:14,115 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:36:14,115 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:36:14,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:36:14,116 INFO L82 PathProgramCache]: Analyzing trace with hash 1600716830, now seen corresponding path program 5 times [2019-12-18 22:36:14,116 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:36:14,116 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327498638] [2019-12-18 22:36:14,116 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:36:14,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:36:14,233 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 22:36:14,234 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327498638] [2019-12-18 22:36:14,234 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:36:14,234 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 22:36:14,234 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201419148] [2019-12-18 22:36:14,235 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 22:36:14,235 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:36:14,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 22:36:14,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 22:36:14,236 INFO L87 Difference]: Start difference. First operand 7158 states and 22938 transitions. Second operand 9 states. [2019-12-18 22:36:15,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:36:15,536 INFO L93 Difference]: Finished difference Result 29906 states and 91401 transitions. [2019-12-18 22:36:15,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-12-18 22:36:15,537 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 54 [2019-12-18 22:36:15,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:36:15,589 INFO L225 Difference]: With dead ends: 29906 [2019-12-18 22:36:15,589 INFO L226 Difference]: Without dead ends: 23860 [2019-12-18 22:36:15,590 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 349 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=347, Invalid=985, Unknown=0, NotChecked=0, Total=1332 [2019-12-18 22:36:15,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23860 states. [2019-12-18 22:36:15,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23860 to 9222. [2019-12-18 22:36:15,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9222 states. [2019-12-18 22:36:15,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9222 states to 9222 states and 29627 transitions. [2019-12-18 22:36:15,837 INFO L78 Accepts]: Start accepts. Automaton has 9222 states and 29627 transitions. Word has length 54 [2019-12-18 22:36:15,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:36:15,837 INFO L462 AbstractCegarLoop]: Abstraction has 9222 states and 29627 transitions. [2019-12-18 22:36:15,837 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 22:36:15,838 INFO L276 IsEmpty]: Start isEmpty. Operand 9222 states and 29627 transitions. [2019-12-18 22:36:15,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 22:36:15,848 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:36:15,848 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:36:15,848 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:36:15,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:36:15,848 INFO L82 PathProgramCache]: Analyzing trace with hash 644386982, now seen corresponding path program 6 times [2019-12-18 22:36:15,848 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:36:15,849 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020612495] [2019-12-18 22:36:15,849 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:36:15,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:36:15,939 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 22:36:15,940 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020612495] [2019-12-18 22:36:15,940 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:36:15,940 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 22:36:15,940 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381201747] [2019-12-18 22:36:15,940 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 22:36:15,941 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:36:15,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 22:36:15,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 22:36:15,941 INFO L87 Difference]: Start difference. First operand 9222 states and 29627 transitions. Second operand 7 states. [2019-12-18 22:36:16,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:36:16,782 INFO L93 Difference]: Finished difference Result 20541 states and 63453 transitions. [2019-12-18 22:36:16,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 22:36:16,783 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-12-18 22:36:16,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:36:16,812 INFO L225 Difference]: With dead ends: 20541 [2019-12-18 22:36:16,812 INFO L226 Difference]: Without dead ends: 20457 [2019-12-18 22:36:16,813 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-12-18 22:36:16,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20457 states. [2019-12-18 22:36:17,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20457 to 13774. [2019-12-18 22:36:17,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13774 states. [2019-12-18 22:36:17,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13774 states to 13774 states and 42784 transitions. [2019-12-18 22:36:17,054 INFO L78 Accepts]: Start accepts. Automaton has 13774 states and 42784 transitions. Word has length 54 [2019-12-18 22:36:17,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:36:17,054 INFO L462 AbstractCegarLoop]: Abstraction has 13774 states and 42784 transitions. [2019-12-18 22:36:17,054 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 22:36:17,055 INFO L276 IsEmpty]: Start isEmpty. Operand 13774 states and 42784 transitions. [2019-12-18 22:36:17,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 22:36:17,074 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:36:17,074 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:36:17,074 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:36:17,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:36:17,074 INFO L82 PathProgramCache]: Analyzing trace with hash 1158703824, now seen corresponding path program 7 times [2019-12-18 22:36:17,075 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:36:17,075 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847719555] [2019-12-18 22:36:17,075 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:36:17,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:36:17,168 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 22:36:17,169 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847719555] [2019-12-18 22:36:17,169 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:36:17,169 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 22:36:17,169 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864325519] [2019-12-18 22:36:17,170 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 22:36:17,170 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:36:17,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 22:36:17,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 22:36:17,170 INFO L87 Difference]: Start difference. First operand 13774 states and 42784 transitions. Second operand 6 states. [2019-12-18 22:36:17,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:36:17,770 INFO L93 Difference]: Finished difference Result 21447 states and 65099 transitions. [2019-12-18 22:36:17,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-18 22:36:17,771 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2019-12-18 22:36:17,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:36:17,800 INFO L225 Difference]: With dead ends: 21447 [2019-12-18 22:36:17,801 INFO L226 Difference]: Without dead ends: 21337 [2019-12-18 22:36:17,801 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-18 22:36:17,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21337 states. [2019-12-18 22:36:18,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21337 to 17792. [2019-12-18 22:36:18,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17792 states. [2019-12-18 22:36:18,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17792 states to 17792 states and 55019 transitions. [2019-12-18 22:36:18,074 INFO L78 Accepts]: Start accepts. Automaton has 17792 states and 55019 transitions. Word has length 54 [2019-12-18 22:36:18,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:36:18,075 INFO L462 AbstractCegarLoop]: Abstraction has 17792 states and 55019 transitions. [2019-12-18 22:36:18,075 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 22:36:18,075 INFO L276 IsEmpty]: Start isEmpty. Operand 17792 states and 55019 transitions. [2019-12-18 22:36:18,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 22:36:18,101 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:36:18,101 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:36:18,101 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:36:18,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:36:18,102 INFO L82 PathProgramCache]: Analyzing trace with hash 1984492944, now seen corresponding path program 8 times [2019-12-18 22:36:18,102 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:36:18,102 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750804149] [2019-12-18 22:36:18,102 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:36:18,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:36:18,165 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 22:36:18,166 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750804149] [2019-12-18 22:36:18,166 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:36:18,167 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 22:36:18,167 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691303230] [2019-12-18 22:36:18,167 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 22:36:18,167 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:36:18,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 22:36:18,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:36:18,169 INFO L87 Difference]: Start difference. First operand 17792 states and 55019 transitions. Second operand 3 states. [2019-12-18 22:36:18,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:36:18,243 INFO L93 Difference]: Finished difference Result 17790 states and 55014 transitions. [2019-12-18 22:36:18,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 22:36:18,244 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-12-18 22:36:18,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:36:18,276 INFO L225 Difference]: With dead ends: 17790 [2019-12-18 22:36:18,277 INFO L226 Difference]: Without dead ends: 17790 [2019-12-18 22:36:18,277 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 22:36:18,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17790 states. [2019-12-18 22:36:18,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17790 to 15448. [2019-12-18 22:36:18,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15448 states. [2019-12-18 22:36:18,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15448 states to 15448 states and 48469 transitions. [2019-12-18 22:36:18,529 INFO L78 Accepts]: Start accepts. Automaton has 15448 states and 48469 transitions. Word has length 54 [2019-12-18 22:36:18,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:36:18,530 INFO L462 AbstractCegarLoop]: Abstraction has 15448 states and 48469 transitions. [2019-12-18 22:36:18,530 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 22:36:18,530 INFO L276 IsEmpty]: Start isEmpty. Operand 15448 states and 48469 transitions. [2019-12-18 22:36:18,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 22:36:18,547 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:36:18,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, 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 22:36:18,547 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:36:18,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:36:18,547 INFO L82 PathProgramCache]: Analyzing trace with hash 1045193736, now seen corresponding path program 1 times [2019-12-18 22:36:18,547 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:36:18,548 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662087269] [2019-12-18 22:36:18,548 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:36:18,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:36:18,608 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 22:36:18,608 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662087269] [2019-12-18 22:36:18,608 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:36:18,608 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 22:36:18,609 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987065993] [2019-12-18 22:36:18,609 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 22:36:18,609 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:36:18,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 22:36:18,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:36:18,610 INFO L87 Difference]: Start difference. First operand 15448 states and 48469 transitions. Second operand 3 states. [2019-12-18 22:36:18,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:36:18,665 INFO L93 Difference]: Finished difference Result 10874 states and 33734 transitions. [2019-12-18 22:36:18,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 22:36:18,665 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-18 22:36:18,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:36:18,685 INFO L225 Difference]: With dead ends: 10874 [2019-12-18 22:36:18,685 INFO L226 Difference]: Without dead ends: 10874 [2019-12-18 22:36:18,686 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 22:36:18,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10874 states. [2019-12-18 22:36:18,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10874 to 10632. [2019-12-18 22:36:18,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10632 states. [2019-12-18 22:36:18,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10632 states to 10632 states and 33043 transitions. [2019-12-18 22:36:18,998 INFO L78 Accepts]: Start accepts. Automaton has 10632 states and 33043 transitions. Word has length 55 [2019-12-18 22:36:18,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:36:18,998 INFO L462 AbstractCegarLoop]: Abstraction has 10632 states and 33043 transitions. [2019-12-18 22:36:18,998 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 22:36:18,998 INFO L276 IsEmpty]: Start isEmpty. Operand 10632 states and 33043 transitions. [2019-12-18 22:36:19,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 22:36:19,010 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:36:19,010 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:36:19,010 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:36:19,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:36:19,010 INFO L82 PathProgramCache]: Analyzing trace with hash -887839476, now seen corresponding path program 1 times [2019-12-18 22:36:19,010 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:36:19,010 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437190271] [2019-12-18 22:36:19,011 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:36:19,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:36:19,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 22:36:19,549 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437190271] [2019-12-18 22:36:19,550 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:36:19,550 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 22:36:19,551 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239361631] [2019-12-18 22:36:19,551 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-18 22:36:19,552 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:36:19,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-18 22:36:19,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2019-12-18 22:36:19,553 INFO L87 Difference]: Start difference. First operand 10632 states and 33043 transitions. Second operand 15 states. [2019-12-18 22:36:22,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:36:22,454 INFO L93 Difference]: Finished difference Result 15523 states and 47384 transitions. [2019-12-18 22:36:22,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-12-18 22:36:22,454 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 56 [2019-12-18 22:36:22,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:36:22,474 INFO L225 Difference]: With dead ends: 15523 [2019-12-18 22:36:22,474 INFO L226 Difference]: Without dead ends: 12813 [2019-12-18 22:36:22,475 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 0 SyntacticMatches, 4 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 671 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=426, Invalid=2124, Unknown=0, NotChecked=0, Total=2550 [2019-12-18 22:36:22,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12813 states. [2019-12-18 22:36:22,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12813 to 11054. [2019-12-18 22:36:22,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11054 states. [2019-12-18 22:36:22,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11054 states to 11054 states and 34153 transitions. [2019-12-18 22:36:22,646 INFO L78 Accepts]: Start accepts. Automaton has 11054 states and 34153 transitions. Word has length 56 [2019-12-18 22:36:22,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:36:22,646 INFO L462 AbstractCegarLoop]: Abstraction has 11054 states and 34153 transitions. [2019-12-18 22:36:22,647 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-18 22:36:22,647 INFO L276 IsEmpty]: Start isEmpty. Operand 11054 states and 34153 transitions. [2019-12-18 22:36:22,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 22:36:22,658 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:36:22,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] [2019-12-18 22:36:22,659 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:36:22,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:36:22,659 INFO L82 PathProgramCache]: Analyzing trace with hash -2011437082, now seen corresponding path program 2 times [2019-12-18 22:36:22,659 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:36:22,660 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005028390] [2019-12-18 22:36:22,660 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:36:22,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:36:22,831 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 22:36:22,831 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005028390] [2019-12-18 22:36:22,831 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:36:22,831 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 22:36:22,831 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486795606] [2019-12-18 22:36:22,832 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 22:36:22,832 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:36:22,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 22:36:22,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 22:36:22,833 INFO L87 Difference]: Start difference. First operand 11054 states and 34153 transitions. Second operand 11 states. [2019-12-18 22:36:23,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:36:23,556 INFO L93 Difference]: Finished difference Result 17293 states and 52589 transitions. [2019-12-18 22:36:23,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-18 22:36:23,556 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 56 [2019-12-18 22:36:23,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:36:23,575 INFO L225 Difference]: With dead ends: 17293 [2019-12-18 22:36:23,575 INFO L226 Difference]: Without dead ends: 11845 [2019-12-18 22:36:23,575 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=161, Invalid=651, Unknown=0, NotChecked=0, Total=812 [2019-12-18 22:36:23,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11845 states. [2019-12-18 22:36:23,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11845 to 10875. [2019-12-18 22:36:23,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10875 states. [2019-12-18 22:36:23,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10875 states to 10875 states and 33273 transitions. [2019-12-18 22:36:23,819 INFO L78 Accepts]: Start accepts. Automaton has 10875 states and 33273 transitions. Word has length 56 [2019-12-18 22:36:23,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:36:23,819 INFO L462 AbstractCegarLoop]: Abstraction has 10875 states and 33273 transitions. [2019-12-18 22:36:23,819 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 22:36:23,819 INFO L276 IsEmpty]: Start isEmpty. Operand 10875 states and 33273 transitions. [2019-12-18 22:36:23,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 22:36:23,830 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:36:23,830 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:36:23,830 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:36:23,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:36:23,831 INFO L82 PathProgramCache]: Analyzing trace with hash 1805028998, now seen corresponding path program 3 times [2019-12-18 22:36:23,831 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:36:23,831 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602248677] [2019-12-18 22:36:23,831 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:36:23,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:36:24,245 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 22:36:24,248 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602248677] [2019-12-18 22:36:24,248 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:36:24,248 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 22:36:24,248 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878297531] [2019-12-18 22:36:24,249 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-18 22:36:24,249 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:36:24,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-18 22:36:24,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2019-12-18 22:36:24,249 INFO L87 Difference]: Start difference. First operand 10875 states and 33273 transitions. Second operand 15 states. [2019-12-18 22:36:26,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:36:26,998 INFO L93 Difference]: Finished difference Result 12674 states and 38017 transitions. [2019-12-18 22:36:26,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-12-18 22:36:26,998 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 56 [2019-12-18 22:36:26,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:36:27,016 INFO L225 Difference]: With dead ends: 12674 [2019-12-18 22:36:27,017 INFO L226 Difference]: Without dead ends: 12376 [2019-12-18 22:36:27,017 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 669 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=420, Invalid=2130, Unknown=0, NotChecked=0, Total=2550 [2019-12-18 22:36:27,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12376 states. [2019-12-18 22:36:27,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12376 to 10887. [2019-12-18 22:36:27,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10887 states. [2019-12-18 22:36:27,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10887 states to 10887 states and 33301 transitions. [2019-12-18 22:36:27,179 INFO L78 Accepts]: Start accepts. Automaton has 10887 states and 33301 transitions. Word has length 56 [2019-12-18 22:36:27,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:36:27,179 INFO L462 AbstractCegarLoop]: Abstraction has 10887 states and 33301 transitions. [2019-12-18 22:36:27,179 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-18 22:36:27,179 INFO L276 IsEmpty]: Start isEmpty. Operand 10887 states and 33301 transitions. [2019-12-18 22:36:27,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 22:36:27,190 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:36:27,190 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:36:27,190 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:36:27,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:36:27,191 INFO L82 PathProgramCache]: Analyzing trace with hash 2127044956, now seen corresponding path program 4 times [2019-12-18 22:36:27,191 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:36:27,191 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321307170] [2019-12-18 22:36:27,191 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:36:27,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:36:27,293 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 22:36:27,293 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321307170] [2019-12-18 22:36:27,294 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:36:27,294 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 22:36:27,294 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341691628] [2019-12-18 22:36:27,294 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 22:36:27,294 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:36:27,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 22:36:27,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-18 22:36:27,295 INFO L87 Difference]: Start difference. First operand 10887 states and 33301 transitions. Second operand 9 states. [2019-12-18 22:36:27,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:36:27,939 INFO L93 Difference]: Finished difference Result 12212 states and 36568 transitions. [2019-12-18 22:36:27,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-18 22:36:27,939 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 56 [2019-12-18 22:36:27,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:36:27,956 INFO L225 Difference]: With dead ends: 12212 [2019-12-18 22:36:27,956 INFO L226 Difference]: Without dead ends: 11637 [2019-12-18 22:36:27,957 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2019-12-18 22:36:27,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11637 states. [2019-12-18 22:36:28,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11637 to 10557. [2019-12-18 22:36:28,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10557 states. [2019-12-18 22:36:28,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10557 states to 10557 states and 32409 transitions. [2019-12-18 22:36:28,183 INFO L78 Accepts]: Start accepts. Automaton has 10557 states and 32409 transitions. Word has length 56 [2019-12-18 22:36:28,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:36:28,183 INFO L462 AbstractCegarLoop]: Abstraction has 10557 states and 32409 transitions. [2019-12-18 22:36:28,183 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 22:36:28,183 INFO L276 IsEmpty]: Start isEmpty. Operand 10557 states and 32409 transitions. [2019-12-18 22:36:28,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 22:36:28,193 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:36:28,193 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:36:28,193 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:36:28,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:36:28,194 INFO L82 PathProgramCache]: Analyzing trace with hash 639764934, now seen corresponding path program 5 times [2019-12-18 22:36:28,194 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:36:28,194 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163493716] [2019-12-18 22:36:28,194 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:36:28,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 22:36:28,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 22:36:28,295 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 22:36:28,295 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 22:36:28,299 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [806] [806] ULTIMATE.startENTRY-->L818: Formula: (let ((.cse0 (store |v_#valid_58| 0 0))) (and (= v_~main$tmp_guard0~0_10 0) (= 0 v_~__unbuffered_p0_EAX~0_13) (= v_~x$r_buff1_thd1~0_42 0) (= 0 v_~x$r_buff0_thd2~0_26) (= 0 v_~x$w_buff1~0_26) (= 0 v_~x$r_buff0_thd0~0_22) (= v_~z~0_14 0) (< 0 |v_#StackHeapBarrier_16|) (= 0 v_~weak$$choice2~0_34) (< |v_#StackHeapBarrier_16| |v_ULTIMATE.start_main_~#t2079~0.base_22|) (= 0 v_~x$read_delayed_var~0.base_7) (= |v_#memory_int_23| (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2079~0.base_22| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2079~0.base_22|) |v_ULTIMATE.start_main_~#t2079~0.offset_18| 0))) (= v_~x$r_buff1_thd0~0_21 0) (= 0 |v_#NULL.base_4|) (= 0 v_~__unbuffered_cnt~0_19) (= 0 v_~weak$$choice0~0_7) (= 0 v_~__unbuffered_p2_EAX~0_13) (= v_~x$mem_tmp~0_10 0) (= 0 v_~x$read_delayed~0_7) (= v_~x$r_buff1_thd2~0_19 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t2079~0.base_22|) 0) (= 0 v_~x$r_buff0_thd3~0_20) (= v_~x$flush_delayed~0_12 0) (= |v_#valid_56| (store .cse0 |v_ULTIMATE.start_main_~#t2079~0.base_22| 1)) (= (store |v_#length_24| |v_ULTIMATE.start_main_~#t2079~0.base_22| 4) |v_#length_23|) (= |v_#NULL.offset_4| 0) (= v_~x~0_22 0) (= v_~x$r_buff1_thd3~0_17 0) (= 0 v_~x$read_delayed_var~0.offset_7) (= 0 v_~x$r_buff0_thd1~0_70) (= 0 v_~x$w_buff0~0_31) (= v_~main$tmp_guard1~0_13 0) (= |v_ULTIMATE.start_main_~#t2079~0.offset_18| 0) (= 0 v_~x$w_buff0_used~0_112) (= v_~x$w_buff1_used~0_68 0) (= 0 v_~y~0_9))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_16|, #valid=|v_#valid_58|, #memory_int=|v_#memory_int_24|, #length=|v_#length_24|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_31, ULTIMATE.start_main_~#t2081~0.base=|v_ULTIMATE.start_main_~#t2081~0.base_19|, ~x$flush_delayed~0=v_~x$flush_delayed~0_12, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_~#t2081~0.offset=|v_ULTIMATE.start_main_~#t2081~0.offset_14|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_42, ULTIMATE.start_main_~#t2079~0.offset=|v_ULTIMATE.start_main_~#t2079~0.offset_18|, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_20, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_10|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_10|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_13, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_13, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_22, ~x$w_buff1~0=v_~x$w_buff1~0_26, ULTIMATE.start_main_~#t2080~0.base=|v_ULTIMATE.start_main_~#t2080~0.base_23|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_68, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_19, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, ~weak$$choice0~0=v_~weak$$choice0~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_16|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_19, ~x~0=v_~x~0_22, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_70, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_20|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_17, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_13, ~x$mem_tmp~0=v_~x$mem_tmp~0_10, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_13|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_10|, ULTIMATE.start_main_~#t2079~0.base=|v_ULTIMATE.start_main_~#t2079~0.base_22|, ~y~0=v_~y~0_9, ULTIMATE.start_main_~#t2080~0.offset=|v_ULTIMATE.start_main_~#t2080~0.offset_18|, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_7|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_21, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_26, #NULL.base=|v_#NULL.base_4|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_112, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_12|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_18|, #valid=|v_#valid_56|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_8|, ~z~0=v_~z~0_14, ~weak$$choice2~0=v_~weak$$choice2~0_34, ~x$read_delayed~0=v_~x$read_delayed~0_7} AuxVars[] AssignedVars[~x$w_buff0~0, ULTIMATE.start_main_~#t2081~0.base, ~x$r_buff0_thd1~0, ~x$flush_delayed~0, #NULL.offset, ULTIMATE.start_main_#t~ite46, ~x$r_buff1_thd3~0, ULTIMATE.start_main_~#t2081~0.offset, ~x$r_buff1_thd1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_~#t2079~0.offset, ~x$r_buff0_thd3~0, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~__unbuffered_p0_EAX~0, ULTIMATE.start_main_~#t2079~0.base, #length, ~__unbuffered_p2_EAX~0, ~y~0, ULTIMATE.start_main_~#t2080~0.offset, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~nondet40, ~x$w_buff1~0, ULTIMATE.start_main_~#t2080~0.base, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ~x$read_delayed_var~0.base, #NULL.base, ~x$w_buff0_used~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~nondet38, #memory_int, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~z~0, ~weak$$choice2~0, ~x~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-18 22:36:28,300 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [776] [776] L818-1-->L820: Formula: (and (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2080~0.base_10| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2080~0.base_10|) |v_ULTIMATE.start_main_~#t2080~0.offset_9| 1)) |v_#memory_int_15|) (= 0 (select |v_#valid_32| |v_ULTIMATE.start_main_~#t2080~0.base_10|)) (not (= 0 |v_ULTIMATE.start_main_~#t2080~0.base_10|)) (= |v_#valid_31| (store |v_#valid_32| |v_ULTIMATE.start_main_~#t2080~0.base_10| 1)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t2080~0.base_10|) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t2080~0.base_10| 4) |v_#length_15|) (= 0 |v_ULTIMATE.start_main_~#t2080~0.offset_9|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~#t2080~0.base=|v_ULTIMATE.start_main_~#t2080~0.base_10|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_4|, #length=|v_#length_15|, ULTIMATE.start_main_~#t2080~0.offset=|v_ULTIMATE.start_main_~#t2080~0.offset_9|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_~#t2080~0.base, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t2080~0.offset] because there is no mapped edge [2019-12-18 22:36:28,300 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [675] [675] P1ENTRY-->L5-3: Formula: (and (= 1 v_~x$w_buff0~0_14) (= v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_6 |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_4|) (= v_P1Thread1of1ForFork0_~arg.base_4 |v_P1Thread1of1ForFork0_#in~arg.base_4|) (= v_~x$w_buff1_used~0_41 v_~x$w_buff0_used~0_70) (= 1 v_~x$w_buff0_used~0_69) (= v_P1Thread1of1ForFork0_~arg.offset_4 |v_P1Thread1of1ForFork0_#in~arg.offset_4|) (= v_~x$w_buff0~0_15 v_~x$w_buff1~0_14) (= (mod v_~x$w_buff1_used~0_41 256) 0) (= 1 |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_4|)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_15, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_4|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_4|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_70} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_14, P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_6, P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_4, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_4, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_4|, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_4|, ~x$w_buff1~0=v_~x$w_buff1~0_14, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_4|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_41, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_69} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression, P1Thread1of1ForFork0_~arg.offset, P1Thread1of1ForFork0_~arg.base, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$w_buff0_used~0] because there is no mapped edge [2019-12-18 22:36:28,302 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L820-1-->L822: Formula: (and (not (= |v_ULTIMATE.start_main_~#t2081~0.base_11| 0)) (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t2081~0.base_11|)) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t2081~0.base_11| 4)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2081~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2081~0.base_11|) |v_ULTIMATE.start_main_~#t2081~0.offset_10| 2)) |v_#memory_int_13|) (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t2081~0.base_11| 1)) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t2081~0.base_11|) (= |v_ULTIMATE.start_main_~#t2081~0.offset_10| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_14|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_~#t2081~0.base=|v_ULTIMATE.start_main_~#t2081~0.base_11|, #StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#t2081~0.offset=|v_ULTIMATE.start_main_~#t2081~0.offset_10|, #length=|v_#length_13|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2081~0.base, #valid, #memory_int, ULTIMATE.start_main_~#t2081~0.offset, #length, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-18 22:36:28,303 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L795-2-->L795-4: Formula: (let ((.cse1 (= (mod ~x$w_buff1_used~0_In-1767369881 256) 0)) (.cse0 (= (mod ~x$r_buff1_thd3~0_In-1767369881 256) 0))) (or (and (not .cse0) (not .cse1) (= ~x$w_buff1~0_In-1767369881 |P2Thread1of1ForFork1_#t~ite32_Out-1767369881|)) (and (= |P2Thread1of1ForFork1_#t~ite32_Out-1767369881| ~x~0_In-1767369881) (or .cse1 .cse0)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-1767369881, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1767369881, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1767369881, ~x~0=~x~0_In-1767369881} OutVars{P2Thread1of1ForFork1_#t~ite32=|P2Thread1of1ForFork1_#t~ite32_Out-1767369881|, ~x$w_buff1~0=~x$w_buff1~0_In-1767369881, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1767369881, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1767369881, ~x~0=~x~0_In-1767369881} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-18 22:36:28,304 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [677] [677] L795-4-->L796: Formula: (= v_~x~0_14 |v_P2Thread1of1ForFork1_#t~ite32_8|) InVars {P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_8|} OutVars{P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_7|, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_7|, ~x~0=v_~x~0_14} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite33, ~x~0] because there is no mapped edge [2019-12-18 22:36:28,304 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] L796-->L796-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd3~0_In325555702 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In325555702 256)))) (or (and (not .cse0) (= |P2Thread1of1ForFork1_#t~ite34_Out325555702| 0) (not .cse1)) (and (= |P2Thread1of1ForFork1_#t~ite34_Out325555702| ~x$w_buff0_used~0_In325555702) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In325555702, ~x$w_buff0_used~0=~x$w_buff0_used~0_In325555702} OutVars{P2Thread1of1ForFork1_#t~ite34=|P2Thread1of1ForFork1_#t~ite34_Out325555702|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In325555702, ~x$w_buff0_used~0=~x$w_buff0_used~0_In325555702} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-18 22:36:28,305 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] L776-->L776-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In76628563 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In76628563 256)))) (or (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In76628563 |P1Thread1of1ForFork0_#t~ite28_Out76628563|)) (and (= 0 |P1Thread1of1ForFork0_#t~ite28_Out76628563|) (not .cse0) (not .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In76628563, ~x$w_buff0_used~0=~x$w_buff0_used~0_In76628563} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In76628563, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out76628563|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In76628563} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-18 22:36:28,306 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [738] [738] L777-->L777-2: Formula: (let ((.cse3 (= (mod ~x$w_buff0_used~0_In-282435237 256) 0)) (.cse2 (= 0 (mod ~x$r_buff0_thd2~0_In-282435237 256))) (.cse0 (= (mod ~x$r_buff1_thd2~0_In-282435237 256) 0)) (.cse1 (= (mod ~x$w_buff1_used~0_In-282435237 256) 0))) (or (and (= |P1Thread1of1ForFork0_#t~ite29_Out-282435237| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= |P1Thread1of1ForFork0_#t~ite29_Out-282435237| ~x$w_buff1_used~0_In-282435237) (or .cse0 .cse1)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-282435237, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-282435237, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-282435237, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-282435237} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-282435237, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-282435237, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-282435237, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out-282435237|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-282435237} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-18 22:36:28,306 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L778-->L779: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In-372839537 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In-372839537 256)))) (or (and (= ~x$r_buff0_thd2~0_Out-372839537 0) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~x$r_buff0_thd2~0_Out-372839537 ~x$r_buff0_thd2~0_In-372839537)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-372839537, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-372839537} OutVars{P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out-372839537|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out-372839537, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-372839537} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-18 22:36:28,307 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] L779-->L779-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd2~0_In-2114626093 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In-2114626093 256) 0)) (.cse2 (= (mod ~x$r_buff1_thd2~0_In-2114626093 256) 0)) (.cse3 (= 0 (mod ~x$w_buff1_used~0_In-2114626093 256)))) (or (and (= 0 |P1Thread1of1ForFork0_#t~ite31_Out-2114626093|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~x$r_buff1_thd2~0_In-2114626093 |P1Thread1of1ForFork0_#t~ite31_Out-2114626093|) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-2114626093, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-2114626093, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-2114626093, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2114626093} OutVars{P1Thread1of1ForFork0_#t~ite31=|P1Thread1of1ForFork0_#t~ite31_Out-2114626093|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2114626093, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-2114626093, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-2114626093, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2114626093} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-18 22:36:28,307 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [763] [763] L779-2-->P1EXIT: Formula: (and (= v_~__unbuffered_cnt~0_13 (+ v_~__unbuffered_cnt~0_14 1)) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|) (= v_~x$r_buff1_thd2~0_14 |v_P1Thread1of1ForFork0_#t~ite31_8|)) InVars {P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_7|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_14, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_5|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-18 22:36:28,307 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [786] [786] L740-->L740-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In-1692286449 256) 0))) (or (and (= |P0Thread1of1ForFork2_#t~ite9_Out-1692286449| |P0Thread1of1ForFork2_#t~ite8_Out-1692286449|) (let ((.cse0 (= (mod ~x$r_buff0_thd1~0_In-1692286449 256) 0))) (or (and (= 0 (mod ~x$w_buff1_used~0_In-1692286449 256)) .cse0) (= 0 (mod ~x$w_buff0_used~0_In-1692286449 256)) (and (= 0 (mod ~x$r_buff1_thd1~0_In-1692286449 256)) .cse0))) (= ~x$w_buff0~0_In-1692286449 |P0Thread1of1ForFork2_#t~ite8_Out-1692286449|) .cse1) (and (not .cse1) (= |P0Thread1of1ForFork2_#t~ite9_Out-1692286449| ~x$w_buff0~0_In-1692286449) (= |P0Thread1of1ForFork2_#t~ite8_In-1692286449| |P0Thread1of1ForFork2_#t~ite8_Out-1692286449|)))) InVars {~x$w_buff0~0=~x$w_buff0~0_In-1692286449, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1692286449, P0Thread1of1ForFork2_#t~ite8=|P0Thread1of1ForFork2_#t~ite8_In-1692286449|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1692286449, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1692286449, ~weak$$choice2~0=~weak$$choice2~0_In-1692286449, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1692286449} OutVars{~x$w_buff0~0=~x$w_buff0~0_In-1692286449, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1692286449, P0Thread1of1ForFork2_#t~ite8=|P0Thread1of1ForFork2_#t~ite8_Out-1692286449|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1692286449, P0Thread1of1ForFork2_#t~ite9=|P0Thread1of1ForFork2_#t~ite9_Out-1692286449|, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1692286449, ~weak$$choice2~0=~weak$$choice2~0_In-1692286449, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1692286449} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite8, P0Thread1of1ForFork2_#t~ite9] because there is no mapped edge [2019-12-18 22:36:28,309 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L797-->L797-2: Formula: (let ((.cse0 (= (mod ~x$w_buff1_used~0_In871349837 256) 0)) (.cse1 (= 0 (mod ~x$r_buff1_thd3~0_In871349837 256))) (.cse3 (= 0 (mod ~x$r_buff0_thd3~0_In871349837 256))) (.cse2 (= (mod ~x$w_buff0_used~0_In871349837 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork1_#t~ite35_Out871349837| 0)) (and (or .cse0 .cse1) (= |P2Thread1of1ForFork1_#t~ite35_Out871349837| ~x$w_buff1_used~0_In871349837) (or .cse3 .cse2)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In871349837, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In871349837, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In871349837, ~x$w_buff0_used~0=~x$w_buff0_used~0_In871349837} OutVars{P2Thread1of1ForFork1_#t~ite35=|P2Thread1of1ForFork1_#t~ite35_Out871349837|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In871349837, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In871349837, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In871349837, ~x$w_buff0_used~0=~x$w_buff0_used~0_In871349837} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-18 22:36:28,310 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [744] [744] L798-->L798-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In522628372 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd3~0_In522628372 256) 0))) (or (and (not .cse0) (= |P2Thread1of1ForFork1_#t~ite36_Out522628372| 0) (not .cse1)) (and (or .cse1 .cse0) (= ~x$r_buff0_thd3~0_In522628372 |P2Thread1of1ForFork1_#t~ite36_Out522628372|)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In522628372, ~x$w_buff0_used~0=~x$w_buff0_used~0_In522628372} OutVars{P2Thread1of1ForFork1_#t~ite36=|P2Thread1of1ForFork1_#t~ite36_Out522628372|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In522628372, ~x$w_buff0_used~0=~x$w_buff0_used~0_In522628372} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-18 22:36:28,311 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] L799-->L799-2: Formula: (let ((.cse3 (= 0 (mod ~x$w_buff1_used~0_In1963023551 256))) (.cse2 (= (mod ~x$r_buff1_thd3~0_In1963023551 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd3~0_In1963023551 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In1963023551 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork1_#t~ite37_Out1963023551| ~x$r_buff1_thd3~0_In1963023551) (or .cse2 .cse3)) (and (= 0 |P2Thread1of1ForFork1_#t~ite37_Out1963023551|) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1963023551, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1963023551, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1963023551, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1963023551} OutVars{P2Thread1of1ForFork1_#t~ite37=|P2Thread1of1ForFork1_#t~ite37_Out1963023551|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1963023551, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1963023551, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1963023551, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1963023551} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-18 22:36:28,311 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L799-2-->P2EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_16 1) v_~__unbuffered_cnt~0_15) (= 0 |v_P2Thread1of1ForFork1_#res.offset_5|) (= 0 |v_P2Thread1of1ForFork1_#res.base_5|) (= v_~x$r_buff1_thd3~0_12 |v_P2Thread1of1ForFork1_#t~ite37_8|)) InVars {P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16} OutVars{P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_7|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_5|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_12, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37, P2Thread1of1ForFork1_#res.base, ~x$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-18 22:36:28,312 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [787] [787] L743-->L743-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In-612571800 256)))) (or (and (let ((.cse0 (= 0 (mod ~x$r_buff0_thd1~0_In-612571800 256)))) (or (and (= 0 (mod ~x$r_buff1_thd1~0_In-612571800 256)) .cse0) (= (mod ~x$w_buff0_used~0_In-612571800 256) 0) (and (= 0 (mod ~x$w_buff1_used~0_In-612571800 256)) .cse0))) (= |P0Thread1of1ForFork2_#t~ite17_Out-612571800| |P0Thread1of1ForFork2_#t~ite18_Out-612571800|) .cse1 (= |P0Thread1of1ForFork2_#t~ite17_Out-612571800| ~x$w_buff1_used~0_In-612571800)) (and (= |P0Thread1of1ForFork2_#t~ite17_In-612571800| |P0Thread1of1ForFork2_#t~ite17_Out-612571800|) (not .cse1) (= |P0Thread1of1ForFork2_#t~ite18_Out-612571800| ~x$w_buff1_used~0_In-612571800)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-612571800, P0Thread1of1ForFork2_#t~ite17=|P0Thread1of1ForFork2_#t~ite17_In-612571800|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-612571800, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-612571800, ~weak$$choice2~0=~weak$$choice2~0_In-612571800, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-612571800} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-612571800, P0Thread1of1ForFork2_#t~ite18=|P0Thread1of1ForFork2_#t~ite18_Out-612571800|, P0Thread1of1ForFork2_#t~ite17=|P0Thread1of1ForFork2_#t~ite17_Out-612571800|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-612571800, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-612571800, ~weak$$choice2~0=~weak$$choice2~0_In-612571800, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-612571800} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite18, P0Thread1of1ForFork2_#t~ite17] because there is no mapped edge [2019-12-18 22:36:28,312 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [730] [730] L744-->L745: Formula: (and (= v_~x$r_buff0_thd1~0_53 v_~x$r_buff0_thd1~0_52) (not (= (mod v_~weak$$choice2~0_23 256) 0))) InVars {~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_53, ~weak$$choice2~0=v_~weak$$choice2~0_23} OutVars{P0Thread1of1ForFork2_#t~ite20=|v_P0Thread1of1ForFork2_#t~ite20_9|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_52, P0Thread1of1ForFork2_#t~ite19=|v_P0Thread1of1ForFork2_#t~ite19_8|, ~weak$$choice2~0=v_~weak$$choice2~0_23, P0Thread1of1ForFork2_#t~ite21=|v_P0Thread1of1ForFork2_#t~ite21_9|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite20, ~x$r_buff0_thd1~0, P0Thread1of1ForFork2_#t~ite19, P0Thread1of1ForFork2_#t~ite21] because there is no mapped edge [2019-12-18 22:36:28,313 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [797] [797] L745-->L745-8: Formula: (let ((.cse5 (= |P0Thread1of1ForFork2_#t~ite23_Out-174832626| |P0Thread1of1ForFork2_#t~ite24_Out-174832626|)) (.cse4 (= 0 (mod ~x$w_buff0_used~0_In-174832626 256))) (.cse3 (= (mod ~x$r_buff1_thd1~0_In-174832626 256) 0)) (.cse0 (= 0 (mod ~weak$$choice2~0_In-174832626 256))) (.cse1 (= (mod ~x$w_buff1_used~0_In-174832626 256) 0)) (.cse2 (= 0 (mod ~x$r_buff0_thd1~0_In-174832626 256)))) (or (and (= |P0Thread1of1ForFork2_#t~ite22_In-174832626| |P0Thread1of1ForFork2_#t~ite22_Out-174832626|) (or (and (= |P0Thread1of1ForFork2_#t~ite23_Out-174832626| |P0Thread1of1ForFork2_#t~ite23_In-174832626|) (not .cse0) (= ~x$r_buff1_thd1~0_In-174832626 |P0Thread1of1ForFork2_#t~ite24_Out-174832626|)) (and (or (and .cse1 .cse2) (and .cse3 .cse2) .cse4) .cse5 .cse0 (= ~x$r_buff1_thd1~0_In-174832626 |P0Thread1of1ForFork2_#t~ite23_Out-174832626|)))) (let ((.cse6 (not .cse2))) (and (= |P0Thread1of1ForFork2_#t~ite22_Out-174832626| |P0Thread1of1ForFork2_#t~ite23_Out-174832626|) .cse5 (not .cse4) (or .cse6 (not .cse3)) .cse0 (or .cse6 (not .cse1)) (= |P0Thread1of1ForFork2_#t~ite22_Out-174832626| 0))))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-174832626, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-174832626, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-174832626, ~weak$$choice2~0=~weak$$choice2~0_In-174832626, P0Thread1of1ForFork2_#t~ite23=|P0Thread1of1ForFork2_#t~ite23_In-174832626|, P0Thread1of1ForFork2_#t~ite22=|P0Thread1of1ForFork2_#t~ite22_In-174832626|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-174832626} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-174832626, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-174832626, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-174832626, P0Thread1of1ForFork2_#t~ite24=|P0Thread1of1ForFork2_#t~ite24_Out-174832626|, ~weak$$choice2~0=~weak$$choice2~0_In-174832626, P0Thread1of1ForFork2_#t~ite23=|P0Thread1of1ForFork2_#t~ite23_Out-174832626|, P0Thread1of1ForFork2_#t~ite22=|P0Thread1of1ForFork2_#t~ite22_Out-174832626|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-174832626} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite24, P0Thread1of1ForFork2_#t~ite23, P0Thread1of1ForFork2_#t~ite22] because there is no mapped edge [2019-12-18 22:36:28,313 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L747-->L755: Formula: (and (= 0 v_~x$flush_delayed~0_7) (not (= 0 (mod v_~x$flush_delayed~0_8 256))) (= v_~x$mem_tmp~0_4 v_~x~0_17) (= (+ v_~__unbuffered_cnt~0_11 1) v_~__unbuffered_cnt~0_10)) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_8, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, ~x$mem_tmp~0=v_~x$mem_tmp~0_4} OutVars{P0Thread1of1ForFork2_#t~ite25=|v_P0Thread1of1ForFork2_#t~ite25_7|, ~x$flush_delayed~0=v_~x$flush_delayed~0_7, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10, ~x$mem_tmp~0=v_~x$mem_tmp~0_4, ~x~0=v_~x~0_17} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite25, ~x$flush_delayed~0, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-12-18 22:36:28,314 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [699] [699] L826-->L828-2: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_5 256))) (or (= (mod v_~x$w_buff0_used~0_82 256) 0) (= (mod v_~x$r_buff0_thd0~0_14 256) 0))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_14, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_82} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_14, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_82} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-18 22:36:28,314 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L828-2-->L828-4: Formula: (let ((.cse1 (= (mod ~x$w_buff1_used~0_In781956842 256) 0)) (.cse0 (= (mod ~x$r_buff1_thd0~0_In781956842 256) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite41_Out781956842| ~x$w_buff1~0_In781956842) (not .cse1)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite41_Out781956842| ~x~0_In781956842)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In781956842, ~x$w_buff1_used~0=~x$w_buff1_used~0_In781956842, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In781956842, ~x~0=~x~0_In781956842} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out781956842|, ~x$w_buff1~0=~x$w_buff1~0_In781956842, ~x$w_buff1_used~0=~x$w_buff1_used~0_In781956842, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In781956842, ~x~0=~x~0_In781956842} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41] because there is no mapped edge [2019-12-18 22:36:28,314 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [688] [688] L828-4-->L829: Formula: (= v_~x~0_15 |v_ULTIMATE.start_main_#t~ite41_7|) InVars {ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_7|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_6|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_6|, ~x~0=v_~x~0_15} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite42, ~x~0] because there is no mapped edge [2019-12-18 22:36:28,314 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [743] [743] L829-->L829-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In936970551 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In936970551 256)))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite43_Out936970551|)) (and (or .cse1 .cse0) (= ~x$w_buff0_used~0_In936970551 |ULTIMATE.start_main_#t~ite43_Out936970551|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In936970551, ~x$w_buff0_used~0=~x$w_buff0_used~0_In936970551} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In936970551, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out936970551|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In936970551} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-18 22:36:28,315 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L830-->L830-2: Formula: (let ((.cse2 (= 0 (mod ~x$r_buff0_thd0~0_In-809252320 256))) (.cse3 (= (mod ~x$w_buff0_used~0_In-809252320 256) 0)) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In-809252320 256))) (.cse0 (= (mod ~x$r_buff1_thd0~0_In-809252320 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite44_Out-809252320| 0)) (and (or .cse2 .cse3) (= ~x$w_buff1_used~0_In-809252320 |ULTIMATE.start_main_#t~ite44_Out-809252320|) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-809252320, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-809252320, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-809252320, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-809252320} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-809252320, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-809252320, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-809252320, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-809252320|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-809252320} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-18 22:36:28,316 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L831-->L831-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In1825519398 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In1825519398 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite45_Out1825519398| ~x$r_buff0_thd0~0_In1825519398) (or .cse0 .cse1)) (and (= |ULTIMATE.start_main_#t~ite45_Out1825519398| 0) (not .cse0) (not .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1825519398, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1825519398} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1825519398, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out1825519398|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1825519398} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-18 22:36:28,316 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [739] [739] L832-->L832-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In476355163 256))) (.cse0 (= (mod ~x$r_buff0_thd0~0_In476355163 256) 0)) (.cse3 (= 0 (mod ~x$r_buff1_thd0~0_In476355163 256))) (.cse2 (= (mod ~x$w_buff1_used~0_In476355163 256) 0))) (or (and (or .cse0 .cse1) (= ~x$r_buff1_thd0~0_In476355163 |ULTIMATE.start_main_#t~ite46_Out476355163|) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= |ULTIMATE.start_main_#t~ite46_Out476355163| 0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In476355163, ~x$w_buff1_used~0=~x$w_buff1_used~0_In476355163, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In476355163, ~x$w_buff0_used~0=~x$w_buff0_used~0_In476355163} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In476355163, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out476355163|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In476355163, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In476355163, ~x$w_buff0_used~0=~x$w_buff0_used~0_In476355163} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-18 22:36:28,316 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [801] [801] L832-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~z~0_11 2) (= v_~main$tmp_guard1~0_10 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8| (mod v_~main$tmp_guard1~0_10 256)) (= 0 v_~__unbuffered_p0_EAX~0_10) (= 1 v_~__unbuffered_p2_EAX~0_10) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 0) (= v_~x$r_buff1_thd0~0_18 |v_ULTIMATE.start_main_#t~ite46_16|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_10, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_16|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_10, ~z~0=v_~z~0_11} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_10, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_15, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_15|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_10, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_10, ~z~0=v_~z~0_11, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_18, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 22:36:28,412 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 10:36:28 BasicIcfg [2019-12-18 22:36:28,413 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 22:36:28,414 INFO L168 Benchmark]: Toolchain (without parser) took 184613.40 ms. Allocated memory was 138.4 MB in the beginning and 4.2 GB in the end (delta: 4.1 GB). Free memory was 102.2 MB in the beginning and 2.4 GB in the end (delta: -2.3 GB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. [2019-12-18 22:36:28,415 INFO L168 Benchmark]: CDTParser took 0.58 ms. Allocated memory is still 138.4 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2019-12-18 22:36:28,415 INFO L168 Benchmark]: CACSL2BoogieTranslator took 824.43 ms. Allocated memory was 138.4 MB in the beginning and 202.4 MB in the end (delta: 64.0 MB). Free memory was 102.0 MB in the beginning and 154.3 MB in the end (delta: -52.3 MB). Peak memory consumption was 24.3 MB. Max. memory is 7.1 GB. [2019-12-18 22:36:28,419 INFO L168 Benchmark]: Boogie Procedure Inliner took 72.91 ms. Allocated memory is still 202.4 MB. Free memory was 154.3 MB in the beginning and 151.5 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-18 22:36:28,419 INFO L168 Benchmark]: Boogie Preprocessor took 41.58 ms. Allocated memory is still 202.4 MB. Free memory was 151.5 MB in the beginning and 149.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-18 22:36:28,420 INFO L168 Benchmark]: RCFGBuilder took 834.36 ms. Allocated memory is still 202.4 MB. Free memory was 149.5 MB in the beginning and 103.1 MB in the end (delta: 46.4 MB). Peak memory consumption was 46.4 MB. Max. memory is 7.1 GB. [2019-12-18 22:36:28,420 INFO L168 Benchmark]: TraceAbstraction took 182834.48 ms. Allocated memory was 202.4 MB in the beginning and 4.2 GB in the end (delta: 4.0 GB). Free memory was 102.4 MB in the beginning and 2.4 GB in the end (delta: -2.3 GB). Peak memory consumption was 1.7 GB. Max. memory is 7.1 GB. [2019-12-18 22:36:28,426 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.58 ms. Allocated memory is still 138.4 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 824.43 ms. Allocated memory was 138.4 MB in the beginning and 202.4 MB in the end (delta: 64.0 MB). Free memory was 102.0 MB in the beginning and 154.3 MB in the end (delta: -52.3 MB). Peak memory consumption was 24.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 72.91 ms. Allocated memory is still 202.4 MB. Free memory was 154.3 MB in the beginning and 151.5 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 41.58 ms. Allocated memory is still 202.4 MB. Free memory was 151.5 MB in the beginning and 149.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 834.36 ms. Allocated memory is still 202.4 MB. Free memory was 149.5 MB in the beginning and 103.1 MB in the end (delta: 46.4 MB). Peak memory consumption was 46.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 182834.48 ms. Allocated memory was 202.4 MB in the beginning and 4.2 GB in the end (delta: 4.0 GB). Free memory was 102.4 MB in the beginning and 2.4 GB in the end (delta: -2.3 GB). Peak memory consumption was 1.7 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.1s, 163 ProgramPointsBefore, 84 ProgramPointsAfterwards, 194 TransitionsBefore, 92 TransitionsAfterwards, 16696 CoEnabledTransitionPairs, 7 FixpointIterations, 32 TrivialSequentialCompositions, 44 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 34 ConcurrentYvCompositions, 27 ChoiceCompositions, 6547 VarBasedMoverChecksPositive, 203 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 68909 CheckedPairsTotal, 110 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L818] FCALL, FORK 0 pthread_create(&t2079, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L820] FCALL, FORK 0 pthread_create(&t2080, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L765] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L766] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L767] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L768] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L769] 2 x$r_buff0_thd2 = (_Bool)1 [L772] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L775] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L822] FCALL, FORK 0 pthread_create(&t2081, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L789] 3 __unbuffered_p2_EAX = y [L792] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L795] 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L775] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L730] 1 z = 2 [L735] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L736] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L737] 1 x$flush_delayed = weak$$choice2 [L738] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L739] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L776] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L777] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L739] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L740] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L741] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L741] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L796] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L797] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L798] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L742] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L742] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L743] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L745] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L746] 1 __unbuffered_p0_EAX = x VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L824] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L829] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L830] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L831] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 154 locations, 2 error locations. Result: UNSAFE, OverallTime: 182.5s, OverallIterations: 29, TraceHistogramMax: 1, AutomataDifference: 49.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 4513 SDtfs, 8246 SDslu, 13651 SDs, 0 SdLazy, 8892 SolverSat, 429 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 371 GetRequests, 36 SyntacticMatches, 22 SemanticMatches, 313 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2226 ImplicationChecksByTransitivity, 5.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=156231occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 107.0s AutomataMinimizationTime, 28 MinimizatonAttempts, 216793 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 1049 NumberOfCodeBlocks, 1049 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 965 ConstructedInterpolants, 0 QuantifiedInterpolants, 177287 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 28 InterpolantComputations, 28 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...