/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix054_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 02:56:54,567 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 02:56:54,569 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 02:56:54,584 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 02:56:54,585 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 02:56:54,586 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 02:56:54,587 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 02:56:54,589 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 02:56:54,591 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 02:56:54,592 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 02:56:54,593 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 02:56:54,594 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 02:56:54,594 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 02:56:54,595 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 02:56:54,596 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 02:56:54,597 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 02:56:54,598 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 02:56:54,599 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 02:56:54,601 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 02:56:54,603 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 02:56:54,604 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 02:56:54,606 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 02:56:54,607 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 02:56:54,607 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 02:56:54,609 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 02:56:54,610 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 02:56:54,610 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 02:56:54,611 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 02:56:54,611 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 02:56:54,612 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 02:56:54,612 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 02:56:54,613 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 02:56:54,614 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 02:56:54,614 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 02:56:54,615 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 02:56:54,616 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 02:56:54,616 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 02:56:54,617 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 02:56:54,617 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 02:56:54,618 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 02:56:54,618 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 02:56:54,619 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf [2019-12-27 02:56:54,633 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 02:56:54,633 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 02:56:54,635 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 02:56:54,635 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 02:56:54,635 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 02:56:54,635 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 02:56:54,636 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 02:56:54,636 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 02:56:54,636 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 02:56:54,636 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 02:56:54,636 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 02:56:54,637 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 02:56:54,637 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 02:56:54,637 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 02:56:54,637 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 02:56:54,637 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 02:56:54,637 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 02:56:54,638 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 02:56:54,638 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 02:56:54,638 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 02:56:54,638 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 02:56:54,639 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 02:56:54,639 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 02:56:54,639 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 02:56:54,639 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 02:56:54,639 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 02:56:54,640 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 02:56:54,640 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 02:56:54,640 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 02:56:54,947 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 02:56:54,967 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 02:56:54,971 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 02:56:54,972 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 02:56:54,973 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 02:56:54,974 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix054_rmo.oepc.i [2019-12-27 02:56:55,051 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd7b2203e/fe233e67b2d745fcbd1cd7416f627a95/FLAG7a693272e [2019-12-27 02:56:55,567 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 02:56:55,567 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix054_rmo.oepc.i [2019-12-27 02:56:55,586 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd7b2203e/fe233e67b2d745fcbd1cd7416f627a95/FLAG7a693272e [2019-12-27 02:56:55,888 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd7b2203e/fe233e67b2d745fcbd1cd7416f627a95 [2019-12-27 02:56:55,900 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 02:56:55,902 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 02:56:55,905 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 02:56:55,905 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 02:56:55,909 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 02:56:55,910 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 02:56:55" (1/1) ... [2019-12-27 02:56:55,913 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@85f7a91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:56:55, skipping insertion in model container [2019-12-27 02:56:55,913 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 02:56:55" (1/1) ... [2019-12-27 02:56:55,920 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 02:56:55,962 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 02:56:56,488 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 02:56:56,500 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 02:56:56,562 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 02:56:56,634 INFO L208 MainTranslator]: Completed translation [2019-12-27 02:56:56,634 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:56:56 WrapperNode [2019-12-27 02:56:56,634 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 02:56:56,635 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 02:56:56,635 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 02:56:56,636 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 02:56:56,645 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:56:56" (1/1) ... [2019-12-27 02:56:56,673 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:56:56" (1/1) ... [2019-12-27 02:56:56,721 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 02:56:56,721 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 02:56:56,721 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 02:56:56,722 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 02:56:56,733 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:56:56" (1/1) ... [2019-12-27 02:56:56,734 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:56:56" (1/1) ... [2019-12-27 02:56:56,738 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:56:56" (1/1) ... [2019-12-27 02:56:56,739 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:56:56" (1/1) ... [2019-12-27 02:56:56,749 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:56:56" (1/1) ... [2019-12-27 02:56:56,754 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:56:56" (1/1) ... [2019-12-27 02:56:56,757 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:56:56" (1/1) ... [2019-12-27 02:56:56,763 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 02:56:56,763 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 02:56:56,763 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 02:56:56,764 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 02:56:56,765 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:56:56" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 02:56:56,828 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 02:56:56,828 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 02:56:56,829 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 02:56:56,829 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 02:56:56,829 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 02:56:56,829 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 02:56:56,829 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 02:56:56,830 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 02:56:56,830 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 02:56:56,830 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 02:56:56,830 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 02:56:56,832 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 02:56:57,567 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 02:56:57,568 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 02:56:57,569 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 02:56:57 BoogieIcfgContainer [2019-12-27 02:56:57,570 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 02:56:57,571 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 02:56:57,571 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 02:56:57,575 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 02:56:57,575 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 02:56:55" (1/3) ... [2019-12-27 02:56:57,576 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5af0769a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 02:56:57, skipping insertion in model container [2019-12-27 02:56:57,576 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:56:56" (2/3) ... [2019-12-27 02:56:57,577 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5af0769a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 02:56:57, skipping insertion in model container [2019-12-27 02:56:57,577 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 02:56:57" (3/3) ... [2019-12-27 02:56:57,579 INFO L109 eAbstractionObserver]: Analyzing ICFG mix054_rmo.oepc.i [2019-12-27 02:56:57,590 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 02:56:57,590 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 02:56:57,598 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 02:56:57,599 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 02:56:57,641 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:57,642 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:57,642 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:57,642 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:57,643 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:57,643 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:57,643 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:57,644 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:57,644 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:57,646 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:57,647 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:57,647 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:57,649 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:57,649 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:57,649 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:57,650 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:57,650 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:57,650 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:57,651 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:57,651 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:57,651 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:57,652 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:57,652 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:57,653 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:57,653 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:57,653 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:57,653 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:57,654 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:57,654 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:57,654 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:57,655 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:57,655 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:57,655 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:57,656 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:57,659 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:57,660 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:57,660 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:57,660 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:57,660 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:57,661 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:57,661 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:57,662 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:57,663 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:57,663 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:57,664 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:57,664 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:57,667 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:57,668 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:57,668 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:57,669 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:57,669 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:57,669 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:57,669 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:57,669 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:57,670 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:57,670 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:57,670 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:57,671 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:57,672 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:57,672 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:57,672 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:57,673 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:57,673 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:57,673 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:57,673 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:57,673 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:57,674 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:57,674 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:57,674 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:57,675 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:57,675 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:57,676 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:57,676 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:57,676 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:57,676 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:57,677 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:57,677 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:57,677 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:57,677 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:57,678 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:57,678 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:57,678 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:57,678 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:57,679 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:57,679 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:57,679 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:57,679 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:57,680 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:57,681 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:57,681 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:57,681 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:57,682 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:57,682 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:57,682 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:57,682 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:57,682 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:57,683 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:57,683 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:57,683 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:57,684 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:57,684 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:57,684 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:57,684 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:57,685 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:57,685 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:57,689 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:57,689 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:57,690 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:57,691 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:57,698 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:57,699 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:57,699 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:57,699 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:57,699 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:57,700 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:57,700 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:57,700 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:57,701 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:57,701 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:57,701 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:57,701 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:57,702 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:57,702 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:57,702 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:57,702 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:57,702 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:57,703 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:57,703 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:57,703 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:57,703 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:57,704 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:57,704 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:57,704 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:57,704 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:57,705 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:57,705 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:57,705 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:57,705 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:57,706 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:57,706 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:57,706 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:57,706 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:57,707 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:57,707 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:57,707 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:57,707 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:57,707 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:57,708 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:57,708 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:57,708 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:57,708 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:57,709 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:57,713 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:57,713 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:57,713 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:57,713 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:57,714 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:57,714 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:57,714 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:57,714 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:57,715 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:57,715 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:57,715 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:57,715 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:57,718 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:57,718 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:57,719 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:57,719 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:57,719 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:57,719 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:57,720 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:57,720 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:57,720 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:57,720 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:57,720 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:57,721 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:57,721 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:57,721 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:57,721 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:57,722 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:57,722 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:57,722 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:57,722 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:57,723 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:57,723 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:57,723 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:57,723 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:57,724 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:57,724 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:57,724 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:57,724 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:57,724 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:57,725 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:57,725 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:57,725 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:57,725 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:57,726 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:57,741 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 02:56:57,763 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 02:56:57,763 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 02:56:57,763 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 02:56:57,763 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 02:56:57,763 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 02:56:57,764 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 02:56:57,764 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 02:56:57,764 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 02:56:57,781 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 146 places, 180 transitions [2019-12-27 02:56:57,784 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 146 places, 180 transitions [2019-12-27 02:56:57,901 INFO L132 PetriNetUnfolder]: 41/178 cut-off events. [2019-12-27 02:56:57,901 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 02:56:57,915 INFO L76 FinitePrefix]: Finished finitePrefix Result has 185 conditions, 178 events. 41/178 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 345 event pairs. 0/135 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 02:56:57,936 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 146 places, 180 transitions [2019-12-27 02:56:58,007 INFO L132 PetriNetUnfolder]: 41/178 cut-off events. [2019-12-27 02:56:58,008 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 02:56:58,016 INFO L76 FinitePrefix]: Finished finitePrefix Result has 185 conditions, 178 events. 41/178 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 345 event pairs. 0/135 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 02:56:58,034 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12056 [2019-12-27 02:56:58,035 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 02:57:02,687 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2019-12-27 02:57:03,013 WARN L192 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 79 [2019-12-27 02:57:03,141 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2019-12-27 02:57:03,485 INFO L206 etLargeBlockEncoding]: Checked pairs total: 74785 [2019-12-27 02:57:03,485 INFO L214 etLargeBlockEncoding]: Total number of compositions: 109 [2019-12-27 02:57:03,490 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 75 places, 85 transitions [2019-12-27 02:57:04,010 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8582 states. [2019-12-27 02:57:04,012 INFO L276 IsEmpty]: Start isEmpty. Operand 8582 states. [2019-12-27 02:57:04,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 02:57:04,017 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:57:04,017 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 02:57:04,018 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:57:04,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:57:04,024 INFO L82 PathProgramCache]: Analyzing trace with hash 791214, now seen corresponding path program 1 times [2019-12-27 02:57:04,032 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:57:04,033 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022436882] [2019-12-27 02:57:04,033 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:57:04,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:57:04,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:57:04,233 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022436882] [2019-12-27 02:57:04,234 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:57:04,234 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 02:57:04,235 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721375532] [2019-12-27 02:57:04,239 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:57:04,239 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:57:04,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:57:04,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:57:04,253 INFO L87 Difference]: Start difference. First operand 8582 states. Second operand 3 states. [2019-12-27 02:57:04,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:57:04,519 INFO L93 Difference]: Finished difference Result 8460 states and 27514 transitions. [2019-12-27 02:57:04,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:57:04,521 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 02:57:04,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:57:04,605 INFO L225 Difference]: With dead ends: 8460 [2019-12-27 02:57:04,605 INFO L226 Difference]: Without dead ends: 7472 [2019-12-27 02:57:04,606 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:57:04,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7472 states. [2019-12-27 02:57:04,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7472 to 7472. [2019-12-27 02:57:04,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7472 states. [2019-12-27 02:57:04,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7472 states to 7472 states and 24214 transitions. [2019-12-27 02:57:04,989 INFO L78 Accepts]: Start accepts. Automaton has 7472 states and 24214 transitions. Word has length 3 [2019-12-27 02:57:04,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:57:04,990 INFO L462 AbstractCegarLoop]: Abstraction has 7472 states and 24214 transitions. [2019-12-27 02:57:04,990 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:57:04,990 INFO L276 IsEmpty]: Start isEmpty. Operand 7472 states and 24214 transitions. [2019-12-27 02:57:04,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 02:57:04,994 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:57:04,994 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:57:04,994 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:57:04,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:57:04,995 INFO L82 PathProgramCache]: Analyzing trace with hash 743461303, now seen corresponding path program 1 times [2019-12-27 02:57:04,995 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:57:04,995 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174138647] [2019-12-27 02:57:04,996 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:57:05,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:57:05,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:57:05,102 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174138647] [2019-12-27 02:57:05,102 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:57:05,102 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:57:05,103 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730258882] [2019-12-27 02:57:05,105 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 02:57:05,105 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:57:05,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 02:57:05,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 02:57:05,106 INFO L87 Difference]: Start difference. First operand 7472 states and 24214 transitions. Second operand 4 states. [2019-12-27 02:57:05,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:57:05,576 INFO L93 Difference]: Finished difference Result 11704 states and 36249 transitions. [2019-12-27 02:57:05,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 02:57:05,577 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 02:57:05,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:57:05,645 INFO L225 Difference]: With dead ends: 11704 [2019-12-27 02:57:05,645 INFO L226 Difference]: Without dead ends: 11690 [2019-12-27 02:57:05,646 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 02:57:05,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11690 states. [2019-12-27 02:57:05,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11690 to 10458. [2019-12-27 02:57:05,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10458 states. [2019-12-27 02:57:06,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10458 states to 10458 states and 32991 transitions. [2019-12-27 02:57:06,007 INFO L78 Accepts]: Start accepts. Automaton has 10458 states and 32991 transitions. Word has length 11 [2019-12-27 02:57:06,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:57:06,008 INFO L462 AbstractCegarLoop]: Abstraction has 10458 states and 32991 transitions. [2019-12-27 02:57:06,008 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 02:57:06,008 INFO L276 IsEmpty]: Start isEmpty. Operand 10458 states and 32991 transitions. [2019-12-27 02:57:06,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 02:57:06,014 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:57:06,014 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:57:06,015 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:57:06,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:57:06,015 INFO L82 PathProgramCache]: Analyzing trace with hash 1209900993, now seen corresponding path program 1 times [2019-12-27 02:57:06,015 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:57:06,016 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020717155] [2019-12-27 02:57:06,016 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:57:06,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:57:06,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:57:06,157 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020717155] [2019-12-27 02:57:06,157 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:57:06,158 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 02:57:06,159 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463574830] [2019-12-27 02:57:06,160 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 02:57:06,160 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:57:06,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 02:57:06,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 02:57:06,161 INFO L87 Difference]: Start difference. First operand 10458 states and 32991 transitions. Second operand 5 states. [2019-12-27 02:57:07,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:57:07,165 INFO L93 Difference]: Finished difference Result 15000 states and 46671 transitions. [2019-12-27 02:57:07,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 02:57:07,165 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-27 02:57:07,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:57:07,216 INFO L225 Difference]: With dead ends: 15000 [2019-12-27 02:57:07,216 INFO L226 Difference]: Without dead ends: 15000 [2019-12-27 02:57:07,216 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-27 02:57:07,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15000 states. [2019-12-27 02:57:07,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15000 to 11886. [2019-12-27 02:57:07,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11886 states. [2019-12-27 02:57:07,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11886 states to 11886 states and 37489 transitions. [2019-12-27 02:57:07,616 INFO L78 Accepts]: Start accepts. Automaton has 11886 states and 37489 transitions. Word has length 14 [2019-12-27 02:57:07,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:57:07,618 INFO L462 AbstractCegarLoop]: Abstraction has 11886 states and 37489 transitions. [2019-12-27 02:57:07,618 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 02:57:07,618 INFO L276 IsEmpty]: Start isEmpty. Operand 11886 states and 37489 transitions. [2019-12-27 02:57:07,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 02:57:07,622 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:57:07,622 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:57:07,622 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:57:07,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:57:07,623 INFO L82 PathProgramCache]: Analyzing trace with hash 529414606, now seen corresponding path program 1 times [2019-12-27 02:57:07,623 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:57:07,623 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287736247] [2019-12-27 02:57:07,624 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:57:07,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:57:07,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:57:07,689 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287736247] [2019-12-27 02:57:07,689 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:57:07,689 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 02:57:07,689 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190710766] [2019-12-27 02:57:07,690 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:57:07,690 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:57:07,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:57:07,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:57:07,691 INFO L87 Difference]: Start difference. First operand 11886 states and 37489 transitions. Second operand 3 states. [2019-12-27 02:57:07,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:57:07,756 INFO L93 Difference]: Finished difference Result 11883 states and 37480 transitions. [2019-12-27 02:57:07,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:57:07,757 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-27 02:57:07,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:57:07,795 INFO L225 Difference]: With dead ends: 11883 [2019-12-27 02:57:07,795 INFO L226 Difference]: Without dead ends: 11883 [2019-12-27 02:57:07,797 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:57:07,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11883 states. [2019-12-27 02:57:08,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11883 to 11883. [2019-12-27 02:57:08,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11883 states. [2019-12-27 02:57:08,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11883 states to 11883 states and 37480 transitions. [2019-12-27 02:57:08,252 INFO L78 Accepts]: Start accepts. Automaton has 11883 states and 37480 transitions. Word has length 16 [2019-12-27 02:57:08,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:57:08,253 INFO L462 AbstractCegarLoop]: Abstraction has 11883 states and 37480 transitions. [2019-12-27 02:57:08,253 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:57:08,253 INFO L276 IsEmpty]: Start isEmpty. Operand 11883 states and 37480 transitions. [2019-12-27 02:57:08,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 02:57:08,258 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:57:08,258 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:57:08,258 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:57:08,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:57:08,259 INFO L82 PathProgramCache]: Analyzing trace with hash 1491434984, now seen corresponding path program 1 times [2019-12-27 02:57:08,259 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:57:08,259 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677634552] [2019-12-27 02:57:08,259 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:57:08,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:57:08,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:57:08,360 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677634552] [2019-12-27 02:57:08,361 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:57:08,361 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:57:08,361 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364279822] [2019-12-27 02:57:08,361 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:57:08,361 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:57:08,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:57:08,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:57:08,363 INFO L87 Difference]: Start difference. First operand 11883 states and 37480 transitions. Second operand 3 states. [2019-12-27 02:57:08,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:57:08,440 INFO L93 Difference]: Finished difference Result 19949 states and 62561 transitions. [2019-12-27 02:57:08,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:57:08,441 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-12-27 02:57:08,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:57:08,479 INFO L225 Difference]: With dead ends: 19949 [2019-12-27 02:57:08,479 INFO L226 Difference]: Without dead ends: 11074 [2019-12-27 02:57:08,479 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-27 02:57:08,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11074 states. [2019-12-27 02:57:08,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11074 to 10421. [2019-12-27 02:57:08,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10421 states. [2019-12-27 02:57:08,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10421 states to 10421 states and 32037 transitions. [2019-12-27 02:57:08,763 INFO L78 Accepts]: Start accepts. Automaton has 10421 states and 32037 transitions. Word has length 17 [2019-12-27 02:57:08,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:57:08,764 INFO L462 AbstractCegarLoop]: Abstraction has 10421 states and 32037 transitions. [2019-12-27 02:57:08,764 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:57:08,764 INFO L276 IsEmpty]: Start isEmpty. Operand 10421 states and 32037 transitions. [2019-12-27 02:57:08,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 02:57:08,768 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:57:08,769 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:57:08,769 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:57:08,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:57:08,769 INFO L82 PathProgramCache]: Analyzing trace with hash 1843431322, now seen corresponding path program 1 times [2019-12-27 02:57:08,769 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:57:08,770 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335047641] [2019-12-27 02:57:08,770 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:57:08,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:57:08,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:57:08,882 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335047641] [2019-12-27 02:57:08,883 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:57:08,883 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 02:57:08,884 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560032249] [2019-12-27 02:57:08,884 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 02:57:08,884 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:57:08,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 02:57:08,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 02:57:08,885 INFO L87 Difference]: Start difference. First operand 10421 states and 32037 transitions. Second operand 4 states. [2019-12-27 02:57:08,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:57:08,927 INFO L93 Difference]: Finished difference Result 1761 states and 4355 transitions. [2019-12-27 02:57:08,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 02:57:08,928 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-12-27 02:57:08,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:57:08,931 INFO L225 Difference]: With dead ends: 1761 [2019-12-27 02:57:08,932 INFO L226 Difference]: Without dead ends: 1251 [2019-12-27 02:57:08,932 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 02:57:08,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1251 states. [2019-12-27 02:57:08,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1251 to 1247. [2019-12-27 02:57:08,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1247 states. [2019-12-27 02:57:08,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1247 states to 1247 states and 2756 transitions. [2019-12-27 02:57:08,955 INFO L78 Accepts]: Start accepts. Automaton has 1247 states and 2756 transitions. Word has length 17 [2019-12-27 02:57:08,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:57:08,955 INFO L462 AbstractCegarLoop]: Abstraction has 1247 states and 2756 transitions. [2019-12-27 02:57:08,955 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 02:57:08,956 INFO L276 IsEmpty]: Start isEmpty. Operand 1247 states and 2756 transitions. [2019-12-27 02:57:08,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 02:57:08,957 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:57:08,958 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:57:08,958 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:57:08,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:57:08,958 INFO L82 PathProgramCache]: Analyzing trace with hash 702739982, now seen corresponding path program 1 times [2019-12-27 02:57:08,958 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:57:08,959 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49317914] [2019-12-27 02:57:08,959 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:57:08,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:57:09,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:57:09,051 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49317914] [2019-12-27 02:57:09,051 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:57:09,052 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 02:57:09,052 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908117680] [2019-12-27 02:57:09,052 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 02:57:09,052 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:57:09,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 02:57:09,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 02:57:09,054 INFO L87 Difference]: Start difference. First operand 1247 states and 2756 transitions. Second operand 6 states. [2019-12-27 02:57:09,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:57:09,262 INFO L93 Difference]: Finished difference Result 1303 states and 2824 transitions. [2019-12-27 02:57:09,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 02:57:09,263 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-12-27 02:57:09,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:57:09,268 INFO L225 Difference]: With dead ends: 1303 [2019-12-27 02:57:09,268 INFO L226 Difference]: Without dead ends: 1252 [2019-12-27 02:57:09,268 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-27 02:57:09,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1252 states. [2019-12-27 02:57:09,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1252 to 1205. [2019-12-27 02:57:09,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1205 states. [2019-12-27 02:57:09,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1205 states to 1205 states and 2651 transitions. [2019-12-27 02:57:09,289 INFO L78 Accepts]: Start accepts. Automaton has 1205 states and 2651 transitions. Word has length 25 [2019-12-27 02:57:09,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:57:09,289 INFO L462 AbstractCegarLoop]: Abstraction has 1205 states and 2651 transitions. [2019-12-27 02:57:09,289 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 02:57:09,290 INFO L276 IsEmpty]: Start isEmpty. Operand 1205 states and 2651 transitions. [2019-12-27 02:57:09,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 02:57:09,291 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:57:09,292 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:57:09,292 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:57:09,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:57:09,292 INFO L82 PathProgramCache]: Analyzing trace with hash 1020603025, now seen corresponding path program 1 times [2019-12-27 02:57:09,292 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:57:09,293 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594636820] [2019-12-27 02:57:09,293 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:57:09,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:57:09,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:57:09,418 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594636820] [2019-12-27 02:57:09,418 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:57:09,418 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 02:57:09,419 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704667253] [2019-12-27 02:57:09,420 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 02:57:09,420 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:57:09,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 02:57:09,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 02:57:09,421 INFO L87 Difference]: Start difference. First operand 1205 states and 2651 transitions. Second operand 5 states. [2019-12-27 02:57:09,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:57:09,879 INFO L93 Difference]: Finished difference Result 1876 states and 4050 transitions. [2019-12-27 02:57:09,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 02:57:09,880 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-27 02:57:09,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:57:09,884 INFO L225 Difference]: With dead ends: 1876 [2019-12-27 02:57:09,884 INFO L226 Difference]: Without dead ends: 1876 [2019-12-27 02:57:09,885 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 02:57:09,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1876 states. [2019-12-27 02:57:09,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1876 to 1694. [2019-12-27 02:57:09,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1694 states. [2019-12-27 02:57:09,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1694 states to 1694 states and 3700 transitions. [2019-12-27 02:57:09,912 INFO L78 Accepts]: Start accepts. Automaton has 1694 states and 3700 transitions. Word has length 27 [2019-12-27 02:57:09,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:57:09,912 INFO L462 AbstractCegarLoop]: Abstraction has 1694 states and 3700 transitions. [2019-12-27 02:57:09,913 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 02:57:09,913 INFO L276 IsEmpty]: Start isEmpty. Operand 1694 states and 3700 transitions. [2019-12-27 02:57:09,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-27 02:57:09,915 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:57:09,916 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:57:09,916 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:57:09,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:57:09,916 INFO L82 PathProgramCache]: Analyzing trace with hash 1134333202, now seen corresponding path program 1 times [2019-12-27 02:57:09,916 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:57:09,917 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637930816] [2019-12-27 02:57:09,917 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:57:09,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:57:09,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:57:09,997 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637930816] [2019-12-27 02:57:09,998 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:57:09,998 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 02:57:09,998 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475796223] [2019-12-27 02:57:09,998 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 02:57:09,998 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:57:09,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 02:57:09,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 02:57:09,999 INFO L87 Difference]: Start difference. First operand 1694 states and 3700 transitions. Second operand 5 states. [2019-12-27 02:57:10,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:57:10,041 INFO L93 Difference]: Finished difference Result 1036 states and 2147 transitions. [2019-12-27 02:57:10,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 02:57:10,042 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-27 02:57:10,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:57:10,043 INFO L225 Difference]: With dead ends: 1036 [2019-12-27 02:57:10,043 INFO L226 Difference]: Without dead ends: 844 [2019-12-27 02:57:10,044 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-27 02:57:10,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 844 states. [2019-12-27 02:57:10,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 844 to 808. [2019-12-27 02:57:10,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 808 states. [2019-12-27 02:57:10,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 808 states to 808 states and 1730 transitions. [2019-12-27 02:57:10,056 INFO L78 Accepts]: Start accepts. Automaton has 808 states and 1730 transitions. Word has length 28 [2019-12-27 02:57:10,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:57:10,057 INFO L462 AbstractCegarLoop]: Abstraction has 808 states and 1730 transitions. [2019-12-27 02:57:10,057 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 02:57:10,057 INFO L276 IsEmpty]: Start isEmpty. Operand 808 states and 1730 transitions. [2019-12-27 02:57:10,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-27 02:57:10,060 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:57:10,060 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] [2019-12-27 02:57:10,060 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:57:10,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:57:10,060 INFO L82 PathProgramCache]: Analyzing trace with hash -1996003398, now seen corresponding path program 1 times [2019-12-27 02:57:10,061 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:57:10,061 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713646352] [2019-12-27 02:57:10,061 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:57:10,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:57:10,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:57:10,101 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713646352] [2019-12-27 02:57:10,101 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:57:10,101 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 02:57:10,101 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595708130] [2019-12-27 02:57:10,102 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:57:10,102 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:57:10,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:57:10,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:57:10,102 INFO L87 Difference]: Start difference. First operand 808 states and 1730 transitions. Second operand 3 states. [2019-12-27 02:57:10,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:57:10,144 INFO L93 Difference]: Finished difference Result 1209 states and 2521 transitions. [2019-12-27 02:57:10,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:57:10,145 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-12-27 02:57:10,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:57:10,148 INFO L225 Difference]: With dead ends: 1209 [2019-12-27 02:57:10,148 INFO L226 Difference]: Without dead ends: 1209 [2019-12-27 02:57:10,148 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-27 02:57:10,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1209 states. [2019-12-27 02:57:10,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1209 to 887. [2019-12-27 02:57:10,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 887 states. [2019-12-27 02:57:10,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 887 states to 887 states and 1887 transitions. [2019-12-27 02:57:10,171 INFO L78 Accepts]: Start accepts. Automaton has 887 states and 1887 transitions. Word has length 51 [2019-12-27 02:57:10,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:57:10,172 INFO L462 AbstractCegarLoop]: Abstraction has 887 states and 1887 transitions. [2019-12-27 02:57:10,172 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:57:10,172 INFO L276 IsEmpty]: Start isEmpty. Operand 887 states and 1887 transitions. [2019-12-27 02:57:10,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-27 02:57:10,175 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:57:10,176 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] [2019-12-27 02:57:10,176 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:57:10,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:57:10,176 INFO L82 PathProgramCache]: Analyzing trace with hash -141325406, now seen corresponding path program 1 times [2019-12-27 02:57:10,177 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:57:10,177 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633362772] [2019-12-27 02:57:10,177 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:57:10,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:57:10,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:57:10,282 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633362772] [2019-12-27 02:57:10,282 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:57:10,282 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 02:57:10,283 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585618715] [2019-12-27 02:57:10,283 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 02:57:10,283 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:57:10,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 02:57:10,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 02:57:10,284 INFO L87 Difference]: Start difference. First operand 887 states and 1887 transitions. Second operand 7 states. [2019-12-27 02:57:10,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:57:10,498 INFO L93 Difference]: Finished difference Result 1513 states and 3141 transitions. [2019-12-27 02:57:10,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 02:57:10,498 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 51 [2019-12-27 02:57:10,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:57:10,501 INFO L225 Difference]: With dead ends: 1513 [2019-12-27 02:57:10,501 INFO L226 Difference]: Without dead ends: 1013 [2019-12-27 02:57:10,501 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-12-27 02:57:10,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1013 states. [2019-12-27 02:57:10,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1013 to 884. [2019-12-27 02:57:10,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 884 states. [2019-12-27 02:57:10,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 884 states to 884 states and 1862 transitions. [2019-12-27 02:57:10,516 INFO L78 Accepts]: Start accepts. Automaton has 884 states and 1862 transitions. Word has length 51 [2019-12-27 02:57:10,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:57:10,516 INFO L462 AbstractCegarLoop]: Abstraction has 884 states and 1862 transitions. [2019-12-27 02:57:10,517 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 02:57:10,517 INFO L276 IsEmpty]: Start isEmpty. Operand 884 states and 1862 transitions. [2019-12-27 02:57:10,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-27 02:57:10,519 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:57:10,520 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] [2019-12-27 02:57:10,520 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:57:10,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:57:10,520 INFO L82 PathProgramCache]: Analyzing trace with hash 747364532, now seen corresponding path program 2 times [2019-12-27 02:57:10,521 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:57:10,521 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061957575] [2019-12-27 02:57:10,521 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:57:10,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:57:10,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:57:10,593 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061957575] [2019-12-27 02:57:10,593 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:57:10,594 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:57:10,594 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752311485] [2019-12-27 02:57:10,594 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:57:10,594 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:57:10,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:57:10,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:57:10,595 INFO L87 Difference]: Start difference. First operand 884 states and 1862 transitions. Second operand 3 states. [2019-12-27 02:57:10,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:57:10,643 INFO L93 Difference]: Finished difference Result 1119 states and 2343 transitions. [2019-12-27 02:57:10,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:57:10,643 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-12-27 02:57:10,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:57:10,645 INFO L225 Difference]: With dead ends: 1119 [2019-12-27 02:57:10,646 INFO L226 Difference]: Without dead ends: 1119 [2019-12-27 02:57:10,646 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:57:10,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1119 states. [2019-12-27 02:57:10,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1119 to 897. [2019-12-27 02:57:10,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 897 states. [2019-12-27 02:57:10,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 897 states to 897 states and 1904 transitions. [2019-12-27 02:57:10,662 INFO L78 Accepts]: Start accepts. Automaton has 897 states and 1904 transitions. Word has length 51 [2019-12-27 02:57:10,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:57:10,662 INFO L462 AbstractCegarLoop]: Abstraction has 897 states and 1904 transitions. [2019-12-27 02:57:10,662 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:57:10,663 INFO L276 IsEmpty]: Start isEmpty. Operand 897 states and 1904 transitions. [2019-12-27 02:57:10,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 02:57:10,665 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:57:10,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] [2019-12-27 02:57:10,665 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:57:10,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:57:10,666 INFO L82 PathProgramCache]: Analyzing trace with hash 559077404, now seen corresponding path program 1 times [2019-12-27 02:57:10,666 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:57:10,666 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961844069] [2019-12-27 02:57:10,666 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:57:10,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:57:10,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-27 02:57:10,925 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961844069] [2019-12-27 02:57:10,925 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:57:10,925 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 02:57:10,926 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797641114] [2019-12-27 02:57:10,926 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 02:57:10,926 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:57:10,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 02:57:10,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-12-27 02:57:10,927 INFO L87 Difference]: Start difference. First operand 897 states and 1904 transitions. Second operand 11 states. [2019-12-27 02:57:11,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:57:11,969 INFO L93 Difference]: Finished difference Result 1555 states and 3169 transitions. [2019-12-27 02:57:11,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-27 02:57:11,970 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 52 [2019-12-27 02:57:11,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:57:11,973 INFO L225 Difference]: With dead ends: 1555 [2019-12-27 02:57:11,973 INFO L226 Difference]: Without dead ends: 1555 [2019-12-27 02:57:11,974 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2019-12-27 02:57:11,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1555 states. [2019-12-27 02:57:11,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1555 to 1011. [2019-12-27 02:57:11,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1011 states. [2019-12-27 02:57:11,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1011 states to 1011 states and 2124 transitions. [2019-12-27 02:57:11,992 INFO L78 Accepts]: Start accepts. Automaton has 1011 states and 2124 transitions. Word has length 52 [2019-12-27 02:57:11,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:57:11,992 INFO L462 AbstractCegarLoop]: Abstraction has 1011 states and 2124 transitions. [2019-12-27 02:57:11,992 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 02:57:11,992 INFO L276 IsEmpty]: Start isEmpty. Operand 1011 states and 2124 transitions. [2019-12-27 02:57:11,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 02:57:11,995 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:57:11,996 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] [2019-12-27 02:57:11,996 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:57:11,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:57:11,996 INFO L82 PathProgramCache]: Analyzing trace with hash -834145858, now seen corresponding path program 2 times [2019-12-27 02:57:11,997 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:57:11,997 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753061922] [2019-12-27 02:57:11,997 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:57:12,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:57:12,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:57:12,077 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753061922] [2019-12-27 02:57:12,077 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:57:12,077 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:57:12,077 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943239297] [2019-12-27 02:57:12,078 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:57:12,078 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:57:12,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:57:12,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:57:12,079 INFO L87 Difference]: Start difference. First operand 1011 states and 2124 transitions. Second operand 3 states. [2019-12-27 02:57:12,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:57:12,091 INFO L93 Difference]: Finished difference Result 1011 states and 2123 transitions. [2019-12-27 02:57:12,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:57:12,091 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-27 02:57:12,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:57:12,093 INFO L225 Difference]: With dead ends: 1011 [2019-12-27 02:57:12,093 INFO L226 Difference]: Without dead ends: 1011 [2019-12-27 02:57:12,093 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:57:12,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1011 states. [2019-12-27 02:57:12,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1011 to 803. [2019-12-27 02:57:12,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 803 states. [2019-12-27 02:57:12,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 803 states to 803 states and 1726 transitions. [2019-12-27 02:57:12,145 INFO L78 Accepts]: Start accepts. Automaton has 803 states and 1726 transitions. Word has length 52 [2019-12-27 02:57:12,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:57:12,145 INFO L462 AbstractCegarLoop]: Abstraction has 803 states and 1726 transitions. [2019-12-27 02:57:12,145 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:57:12,145 INFO L276 IsEmpty]: Start isEmpty. Operand 803 states and 1726 transitions. [2019-12-27 02:57:12,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 02:57:12,148 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:57:12,148 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] [2019-12-27 02:57:12,148 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:57:12,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:57:12,148 INFO L82 PathProgramCache]: Analyzing trace with hash -288059161, now seen corresponding path program 1 times [2019-12-27 02:57:12,149 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:57:12,149 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008738810] [2019-12-27 02:57:12,149 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:57:12,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 02:57:12,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 02:57:12,252 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 02:57:12,252 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 02:57:12,256 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [771] [771] ULTIMATE.startENTRY-->L792: Formula: (let ((.cse0 (store |v_#valid_59| 0 0))) (and (= 0 v_~y$read_delayed_var~0.base_6) (= 0 v_~y$r_buff1_thd2~0_239) (= 0 v_~y$flush_delayed~0_31) (= v_~main$tmp_guard0~0_30 0) (= v_~x~0_98 0) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1449~0.base_35|) (= |v_#valid_57| (store .cse0 |v_ULTIMATE.start_main_~#t1449~0.base_35| 1)) (= v_~y~0_135 0) (= |v_#NULL.offset_3| 0) (= v_~y$mem_tmp~0_22 0) (= v_~y$r_buff1_thd1~0_110 0) (= 0 |v_ULTIMATE.start_main_~#t1449~0.offset_27|) (= v_~y$r_buff0_thd1~0_187 0) (= 0 v_~__unbuffered_p1_EAX~0_38) (= v_~y$w_buff0_used~0_704 0) (= v_~main$tmp_guard1~0_45 0) (= v_~y$r_buff0_thd0~0_135 0) (= v_~y$r_buff1_thd0~0_153 0) (= v_~y$read_delayed~0_6 0) (= 0 v_~__unbuffered_cnt~0_51) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1449~0.base_35| 4)) (< 0 |v_#StackHeapBarrier_14|) (= 0 v_~y$r_buff0_thd2~0_327) (= 0 v_~weak$$choice0~0_20) (= v_~y$w_buff1_used~0_445 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1449~0.base_35|)) (= 0 |v_#NULL.base_3|) (= v_~weak$$choice2~0_107 0) (= 0 v_~y$read_delayed_var~0.offset_6) (= v_~y$w_buff1~0_286 0) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1449~0.base_35| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1449~0.base_35|) |v_ULTIMATE.start_main_~#t1449~0.offset_27| 0)) |v_#memory_int_15|) (= 0 v_~y$w_buff0~0_484))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_59|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t1450~0.offset=|v_ULTIMATE.start_main_~#t1450~0.offset_15|, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_6, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_704, #NULL.offset=|v_#NULL.offset_3|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_45, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_27|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_39|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_78|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_47|, ~y$read_delayed~0=v_~y$read_delayed~0_6, ULTIMATE.start_main_~#t1449~0.base=|v_ULTIMATE.start_main_~#t1449~0.base_35|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_110, ~y$mem_tmp~0=v_~y$mem_tmp~0_22, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_38, ~y$w_buff0~0=v_~y$w_buff0~0_484, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_187, ~y$flush_delayed~0=v_~y$flush_delayed~0_31, #length=|v_#length_17|, ~y~0=v_~y~0_135, ULTIMATE.start_main_~#t1450~0.base=|v_ULTIMATE.start_main_~#t1450~0.base_17|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_30, #NULL.base=|v_#NULL.base_3|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_239, ~weak$$choice0~0=v_~weak$$choice0~0_20, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_102|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_77|, ~y$w_buff1~0=v_~y$w_buff1~0_286, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_32|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_135, #valid=|v_#valid_57|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_327, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_51, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_20|, ULTIMATE.start_main_~#t1449~0.offset=|v_ULTIMATE.start_main_~#t1449~0.offset_27|, ~weak$$choice2~0=v_~weak$$choice2~0_107, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_153, ~x~0=v_~x~0_98, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_445} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1450~0.offset, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, #NULL.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~y$read_delayed~0, ULTIMATE.start_main_~#t1449~0.base, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~__unbuffered_p1_EAX~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~y~0, ULTIMATE.start_main_~#t1450~0.base, ~main$tmp_guard0~0, #NULL.base, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, ~y$r_buff0_thd2~0, #memory_int, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ULTIMATE.start_main_~#t1449~0.offset, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 02:57:12,258 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] L4-->L736: Formula: (and (= 1 ~x~0_Out-1267687301) (not (= P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-1267687301 0)) (= ~y$r_buff0_thd2~0_In-1267687301 ~y$r_buff1_thd2~0_Out-1267687301) (= 1 ~y$r_buff0_thd1~0_Out-1267687301) (= ~y$r_buff1_thd1~0_Out-1267687301 ~y$r_buff0_thd1~0_In-1267687301) (= ~y$r_buff1_thd0~0_Out-1267687301 ~y$r_buff0_thd0~0_In-1267687301)) InVars {~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1267687301, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1267687301, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1267687301, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-1267687301} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_Out-1267687301, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_Out-1267687301, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1267687301, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out-1267687301, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1267687301, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-1267687301, ~x~0=~x~0_Out-1267687301, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out-1267687301} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff0_thd1~0, ~x~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-27 02:57:12,258 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [734] [734] L792-1-->L794: Formula: (and (= |v_#length_9| (store |v_#length_10| |v_ULTIMATE.start_main_~#t1450~0.base_11| 4)) (= |v_ULTIMATE.start_main_~#t1450~0.offset_10| 0) (= (select |v_#valid_24| |v_ULTIMATE.start_main_~#t1450~0.base_11|) 0) (= (store |v_#memory_int_8| |v_ULTIMATE.start_main_~#t1450~0.base_11| (store (select |v_#memory_int_8| |v_ULTIMATE.start_main_~#t1450~0.base_11|) |v_ULTIMATE.start_main_~#t1450~0.offset_10| 1)) |v_#memory_int_7|) (not (= |v_ULTIMATE.start_main_~#t1450~0.base_11| 0)) (= (store |v_#valid_24| |v_ULTIMATE.start_main_~#t1450~0.base_11| 1) |v_#valid_23|) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t1450~0.base_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_8|, #length=|v_#length_10|} OutVars{ULTIMATE.start_main_~#t1450~0.offset=|v_ULTIMATE.start_main_~#t1450~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_6|, #length=|v_#length_9|, ULTIMATE.start_main_~#t1450~0.base=|v_ULTIMATE.start_main_~#t1450~0.base_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1450~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t1450~0.base] because there is no mapped edge [2019-12-27 02:57:12,261 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L737-->L737-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In2065122796 256))) (.cse0 (= (mod ~y$r_buff0_thd1~0_In2065122796 256) 0))) (or (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In2065122796 |P0Thread1of1ForFork0_#t~ite5_Out2065122796|)) (and (not .cse1) (not .cse0) (= 0 |P0Thread1of1ForFork0_#t~ite5_Out2065122796|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In2065122796, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In2065122796} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out2065122796|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2065122796, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In2065122796} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-27 02:57:12,262 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L758-->L758-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In-657117839 256) 0))) (or (and (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In-657117839 256) 0))) (or (and .cse0 (= (mod ~y$w_buff1_used~0_In-657117839 256) 0)) (and .cse0 (= 0 (mod ~y$r_buff1_thd2~0_In-657117839 256))) (= 0 (mod ~y$w_buff0_used~0_In-657117839 256)))) .cse1 (= |P1Thread1of1ForFork1_#t~ite15_Out-657117839| |P1Thread1of1ForFork1_#t~ite14_Out-657117839|) (= ~y$w_buff0~0_In-657117839 |P1Thread1of1ForFork1_#t~ite14_Out-657117839|)) (and (= |P1Thread1of1ForFork1_#t~ite15_Out-657117839| ~y$w_buff0~0_In-657117839) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite14_In-657117839| |P1Thread1of1ForFork1_#t~ite14_Out-657117839|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-657117839, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-657117839, ~y$w_buff0~0=~y$w_buff0~0_In-657117839, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-657117839, ~weak$$choice2~0=~weak$$choice2~0_In-657117839, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_In-657117839|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-657117839} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-657117839, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-657117839, ~y$w_buff0~0=~y$w_buff0~0_In-657117839, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-657117839, P1Thread1of1ForFork1_#t~ite15=|P1Thread1of1ForFork1_#t~ite15_Out-657117839|, ~weak$$choice2~0=~weak$$choice2~0_In-657117839, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out-657117839|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-657117839} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite15, P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-27 02:57:12,264 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L760-->L760-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In1809798397 256)))) (or (and (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In1809798397 256) 0))) (or (= 0 (mod ~y$w_buff0_used~0_In1809798397 256)) (and (= (mod ~y$r_buff1_thd2~0_In1809798397 256) 0) .cse0) (and (= (mod ~y$w_buff1_used~0_In1809798397 256) 0) .cse0))) (= |P1Thread1of1ForFork1_#t~ite21_Out1809798397| |P1Thread1of1ForFork1_#t~ite20_Out1809798397|) .cse1 (= ~y$w_buff0_used~0_In1809798397 |P1Thread1of1ForFork1_#t~ite20_Out1809798397|)) (and (= |P1Thread1of1ForFork1_#t~ite21_Out1809798397| ~y$w_buff0_used~0_In1809798397) (= |P1Thread1of1ForFork1_#t~ite20_In1809798397| |P1Thread1of1ForFork1_#t~ite20_Out1809798397|) (not .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1809798397, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1809798397, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_In1809798397|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1809798397, ~weak$$choice2~0=~weak$$choice2~0_In1809798397, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1809798397} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1809798397, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1809798397, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_Out1809798397|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1809798397, P1Thread1of1ForFork1_#t~ite21=|P1Thread1of1ForFork1_#t~ite21_Out1809798397|, ~weak$$choice2~0=~weak$$choice2~0_In1809798397, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1809798397} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite20, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-27 02:57:12,266 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [653] [653] L762-->L763: Formula: (and (not (= (mod v_~weak$$choice2~0_18 256) 0)) (= v_~y$r_buff0_thd2~0_68 v_~y$r_buff0_thd2~0_67)) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_68, ~weak$$choice2~0=v_~weak$$choice2~0_18} OutVars{~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_67, P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_7|, ~weak$$choice2~0=v_~weak$$choice2~0_18, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_13|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_7|} AuxVars[] AssignedVars[~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite27, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26] because there is no mapped edge [2019-12-27 02:57:12,266 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L763-->L763-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1493246481 256)))) (or (and (= ~y$r_buff1_thd2~0_In1493246481 |P1Thread1of1ForFork1_#t~ite29_Out1493246481|) .cse0 (= |P1Thread1of1ForFork1_#t~ite30_Out1493246481| |P1Thread1of1ForFork1_#t~ite29_Out1493246481|) (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In1493246481 256)))) (or (and (= 0 (mod ~y$r_buff1_thd2~0_In1493246481 256)) .cse1) (and .cse1 (= 0 (mod ~y$w_buff1_used~0_In1493246481 256))) (= (mod ~y$w_buff0_used~0_In1493246481 256) 0)))) (and (= ~y$r_buff1_thd2~0_In1493246481 |P1Thread1of1ForFork1_#t~ite30_Out1493246481|) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite29_In1493246481| |P1Thread1of1ForFork1_#t~ite29_Out1493246481|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1493246481, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In1493246481|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1493246481, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1493246481, ~weak$$choice2~0=~weak$$choice2~0_In1493246481, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1493246481} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1493246481, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out1493246481|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out1493246481|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1493246481, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1493246481, ~weak$$choice2~0=~weak$$choice2~0_In1493246481, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1493246481} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-12-27 02:57:12,267 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [660] [660] L765-->L769: Formula: (and (= 0 v_~y$flush_delayed~0_8) (= v_~y~0_24 v_~y$mem_tmp~0_6) (not (= 0 (mod v_~y$flush_delayed~0_9 256)))) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_6, ~y$flush_delayed~0=v_~y$flush_delayed~0_9} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_6, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_7|, ~y$flush_delayed~0=v_~y$flush_delayed~0_8, ~y~0=v_~y~0_24} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31, ~y$flush_delayed~0, ~y~0] because there is no mapped edge [2019-12-27 02:57:12,268 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L769-2-->L769-5: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff1_thd2~0_In550775004 256))) (.cse0 (= (mod ~y$w_buff1_used~0_In550775004 256) 0)) (.cse2 (= |P1Thread1of1ForFork1_#t~ite33_Out550775004| |P1Thread1of1ForFork1_#t~ite32_Out550775004|))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite32_Out550775004| ~y~0_In550775004) .cse2) (and (not .cse1) (not .cse0) .cse2 (= |P1Thread1of1ForFork1_#t~ite32_Out550775004| ~y$w_buff1~0_In550775004)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In550775004, ~y$w_buff1~0=~y$w_buff1~0_In550775004, ~y~0=~y~0_In550775004, ~y$w_buff1_used~0=~y$w_buff1_used~0_In550775004} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In550775004, ~y$w_buff1~0=~y$w_buff1~0_In550775004, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out550775004|, P1Thread1of1ForFork1_#t~ite33=|P1Thread1of1ForFork1_#t~ite33_Out550775004|, ~y~0=~y~0_In550775004, ~y$w_buff1_used~0=~y$w_buff1_used~0_In550775004} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33] because there is no mapped edge [2019-12-27 02:57:12,268 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L770-->L770-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-846187184 256))) (.cse0 (= (mod ~y$r_buff0_thd2~0_In-846187184 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite34_Out-846187184| ~y$w_buff0_used~0_In-846187184) (or .cse0 .cse1)) (and (= |P1Thread1of1ForFork1_#t~ite34_Out-846187184| 0) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-846187184, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-846187184} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-846187184, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-846187184, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out-846187184|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-27 02:57:12,269 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L771-->L771-2: Formula: (let ((.cse0 (= (mod ~y$w_buff1_used~0_In-1122650421 256) 0)) (.cse1 (= 0 (mod ~y$r_buff1_thd2~0_In-1122650421 256))) (.cse2 (= (mod ~y$r_buff0_thd2~0_In-1122650421 256) 0)) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In-1122650421 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite35_Out-1122650421|)) (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$w_buff1_used~0_In-1122650421 |P1Thread1of1ForFork1_#t~ite35_Out-1122650421|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1122650421, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1122650421, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1122650421, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1122650421} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1122650421, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1122650421, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1122650421, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out-1122650421|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1122650421} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-27 02:57:12,270 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L772-->L772-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-2090957103 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-2090957103 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite36_Out-2090957103| ~y$r_buff0_thd2~0_In-2090957103)) (and (= 0 |P1Thread1of1ForFork1_#t~ite36_Out-2090957103|) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2090957103, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2090957103} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-2090957103, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2090957103, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out-2090957103|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-27 02:57:12,270 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L773-->L773-2: Formula: (let ((.cse3 (= (mod ~y$w_buff1_used~0_In-1580695497 256) 0)) (.cse2 (= (mod ~y$r_buff1_thd2~0_In-1580695497 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-1580695497 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1580695497 256)))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite37_Out-1580695497|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= ~y$r_buff1_thd2~0_In-1580695497 |P1Thread1of1ForFork1_#t~ite37_Out-1580695497|) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1580695497, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1580695497, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1580695497, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1580695497} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1580695497, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1580695497, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1580695497, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out-1580695497|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1580695497} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-27 02:57:12,271 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [738] [738] L773-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~y$r_buff1_thd2~0_151 |v_P1Thread1of1ForFork1_#t~ite37_32|) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_40 1) v_~__unbuffered_cnt~0_39)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_32|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_151, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_31|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-27 02:57:12,271 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L738-->L738-2: Formula: (let ((.cse2 (= (mod ~y$r_buff0_thd1~0_In65996921 256) 0)) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In65996921 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd1~0_In65996921 256))) (.cse1 (= (mod ~y$w_buff1_used~0_In65996921 256) 0))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite6_Out65996921| ~y$w_buff1_used~0_In65996921) (or .cse2 .cse3)) (and (= |P0Thread1of1ForFork0_#t~ite6_Out65996921| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In65996921, ~y$w_buff0_used~0=~y$w_buff0_used~0_In65996921, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In65996921, ~y$w_buff1_used~0=~y$w_buff1_used~0_In65996921} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out65996921|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In65996921, ~y$w_buff0_used~0=~y$w_buff0_used~0_In65996921, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In65996921, ~y$w_buff1_used~0=~y$w_buff1_used~0_In65996921} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-27 02:57:12,271 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L739-->L740: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd1~0_In947085904 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In947085904 256)))) (or (and (not .cse0) (not .cse1) (= ~y$r_buff0_thd1~0_Out947085904 0)) (and (or .cse1 .cse0) (= ~y$r_buff0_thd1~0_Out947085904 ~y$r_buff0_thd1~0_In947085904)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In947085904, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In947085904} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In947085904, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out947085904|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out947085904} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 02:57:12,272 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L740-->L740-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In-244078989 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd1~0_In-244078989 256))) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In-244078989 256))) (.cse2 (= 0 (mod ~y$r_buff0_thd1~0_In-244078989 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P0Thread1of1ForFork0_#t~ite8_Out-244078989| ~y$r_buff1_thd1~0_In-244078989)) (and (= |P0Thread1of1ForFork0_#t~ite8_Out-244078989| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-244078989, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-244078989, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-244078989, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-244078989} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-244078989, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-244078989, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-244078989|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-244078989, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-244078989} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 02:57:12,272 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [728] [728] L740-2-->P0EXIT: Formula: (and (= v_~__unbuffered_cnt~0_32 (+ v_~__unbuffered_cnt~0_33 1)) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= v_~y$r_buff1_thd1~0_50 |v_P0Thread1of1ForFork0_#t~ite8_28|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_33} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_50, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_27|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_32} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-27 02:57:12,273 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [681] [681] L798-->L800-2: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_6 256))) (or (= 0 (mod v_~y$w_buff0_used~0_276 256)) (= (mod v_~y$r_buff0_thd0~0_50 256) 0))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_276, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_50, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_276, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_50, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-27 02:57:12,273 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L800-2-->L800-5: Formula: (let ((.cse0 (= |ULTIMATE.start_main_#t~ite41_Out2147230897| |ULTIMATE.start_main_#t~ite40_Out2147230897|)) (.cse1 (= (mod ~y$w_buff1_used~0_In2147230897 256) 0)) (.cse2 (= (mod ~y$r_buff1_thd0~0_In2147230897 256) 0))) (or (and .cse0 (not .cse1) (= |ULTIMATE.start_main_#t~ite40_Out2147230897| ~y$w_buff1~0_In2147230897) (not .cse2)) (and .cse0 (or .cse1 .cse2) (= |ULTIMATE.start_main_#t~ite40_Out2147230897| ~y~0_In2147230897)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In2147230897, ~y~0=~y~0_In2147230897, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In2147230897, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2147230897} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out2147230897|, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out2147230897|, ~y$w_buff1~0=~y$w_buff1~0_In2147230897, ~y~0=~y~0_In2147230897, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In2147230897, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2147230897} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-27 02:57:12,274 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L801-->L801-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In2088314378 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In2088314378 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite42_Out2088314378|)) (and (= ~y$w_buff0_used~0_In2088314378 |ULTIMATE.start_main_#t~ite42_Out2088314378|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In2088314378, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2088314378} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In2088314378, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2088314378, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out2088314378|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-27 02:57:12,274 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L802-->L802-2: Formula: (let ((.cse0 (= (mod ~y$r_buff1_thd0~0_In-986131640 256) 0)) (.cse1 (= (mod ~y$w_buff1_used~0_In-986131640 256) 0)) (.cse2 (= (mod ~y$r_buff0_thd0~0_In-986131640 256) 0)) (.cse3 (= (mod ~y$w_buff0_used~0_In-986131640 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite43_Out-986131640| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite43_Out-986131640| ~y$w_buff1_used~0_In-986131640)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-986131640, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-986131640, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-986131640, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-986131640} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-986131640, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-986131640, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-986131640|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-986131640, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-986131640} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-27 02:57:12,275 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L803-->L803-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In1456357570 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In1456357570 256) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite44_Out1456357570| 0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite44_Out1456357570| ~y$r_buff0_thd0~0_In1456357570) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1456357570, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1456357570} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1456357570, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1456357570, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out1456357570|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-27 02:57:12,276 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L804-->L804-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In-178459319 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In-178459319 256) 0)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In-178459319 256))) (.cse3 (= 0 (mod ~y$r_buff1_thd0~0_In-178459319 256)))) (or (and (= |ULTIMATE.start_main_#t~ite45_Out-178459319| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |ULTIMATE.start_main_#t~ite45_Out-178459319| ~y$r_buff1_thd0~0_In-178459319) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-178459319, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-178459319, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-178459319, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-178459319} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-178459319, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-178459319, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-178459319, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-178459319|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-178459319} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-27 02:57:12,276 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] L804-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_16 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_19 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|) (= v_~y$r_buff1_thd0~0_104 |v_ULTIMATE.start_main_#t~ite45_33|) (= 0 v_~__unbuffered_p1_EAX~0_18) (= v_~x~0_61 2) (= v_ULTIMATE.start___VERIFIER_assert_~expression_19 0)) InVars {~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_18, ~x~0=v_~x~0_61, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_33|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_19, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_18, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_16, ~x~0=v_~x~0_61, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_104, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_32|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 02:57:12,359 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 02:57:12 BasicIcfg [2019-12-27 02:57:12,359 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 02:57:12,361 INFO L168 Benchmark]: Toolchain (without parser) took 16459.02 ms. Allocated memory was 134.7 MB in the beginning and 681.6 MB in the end (delta: 546.8 MB). Free memory was 97.2 MB in the beginning and 528.0 MB in the end (delta: -430.8 MB). Peak memory consumption was 116.1 MB. Max. memory is 7.1 GB. [2019-12-27 02:57:12,361 INFO L168 Benchmark]: CDTParser took 0.45 ms. Allocated memory is still 134.7 MB. Free memory was 117.9 MB in the beginning and 117.7 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2019-12-27 02:57:12,362 INFO L168 Benchmark]: CACSL2BoogieTranslator took 729.61 ms. Allocated memory was 134.7 MB in the beginning and 198.7 MB in the end (delta: 64.0 MB). Free memory was 96.8 MB in the beginning and 153.0 MB in the end (delta: -56.2 MB). Peak memory consumption was 24.5 MB. Max. memory is 7.1 GB. [2019-12-27 02:57:12,363 INFO L168 Benchmark]: Boogie Procedure Inliner took 85.84 ms. Allocated memory is still 198.7 MB. Free memory was 153.0 MB in the beginning and 150.1 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. [2019-12-27 02:57:12,364 INFO L168 Benchmark]: Boogie Preprocessor took 41.62 ms. Allocated memory is still 198.7 MB. Free memory was 150.1 MB in the beginning and 148.0 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 7.1 GB. [2019-12-27 02:57:12,364 INFO L168 Benchmark]: RCFGBuilder took 806.52 ms. Allocated memory is still 198.7 MB. Free memory was 148.0 MB in the beginning and 103.9 MB in the end (delta: 44.1 MB). Peak memory consumption was 44.1 MB. Max. memory is 7.1 GB. [2019-12-27 02:57:12,365 INFO L168 Benchmark]: TraceAbstraction took 14788.11 ms. Allocated memory was 198.7 MB in the beginning and 681.6 MB in the end (delta: 482.9 MB). Free memory was 103.1 MB in the beginning and 528.0 MB in the end (delta: -424.8 MB). Peak memory consumption was 58.0 MB. Max. memory is 7.1 GB. [2019-12-27 02:57:12,369 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.45 ms. Allocated memory is still 134.7 MB. Free memory was 117.9 MB in the beginning and 117.7 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 729.61 ms. Allocated memory was 134.7 MB in the beginning and 198.7 MB in the end (delta: 64.0 MB). Free memory was 96.8 MB in the beginning and 153.0 MB in the end (delta: -56.2 MB). Peak memory consumption was 24.5 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 85.84 ms. Allocated memory is still 198.7 MB. Free memory was 153.0 MB in the beginning and 150.1 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 41.62 ms. Allocated memory is still 198.7 MB. Free memory was 150.1 MB in the beginning and 148.0 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 806.52 ms. Allocated memory is still 198.7 MB. Free memory was 148.0 MB in the beginning and 103.9 MB in the end (delta: 44.1 MB). Peak memory consumption was 44.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 14788.11 ms. Allocated memory was 198.7 MB in the beginning and 681.6 MB in the end (delta: 482.9 MB). Free memory was 103.1 MB in the beginning and 528.0 MB in the end (delta: -424.8 MB). Peak memory consumption was 58.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.7s, 146 ProgramPointsBefore, 75 ProgramPointsAfterwards, 180 TransitionsBefore, 85 TransitionsAfterwards, 12056 CoEnabledTransitionPairs, 12 FixpointIterations, 28 TrivialSequentialCompositions, 51 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 30 ConcurrentYvCompositions, 27 ChoiceCompositions, 4902 VarBasedMoverChecksPositive, 321 VarBasedMoverChecksNegative, 236 SemBasedMoverChecksPositive, 194 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.8s, 0 MoverChecksTotal, 74785 CheckedPairsTotal, 109 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L792] FCALL, FORK 0 pthread_create(&t1449, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L722] 1 y$w_buff1 = y$w_buff0 [L723] 1 y$w_buff0 = 1 [L724] 1 y$w_buff1_used = y$w_buff0_used [L725] 1 y$w_buff0_used = (_Bool)1 [L736] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L794] FCALL, FORK 0 pthread_create(&t1450, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L750] 2 x = 2 [L753] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L754] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L755] 2 y$flush_delayed = weak$$choice2 [L756] 2 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L757] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L736] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L757] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L758] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L759] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L759] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L737] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L760] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L761] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L761] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L763] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L764] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L769] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L769] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L770] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L771] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L772] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L738] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L796] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L800] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L801] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L802] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L803] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 140 locations, 2 error locations. Result: UNSAFE, OverallTime: 14.4s, OverallIterations: 15, TraceHistogramMax: 1, AutomataDifference: 4.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1581 SDtfs, 1552 SDslu, 2968 SDs, 0 SdLazy, 2094 SolverSat, 96 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 85 GetRequests, 18 SyntacticMatches, 9 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=11886occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.0s AutomataMinimizationTime, 14 MinimizatonAttempts, 6693 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 468 NumberOfCodeBlocks, 468 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 401 ConstructedInterpolants, 0 QuantifiedInterpolants, 51389 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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...