/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/rfi004_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 14:10:29,540 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 14:10:29,543 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 14:10:29,561 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 14:10:29,562 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 14:10:29,564 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 14:10:29,566 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 14:10:29,575 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 14:10:29,579 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 14:10:29,583 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 14:10:29,585 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 14:10:29,587 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 14:10:29,587 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 14:10:29,589 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 14:10:29,591 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 14:10:29,593 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 14:10:29,595 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 14:10:29,595 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 14:10:29,597 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 14:10:29,602 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 14:10:29,607 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 14:10:29,610 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 14:10:29,611 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 14:10:29,612 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 14:10:29,614 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 14:10:29,614 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 14:10:29,614 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 14:10:29,615 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 14:10:29,616 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 14:10:29,617 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 14:10:29,617 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 14:10:29,618 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 14:10:29,618 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 14:10:29,619 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 14:10:29,620 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 14:10:29,620 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 14:10:29,621 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 14:10:29,621 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 14:10:29,621 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 14:10:29,622 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 14:10:29,623 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 14:10:29,624 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-18 14:10:29,638 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 14:10:29,638 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 14:10:29,639 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 14:10:29,639 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 14:10:29,640 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 14:10:29,640 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 14:10:29,640 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 14:10:29,640 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 14:10:29,640 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 14:10:29,641 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 14:10:29,641 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 14:10:29,641 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 14:10:29,641 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 14:10:29,641 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 14:10:29,642 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 14:10:29,642 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 14:10:29,642 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 14:10:29,642 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 14:10:29,642 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 14:10:29,643 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 14:10:29,643 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 14:10:29,643 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 14:10:29,643 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 14:10:29,643 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 14:10:29,644 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 14:10:29,644 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 14:10:29,644 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 14:10:29,644 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 14:10:29,644 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-18 14:10:29,645 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 14:10:29,922 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 14:10:29,937 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 14:10:29,941 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 14:10:29,942 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 14:10:29,943 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 14:10:29,944 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi004_power.oepc.i [2019-12-18 14:10:30,018 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ee1e506d3/5c385fca24da4645a7a6b1616ee7a793/FLAG201f82d9f [2019-12-18 14:10:30,607 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 14:10:30,607 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi004_power.oepc.i [2019-12-18 14:10:30,630 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ee1e506d3/5c385fca24da4645a7a6b1616ee7a793/FLAG201f82d9f [2019-12-18 14:10:30,892 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ee1e506d3/5c385fca24da4645a7a6b1616ee7a793 [2019-12-18 14:10:30,901 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 14:10:30,903 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 14:10:30,904 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 14:10:30,904 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 14:10:30,908 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 14:10:30,909 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 02:10:30" (1/1) ... [2019-12-18 14:10:30,912 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e73aeb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:10:30, skipping insertion in model container [2019-12-18 14:10:30,912 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 02:10:30" (1/1) ... [2019-12-18 14:10:30,920 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 14:10:30,963 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 14:10:31,428 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 14:10:31,440 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 14:10:31,527 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 14:10:31,597 INFO L208 MainTranslator]: Completed translation [2019-12-18 14:10:31,597 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:10:31 WrapperNode [2019-12-18 14:10:31,597 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 14:10:31,598 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 14:10:31,598 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 14:10:31,599 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 14:10:31,608 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:10:31" (1/1) ... [2019-12-18 14:10:31,629 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:10:31" (1/1) ... [2019-12-18 14:10:31,677 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 14:10:31,678 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 14:10:31,678 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 14:10:31,678 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 14:10:31,691 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:10:31" (1/1) ... [2019-12-18 14:10:31,691 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:10:31" (1/1) ... [2019-12-18 14:10:31,708 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:10:31" (1/1) ... [2019-12-18 14:10:31,709 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:10:31" (1/1) ... [2019-12-18 14:10:31,725 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:10:31" (1/1) ... [2019-12-18 14:10:31,730 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:10:31" (1/1) ... [2019-12-18 14:10:31,735 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:10:31" (1/1) ... [2019-12-18 14:10:31,739 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 14:10:31,746 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 14:10:31,747 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 14:10:31,747 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 14:10:31,748 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:10:31" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 14:10:31,807 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 14:10:31,807 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 14:10:31,808 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 14:10:31,808 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 14:10:31,809 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 14:10:31,809 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 14:10:31,810 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 14:10:31,810 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 14:10:31,810 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 14:10:31,810 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 14:10:31,810 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 14:10:31,812 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 14:10:32,487 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 14:10:32,488 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 14:10:32,489 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 02:10:32 BoogieIcfgContainer [2019-12-18 14:10:32,489 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 14:10:32,490 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 14:10:32,491 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 14:10:32,494 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 14:10:32,494 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 02:10:30" (1/3) ... [2019-12-18 14:10:32,495 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6103e7aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 02:10:32, skipping insertion in model container [2019-12-18 14:10:32,495 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:10:31" (2/3) ... [2019-12-18 14:10:32,496 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6103e7aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 02:10:32, skipping insertion in model container [2019-12-18 14:10:32,496 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 02:10:32" (3/3) ... [2019-12-18 14:10:32,498 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi004_power.oepc.i [2019-12-18 14:10:32,509 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 14:10:32,510 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 14:10:32,518 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 14:10:32,519 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 14:10:32,558 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:32,559 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:32,559 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:32,559 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:32,560 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:32,560 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:32,560 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:32,560 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:32,561 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:32,561 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:32,562 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:32,562 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:32,562 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:32,562 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:32,563 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:32,563 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:32,563 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:32,564 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:32,564 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:32,564 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:32,564 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:32,565 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:32,565 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:32,566 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:32,566 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:32,566 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:32,566 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:32,567 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:32,567 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:32,567 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:32,567 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:32,568 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:32,568 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:32,568 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:32,568 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:32,569 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:32,569 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:32,569 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:32,570 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:32,570 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:32,570 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:32,570 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:32,571 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:32,571 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:32,571 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:32,571 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:32,572 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:32,572 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:32,572 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:32,573 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:32,573 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:32,573 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:32,573 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:32,574 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:32,574 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:32,574 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:32,574 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:32,575 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:32,575 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:32,575 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:32,575 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:32,576 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:32,576 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:32,576 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:32,577 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:32,577 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:32,577 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:32,577 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:32,578 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:32,578 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:32,578 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:32,579 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:32,579 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:32,579 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:32,579 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:32,580 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:32,580 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:32,580 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:32,580 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:32,581 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:32,581 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:32,581 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:32,582 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:32,582 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:32,582 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:32,582 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:32,583 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:32,583 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:32,583 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:32,583 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:32,584 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:32,584 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:32,584 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:32,584 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:32,585 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:32,586 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:32,586 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:32,586 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:32,586 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:32,586 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:32,587 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:32,587 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:32,588 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:32,588 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:32,588 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:32,588 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:32,589 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:32,589 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:32,589 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:32,590 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:32,590 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:32,590 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:32,590 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:32,591 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:32,591 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:32,591 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:32,592 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:32,592 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:32,592 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:32,592 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:32,593 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:32,593 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:32,593 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:32,593 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:32,594 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:32,594 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:32,594 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:32,594 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:32,598 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:32,599 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:32,599 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:32,599 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:32,599 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:32,600 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:32,600 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:32,600 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:32,600 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:32,601 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:32,601 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:32,601 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:32,604 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:32,605 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:32,605 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:32,605 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:32,606 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:32,606 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:32,606 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:32,606 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:32,607 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:32,607 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:32,607 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:32,607 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:32,607 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:32,608 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:32,608 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:32,608 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:32,608 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:32,609 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:32,609 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:32,609 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:32,609 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:32,609 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:32,610 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:32,610 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:32,610 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:32,610 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:32,611 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:32,642 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-18 14:10:32,663 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 14:10:32,663 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 14:10:32,663 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 14:10:32,663 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 14:10:32,663 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 14:10:32,664 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 14:10:32,664 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 14:10:32,664 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 14:10:32,682 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 137 places, 165 transitions [2019-12-18 14:10:32,684 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 137 places, 165 transitions [2019-12-18 14:10:32,769 INFO L126 PetriNetUnfolder]: 35/163 cut-off events. [2019-12-18 14:10:32,769 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 14:10:32,785 INFO L76 FinitePrefix]: Finished finitePrefix Result has 170 conditions, 163 events. 35/163 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 339 event pairs. 6/132 useless extension candidates. Maximal degree in co-relation 132. Up to 2 conditions per place. [2019-12-18 14:10:32,803 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 137 places, 165 transitions [2019-12-18 14:10:32,838 INFO L126 PetriNetUnfolder]: 35/163 cut-off events. [2019-12-18 14:10:32,838 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 14:10:32,843 INFO L76 FinitePrefix]: Finished finitePrefix Result has 170 conditions, 163 events. 35/163 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 339 event pairs. 6/132 useless extension candidates. Maximal degree in co-relation 132. Up to 2 conditions per place. [2019-12-18 14:10:32,856 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 10216 [2019-12-18 14:10:32,857 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 14:10:37,359 WARN L192 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2019-12-18 14:10:37,487 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-12-18 14:10:37,584 INFO L206 etLargeBlockEncoding]: Checked pairs total: 39043 [2019-12-18 14:10:37,585 INFO L214 etLargeBlockEncoding]: Total number of compositions: 99 [2019-12-18 14:10:37,589 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 67 places, 78 transitions [2019-12-18 14:10:38,024 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 6812 states. [2019-12-18 14:10:38,026 INFO L276 IsEmpty]: Start isEmpty. Operand 6812 states. [2019-12-18 14:10:38,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-18 14:10:38,034 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:10:38,035 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-18 14:10:38,035 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:10:38,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:10:38,042 INFO L82 PathProgramCache]: Analyzing trace with hash 679696961, now seen corresponding path program 1 times [2019-12-18 14:10:38,051 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:10:38,052 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701977903] [2019-12-18 14:10:38,053 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:10:38,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:10:38,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:10:38,397 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701977903] [2019-12-18 14:10:38,398 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:10:38,398 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 14:10:38,400 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875386860] [2019-12-18 14:10:38,408 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:10:38,408 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:10:38,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:10:38,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:10:38,432 INFO L87 Difference]: Start difference. First operand 6812 states. Second operand 3 states. [2019-12-18 14:10:38,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:10:38,690 INFO L93 Difference]: Finished difference Result 6636 states and 22229 transitions. [2019-12-18 14:10:38,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:10:38,692 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-18 14:10:38,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:10:38,811 INFO L225 Difference]: With dead ends: 6636 [2019-12-18 14:10:38,812 INFO L226 Difference]: Without dead ends: 6246 [2019-12-18 14:10:38,813 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:10:38,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6246 states. [2019-12-18 14:10:39,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6246 to 6246. [2019-12-18 14:10:39,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6246 states. [2019-12-18 14:10:39,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6246 states to 6246 states and 20886 transitions. [2019-12-18 14:10:39,277 INFO L78 Accepts]: Start accepts. Automaton has 6246 states and 20886 transitions. Word has length 5 [2019-12-18 14:10:39,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:10:39,277 INFO L462 AbstractCegarLoop]: Abstraction has 6246 states and 20886 transitions. [2019-12-18 14:10:39,277 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:10:39,278 INFO L276 IsEmpty]: Start isEmpty. Operand 6246 states and 20886 transitions. [2019-12-18 14:10:39,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 14:10:39,291 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:10:39,292 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:10:39,293 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:10:39,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:10:39,298 INFO L82 PathProgramCache]: Analyzing trace with hash -113641298, now seen corresponding path program 1 times [2019-12-18 14:10:39,298 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:10:39,299 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424538378] [2019-12-18 14:10:39,299 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:10:39,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:10:39,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:10:39,416 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424538378] [2019-12-18 14:10:39,417 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:10:39,417 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:10:39,417 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471244491] [2019-12-18 14:10:39,419 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 14:10:39,419 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:10:39,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 14:10:39,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 14:10:39,419 INFO L87 Difference]: Start difference. First operand 6246 states and 20886 transitions. Second operand 4 states. [2019-12-18 14:10:39,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:10:39,743 INFO L93 Difference]: Finished difference Result 9424 states and 30254 transitions. [2019-12-18 14:10:39,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 14:10:39,744 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 14:10:39,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:10:39,809 INFO L225 Difference]: With dead ends: 9424 [2019-12-18 14:10:39,809 INFO L226 Difference]: Without dead ends: 9411 [2019-12-18 14:10:39,810 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:10:39,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9411 states. [2019-12-18 14:10:40,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9411 to 8307. [2019-12-18 14:10:40,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8307 states. [2019-12-18 14:10:40,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8307 states to 8307 states and 27132 transitions. [2019-12-18 14:10:40,161 INFO L78 Accepts]: Start accepts. Automaton has 8307 states and 27132 transitions. Word has length 11 [2019-12-18 14:10:40,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:10:40,162 INFO L462 AbstractCegarLoop]: Abstraction has 8307 states and 27132 transitions. [2019-12-18 14:10:40,162 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 14:10:40,162 INFO L276 IsEmpty]: Start isEmpty. Operand 8307 states and 27132 transitions. [2019-12-18 14:10:40,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 14:10:40,262 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:10:40,262 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:10:40,263 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:10:40,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:10:40,263 INFO L82 PathProgramCache]: Analyzing trace with hash 711580898, now seen corresponding path program 1 times [2019-12-18 14:10:40,263 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:10:40,263 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909018910] [2019-12-18 14:10:40,264 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:10:40,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:10:40,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:10:40,335 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909018910] [2019-12-18 14:10:40,335 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:10:40,336 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 14:10:40,336 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931943057] [2019-12-18 14:10:40,336 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:10:40,337 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:10:40,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:10:40,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:10:40,338 INFO L87 Difference]: Start difference. First operand 8307 states and 27132 transitions. Second operand 3 states. [2019-12-18 14:10:40,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:10:40,471 INFO L93 Difference]: Finished difference Result 11392 states and 37048 transitions. [2019-12-18 14:10:40,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:10:40,471 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-12-18 14:10:40,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:10:40,514 INFO L225 Difference]: With dead ends: 11392 [2019-12-18 14:10:40,515 INFO L226 Difference]: Without dead ends: 11392 [2019-12-18 14:10:40,515 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:10:40,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11392 states. [2019-12-18 14:10:40,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11392 to 10440. [2019-12-18 14:10:40,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10440 states. [2019-12-18 14:10:40,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10440 states to 10440 states and 34208 transitions. [2019-12-18 14:10:40,864 INFO L78 Accepts]: Start accepts. Automaton has 10440 states and 34208 transitions. Word has length 14 [2019-12-18 14:10:40,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:10:40,865 INFO L462 AbstractCegarLoop]: Abstraction has 10440 states and 34208 transitions. [2019-12-18 14:10:40,865 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:10:40,865 INFO L276 IsEmpty]: Start isEmpty. Operand 10440 states and 34208 transitions. [2019-12-18 14:10:40,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 14:10:40,868 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:10:40,869 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:10:40,869 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:10:40,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:10:40,869 INFO L82 PathProgramCache]: Analyzing trace with hash 798779155, now seen corresponding path program 1 times [2019-12-18 14:10:40,870 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:10:40,870 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211417635] [2019-12-18 14:10:40,870 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:10:40,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:10:40,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:10:40,921 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211417635] [2019-12-18 14:10:40,921 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:10:40,921 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:10:40,921 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888047727] [2019-12-18 14:10:40,921 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 14:10:40,922 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:10:40,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 14:10:40,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 14:10:40,922 INFO L87 Difference]: Start difference. First operand 10440 states and 34208 transitions. Second operand 4 states. [2019-12-18 14:10:41,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:10:41,700 INFO L93 Difference]: Finished difference Result 12648 states and 40515 transitions. [2019-12-18 14:10:41,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 14:10:41,700 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-18 14:10:41,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:10:41,739 INFO L225 Difference]: With dead ends: 12648 [2019-12-18 14:10:41,739 INFO L226 Difference]: Without dead ends: 12637 [2019-12-18 14:10:41,739 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:10:41,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12637 states. [2019-12-18 14:10:42,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12637 to 11272. [2019-12-18 14:10:42,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11272 states. [2019-12-18 14:10:42,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11272 states to 11272 states and 36643 transitions. [2019-12-18 14:10:42,102 INFO L78 Accepts]: Start accepts. Automaton has 11272 states and 36643 transitions. Word has length 14 [2019-12-18 14:10:42,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:10:42,102 INFO L462 AbstractCegarLoop]: Abstraction has 11272 states and 36643 transitions. [2019-12-18 14:10:42,103 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 14:10:42,103 INFO L276 IsEmpty]: Start isEmpty. Operand 11272 states and 36643 transitions. [2019-12-18 14:10:42,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 14:10:42,106 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:10:42,106 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:10:42,106 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:10:42,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:10:42,107 INFO L82 PathProgramCache]: Analyzing trace with hash -564373810, now seen corresponding path program 1 times [2019-12-18 14:10:42,107 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:10:42,108 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417784879] [2019-12-18 14:10:42,108 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:10:42,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:10:42,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:10:42,186 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417784879] [2019-12-18 14:10:42,187 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:10:42,187 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:10:42,188 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676416552] [2019-12-18 14:10:42,188 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 14:10:42,188 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:10:42,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 14:10:42,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 14:10:42,189 INFO L87 Difference]: Start difference. First operand 11272 states and 36643 transitions. Second operand 4 states. [2019-12-18 14:10:42,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:10:42,418 INFO L93 Difference]: Finished difference Result 13620 states and 43661 transitions. [2019-12-18 14:10:42,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 14:10:42,422 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-18 14:10:42,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:10:42,565 INFO L225 Difference]: With dead ends: 13620 [2019-12-18 14:10:42,566 INFO L226 Difference]: Without dead ends: 13607 [2019-12-18 14:10:42,566 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:10:42,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13607 states. [2019-12-18 14:10:42,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13607 to 11607. [2019-12-18 14:10:42,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11607 states. [2019-12-18 14:10:42,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11607 states to 11607 states and 37707 transitions. [2019-12-18 14:10:42,879 INFO L78 Accepts]: Start accepts. Automaton has 11607 states and 37707 transitions. Word has length 14 [2019-12-18 14:10:42,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:10:42,879 INFO L462 AbstractCegarLoop]: Abstraction has 11607 states and 37707 transitions. [2019-12-18 14:10:42,880 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 14:10:42,880 INFO L276 IsEmpty]: Start isEmpty. Operand 11607 states and 37707 transitions. [2019-12-18 14:10:42,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 14:10:42,885 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:10:42,885 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:10:42,885 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:10:42,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:10:42,885 INFO L82 PathProgramCache]: Analyzing trace with hash 833908596, now seen corresponding path program 1 times [2019-12-18 14:10:42,886 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:10:42,886 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927325390] [2019-12-18 14:10:42,886 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:10:42,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:10:42,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:10:42,937 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927325390] [2019-12-18 14:10:42,938 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:10:42,938 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 14:10:42,938 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751872573] [2019-12-18 14:10:42,938 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:10:42,939 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:10:42,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:10:42,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:10:42,939 INFO L87 Difference]: Start difference. First operand 11607 states and 37707 transitions. Second operand 3 states. [2019-12-18 14:10:42,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:10:42,996 INFO L93 Difference]: Finished difference Result 11464 states and 37241 transitions. [2019-12-18 14:10:42,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:10:42,996 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-18 14:10:42,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:10:43,023 INFO L225 Difference]: With dead ends: 11464 [2019-12-18 14:10:43,023 INFO L226 Difference]: Without dead ends: 11464 [2019-12-18 14:10:43,024 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:10:43,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11464 states. [2019-12-18 14:10:43,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11464 to 11464. [2019-12-18 14:10:43,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11464 states. [2019-12-18 14:10:43,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11464 states to 11464 states and 37241 transitions. [2019-12-18 14:10:43,481 INFO L78 Accepts]: Start accepts. Automaton has 11464 states and 37241 transitions. Word has length 16 [2019-12-18 14:10:43,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:10:43,481 INFO L462 AbstractCegarLoop]: Abstraction has 11464 states and 37241 transitions. [2019-12-18 14:10:43,481 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:10:43,481 INFO L276 IsEmpty]: Start isEmpty. Operand 11464 states and 37241 transitions. [2019-12-18 14:10:43,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-18 14:10:43,488 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:10:43,488 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:10:43,488 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:10:43,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:10:43,489 INFO L82 PathProgramCache]: Analyzing trace with hash 89165451, now seen corresponding path program 1 times [2019-12-18 14:10:43,489 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:10:43,489 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46277973] [2019-12-18 14:10:43,489 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:10:43,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:10:43,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:10:43,559 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46277973] [2019-12-18 14:10:43,559 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:10:43,559 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 14:10:43,559 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166044842] [2019-12-18 14:10:43,560 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 14:10:43,560 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:10:43,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 14:10:43,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 14:10:43,560 INFO L87 Difference]: Start difference. First operand 11464 states and 37241 transitions. Second operand 4 states. [2019-12-18 14:10:43,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:10:43,604 INFO L93 Difference]: Finished difference Result 2504 states and 6586 transitions. [2019-12-18 14:10:43,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 14:10:43,605 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-12-18 14:10:43,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:10:43,609 INFO L225 Difference]: With dead ends: 2504 [2019-12-18 14:10:43,609 INFO L226 Difference]: Without dead ends: 1773 [2019-12-18 14:10:43,610 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:10:43,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1773 states. [2019-12-18 14:10:43,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1773 to 1773. [2019-12-18 14:10:43,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1773 states. [2019-12-18 14:10:43,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1773 states to 1773 states and 4286 transitions. [2019-12-18 14:10:43,648 INFO L78 Accepts]: Start accepts. Automaton has 1773 states and 4286 transitions. Word has length 17 [2019-12-18 14:10:43,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:10:43,648 INFO L462 AbstractCegarLoop]: Abstraction has 1773 states and 4286 transitions. [2019-12-18 14:10:43,648 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 14:10:43,648 INFO L276 IsEmpty]: Start isEmpty. Operand 1773 states and 4286 transitions. [2019-12-18 14:10:43,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-18 14:10:43,651 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:10:43,652 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] [2019-12-18 14:10:43,652 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:10:43,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:10:43,652 INFO L82 PathProgramCache]: Analyzing trace with hash -375021524, now seen corresponding path program 1 times [2019-12-18 14:10:43,652 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:10:43,653 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020791975] [2019-12-18 14:10:43,653 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:10:43,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:10:43,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:10:43,750 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020791975] [2019-12-18 14:10:43,750 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:10:43,750 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 14:10:43,751 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97412721] [2019-12-18 14:10:43,751 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 14:10:43,751 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:10:43,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 14:10:43,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:10:43,752 INFO L87 Difference]: Start difference. First operand 1773 states and 4286 transitions. Second operand 5 states. [2019-12-18 14:10:43,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:10:43,979 INFO L93 Difference]: Finished difference Result 2369 states and 5653 transitions. [2019-12-18 14:10:43,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 14:10:43,979 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-18 14:10:43,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:10:43,984 INFO L225 Difference]: With dead ends: 2369 [2019-12-18 14:10:43,984 INFO L226 Difference]: Without dead ends: 2367 [2019-12-18 14:10:43,985 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 14:10:43,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2367 states. [2019-12-18 14:10:44,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2367 to 1883. [2019-12-18 14:10:44,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1883 states. [2019-12-18 14:10:44,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1883 states to 1883 states and 4545 transitions. [2019-12-18 14:10:44,024 INFO L78 Accepts]: Start accepts. Automaton has 1883 states and 4545 transitions. Word has length 26 [2019-12-18 14:10:44,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:10:44,025 INFO L462 AbstractCegarLoop]: Abstraction has 1883 states and 4545 transitions. [2019-12-18 14:10:44,025 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 14:10:44,025 INFO L276 IsEmpty]: Start isEmpty. Operand 1883 states and 4545 transitions. [2019-12-18 14:10:44,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-18 14:10:44,029 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:10:44,029 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] [2019-12-18 14:10:44,029 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:10:44,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:10:44,030 INFO L82 PathProgramCache]: Analyzing trace with hash -673024853, now seen corresponding path program 1 times [2019-12-18 14:10:44,030 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:10:44,030 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112992006] [2019-12-18 14:10:44,031 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:10:44,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:10:44,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:10:44,138 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112992006] [2019-12-18 14:10:44,138 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:10:44,139 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 14:10:44,139 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830414192] [2019-12-18 14:10:44,139 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 14:10:44,139 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:10:44,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 14:10:44,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:10:44,140 INFO L87 Difference]: Start difference. First operand 1883 states and 4545 transitions. Second operand 5 states. [2019-12-18 14:10:44,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:10:44,517 INFO L93 Difference]: Finished difference Result 2691 states and 6378 transitions. [2019-12-18 14:10:44,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 14:10:44,517 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-18 14:10:44,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:10:44,521 INFO L225 Difference]: With dead ends: 2691 [2019-12-18 14:10:44,522 INFO L226 Difference]: Without dead ends: 2691 [2019-12-18 14:10:44,523 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-18 14:10:44,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2691 states. [2019-12-18 14:10:44,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2691 to 2271. [2019-12-18 14:10:44,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2271 states. [2019-12-18 14:10:44,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2271 states to 2271 states and 5420 transitions. [2019-12-18 14:10:44,564 INFO L78 Accepts]: Start accepts. Automaton has 2271 states and 5420 transitions. Word has length 26 [2019-12-18 14:10:44,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:10:44,565 INFO L462 AbstractCegarLoop]: Abstraction has 2271 states and 5420 transitions. [2019-12-18 14:10:44,566 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 14:10:44,566 INFO L276 IsEmpty]: Start isEmpty. Operand 2271 states and 5420 transitions. [2019-12-18 14:10:44,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 14:10:44,570 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:10:44,570 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:10:44,571 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:10:44,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:10:44,571 INFO L82 PathProgramCache]: Analyzing trace with hash 427469221, now seen corresponding path program 1 times [2019-12-18 14:10:44,571 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:10:44,572 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816572737] [2019-12-18 14:10:44,572 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:10:44,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:10:44,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:10:44,656 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816572737] [2019-12-18 14:10:44,656 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:10:44,656 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 14:10:44,657 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814212807] [2019-12-18 14:10:44,657 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 14:10:44,657 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:10:44,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 14:10:44,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:10:44,658 INFO L87 Difference]: Start difference. First operand 2271 states and 5420 transitions. Second operand 5 states. [2019-12-18 14:10:44,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:10:44,862 INFO L93 Difference]: Finished difference Result 2790 states and 6588 transitions. [2019-12-18 14:10:44,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 14:10:44,862 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-18 14:10:44,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:10:44,866 INFO L225 Difference]: With dead ends: 2790 [2019-12-18 14:10:44,867 INFO L226 Difference]: Without dead ends: 2788 [2019-12-18 14:10:44,867 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 14:10:44,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2788 states. [2019-12-18 14:10:44,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2788 to 2211. [2019-12-18 14:10:44,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2211 states. [2019-12-18 14:10:44,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2211 states to 2211 states and 5271 transitions. [2019-12-18 14:10:44,905 INFO L78 Accepts]: Start accepts. Automaton has 2211 states and 5271 transitions. Word has length 27 [2019-12-18 14:10:44,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:10:44,905 INFO L462 AbstractCegarLoop]: Abstraction has 2211 states and 5271 transitions. [2019-12-18 14:10:44,905 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 14:10:44,905 INFO L276 IsEmpty]: Start isEmpty. Operand 2211 states and 5271 transitions. [2019-12-18 14:10:44,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 14:10:44,910 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:10:44,910 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:10:44,910 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:10:44,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:10:44,911 INFO L82 PathProgramCache]: Analyzing trace with hash 225506980, now seen corresponding path program 1 times [2019-12-18 14:10:44,911 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:10:44,911 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474926288] [2019-12-18 14:10:44,912 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:10:44,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:10:45,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:10:45,020 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474926288] [2019-12-18 14:10:45,020 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:10:45,020 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 14:10:45,020 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619249132] [2019-12-18 14:10:45,021 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 14:10:45,021 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:10:45,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 14:10:45,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:10:45,022 INFO L87 Difference]: Start difference. First operand 2211 states and 5271 transitions. Second operand 5 states. [2019-12-18 14:10:45,167 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-12-18 14:10:45,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:10:45,199 INFO L93 Difference]: Finished difference Result 1251 states and 2791 transitions. [2019-12-18 14:10:45,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 14:10:45,200 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-18 14:10:45,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:10:45,203 INFO L225 Difference]: With dead ends: 1251 [2019-12-18 14:10:45,203 INFO L226 Difference]: Without dead ends: 1109 [2019-12-18 14:10:45,203 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 14:10:45,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1109 states. [2019-12-18 14:10:45,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1109 to 989. [2019-12-18 14:10:45,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 989 states. [2019-12-18 14:10:45,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 989 states to 989 states and 2218 transitions. [2019-12-18 14:10:45,226 INFO L78 Accepts]: Start accepts. Automaton has 989 states and 2218 transitions. Word has length 27 [2019-12-18 14:10:45,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:10:45,227 INFO L462 AbstractCegarLoop]: Abstraction has 989 states and 2218 transitions. [2019-12-18 14:10:45,227 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 14:10:45,227 INFO L276 IsEmpty]: Start isEmpty. Operand 989 states and 2218 transitions. [2019-12-18 14:10:45,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-18 14:10:45,232 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:10:45,232 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:10:45,232 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:10:45,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:10:45,233 INFO L82 PathProgramCache]: Analyzing trace with hash 1687726867, now seen corresponding path program 1 times [2019-12-18 14:10:45,233 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:10:45,233 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708124202] [2019-12-18 14:10:45,233 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:10:45,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:10:45,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:10:45,363 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708124202] [2019-12-18 14:10:45,363 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:10:45,363 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 14:10:45,364 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365355143] [2019-12-18 14:10:45,364 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 14:10:45,364 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:10:45,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 14:10:45,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 14:10:45,365 INFO L87 Difference]: Start difference. First operand 989 states and 2218 transitions. Second operand 6 states. [2019-12-18 14:10:45,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:10:45,582 INFO L93 Difference]: Finished difference Result 2445 states and 5362 transitions. [2019-12-18 14:10:45,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 14:10:45,582 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2019-12-18 14:10:45,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:10:45,585 INFO L225 Difference]: With dead ends: 2445 [2019-12-18 14:10:45,585 INFO L226 Difference]: Without dead ends: 1624 [2019-12-18 14:10:45,585 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2019-12-18 14:10:45,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1624 states. [2019-12-18 14:10:45,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1624 to 1064. [2019-12-18 14:10:45,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1064 states. [2019-12-18 14:10:45,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1064 states to 1064 states and 2384 transitions. [2019-12-18 14:10:45,606 INFO L78 Accepts]: Start accepts. Automaton has 1064 states and 2384 transitions. Word has length 41 [2019-12-18 14:10:45,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:10:45,607 INFO L462 AbstractCegarLoop]: Abstraction has 1064 states and 2384 transitions. [2019-12-18 14:10:45,607 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 14:10:45,607 INFO L276 IsEmpty]: Start isEmpty. Operand 1064 states and 2384 transitions. [2019-12-18 14:10:45,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-18 14:10:45,610 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:10:45,610 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:10:45,611 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:10:45,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:10:45,611 INFO L82 PathProgramCache]: Analyzing trace with hash -2071793039, now seen corresponding path program 2 times [2019-12-18 14:10:45,611 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:10:45,611 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350278316] [2019-12-18 14:10:45,612 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:10:45,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:10:45,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:10:45,668 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350278316] [2019-12-18 14:10:45,669 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:10:45,669 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 14:10:45,669 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578480362] [2019-12-18 14:10:45,669 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 14:10:45,670 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:10:45,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 14:10:45,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 14:10:45,670 INFO L87 Difference]: Start difference. First operand 1064 states and 2384 transitions. Second operand 4 states. [2019-12-18 14:10:45,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:10:45,694 INFO L93 Difference]: Finished difference Result 1833 states and 4110 transitions. [2019-12-18 14:10:45,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 14:10:45,695 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 41 [2019-12-18 14:10:45,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:10:45,696 INFO L225 Difference]: With dead ends: 1833 [2019-12-18 14:10:45,696 INFO L226 Difference]: Without dead ends: 797 [2019-12-18 14:10:45,697 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:10:45,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 797 states. [2019-12-18 14:10:45,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 797 to 797. [2019-12-18 14:10:45,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2019-12-18 14:10:45,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 1774 transitions. [2019-12-18 14:10:45,708 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 1774 transitions. Word has length 41 [2019-12-18 14:10:45,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:10:45,708 INFO L462 AbstractCegarLoop]: Abstraction has 797 states and 1774 transitions. [2019-12-18 14:10:45,709 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 14:10:45,709 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 1774 transitions. [2019-12-18 14:10:45,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-18 14:10:45,711 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:10:45,711 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:10:45,711 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:10:45,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:10:45,712 INFO L82 PathProgramCache]: Analyzing trace with hash 1825813411, now seen corresponding path program 3 times [2019-12-18 14:10:45,712 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:10:45,712 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109456034] [2019-12-18 14:10:45,712 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:10:45,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:10:45,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:10:45,780 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109456034] [2019-12-18 14:10:45,781 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:10:45,781 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 14:10:45,781 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811808616] [2019-12-18 14:10:45,782 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 14:10:45,782 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:10:45,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 14:10:45,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 14:10:45,782 INFO L87 Difference]: Start difference. First operand 797 states and 1774 transitions. Second operand 7 states. [2019-12-18 14:10:45,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:10:45,969 INFO L93 Difference]: Finished difference Result 1250 states and 2717 transitions. [2019-12-18 14:10:45,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 14:10:45,970 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2019-12-18 14:10:45,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:10:45,972 INFO L225 Difference]: With dead ends: 1250 [2019-12-18 14:10:45,972 INFO L226 Difference]: Without dead ends: 829 [2019-12-18 14:10:45,973 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-18 14:10:45,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 829 states. [2019-12-18 14:10:45,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 829 to 785. [2019-12-18 14:10:45,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2019-12-18 14:10:45,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 1748 transitions. [2019-12-18 14:10:45,991 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 1748 transitions. Word has length 41 [2019-12-18 14:10:45,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:10:45,991 INFO L462 AbstractCegarLoop]: Abstraction has 785 states and 1748 transitions. [2019-12-18 14:10:45,992 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 14:10:45,992 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 1748 transitions. [2019-12-18 14:10:45,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-18 14:10:45,995 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:10:45,995 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:10:45,995 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:10:45,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:10:45,996 INFO L82 PathProgramCache]: Analyzing trace with hash 1484678691, now seen corresponding path program 4 times [2019-12-18 14:10:45,996 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:10:45,997 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726438135] [2019-12-18 14:10:45,997 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:10:46,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:10:46,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:10:46,098 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726438135] [2019-12-18 14:10:46,098 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:10:46,098 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 14:10:46,098 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161482297] [2019-12-18 14:10:46,099 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 14:10:46,099 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:10:46,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 14:10:46,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 14:10:46,099 INFO L87 Difference]: Start difference. First operand 785 states and 1748 transitions. Second operand 6 states. [2019-12-18 14:10:46,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:10:46,457 INFO L93 Difference]: Finished difference Result 908 states and 1993 transitions. [2019-12-18 14:10:46,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 14:10:46,457 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2019-12-18 14:10:46,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:10:46,459 INFO L225 Difference]: With dead ends: 908 [2019-12-18 14:10:46,459 INFO L226 Difference]: Without dead ends: 908 [2019-12-18 14:10:46,459 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-18 14:10:46,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 908 states. [2019-12-18 14:10:46,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 908 to 791. [2019-12-18 14:10:46,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2019-12-18 14:10:46,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 1759 transitions. [2019-12-18 14:10:46,471 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 1759 transitions. Word has length 41 [2019-12-18 14:10:46,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:10:46,471 INFO L462 AbstractCegarLoop]: Abstraction has 791 states and 1759 transitions. [2019-12-18 14:10:46,472 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 14:10:46,472 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 1759 transitions. [2019-12-18 14:10:46,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-18 14:10:46,474 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:10:46,474 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:10:46,474 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:10:46,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:10:46,474 INFO L82 PathProgramCache]: Analyzing trace with hash 577447219, now seen corresponding path program 5 times [2019-12-18 14:10:46,475 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:10:46,475 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829150426] [2019-12-18 14:10:46,475 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:10:46,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:10:46,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:10:46,530 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829150426] [2019-12-18 14:10:46,531 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:10:46,531 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:10:46,531 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411916595] [2019-12-18 14:10:46,531 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:10:46,532 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:10:46,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:10:46,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:10:46,532 INFO L87 Difference]: Start difference. First operand 791 states and 1759 transitions. Second operand 3 states. [2019-12-18 14:10:46,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:10:46,547 INFO L93 Difference]: Finished difference Result 789 states and 1754 transitions. [2019-12-18 14:10:46,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:10:46,547 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2019-12-18 14:10:46,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:10:46,549 INFO L225 Difference]: With dead ends: 789 [2019-12-18 14:10:46,549 INFO L226 Difference]: Without dead ends: 789 [2019-12-18 14:10:46,549 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:10:46,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 789 states. [2019-12-18 14:10:46,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 789 to 697. [2019-12-18 14:10:46,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 697 states. [2019-12-18 14:10:46,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 697 states to 697 states and 1570 transitions. [2019-12-18 14:10:46,560 INFO L78 Accepts]: Start accepts. Automaton has 697 states and 1570 transitions. Word has length 41 [2019-12-18 14:10:46,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:10:46,560 INFO L462 AbstractCegarLoop]: Abstraction has 697 states and 1570 transitions. [2019-12-18 14:10:46,560 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:10:46,561 INFO L276 IsEmpty]: Start isEmpty. Operand 697 states and 1570 transitions. [2019-12-18 14:10:46,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-18 14:10:46,562 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:10:46,563 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] [2019-12-18 14:10:46,563 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:10:46,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:10:46,563 INFO L82 PathProgramCache]: Analyzing trace with hash -1605159892, now seen corresponding path program 1 times [2019-12-18 14:10:46,563 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:10:46,564 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456195717] [2019-12-18 14:10:46,564 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:10:46,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 14:10:46,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 14:10:46,670 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 14:10:46,670 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 14:10:46,674 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [686] [686] ULTIMATE.startENTRY-->L802: Formula: (let ((.cse0 (store |v_#valid_40| 0 0))) (and (= 0 v_~y$read_delayed_var~0.base_6) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1649~0.base_19|) (< 0 |v_#StackHeapBarrier_12|) (= 0 v_~y$w_buff0~0_571) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1649~0.base_19|)) (= v_~z~0_33 0) (= 0 v_~y$r_buff0_thd2~0_124) (= 0 v_~y$flush_delayed~0_47) (= |v_#NULL.offset_6| 0) (= v_~__unbuffered_p1_EBX~0_56 0) (= v_~y$read_delayed~0_7 0) (= v_~y$r_buff0_thd1~0_321 0) (= 0 |v_ULTIMATE.start_main_~#t1649~0.offset_17|) (= 0 v_~__unbuffered_p0_EAX~0_60) (= v_~weak$$choice2~0_156 0) (= v_~y~0_145 0) (= v_~y$w_buff1_used~0_548 0) (= v_~main$tmp_guard1~0_30 0) (= 0 v_~__unbuffered_cnt~0_85) (= v_~y$r_buff1_thd0~0_115 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t1649~0.base_19| 1) |v_#valid_38|) (= v_~y$r_buff1_thd1~0_238 0) (= v_~y$mem_tmp~0_18 0) (= 0 v_~y$r_buff1_thd2~0_86) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t1649~0.base_19| 4)) (= v_~y$w_buff0_used~0_794 0) (= 0 |v_#NULL.base_6|) (= 0 v_~weak$$choice0~0_11) (= v_~y$r_buff0_thd0~0_127 0) (= v_~main$tmp_guard0~0_32 0) (= 0 v_~__unbuffered_p1_EAX~0_56) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1649~0.base_19| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1649~0.base_19|) |v_ULTIMATE.start_main_~#t1649~0.offset_17| 0)) |v_#memory_int_11|) (= 0 v_~y$read_delayed_var~0.offset_6) (= v_~x~0_36 0) (= v_~y$w_buff1~0_385 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_9|, ~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_794, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_15|, ULTIMATE.start_main_~#t1650~0.offset=|v_ULTIMATE.start_main_~#t1650~0.offset_17|, #NULL.offset=|v_#NULL.offset_6|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_30, ~y$read_delayed~0=v_~y$read_delayed~0_7, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_238, ~y$mem_tmp~0=v_~y$mem_tmp~0_18, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_60, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_56, ~y$w_buff0~0=v_~y$w_buff0~0_571, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_321, ~y$flush_delayed~0=v_~y$flush_delayed~0_47, #length=|v_#length_13|, ~y~0=v_~y~0_145, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_56, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_68|, ULTIMATE.start_main_~#t1649~0.offset=|v_ULTIMATE.start_main_~#t1649~0.offset_17|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_33|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_86|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_44|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_120|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_32, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_44|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_86, ~weak$$choice0~0=v_~weak$$choice0~0_11, #StackHeapBarrier=|v_#StackHeapBarrier_12|, ~y$w_buff1~0=v_~y$w_buff1~0_385, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_23|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_127, ULTIMATE.start_main_~#t1649~0.base=|v_ULTIMATE.start_main_~#t1649~0.base_19|, #valid=|v_#valid_38|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_124, #memory_int=|v_#memory_int_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_85, ~z~0=v_~z~0_33, ~weak$$choice2~0=v_~weak$$choice2~0_156, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_115, ~x~0=v_~x~0_36, ULTIMATE.start_main_~#t1650~0.base=|v_ULTIMATE.start_main_~#t1650~0.base_22|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_548} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~nondet33, ULTIMATE.start_main_~#t1650~0.offset, #NULL.offset, ~main$tmp_guard1~0, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~y~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_~#t1649~0.offset, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_#t~ite37, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_#t~ite34, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, ULTIMATE.start_main_~#t1649~0.base, #valid, ~y$r_buff0_thd2~0, #memory_int, ~__unbuffered_cnt~0, ~z~0, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ULTIMATE.start_main_~#t1650~0.base, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-18 14:10:46,675 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [648] [648] L802-1-->L804: Formula: (and (= |v_#length_9| (store |v_#length_10| |v_ULTIMATE.start_main_~#t1650~0.base_9| 4)) (not (= |v_ULTIMATE.start_main_~#t1650~0.base_9| 0)) (= (select |v_#valid_20| |v_ULTIMATE.start_main_~#t1650~0.base_9|) 0) (= |v_#valid_19| (store |v_#valid_20| |v_ULTIMATE.start_main_~#t1650~0.base_9| 1)) (< |v_#StackHeapBarrier_7| |v_ULTIMATE.start_main_~#t1650~0.base_9|) (= (store |v_#memory_int_8| |v_ULTIMATE.start_main_~#t1650~0.base_9| (store (select |v_#memory_int_8| |v_ULTIMATE.start_main_~#t1650~0.base_9|) |v_ULTIMATE.start_main_~#t1650~0.offset_8| 1)) |v_#memory_int_7|) (= |v_ULTIMATE.start_main_~#t1650~0.offset_8| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_7|, #valid=|v_#valid_20|, #memory_int=|v_#memory_int_8|, #length=|v_#length_10|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_7|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_4|, ULTIMATE.start_main_~#t1650~0.offset=|v_ULTIMATE.start_main_~#t1650~0.offset_8|, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_7|, #length=|v_#length_9|, ULTIMATE.start_main_~#t1650~0.base=|v_ULTIMATE.start_main_~#t1650~0.base_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_~#t1650~0.offset, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1650~0.base] because there is no mapped edge [2019-12-18 14:10:46,676 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [621] [621] L5-->L779: Formula: (and (not (= v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_76 0)) (= v_~z~0_12 1) (= v_~y$r_buff0_thd2~0_57 v_~y$r_buff1_thd2~0_35) (= v_~y$r_buff0_thd0~0_50 v_~y$r_buff1_thd0~0_31) (= v_~y$r_buff0_thd1~0_125 v_~y$r_buff1_thd1~0_69) (= v_~__unbuffered_p1_EBX~0_15 v_~x~0_14) (= v_~y$r_buff0_thd2~0_56 1) (= v_~z~0_12 v_~__unbuffered_p1_EAX~0_15)) InVars {P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_76, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_50, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_57, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_125, ~x~0=v_~x~0_14} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_35, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_69, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_15, P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_76, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_15, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_50, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_56, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_125, ~z~0=v_~z~0_12, ~x~0=v_~x~0_14, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_31} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~__unbuffered_p1_EBX~0, ~__unbuffered_p1_EAX~0, ~y$r_buff0_thd2~0, ~z~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-18 14:10:46,679 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [641] [641] L780-->L780-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In-1664435605 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In-1664435605 256) 0))) (or (and (= 0 |P1Thread1of1ForFork0_#t~ite28_Out-1664435605|) (not .cse0) (not .cse1)) (and (= |P1Thread1of1ForFork0_#t~ite28_Out-1664435605| ~y$w_buff0_used~0_In-1664435605) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1664435605, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1664435605} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1664435605, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1664435605, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out-1664435605|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-18 14:10:46,679 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [629] [629] L781-->L781-2: Formula: (let ((.cse2 (= (mod ~y$r_buff0_thd2~0_In478470622 256) 0)) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In478470622 256))) (.cse1 (= (mod ~y$r_buff1_thd2~0_In478470622 256) 0)) (.cse0 (= (mod ~y$w_buff1_used~0_In478470622 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork0_#t~ite29_Out478470622|)) (and (or .cse2 .cse3) (or .cse1 .cse0) (= |P1Thread1of1ForFork0_#t~ite29_Out478470622| ~y$w_buff1_used~0_In478470622)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In478470622, ~y$w_buff0_used~0=~y$w_buff0_used~0_In478470622, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In478470622, ~y$w_buff1_used~0=~y$w_buff1_used~0_In478470622} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In478470622, ~y$w_buff0_used~0=~y$w_buff0_used~0_In478470622, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In478470622, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out478470622|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In478470622} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-18 14:10:46,680 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [640] [640] L782-->L783: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-2128339098 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-2128339098 256)))) (or (and (not .cse0) (not .cse1) (= 0 ~y$r_buff0_thd2~0_Out-2128339098)) (and (or .cse0 .cse1) (= ~y$r_buff0_thd2~0_Out-2128339098 ~y$r_buff0_thd2~0_In-2128339098)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2128339098, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2128339098} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-2128339098, P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out-2128339098|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_Out-2128339098} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~y$r_buff0_thd2~0] because there is no mapped edge [2019-12-18 14:10:46,684 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [669] [669] L742-->L742-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In-1745118309 256) 0))) (or (and (= |P0Thread1of1ForFork1_#t~ite18_Out-1745118309| |P0Thread1of1ForFork1_#t~ite17_Out-1745118309|) (= ~y$w_buff1_used~0_In-1745118309 |P0Thread1of1ForFork1_#t~ite17_Out-1745118309|) (let ((.cse0 (= (mod ~y$r_buff0_thd1~0_In-1745118309 256) 0))) (or (and (= (mod ~y$w_buff1_used~0_In-1745118309 256) 0) .cse0) (and .cse0 (= 0 (mod ~y$r_buff1_thd1~0_In-1745118309 256))) (= (mod ~y$w_buff0_used~0_In-1745118309 256) 0))) .cse1) (and (= |P0Thread1of1ForFork1_#t~ite17_In-1745118309| |P0Thread1of1ForFork1_#t~ite17_Out-1745118309|) (not .cse1) (= ~y$w_buff1_used~0_In-1745118309 |P0Thread1of1ForFork1_#t~ite18_Out-1745118309|)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1745118309, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1745118309, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1745118309, P0Thread1of1ForFork1_#t~ite17=|P0Thread1of1ForFork1_#t~ite17_In-1745118309|, ~weak$$choice2~0=~weak$$choice2~0_In-1745118309, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1745118309} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1745118309, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1745118309, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1745118309, P0Thread1of1ForFork1_#t~ite18=|P0Thread1of1ForFork1_#t~ite18_Out-1745118309|, P0Thread1of1ForFork1_#t~ite17=|P0Thread1of1ForFork1_#t~ite17_Out-1745118309|, ~weak$$choice2~0=~weak$$choice2~0_In-1745118309, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1745118309} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite18, P0Thread1of1ForFork1_#t~ite17] because there is no mapped edge [2019-12-18 14:10:46,684 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [609] [609] L743-->L744: Formula: (and (= v_~y$r_buff0_thd1~0_97 v_~y$r_buff0_thd1~0_96) (not (= 0 (mod v_~weak$$choice2~0_29 256)))) InVars {~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_97, ~weak$$choice2~0=v_~weak$$choice2~0_29} OutVars{P0Thread1of1ForFork1_#t~ite21=|v_P0Thread1of1ForFork1_#t~ite21_7|, P0Thread1of1ForFork1_#t~ite20=|v_P0Thread1of1ForFork1_#t~ite20_14|, P0Thread1of1ForFork1_#t~ite19=|v_P0Thread1of1ForFork1_#t~ite19_15|, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_96, ~weak$$choice2~0=v_~weak$$choice2~0_29} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite21, P0Thread1of1ForFork1_#t~ite20, P0Thread1of1ForFork1_#t~ite19, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 14:10:46,685 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [599] [599] L746-->L754: Formula: (and (= (+ v_~__unbuffered_cnt~0_13 1) v_~__unbuffered_cnt~0_12) (= v_~y~0_27 v_~y$mem_tmp~0_4) (= 0 v_~y$flush_delayed~0_8) (not (= 0 (mod v_~y$flush_delayed~0_9 256)))) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_4, ~y$flush_delayed~0=v_~y$flush_delayed~0_9, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_4, P0Thread1of1ForFork1_#t~ite25=|v_P0Thread1of1ForFork1_#t~ite25_11|, ~y$flush_delayed~0=v_~y$flush_delayed~0_8, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, ~y~0=v_~y~0_27} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite25, ~y$flush_delayed~0, ~__unbuffered_cnt~0, ~y~0] because there is no mapped edge [2019-12-18 14:10:46,686 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [639] [639] L783-->L783-2: Formula: (let ((.cse2 (= 0 (mod ~y$r_buff1_thd2~0_In521075886 256))) (.cse3 (= (mod ~y$w_buff1_used~0_In521075886 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In521075886 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In521075886 256)))) (or (and (= 0 |P1Thread1of1ForFork0_#t~ite31_Out521075886|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~y$r_buff1_thd2~0_In521075886 |P1Thread1of1ForFork0_#t~ite31_Out521075886|) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In521075886, ~y$w_buff0_used~0=~y$w_buff0_used~0_In521075886, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In521075886, ~y$w_buff1_used~0=~y$w_buff1_used~0_In521075886} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In521075886, ~y$w_buff0_used~0=~y$w_buff0_used~0_In521075886, P1Thread1of1ForFork0_#t~ite31=|P1Thread1of1ForFork0_#t~ite31_Out521075886|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In521075886, ~y$w_buff1_used~0=~y$w_buff1_used~0_In521075886} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-18 14:10:46,686 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [660] [660] L783-2-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork0_#t~ite31_34| v_~y$r_buff1_thd2~0_51) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_54 1) v_~__unbuffered_cnt~0_53) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|)) InVars {P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_34|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_54} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_51, P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_33|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_53, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_5|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_5|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork0_#t~ite31, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-18 14:10:46,686 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [581] [581] L808-->L810-2: Formula: (and (or (= (mod v_~y$w_buff0_used~0_97 256) 0) (= 0 (mod v_~y$r_buff0_thd0~0_21 256))) (not (= 0 (mod v_~main$tmp_guard0~0_5 256)))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_97, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_21, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_97, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_21, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-18 14:10:46,687 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [645] [645] L810-2-->L810-4: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In-543563437 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In-543563437 256)))) (or (and (or .cse0 .cse1) (= ~y~0_In-543563437 |ULTIMATE.start_main_#t~ite34_Out-543563437|)) (and (not .cse0) (= ~y$w_buff1~0_In-543563437 |ULTIMATE.start_main_#t~ite34_Out-543563437|) (not .cse1)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-543563437, ~y~0=~y~0_In-543563437, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-543563437, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-543563437} OutVars{~y$w_buff1~0=~y$w_buff1~0_In-543563437, ~y~0=~y~0_In-543563437, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-543563437, ULTIMATE.start_main_#t~ite34=|ULTIMATE.start_main_#t~ite34_Out-543563437|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-543563437} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2019-12-18 14:10:46,687 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [569] [569] L810-4-->L811: Formula: (= v_~y~0_15 |v_ULTIMATE.start_main_#t~ite34_7|) InVars {ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_7|} OutVars{ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_6|, ~y~0=v_~y~0_15, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ~y~0, ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2019-12-18 14:10:46,687 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [635] [635] L811-->L811-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-938391654 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-938391654 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite36_Out-938391654| ~y$w_buff0_used~0_In-938391654)) (and (not .cse1) (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite36_Out-938391654|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-938391654, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-938391654} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-938391654, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-938391654, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out-938391654|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36] because there is no mapped edge [2019-12-18 14:10:46,688 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [634] [634] L812-->L812-2: Formula: (let ((.cse1 (= (mod ~y$r_buff1_thd0~0_In1754553545 256) 0)) (.cse0 (= (mod ~y$w_buff1_used~0_In1754553545 256) 0)) (.cse3 (= 0 (mod ~y$r_buff0_thd0~0_In1754553545 256))) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In1754553545 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite37_Out1754553545|)) (and (= ~y$w_buff1_used~0_In1754553545 |ULTIMATE.start_main_#t~ite37_Out1754553545|) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1754553545, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1754553545, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1754553545, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1754553545} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1754553545, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1754553545, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out1754553545|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1754553545, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1754553545} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-12-18 14:10:46,688 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [644] [644] L813-->L813-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In1563368527 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In1563368527 256)))) (or (and (= |ULTIMATE.start_main_#t~ite38_Out1563368527| ~y$r_buff0_thd0~0_In1563368527) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |ULTIMATE.start_main_#t~ite38_Out1563368527| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1563368527, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1563368527} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1563368527, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1563368527, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out1563368527|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-18 14:10:46,689 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [631] [631] L814-->L814-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff1_used~0_In1689703282 256))) (.cse2 (= 0 (mod ~y$r_buff1_thd0~0_In1689703282 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In1689703282 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd0~0_In1689703282 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite39_Out1689703282| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= |ULTIMATE.start_main_#t~ite39_Out1689703282| ~y$r_buff1_thd0~0_In1689703282) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1689703282, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1689703282, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1689703282, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1689703282} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1689703282, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out1689703282|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1689703282, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1689703282, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1689703282} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-18 14:10:46,689 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [671] [671] L814-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_15 0) (= 1 v_~__unbuffered_p1_EAX~0_32) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13| (mod v_~main$tmp_guard1~0_15 256)) (= v_~__unbuffered_p1_EBX~0_32 0) (= 0 v_~__unbuffered_p0_EAX~0_40) (= |v_ULTIMATE.start_main_#t~ite39_34| v_~y$r_buff1_thd0~0_70)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_40, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_32, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_32, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_34|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_40, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_32, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_32, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_33|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_15, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_70, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite39, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 14:10:46,747 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 02:10:46 BasicIcfg [2019-12-18 14:10:46,747 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 14:10:46,749 INFO L168 Benchmark]: Toolchain (without parser) took 15846.82 ms. Allocated memory was 146.8 MB in the beginning and 693.6 MB in the end (delta: 546.8 MB). Free memory was 103.1 MB in the beginning and 280.1 MB in the end (delta: -177.0 MB). Peak memory consumption was 369.8 MB. Max. memory is 7.1 GB. [2019-12-18 14:10:46,750 INFO L168 Benchmark]: CDTParser took 1.36 ms. Allocated memory is still 146.8 MB. Free memory is still 122.8 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-12-18 14:10:46,750 INFO L168 Benchmark]: CACSL2BoogieTranslator took 693.75 ms. Allocated memory was 146.8 MB in the beginning and 203.4 MB in the end (delta: 56.6 MB). Free memory was 102.7 MB in the beginning and 158.0 MB in the end (delta: -55.4 MB). Peak memory consumption was 21.9 MB. Max. memory is 7.1 GB. [2019-12-18 14:10:46,751 INFO L168 Benchmark]: Boogie Procedure Inliner took 79.40 ms. Allocated memory is still 203.4 MB. Free memory was 158.0 MB in the beginning and 155.2 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-18 14:10:46,752 INFO L168 Benchmark]: Boogie Preprocessor took 61.89 ms. Allocated memory is still 203.4 MB. Free memory was 155.2 MB in the beginning and 153.3 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-12-18 14:10:46,752 INFO L168 Benchmark]: RCFGBuilder took 743.15 ms. Allocated memory is still 203.4 MB. Free memory was 153.3 MB in the beginning and 111.8 MB in the end (delta: 41.6 MB). Peak memory consumption was 41.6 MB. Max. memory is 7.1 GB. [2019-12-18 14:10:46,753 INFO L168 Benchmark]: TraceAbstraction took 14257.10 ms. Allocated memory was 203.4 MB in the beginning and 693.6 MB in the end (delta: 490.2 MB). Free memory was 111.8 MB in the beginning and 280.1 MB in the end (delta: -168.4 MB). Peak memory consumption was 321.8 MB. Max. memory is 7.1 GB. [2019-12-18 14:10:46,757 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.36 ms. Allocated memory is still 146.8 MB. Free memory is still 122.8 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 693.75 ms. Allocated memory was 146.8 MB in the beginning and 203.4 MB in the end (delta: 56.6 MB). Free memory was 102.7 MB in the beginning and 158.0 MB in the end (delta: -55.4 MB). Peak memory consumption was 21.9 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 79.40 ms. Allocated memory is still 203.4 MB. Free memory was 158.0 MB in the beginning and 155.2 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 61.89 ms. Allocated memory is still 203.4 MB. Free memory was 155.2 MB in the beginning and 153.3 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 743.15 ms. Allocated memory is still 203.4 MB. Free memory was 153.3 MB in the beginning and 111.8 MB in the end (delta: 41.6 MB). Peak memory consumption was 41.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 14257.10 ms. Allocated memory was 203.4 MB in the beginning and 693.6 MB in the end (delta: 490.2 MB). Free memory was 111.8 MB in the beginning and 280.1 MB in the end (delta: -168.4 MB). Peak memory consumption was 321.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.9s, 137 ProgramPointsBefore, 67 ProgramPointsAfterwards, 165 TransitionsBefore, 78 TransitionsAfterwards, 10216 CoEnabledTransitionPairs, 7 FixpointIterations, 31 TrivialSequentialCompositions, 41 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 27 ConcurrentYvCompositions, 20 ChoiceCompositions, 4326 VarBasedMoverChecksPositive, 213 VarBasedMoverChecksNegative, 84 SemBasedMoverChecksPositive, 180 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.6s, 0 MoverChecksTotal, 39043 CheckedPairsTotal, 99 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L802] FCALL, FORK 0 pthread_create(&t1649, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0: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, z=0] [L804] FCALL, FORK 0 pthread_create(&t1650, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0: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, z=0] [L759] 2 y$w_buff1 = y$w_buff0 [L760] 2 y$w_buff0 = 1 [L761] 2 y$w_buff1_used = y$w_buff0_used [L762] 2 y$w_buff0_used = (_Bool)1 [L779] 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_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0: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=1, 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, z=1] [L729] 1 x = 1 [L734] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L735] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L736] 1 y$flush_delayed = weak$$choice2 [L737] 1 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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, z=1] [L738] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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, z=1] [L779] 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) [L780] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L781] 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 [L738] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L739] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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, z=1] [L739] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L740] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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, z=1] [L740] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L741] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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, z=1] [L741] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L742] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L744] EXPR 1 weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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, z=1] [L744] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L745] 1 __unbuffered_p0_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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, z=1] [L806] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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, z=1] [L811] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L812] 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 [L813] 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, 131 locations, 2 error locations. Result: UNSAFE, OverallTime: 14.0s, OverallIterations: 17, TraceHistogramMax: 1, AutomataDifference: 4.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1945 SDtfs, 1721 SDslu, 3471 SDs, 0 SdLazy, 1643 SolverSat, 80 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 90 GetRequests, 23 SyntacticMatches, 5 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=11607occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.5s AutomataMinimizationTime, 16 MinimizatonAttempts, 7835 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 444 NumberOfCodeBlocks, 444 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 386 ConstructedInterpolants, 0 QuantifiedInterpolants, 33742 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 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...