/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/mix032_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 13:15:40,510 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 13:15:40,513 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 13:15:40,534 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 13:15:40,535 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 13:15:40,537 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 13:15:40,539 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 13:15:40,551 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 13:15:40,553 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 13:15:40,554 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 13:15:40,555 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 13:15:40,556 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 13:15:40,557 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 13:15:40,558 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 13:15:40,559 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 13:15:40,560 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 13:15:40,560 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 13:15:40,561 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 13:15:40,563 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 13:15:40,565 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 13:15:40,566 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 13:15:40,568 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 13:15:40,569 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 13:15:40,569 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 13:15:40,572 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 13:15:40,572 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 13:15:40,572 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 13:15:40,573 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 13:15:40,573 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 13:15:40,574 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 13:15:40,575 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 13:15:40,575 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 13:15:40,576 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 13:15:40,577 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 13:15:40,578 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 13:15:40,578 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 13:15:40,581 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 13:15:40,581 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 13:15:40,582 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 13:15:40,583 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 13:15:40,583 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 13:15:40,584 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 13:15:40,608 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 13:15:40,608 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 13:15:40,612 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 13:15:40,612 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 13:15:40,613 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 13:15:40,613 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 13:15:40,613 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 13:15:40,614 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 13:15:40,614 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 13:15:40,614 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 13:15:40,615 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 13:15:40,615 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 13:15:40,616 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 13:15:40,616 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 13:15:40,616 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 13:15:40,616 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 13:15:40,617 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 13:15:40,617 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 13:15:40,617 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 13:15:40,617 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 13:15:40,618 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 13:15:40,618 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 13:15:40,618 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 13:15:40,619 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 13:15:40,619 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 13:15:40,620 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 13:15:40,620 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 13:15:40,620 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 13:15:40,620 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-18 13:15:40,620 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 13:15:40,928 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 13:15:40,949 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 13:15:40,952 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 13:15:40,953 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 13:15:40,953 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 13:15:40,954 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix032_rmo.oepc.i [2019-12-18 13:15:41,018 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b9af9eed7/61a1f5955e76433889ba2afc08d07ef0/FLAG96a81de3b [2019-12-18 13:15:41,545 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 13:15:41,546 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix032_rmo.oepc.i [2019-12-18 13:15:41,569 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b9af9eed7/61a1f5955e76433889ba2afc08d07ef0/FLAG96a81de3b [2019-12-18 13:15:41,858 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b9af9eed7/61a1f5955e76433889ba2afc08d07ef0 [2019-12-18 13:15:41,869 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 13:15:41,871 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 13:15:41,872 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 13:15:41,872 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 13:15:41,876 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 13:15:41,877 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 01:15:41" (1/1) ... [2019-12-18 13:15:41,880 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49c2c113 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:15:41, skipping insertion in model container [2019-12-18 13:15:41,880 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 01:15:41" (1/1) ... [2019-12-18 13:15:41,888 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 13:15:41,942 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 13:15:42,522 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 13:15:42,535 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 13:15:42,641 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 13:15:42,725 INFO L208 MainTranslator]: Completed translation [2019-12-18 13:15:42,726 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:15:42 WrapperNode [2019-12-18 13:15:42,726 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 13:15:42,727 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 13:15:42,727 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 13:15:42,727 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 13:15:42,736 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:15:42" (1/1) ... [2019-12-18 13:15:42,758 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:15:42" (1/1) ... [2019-12-18 13:15:42,792 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 13:15:42,793 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 13:15:42,793 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 13:15:42,793 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 13:15:42,802 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:15:42" (1/1) ... [2019-12-18 13:15:42,803 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:15:42" (1/1) ... [2019-12-18 13:15:42,808 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:15:42" (1/1) ... [2019-12-18 13:15:42,809 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:15:42" (1/1) ... [2019-12-18 13:15:42,820 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:15:42" (1/1) ... [2019-12-18 13:15:42,824 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:15:42" (1/1) ... [2019-12-18 13:15:42,828 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:15:42" (1/1) ... [2019-12-18 13:15:42,834 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 13:15:42,834 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 13:15:42,834 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 13:15:42,834 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 13:15:42,835 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:15:42" (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 13:15:42,906 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 13:15:42,906 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 13:15:42,906 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 13:15:42,906 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 13:15:42,906 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 13:15:42,907 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 13:15:42,907 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 13:15:42,907 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 13:15:42,907 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 13:15:42,907 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 13:15:42,907 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 13:15:42,908 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 13:15:42,908 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 13:15:42,910 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 13:15:43,714 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 13:15:43,714 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 13:15:43,716 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 01:15:43 BoogieIcfgContainer [2019-12-18 13:15:43,716 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 13:15:43,717 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 13:15:43,717 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 13:15:43,721 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 13:15:43,721 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 01:15:41" (1/3) ... [2019-12-18 13:15:43,722 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f650ac4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 01:15:43, skipping insertion in model container [2019-12-18 13:15:43,722 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:15:42" (2/3) ... [2019-12-18 13:15:43,723 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f650ac4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 01:15:43, skipping insertion in model container [2019-12-18 13:15:43,723 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 01:15:43" (3/3) ... [2019-12-18 13:15:43,725 INFO L109 eAbstractionObserver]: Analyzing ICFG mix032_rmo.oepc.i [2019-12-18 13:15:43,736 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 13:15:43,737 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 13:15:43,745 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 13:15:43,746 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 13:15:43,792 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:43,793 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:43,793 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:43,794 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:43,794 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:43,794 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:43,795 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:43,796 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:43,796 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:43,797 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:43,797 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:43,797 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:43,797 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:43,798 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:43,798 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:43,798 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:43,799 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:43,799 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:43,799 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:43,799 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:43,800 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:43,800 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:43,800 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:43,801 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:43,801 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:43,801 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:43,803 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:43,804 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:43,805 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:43,805 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:43,806 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:43,806 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:43,806 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:43,822 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:43,825 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:43,825 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:43,826 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:43,826 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:43,827 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:43,828 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:43,828 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:43,828 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:43,829 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:43,829 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:43,829 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:43,830 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:43,831 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:43,831 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:43,831 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:43,831 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:43,832 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:43,832 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:43,832 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:43,832 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:43,832 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:43,833 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:43,833 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:43,833 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:43,834 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:43,834 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:43,835 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:43,835 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:43,836 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:43,836 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:43,841 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:43,841 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:43,841 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:43,841 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:43,842 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:43,842 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:43,842 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:43,842 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:43,842 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:43,843 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:43,843 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:43,843 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:43,843 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:43,843 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:43,844 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:43,844 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:43,845 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:43,845 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:43,845 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:43,845 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:43,846 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:43,846 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:43,847 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:43,847 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:43,847 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:43,847 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:43,848 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:43,848 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:43,848 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:43,848 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:43,848 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:43,849 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:43,849 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:43,849 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:43,849 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:43,849 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:43,850 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:43,850 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:43,854 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:43,854 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:43,855 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:43,855 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:43,860 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:43,860 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:43,861 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:43,861 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:43,861 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:43,861 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:43,861 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:43,862 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:43,862 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:43,862 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:43,862 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:43,862 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:43,863 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:43,863 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:43,863 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:43,863 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:43,863 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:43,864 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:43,864 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:43,864 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:43,864 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:43,865 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:43,865 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:43,865 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:43,865 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:43,865 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:43,865 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:43,866 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:43,866 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:43,866 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:43,866 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:43,866 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:43,867 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:43,867 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:43,867 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:43,867 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:43,867 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:43,868 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:43,868 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:43,868 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:43,868 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:43,868 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:43,869 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:43,869 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:43,869 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:43,869 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:43,869 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:43,870 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:43,870 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:43,870 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:43,870 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:43,870 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:43,871 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:43,871 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:43,871 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:43,871 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:43,871 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:43,872 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:43,872 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:43,872 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:43,872 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:43,872 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:43,872 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:43,873 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:43,873 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:43,873 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:43,873 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:43,874 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:43,874 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:43,874 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:43,874 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:43,874 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:43,875 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:43,875 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:43,875 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:43,875 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:43,879 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:43,879 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:43,879 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:43,879 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:43,880 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:43,880 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:43,880 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:43,880 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:43,880 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:43,880 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:43,883 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:43,883 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:43,883 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:43,884 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:43,884 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:43,884 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:43,884 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:43,884 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:43,884 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:43,885 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:43,885 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:43,885 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:43,885 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:43,885 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:43,885 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:43,886 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:43,886 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:43,886 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:43,886 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:43,886 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:43,887 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:43,887 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:43,887 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:43,887 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:43,887 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:43,888 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:43,888 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:43,888 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:43,888 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:43,888 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:43,889 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:43,889 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:43,889 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:43,895 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:43,895 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:43,896 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:43,897 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:43,902 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:43,902 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:43,902 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:43,902 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:43,902 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:43,905 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:43,906 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:43,906 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:43,923 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 13:15:43,945 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 13:15:43,946 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 13:15:43,946 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 13:15:43,946 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 13:15:43,946 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 13:15:43,946 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 13:15:43,946 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 13:15:43,947 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 13:15:43,967 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 180 places, 217 transitions [2019-12-18 13:15:43,969 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 180 places, 217 transitions [2019-12-18 13:15:44,061 INFO L126 PetriNetUnfolder]: 47/214 cut-off events. [2019-12-18 13:15:44,061 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 13:15:44,083 INFO L76 FinitePrefix]: Finished finitePrefix Result has 224 conditions, 214 events. 47/214 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 436 event pairs. 9/174 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 13:15:44,114 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 180 places, 217 transitions [2019-12-18 13:15:44,163 INFO L126 PetriNetUnfolder]: 47/214 cut-off events. [2019-12-18 13:15:44,163 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 13:15:44,175 INFO L76 FinitePrefix]: Finished finitePrefix Result has 224 conditions, 214 events. 47/214 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 436 event pairs. 9/174 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 13:15:44,202 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-18 13:15:44,203 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 13:15:49,505 WARN L192 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 97 [2019-12-18 13:15:49,641 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2019-12-18 13:15:49,674 INFO L206 etLargeBlockEncoding]: Checked pairs total: 83556 [2019-12-18 13:15:49,674 INFO L214 etLargeBlockEncoding]: Total number of compositions: 115 [2019-12-18 13:15:49,678 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 96 places, 105 transitions [2019-12-18 13:16:11,028 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 129602 states. [2019-12-18 13:16:11,029 INFO L276 IsEmpty]: Start isEmpty. Operand 129602 states. [2019-12-18 13:16:11,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-18 13:16:11,035 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:16:11,035 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-18 13:16:11,036 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:16:11,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:16:11,041 INFO L82 PathProgramCache]: Analyzing trace with hash 923865, now seen corresponding path program 1 times [2019-12-18 13:16:11,048 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:16:11,048 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805198170] [2019-12-18 13:16:11,048 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:16:11,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:16:11,277 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 13:16:11,278 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805198170] [2019-12-18 13:16:11,279 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:16:11,279 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 13:16:11,280 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982595139] [2019-12-18 13:16:11,284 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:16:11,285 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:16:11,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:16:11,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:16:11,302 INFO L87 Difference]: Start difference. First operand 129602 states. Second operand 3 states. [2019-12-18 13:16:14,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:16:14,283 INFO L93 Difference]: Finished difference Result 128376 states and 546782 transitions. [2019-12-18 13:16:14,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:16:14,285 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-18 13:16:14,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:16:14,977 INFO L225 Difference]: With dead ends: 128376 [2019-12-18 13:16:14,977 INFO L226 Difference]: Without dead ends: 120914 [2019-12-18 13:16:14,979 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 13:16:22,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120914 states. [2019-12-18 13:16:25,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120914 to 120914. [2019-12-18 13:16:25,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120914 states. [2019-12-18 13:16:25,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120914 states to 120914 states and 514358 transitions. [2019-12-18 13:16:25,608 INFO L78 Accepts]: Start accepts. Automaton has 120914 states and 514358 transitions. Word has length 3 [2019-12-18 13:16:25,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:16:25,609 INFO L462 AbstractCegarLoop]: Abstraction has 120914 states and 514358 transitions. [2019-12-18 13:16:25,609 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:16:25,609 INFO L276 IsEmpty]: Start isEmpty. Operand 120914 states and 514358 transitions. [2019-12-18 13:16:25,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 13:16:25,613 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:16:25,614 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:16:25,614 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:16:25,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:16:25,614 INFO L82 PathProgramCache]: Analyzing trace with hash 2102120012, now seen corresponding path program 1 times [2019-12-18 13:16:25,615 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:16:25,615 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231827961] [2019-12-18 13:16:25,615 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:16:25,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:16:25,721 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 13:16:25,721 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231827961] [2019-12-18 13:16:25,722 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:16:25,722 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:16:25,722 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286999433] [2019-12-18 13:16:25,723 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 13:16:25,724 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:16:25,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 13:16:25,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:16:25,724 INFO L87 Difference]: Start difference. First operand 120914 states and 514358 transitions. Second operand 4 states. [2019-12-18 13:16:31,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:16:31,061 INFO L93 Difference]: Finished difference Result 187704 states and 768206 transitions. [2019-12-18 13:16:31,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 13:16:31,062 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 13:16:31,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:16:31,672 INFO L225 Difference]: With dead ends: 187704 [2019-12-18 13:16:31,673 INFO L226 Difference]: Without dead ends: 187655 [2019-12-18 13:16:31,673 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 13:16:37,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187655 states. [2019-12-18 13:16:42,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187655 to 171775. [2019-12-18 13:16:42,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171775 states. [2019-12-18 13:16:50,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171775 states to 171775 states and 711726 transitions. [2019-12-18 13:16:50,963 INFO L78 Accepts]: Start accepts. Automaton has 171775 states and 711726 transitions. Word has length 11 [2019-12-18 13:16:50,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:16:50,964 INFO L462 AbstractCegarLoop]: Abstraction has 171775 states and 711726 transitions. [2019-12-18 13:16:50,964 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 13:16:50,964 INFO L276 IsEmpty]: Start isEmpty. Operand 171775 states and 711726 transitions. [2019-12-18 13:16:50,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 13:16:50,970 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:16:50,970 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:16:50,971 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:16:50,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:16:50,971 INFO L82 PathProgramCache]: Analyzing trace with hash -1617299066, now seen corresponding path program 1 times [2019-12-18 13:16:50,971 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:16:50,971 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995065760] [2019-12-18 13:16:50,972 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:16:50,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:16:51,035 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 13:16:51,036 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995065760] [2019-12-18 13:16:51,036 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:16:51,036 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:16:51,036 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160696366] [2019-12-18 13:16:51,037 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:16:51,037 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:16:51,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:16:51,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:16:51,037 INFO L87 Difference]: Start difference. First operand 171775 states and 711726 transitions. Second operand 3 states. [2019-12-18 13:16:51,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:16:51,173 INFO L93 Difference]: Finished difference Result 36261 states and 117727 transitions. [2019-12-18 13:16:51,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:16:51,173 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-18 13:16:51,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:16:51,270 INFO L225 Difference]: With dead ends: 36261 [2019-12-18 13:16:51,271 INFO L226 Difference]: Without dead ends: 36261 [2019-12-18 13:16:51,271 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:16:51,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36261 states. [2019-12-18 13:16:51,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36261 to 36261. [2019-12-18 13:16:51,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36261 states. [2019-12-18 13:16:51,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36261 states to 36261 states and 117727 transitions. [2019-12-18 13:16:51,961 INFO L78 Accepts]: Start accepts. Automaton has 36261 states and 117727 transitions. Word has length 13 [2019-12-18 13:16:51,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:16:51,961 INFO L462 AbstractCegarLoop]: Abstraction has 36261 states and 117727 transitions. [2019-12-18 13:16:51,962 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:16:51,962 INFO L276 IsEmpty]: Start isEmpty. Operand 36261 states and 117727 transitions. [2019-12-18 13:16:51,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 13:16:51,965 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:16:51,966 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:16:51,966 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:16:51,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:16:51,966 INFO L82 PathProgramCache]: Analyzing trace with hash 947448332, now seen corresponding path program 1 times [2019-12-18 13:16:51,966 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:16:51,967 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346590142] [2019-12-18 13:16:51,967 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:16:51,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:16:52,077 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 13:16:52,080 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346590142] [2019-12-18 13:16:52,080 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:16:52,080 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:16:52,081 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374907450] [2019-12-18 13:16:52,083 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 13:16:52,083 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:16:52,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 13:16:52,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:16:52,084 INFO L87 Difference]: Start difference. First operand 36261 states and 117727 transitions. Second operand 5 states. [2019-12-18 13:16:52,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:16:52,614 INFO L93 Difference]: Finished difference Result 50300 states and 161544 transitions. [2019-12-18 13:16:52,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 13:16:52,615 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-18 13:16:52,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:16:55,348 INFO L225 Difference]: With dead ends: 50300 [2019-12-18 13:16:55,349 INFO L226 Difference]: Without dead ends: 50300 [2019-12-18 13:16:55,349 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 13:16:55,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50300 states. [2019-12-18 13:16:56,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50300 to 43029. [2019-12-18 13:16:56,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43029 states. [2019-12-18 13:16:56,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43029 states to 43029 states and 139308 transitions. [2019-12-18 13:16:56,103 INFO L78 Accepts]: Start accepts. Automaton has 43029 states and 139308 transitions. Word has length 16 [2019-12-18 13:16:56,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:16:56,105 INFO L462 AbstractCegarLoop]: Abstraction has 43029 states and 139308 transitions. [2019-12-18 13:16:56,105 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 13:16:56,105 INFO L276 IsEmpty]: Start isEmpty. Operand 43029 states and 139308 transitions. [2019-12-18 13:16:56,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 13:16:56,115 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:16:56,115 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:16:56,115 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:16:56,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:16:56,115 INFO L82 PathProgramCache]: Analyzing trace with hash -282717849, now seen corresponding path program 1 times [2019-12-18 13:16:56,116 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:16:56,116 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148767109] [2019-12-18 13:16:56,116 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:16:56,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:16:56,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:16:56,234 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148767109] [2019-12-18 13:16:56,234 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:16:56,234 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 13:16:56,234 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145763719] [2019-12-18 13:16:56,234 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 13:16:56,235 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:16:56,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 13:16:56,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 13:16:56,235 INFO L87 Difference]: Start difference. First operand 43029 states and 139308 transitions. Second operand 6 states. [2019-12-18 13:16:57,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:16:57,158 INFO L93 Difference]: Finished difference Result 64122 states and 202692 transitions. [2019-12-18 13:16:57,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 13:16:57,158 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-18 13:16:57,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:16:57,269 INFO L225 Difference]: With dead ends: 64122 [2019-12-18 13:16:57,269 INFO L226 Difference]: Without dead ends: 64115 [2019-12-18 13:16:57,270 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-18 13:16:57,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64115 states. [2019-12-18 13:16:58,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64115 to 42953. [2019-12-18 13:16:58,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42953 states. [2019-12-18 13:16:58,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42953 states to 42953 states and 138310 transitions. [2019-12-18 13:16:58,449 INFO L78 Accepts]: Start accepts. Automaton has 42953 states and 138310 transitions. Word has length 22 [2019-12-18 13:16:58,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:16:58,449 INFO L462 AbstractCegarLoop]: Abstraction has 42953 states and 138310 transitions. [2019-12-18 13:16:58,449 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 13:16:58,449 INFO L276 IsEmpty]: Start isEmpty. Operand 42953 states and 138310 transitions. [2019-12-18 13:16:58,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 13:16:58,463 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:16:58,463 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:16:58,464 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:16:58,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:16:58,464 INFO L82 PathProgramCache]: Analyzing trace with hash -71664384, now seen corresponding path program 1 times [2019-12-18 13:16:58,464 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:16:58,465 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319698149] [2019-12-18 13:16:58,465 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:16:58,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:16:58,546 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 13:16:58,547 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319698149] [2019-12-18 13:16:58,547 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:16:58,547 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:16:58,547 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052560820] [2019-12-18 13:16:58,548 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 13:16:58,548 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:16:58,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 13:16:58,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:16:58,548 INFO L87 Difference]: Start difference. First operand 42953 states and 138310 transitions. Second operand 4 states. [2019-12-18 13:16:58,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:16:58,614 INFO L93 Difference]: Finished difference Result 17024 states and 51836 transitions. [2019-12-18 13:16:58,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 13:16:58,614 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-18 13:16:58,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:16:58,646 INFO L225 Difference]: With dead ends: 17024 [2019-12-18 13:16:58,646 INFO L226 Difference]: Without dead ends: 17024 [2019-12-18 13:16:58,647 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:16:58,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17024 states. [2019-12-18 13:16:58,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17024 to 16731. [2019-12-18 13:16:58,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16731 states. [2019-12-18 13:16:58,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16731 states to 16731 states and 51000 transitions. [2019-12-18 13:16:58,922 INFO L78 Accepts]: Start accepts. Automaton has 16731 states and 51000 transitions. Word has length 25 [2019-12-18 13:16:58,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:16:58,922 INFO L462 AbstractCegarLoop]: Abstraction has 16731 states and 51000 transitions. [2019-12-18 13:16:58,922 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 13:16:58,922 INFO L276 IsEmpty]: Start isEmpty. Operand 16731 states and 51000 transitions. [2019-12-18 13:16:58,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 13:16:58,935 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:16:58,935 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 13:16:58,935 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:16:58,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:16:58,935 INFO L82 PathProgramCache]: Analyzing trace with hash -1418175430, now seen corresponding path program 1 times [2019-12-18 13:16:58,935 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:16:58,936 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278627914] [2019-12-18 13:16:58,936 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:16:58,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:16:58,989 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 13:16:58,989 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278627914] [2019-12-18 13:16:58,990 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:16:58,990 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:16:58,990 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641530536] [2019-12-18 13:16:58,990 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:16:58,991 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:16:58,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:16:58,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:16:58,991 INFO L87 Difference]: Start difference. First operand 16731 states and 51000 transitions. Second operand 3 states. [2019-12-18 13:16:59,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:16:59,093 INFO L93 Difference]: Finished difference Result 24375 states and 72822 transitions. [2019-12-18 13:16:59,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:16:59,094 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-12-18 13:16:59,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:16:59,125 INFO L225 Difference]: With dead ends: 24375 [2019-12-18 13:16:59,126 INFO L226 Difference]: Without dead ends: 24375 [2019-12-18 13:16:59,126 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 13:16:59,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24375 states. [2019-12-18 13:16:59,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24375 to 18589. [2019-12-18 13:16:59,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18589 states. [2019-12-18 13:16:59,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18589 states to 18589 states and 56096 transitions. [2019-12-18 13:16:59,557 INFO L78 Accepts]: Start accepts. Automaton has 18589 states and 56096 transitions. Word has length 27 [2019-12-18 13:16:59,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:16:59,557 INFO L462 AbstractCegarLoop]: Abstraction has 18589 states and 56096 transitions. [2019-12-18 13:16:59,558 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:16:59,558 INFO L276 IsEmpty]: Start isEmpty. Operand 18589 states and 56096 transitions. [2019-12-18 13:16:59,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 13:16:59,570 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:16:59,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 13:16:59,570 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:16:59,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:16:59,571 INFO L82 PathProgramCache]: Analyzing trace with hash 1834697800, now seen corresponding path program 1 times [2019-12-18 13:16:59,571 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:16:59,571 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885019566] [2019-12-18 13:16:59,571 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:16:59,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:16:59,680 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 13:16:59,680 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885019566] [2019-12-18 13:16:59,680 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:16:59,681 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 13:16:59,681 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462484511] [2019-12-18 13:16:59,681 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 13:16:59,681 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:16:59,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 13:16:59,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 13:16:59,683 INFO L87 Difference]: Start difference. First operand 18589 states and 56096 transitions. Second operand 6 states. [2019-12-18 13:17:00,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:17:00,294 INFO L93 Difference]: Finished difference Result 26038 states and 76681 transitions. [2019-12-18 13:17:00,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 13:17:00,295 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-18 13:17:00,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:17:00,335 INFO L225 Difference]: With dead ends: 26038 [2019-12-18 13:17:00,335 INFO L226 Difference]: Without dead ends: 26038 [2019-12-18 13:17:00,336 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-18 13:17:00,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26038 states. [2019-12-18 13:17:00,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26038 to 21331. [2019-12-18 13:17:00,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21331 states. [2019-12-18 13:17:00,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21331 states to 21331 states and 64000 transitions. [2019-12-18 13:17:00,686 INFO L78 Accepts]: Start accepts. Automaton has 21331 states and 64000 transitions. Word has length 27 [2019-12-18 13:17:00,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:17:00,686 INFO L462 AbstractCegarLoop]: Abstraction has 21331 states and 64000 transitions. [2019-12-18 13:17:00,686 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 13:17:00,686 INFO L276 IsEmpty]: Start isEmpty. Operand 21331 states and 64000 transitions. [2019-12-18 13:17:00,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-18 13:17:00,708 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:17:00,708 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:17:00,708 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:17:00,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:17:00,709 INFO L82 PathProgramCache]: Analyzing trace with hash -2065332723, now seen corresponding path program 1 times [2019-12-18 13:17:00,709 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:17:00,709 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189647028] [2019-12-18 13:17:00,709 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:17:00,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:17:00,796 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 13:17:00,797 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189647028] [2019-12-18 13:17:00,797 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:17:00,797 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 13:17:00,797 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556907194] [2019-12-18 13:17:00,798 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 13:17:00,798 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:17:00,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 13:17:00,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 13:17:00,799 INFO L87 Difference]: Start difference. First operand 21331 states and 64000 transitions. Second operand 7 states. [2019-12-18 13:17:02,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:17:02,061 INFO L93 Difference]: Finished difference Result 28794 states and 84449 transitions. [2019-12-18 13:17:02,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-18 13:17:02,062 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-18 13:17:02,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:17:02,104 INFO L225 Difference]: With dead ends: 28794 [2019-12-18 13:17:02,105 INFO L226 Difference]: Without dead ends: 28794 [2019-12-18 13:17:02,105 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2019-12-18 13:17:02,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28794 states. [2019-12-18 13:17:02,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28794 to 19492. [2019-12-18 13:17:02,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19492 states. [2019-12-18 13:17:02,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19492 states to 19492 states and 58703 transitions. [2019-12-18 13:17:02,690 INFO L78 Accepts]: Start accepts. Automaton has 19492 states and 58703 transitions. Word has length 33 [2019-12-18 13:17:02,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:17:02,690 INFO L462 AbstractCegarLoop]: Abstraction has 19492 states and 58703 transitions. [2019-12-18 13:17:02,690 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 13:17:02,690 INFO L276 IsEmpty]: Start isEmpty. Operand 19492 states and 58703 transitions. [2019-12-18 13:17:02,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-18 13:17:02,715 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:17:02,715 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:17:02,715 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:17:02,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:17:02,715 INFO L82 PathProgramCache]: Analyzing trace with hash 603828080, now seen corresponding path program 1 times [2019-12-18 13:17:02,716 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:17:02,716 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529651913] [2019-12-18 13:17:02,716 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:17:02,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:17:02,793 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 13:17:02,793 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529651913] [2019-12-18 13:17:02,794 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:17:02,794 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:17:02,794 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171543940] [2019-12-18 13:17:02,794 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 13:17:02,795 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:17:02,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 13:17:02,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:17:02,796 INFO L87 Difference]: Start difference. First operand 19492 states and 58703 transitions. Second operand 4 states. [2019-12-18 13:17:02,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:17:02,958 INFO L93 Difference]: Finished difference Result 33180 states and 100186 transitions. [2019-12-18 13:17:02,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 13:17:02,959 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2019-12-18 13:17:02,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:17:02,997 INFO L225 Difference]: With dead ends: 33180 [2019-12-18 13:17:02,997 INFO L226 Difference]: Without dead ends: 16657 [2019-12-18 13:17:02,997 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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 13:17:03,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16657 states. [2019-12-18 13:17:03,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16657 to 16583. [2019-12-18 13:17:03,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16583 states. [2019-12-18 13:17:03,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16583 states to 16583 states and 49025 transitions. [2019-12-18 13:17:03,363 INFO L78 Accepts]: Start accepts. Automaton has 16583 states and 49025 transitions. Word has length 39 [2019-12-18 13:17:03,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:17:03,363 INFO L462 AbstractCegarLoop]: Abstraction has 16583 states and 49025 transitions. [2019-12-18 13:17:03,363 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 13:17:03,363 INFO L276 IsEmpty]: Start isEmpty. Operand 16583 states and 49025 transitions. [2019-12-18 13:17:03,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-18 13:17:03,382 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:17:03,382 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:17:03,382 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:17:03,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:17:03,383 INFO L82 PathProgramCache]: Analyzing trace with hash 1247651138, now seen corresponding path program 2 times [2019-12-18 13:17:03,383 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:17:03,383 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916211240] [2019-12-18 13:17:03,383 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:17:03,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:17:03,442 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 13:17:03,442 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916211240] [2019-12-18 13:17:03,443 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:17:03,443 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 13:17:03,443 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068574032] [2019-12-18 13:17:03,443 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:17:03,444 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:17:03,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:17:03,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:17:03,444 INFO L87 Difference]: Start difference. First operand 16583 states and 49025 transitions. Second operand 3 states. [2019-12-18 13:17:03,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:17:03,519 INFO L93 Difference]: Finished difference Result 16582 states and 49023 transitions. [2019-12-18 13:17:03,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:17:03,520 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-18 13:17:03,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:17:03,552 INFO L225 Difference]: With dead ends: 16582 [2019-12-18 13:17:03,552 INFO L226 Difference]: Without dead ends: 16582 [2019-12-18 13:17:03,553 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 13:17:03,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16582 states. [2019-12-18 13:17:03,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16582 to 16582. [2019-12-18 13:17:03,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16582 states. [2019-12-18 13:17:03,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16582 states to 16582 states and 49023 transitions. [2019-12-18 13:17:03,795 INFO L78 Accepts]: Start accepts. Automaton has 16582 states and 49023 transitions. Word has length 39 [2019-12-18 13:17:03,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:17:03,795 INFO L462 AbstractCegarLoop]: Abstraction has 16582 states and 49023 transitions. [2019-12-18 13:17:03,795 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:17:03,795 INFO L276 IsEmpty]: Start isEmpty. Operand 16582 states and 49023 transitions. [2019-12-18 13:17:03,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 13:17:03,810 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:17:03,811 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:17:03,811 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:17:03,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:17:03,811 INFO L82 PathProgramCache]: Analyzing trace with hash -2020108147, now seen corresponding path program 1 times [2019-12-18 13:17:03,811 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:17:03,812 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90500092] [2019-12-18 13:17:03,812 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:17:03,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:17:03,866 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 13:17:03,867 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90500092] [2019-12-18 13:17:03,867 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:17:03,867 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:17:03,868 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027105572] [2019-12-18 13:17:03,868 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 13:17:03,868 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:17:03,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 13:17:03,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:17:03,869 INFO L87 Difference]: Start difference. First operand 16582 states and 49023 transitions. Second operand 4 states. [2019-12-18 13:17:03,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:17:03,978 INFO L93 Difference]: Finished difference Result 26060 states and 77460 transitions. [2019-12-18 13:17:03,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 13:17:03,979 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2019-12-18 13:17:03,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:17:03,996 INFO L225 Difference]: With dead ends: 26060 [2019-12-18 13:17:03,996 INFO L226 Difference]: Without dead ends: 11670 [2019-12-18 13:17:03,997 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 13:17:04,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11670 states. [2019-12-18 13:17:04,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11670 to 11605. [2019-12-18 13:17:04,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11605 states. [2019-12-18 13:17:04,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11605 states to 11605 states and 33387 transitions. [2019-12-18 13:17:04,168 INFO L78 Accepts]: Start accepts. Automaton has 11605 states and 33387 transitions. Word has length 40 [2019-12-18 13:17:04,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:17:04,169 INFO L462 AbstractCegarLoop]: Abstraction has 11605 states and 33387 transitions. [2019-12-18 13:17:04,169 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 13:17:04,169 INFO L276 IsEmpty]: Start isEmpty. Operand 11605 states and 33387 transitions. [2019-12-18 13:17:04,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 13:17:04,180 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:17:04,180 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:17:04,180 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:17:04,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:17:04,181 INFO L82 PathProgramCache]: Analyzing trace with hash -1707989501, now seen corresponding path program 2 times [2019-12-18 13:17:04,181 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:17:04,181 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102901472] [2019-12-18 13:17:04,181 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:17:04,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:17:04,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:17:04,232 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102901472] [2019-12-18 13:17:04,232 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:17:04,232 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 13:17:04,232 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525703481] [2019-12-18 13:17:04,233 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 13:17:04,233 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:17:04,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 13:17:04,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:17:04,234 INFO L87 Difference]: Start difference. First operand 11605 states and 33387 transitions. Second operand 5 states. [2019-12-18 13:17:04,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:17:04,292 INFO L93 Difference]: Finished difference Result 10656 states and 31273 transitions. [2019-12-18 13:17:04,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 13:17:04,292 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-18 13:17:04,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:17:04,308 INFO L225 Difference]: With dead ends: 10656 [2019-12-18 13:17:04,308 INFO L226 Difference]: Without dead ends: 7573 [2019-12-18 13:17:04,308 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:17:04,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7573 states. [2019-12-18 13:17:04,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7573 to 7573. [2019-12-18 13:17:04,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7573 states. [2019-12-18 13:17:04,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7573 states to 7573 states and 24358 transitions. [2019-12-18 13:17:04,503 INFO L78 Accepts]: Start accepts. Automaton has 7573 states and 24358 transitions. Word has length 40 [2019-12-18 13:17:04,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:17:04,504 INFO L462 AbstractCegarLoop]: Abstraction has 7573 states and 24358 transitions. [2019-12-18 13:17:04,504 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 13:17:04,504 INFO L276 IsEmpty]: Start isEmpty. Operand 7573 states and 24358 transitions. [2019-12-18 13:17:04,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 13:17:04,516 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:17:04,516 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:17:04,516 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:17:04,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:17:04,517 INFO L82 PathProgramCache]: Analyzing trace with hash -1827713058, now seen corresponding path program 1 times [2019-12-18 13:17:04,517 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:17:04,517 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322038330] [2019-12-18 13:17:04,518 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:17:04,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:17:04,565 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 13:17:04,565 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322038330] [2019-12-18 13:17:04,565 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:17:04,565 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:17:04,566 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387260841] [2019-12-18 13:17:04,566 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:17:04,566 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:17:04,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:17:04,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:17:04,567 INFO L87 Difference]: Start difference. First operand 7573 states and 24358 transitions. Second operand 3 states. [2019-12-18 13:17:04,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:17:04,629 INFO L93 Difference]: Finished difference Result 10082 states and 31704 transitions. [2019-12-18 13:17:04,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:17:04,630 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-18 13:17:04,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:17:04,644 INFO L225 Difference]: With dead ends: 10082 [2019-12-18 13:17:04,644 INFO L226 Difference]: Without dead ends: 10082 [2019-12-18 13:17:04,644 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 13:17:04,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10082 states. [2019-12-18 13:17:04,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10082 to 7729. [2019-12-18 13:17:04,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7729 states. [2019-12-18 13:17:04,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7729 states to 7729 states and 24514 transitions. [2019-12-18 13:17:04,894 INFO L78 Accepts]: Start accepts. Automaton has 7729 states and 24514 transitions. Word has length 64 [2019-12-18 13:17:04,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:17:04,896 INFO L462 AbstractCegarLoop]: Abstraction has 7729 states and 24514 transitions. [2019-12-18 13:17:04,896 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:17:04,896 INFO L276 IsEmpty]: Start isEmpty. Operand 7729 states and 24514 transitions. [2019-12-18 13:17:04,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 13:17:04,905 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:17:04,905 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:17:04,905 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:17:04,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:17:04,906 INFO L82 PathProgramCache]: Analyzing trace with hash 572197328, now seen corresponding path program 1 times [2019-12-18 13:17:04,906 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:17:04,906 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823495992] [2019-12-18 13:17:04,906 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:17:04,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:17:05,012 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 13:17:05,012 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823495992] [2019-12-18 13:17:05,013 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:17:05,013 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 13:17:05,013 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838881333] [2019-12-18 13:17:05,013 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 13:17:05,014 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:17:05,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 13:17:05,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 13:17:05,014 INFO L87 Difference]: Start difference. First operand 7729 states and 24514 transitions. Second operand 7 states. [2019-12-18 13:17:05,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:17:05,377 INFO L93 Difference]: Finished difference Result 15437 states and 48014 transitions. [2019-12-18 13:17:05,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 13:17:05,378 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-18 13:17:05,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:17:05,405 INFO L225 Difference]: With dead ends: 15437 [2019-12-18 13:17:05,406 INFO L226 Difference]: Without dead ends: 11573 [2019-12-18 13:17:05,408 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-18 13:17:05,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11573 states. [2019-12-18 13:17:05,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11573 to 9445. [2019-12-18 13:17:05,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9445 states. [2019-12-18 13:17:05,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9445 states to 9445 states and 29808 transitions. [2019-12-18 13:17:05,678 INFO L78 Accepts]: Start accepts. Automaton has 9445 states and 29808 transitions. Word has length 64 [2019-12-18 13:17:05,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:17:05,678 INFO L462 AbstractCegarLoop]: Abstraction has 9445 states and 29808 transitions. [2019-12-18 13:17:05,678 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 13:17:05,678 INFO L276 IsEmpty]: Start isEmpty. Operand 9445 states and 29808 transitions. [2019-12-18 13:17:05,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 13:17:05,696 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:17:05,696 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:17:05,696 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:17:05,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:17:05,697 INFO L82 PathProgramCache]: Analyzing trace with hash -22937850, now seen corresponding path program 2 times [2019-12-18 13:17:05,697 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:17:05,697 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798186027] [2019-12-18 13:17:05,697 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:17:05,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:17:05,796 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 13:17:05,797 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798186027] [2019-12-18 13:17:05,798 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:17:05,799 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 13:17:05,799 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636822435] [2019-12-18 13:17:05,799 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 13:17:05,799 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:17:05,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 13:17:05,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 13:17:05,800 INFO L87 Difference]: Start difference. First operand 9445 states and 29808 transitions. Second operand 7 states. [2019-12-18 13:17:06,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:17:06,098 INFO L93 Difference]: Finished difference Result 17385 states and 53705 transitions. [2019-12-18 13:17:06,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 13:17:06,099 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-18 13:17:06,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:17:06,122 INFO L225 Difference]: With dead ends: 17385 [2019-12-18 13:17:06,122 INFO L226 Difference]: Without dead ends: 13105 [2019-12-18 13:17:06,123 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-18 13:17:06,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13105 states. [2019-12-18 13:17:06,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13105 to 10746. [2019-12-18 13:17:06,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10746 states. [2019-12-18 13:17:06,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10746 states to 10746 states and 33681 transitions. [2019-12-18 13:17:06,309 INFO L78 Accepts]: Start accepts. Automaton has 10746 states and 33681 transitions. Word has length 64 [2019-12-18 13:17:06,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:17:06,309 INFO L462 AbstractCegarLoop]: Abstraction has 10746 states and 33681 transitions. [2019-12-18 13:17:06,310 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 13:17:06,310 INFO L276 IsEmpty]: Start isEmpty. Operand 10746 states and 33681 transitions. [2019-12-18 13:17:06,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 13:17:06,324 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:17:06,324 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:17:06,324 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:17:06,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:17:06,325 INFO L82 PathProgramCache]: Analyzing trace with hash -1388618928, now seen corresponding path program 3 times [2019-12-18 13:17:06,325 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:17:06,325 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774717434] [2019-12-18 13:17:06,325 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:17:06,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:17:06,449 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 13:17:06,449 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774717434] [2019-12-18 13:17:06,450 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:17:06,450 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 13:17:06,450 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166356400] [2019-12-18 13:17:06,451 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 13:17:06,451 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:17:06,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 13:17:06,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 13:17:06,452 INFO L87 Difference]: Start difference. First operand 10746 states and 33681 transitions. Second operand 9 states. [2019-12-18 13:17:07,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:17:07,454 INFO L93 Difference]: Finished difference Result 24832 states and 76056 transitions. [2019-12-18 13:17:07,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-18 13:17:07,455 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2019-12-18 13:17:07,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:17:07,485 INFO L225 Difference]: With dead ends: 24832 [2019-12-18 13:17:07,485 INFO L226 Difference]: Without dead ends: 22344 [2019-12-18 13:17:07,486 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=163, Invalid=539, Unknown=0, NotChecked=0, Total=702 [2019-12-18 13:17:07,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22344 states. [2019-12-18 13:17:07,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22344 to 10578. [2019-12-18 13:17:07,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10578 states. [2019-12-18 13:17:07,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10578 states to 10578 states and 33121 transitions. [2019-12-18 13:17:07,732 INFO L78 Accepts]: Start accepts. Automaton has 10578 states and 33121 transitions. Word has length 64 [2019-12-18 13:17:07,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:17:07,733 INFO L462 AbstractCegarLoop]: Abstraction has 10578 states and 33121 transitions. [2019-12-18 13:17:07,733 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 13:17:07,733 INFO L276 IsEmpty]: Start isEmpty. Operand 10578 states and 33121 transitions. [2019-12-18 13:17:07,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 13:17:07,746 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:17:07,746 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:17:07,746 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:17:07,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:17:07,746 INFO L82 PathProgramCache]: Analyzing trace with hash -1527941036, now seen corresponding path program 4 times [2019-12-18 13:17:07,746 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:17:07,747 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230286495] [2019-12-18 13:17:07,747 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:17:07,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:17:07,874 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 13:17:07,874 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230286495] [2019-12-18 13:17:07,875 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:17:07,876 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 13:17:07,877 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390630273] [2019-12-18 13:17:07,877 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 13:17:07,877 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:17:07,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 13:17:07,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 13:17:07,880 INFO L87 Difference]: Start difference. First operand 10578 states and 33121 transitions. Second operand 9 states. [2019-12-18 13:17:09,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:17:09,136 INFO L93 Difference]: Finished difference Result 28772 states and 88210 transitions. [2019-12-18 13:17:09,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-18 13:17:09,136 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2019-12-18 13:17:09,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:17:09,175 INFO L225 Difference]: With dead ends: 28772 [2019-12-18 13:17:09,176 INFO L226 Difference]: Without dead ends: 26348 [2019-12-18 13:17:09,176 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=154, Invalid=496, Unknown=0, NotChecked=0, Total=650 [2019-12-18 13:17:09,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26348 states. [2019-12-18 13:17:09,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26348 to 10606. [2019-12-18 13:17:09,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10606 states. [2019-12-18 13:17:09,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10606 states to 10606 states and 33275 transitions. [2019-12-18 13:17:09,445 INFO L78 Accepts]: Start accepts. Automaton has 10606 states and 33275 transitions. Word has length 64 [2019-12-18 13:17:09,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:17:09,446 INFO L462 AbstractCegarLoop]: Abstraction has 10606 states and 33275 transitions. [2019-12-18 13:17:09,446 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 13:17:09,446 INFO L276 IsEmpty]: Start isEmpty. Operand 10606 states and 33275 transitions. [2019-12-18 13:17:09,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 13:17:09,462 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:17:09,462 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:17:09,463 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:17:09,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:17:09,463 INFO L82 PathProgramCache]: Analyzing trace with hash 1911526292, now seen corresponding path program 5 times [2019-12-18 13:17:09,463 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:17:09,463 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893511271] [2019-12-18 13:17:09,464 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:17:09,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:17:09,538 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 13:17:09,538 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893511271] [2019-12-18 13:17:09,538 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:17:09,538 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:17:09,539 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339655969] [2019-12-18 13:17:09,539 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:17:09,539 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:17:09,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:17:09,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:17:09,540 INFO L87 Difference]: Start difference. First operand 10606 states and 33275 transitions. Second operand 3 states. [2019-12-18 13:17:09,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:17:09,630 INFO L93 Difference]: Finished difference Result 12322 states and 38579 transitions. [2019-12-18 13:17:09,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:17:09,631 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-18 13:17:09,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:17:09,647 INFO L225 Difference]: With dead ends: 12322 [2019-12-18 13:17:09,647 INFO L226 Difference]: Without dead ends: 12322 [2019-12-18 13:17:09,647 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:17:09,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12322 states. [2019-12-18 13:17:09,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12322 to 11074. [2019-12-18 13:17:09,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11074 states. [2019-12-18 13:17:09,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11074 states to 11074 states and 34835 transitions. [2019-12-18 13:17:09,829 INFO L78 Accepts]: Start accepts. Automaton has 11074 states and 34835 transitions. Word has length 64 [2019-12-18 13:17:09,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:17:09,829 INFO L462 AbstractCegarLoop]: Abstraction has 11074 states and 34835 transitions. [2019-12-18 13:17:09,829 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:17:09,829 INFO L276 IsEmpty]: Start isEmpty. Operand 11074 states and 34835 transitions. [2019-12-18 13:17:09,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 13:17:09,841 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:17:09,841 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:17:09,842 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:17:09,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:17:09,842 INFO L82 PathProgramCache]: Analyzing trace with hash -2140458066, now seen corresponding path program 1 times [2019-12-18 13:17:09,842 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:17:09,842 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213613716] [2019-12-18 13:17:09,842 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:17:09,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:17:09,946 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 13:17:09,946 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213613716] [2019-12-18 13:17:09,946 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:17:09,947 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 13:17:09,947 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603804014] [2019-12-18 13:17:09,947 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 13:17:09,948 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:17:09,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 13:17:09,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-18 13:17:09,948 INFO L87 Difference]: Start difference. First operand 11074 states and 34835 transitions. Second operand 8 states. [2019-12-18 13:17:10,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:17:10,763 INFO L93 Difference]: Finished difference Result 29477 states and 90578 transitions. [2019-12-18 13:17:10,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-18 13:17:10,764 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 65 [2019-12-18 13:17:10,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:17:10,800 INFO L225 Difference]: With dead ends: 29477 [2019-12-18 13:17:10,800 INFO L226 Difference]: Without dead ends: 26544 [2019-12-18 13:17:10,800 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=286, Unknown=0, NotChecked=0, Total=380 [2019-12-18 13:17:10,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26544 states. [2019-12-18 13:17:11,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26544 to 11347. [2019-12-18 13:17:11,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11347 states. [2019-12-18 13:17:11,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11347 states to 11347 states and 35865 transitions. [2019-12-18 13:17:11,075 INFO L78 Accepts]: Start accepts. Automaton has 11347 states and 35865 transitions. Word has length 65 [2019-12-18 13:17:11,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:17:11,075 INFO L462 AbstractCegarLoop]: Abstraction has 11347 states and 35865 transitions. [2019-12-18 13:17:11,075 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 13:17:11,076 INFO L276 IsEmpty]: Start isEmpty. Operand 11347 states and 35865 transitions. [2019-12-18 13:17:11,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 13:17:11,089 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:17:11,089 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:17:11,089 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:17:11,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:17:11,090 INFO L82 PathProgramCache]: Analyzing trace with hash -281745782, now seen corresponding path program 2 times [2019-12-18 13:17:11,090 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:17:11,090 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064951671] [2019-12-18 13:17:11,090 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:17:11,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:17:11,203 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 13:17:11,204 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064951671] [2019-12-18 13:17:11,204 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:17:11,204 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 13:17:11,204 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252413962] [2019-12-18 13:17:11,205 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 13:17:11,205 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:17:11,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 13:17:11,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 13:17:11,205 INFO L87 Difference]: Start difference. First operand 11347 states and 35865 transitions. Second operand 9 states. [2019-12-18 13:17:12,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:17:12,135 INFO L93 Difference]: Finished difference Result 32061 states and 97811 transitions. [2019-12-18 13:17:12,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-18 13:17:12,136 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-18 13:17:12,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:17:12,176 INFO L225 Difference]: With dead ends: 32061 [2019-12-18 13:17:12,176 INFO L226 Difference]: Without dead ends: 29128 [2019-12-18 13:17:12,177 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=129, Invalid=423, Unknown=0, NotChecked=0, Total=552 [2019-12-18 13:17:12,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29128 states. [2019-12-18 13:17:12,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29128 to 11355. [2019-12-18 13:17:12,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11355 states. [2019-12-18 13:17:12,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11355 states to 11355 states and 35880 transitions. [2019-12-18 13:17:12,582 INFO L78 Accepts]: Start accepts. Automaton has 11355 states and 35880 transitions. Word has length 65 [2019-12-18 13:17:12,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:17:12,583 INFO L462 AbstractCegarLoop]: Abstraction has 11355 states and 35880 transitions. [2019-12-18 13:17:12,583 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 13:17:12,583 INFO L276 IsEmpty]: Start isEmpty. Operand 11355 states and 35880 transitions. [2019-12-18 13:17:12,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 13:17:12,602 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:17:12,602 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:17:12,602 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:17:12,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:17:12,603 INFO L82 PathProgramCache]: Analyzing trace with hash -1813356122, now seen corresponding path program 3 times [2019-12-18 13:17:12,603 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:17:12,603 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330923123] [2019-12-18 13:17:12,603 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:17:12,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:17:12,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:17:12,723 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330923123] [2019-12-18 13:17:12,723 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:17:12,723 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 13:17:12,723 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989291764] [2019-12-18 13:17:12,724 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 13:17:12,724 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:17:12,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 13:17:12,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 13:17:12,725 INFO L87 Difference]: Start difference. First operand 11355 states and 35880 transitions. Second operand 9 states. [2019-12-18 13:17:13,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:17:13,975 INFO L93 Difference]: Finished difference Result 33909 states and 103392 transitions. [2019-12-18 13:17:13,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-18 13:17:13,975 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-18 13:17:13,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:17:14,017 INFO L225 Difference]: With dead ends: 33909 [2019-12-18 13:17:14,017 INFO L226 Difference]: Without dead ends: 30991 [2019-12-18 13:17:14,018 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=118, Invalid=388, Unknown=0, NotChecked=0, Total=506 [2019-12-18 13:17:14,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30991 states. [2019-12-18 13:17:14,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30991 to 11298. [2019-12-18 13:17:14,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11298 states. [2019-12-18 13:17:14,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11298 states to 11298 states and 35607 transitions. [2019-12-18 13:17:14,325 INFO L78 Accepts]: Start accepts. Automaton has 11298 states and 35607 transitions. Word has length 65 [2019-12-18 13:17:14,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:17:14,325 INFO L462 AbstractCegarLoop]: Abstraction has 11298 states and 35607 transitions. [2019-12-18 13:17:14,325 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 13:17:14,325 INFO L276 IsEmpty]: Start isEmpty. Operand 11298 states and 35607 transitions. [2019-12-18 13:17:14,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 13:17:14,338 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:17:14,338 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:17:14,339 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:17:14,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:17:14,339 INFO L82 PathProgramCache]: Analyzing trace with hash 1724524394, now seen corresponding path program 4 times [2019-12-18 13:17:14,339 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:17:14,339 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880810799] [2019-12-18 13:17:14,340 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:17:14,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:17:14,414 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 13:17:14,415 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880810799] [2019-12-18 13:17:14,415 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:17:14,415 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:17:14,415 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932756921] [2019-12-18 13:17:14,416 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 13:17:14,416 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:17:14,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 13:17:14,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:17:14,416 INFO L87 Difference]: Start difference. First operand 11298 states and 35607 transitions. Second operand 4 states. [2019-12-18 13:17:14,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:17:14,544 INFO L93 Difference]: Finished difference Result 11142 states and 34983 transitions. [2019-12-18 13:17:14,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 13:17:14,545 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-12-18 13:17:14,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:17:14,566 INFO L225 Difference]: With dead ends: 11142 [2019-12-18 13:17:14,566 INFO L226 Difference]: Without dead ends: 11142 [2019-12-18 13:17:14,566 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:17:14,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11142 states. [2019-12-18 13:17:14,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11142 to 10674. [2019-12-18 13:17:14,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10674 states. [2019-12-18 13:17:14,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10674 states to 10674 states and 33423 transitions. [2019-12-18 13:17:14,757 INFO L78 Accepts]: Start accepts. Automaton has 10674 states and 33423 transitions. Word has length 65 [2019-12-18 13:17:14,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:17:14,757 INFO L462 AbstractCegarLoop]: Abstraction has 10674 states and 33423 transitions. [2019-12-18 13:17:14,757 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 13:17:14,758 INFO L276 IsEmpty]: Start isEmpty. Operand 10674 states and 33423 transitions. [2019-12-18 13:17:14,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 13:17:14,770 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:17:14,770 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:17:14,770 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:17:14,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:17:14,771 INFO L82 PathProgramCache]: Analyzing trace with hash 837718325, now seen corresponding path program 1 times [2019-12-18 13:17:14,771 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:17:14,771 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694157375] [2019-12-18 13:17:14,771 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:17:14,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:17:14,855 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 13:17:14,856 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694157375] [2019-12-18 13:17:14,856 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:17:14,856 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:17:14,856 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83151235] [2019-12-18 13:17:14,857 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:17:14,857 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:17:14,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:17:14,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:17:14,857 INFO L87 Difference]: Start difference. First operand 10674 states and 33423 transitions. Second operand 3 states. [2019-12-18 13:17:14,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:17:14,901 INFO L93 Difference]: Finished difference Result 8642 states and 26216 transitions. [2019-12-18 13:17:14,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:17:14,901 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-18 13:17:14,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:17:14,916 INFO L225 Difference]: With dead ends: 8642 [2019-12-18 13:17:14,916 INFO L226 Difference]: Without dead ends: 8642 [2019-12-18 13:17:14,916 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 13:17:14,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8642 states. [2019-12-18 13:17:15,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8642 to 8369. [2019-12-18 13:17:15,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8369 states. [2019-12-18 13:17:15,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8369 states to 8369 states and 25355 transitions. [2019-12-18 13:17:15,087 INFO L78 Accepts]: Start accepts. Automaton has 8369 states and 25355 transitions. Word has length 65 [2019-12-18 13:17:15,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:17:15,088 INFO L462 AbstractCegarLoop]: Abstraction has 8369 states and 25355 transitions. [2019-12-18 13:17:15,088 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:17:15,088 INFO L276 IsEmpty]: Start isEmpty. Operand 8369 states and 25355 transitions. [2019-12-18 13:17:15,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 13:17:15,096 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:17:15,096 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:17:15,096 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:17:15,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:17:15,097 INFO L82 PathProgramCache]: Analyzing trace with hash 1324094588, now seen corresponding path program 1 times [2019-12-18 13:17:15,097 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:17:15,097 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489978277] [2019-12-18 13:17:15,097 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:17:15,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:17:15,276 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 13:17:15,276 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489978277] [2019-12-18 13:17:15,276 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:17:15,276 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 13:17:15,277 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973364426] [2019-12-18 13:17:15,277 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 13:17:15,277 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:17:15,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 13:17:15,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-12-18 13:17:15,278 INFO L87 Difference]: Start difference. First operand 8369 states and 25355 transitions. Second operand 10 states. [2019-12-18 13:17:16,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:17:16,508 INFO L93 Difference]: Finished difference Result 14719 states and 43789 transitions. [2019-12-18 13:17:16,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-18 13:17:16,508 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 66 [2019-12-18 13:17:16,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:17:16,523 INFO L225 Difference]: With dead ends: 14719 [2019-12-18 13:17:16,523 INFO L226 Difference]: Without dead ends: 11119 [2019-12-18 13:17:16,524 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=300, Unknown=0, NotChecked=0, Total=380 [2019-12-18 13:17:16,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11119 states. [2019-12-18 13:17:16,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11119 to 8667. [2019-12-18 13:17:16,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8667 states. [2019-12-18 13:17:16,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8667 states to 8667 states and 26103 transitions. [2019-12-18 13:17:16,755 INFO L78 Accepts]: Start accepts. Automaton has 8667 states and 26103 transitions. Word has length 66 [2019-12-18 13:17:16,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:17:16,755 INFO L462 AbstractCegarLoop]: Abstraction has 8667 states and 26103 transitions. [2019-12-18 13:17:16,755 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 13:17:16,755 INFO L276 IsEmpty]: Start isEmpty. Operand 8667 states and 26103 transitions. [2019-12-18 13:17:16,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 13:17:16,764 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:17:16,764 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:17:16,765 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:17:16,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:17:16,765 INFO L82 PathProgramCache]: Analyzing trace with hash -1320774952, now seen corresponding path program 2 times [2019-12-18 13:17:16,765 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:17:16,765 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020307804] [2019-12-18 13:17:16,765 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:17:16,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:17:16,957 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 13:17:16,958 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020307804] [2019-12-18 13:17:16,958 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:17:16,958 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 13:17:16,958 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760361946] [2019-12-18 13:17:16,959 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 13:17:16,959 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:17:16,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 13:17:16,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-18 13:17:16,959 INFO L87 Difference]: Start difference. First operand 8667 states and 26103 transitions. Second operand 10 states. [2019-12-18 13:17:18,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:17:18,070 INFO L93 Difference]: Finished difference Result 15219 states and 44775 transitions. [2019-12-18 13:17:18,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-18 13:17:18,071 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 66 [2019-12-18 13:17:18,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:17:18,086 INFO L225 Difference]: With dead ends: 15219 [2019-12-18 13:17:18,087 INFO L226 Difference]: Without dead ends: 12167 [2019-12-18 13:17:18,087 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2019-12-18 13:17:18,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12167 states. [2019-12-18 13:17:18,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12167 to 9003. [2019-12-18 13:17:18,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9003 states. [2019-12-18 13:17:18,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9003 states to 9003 states and 26933 transitions. [2019-12-18 13:17:18,257 INFO L78 Accepts]: Start accepts. Automaton has 9003 states and 26933 transitions. Word has length 66 [2019-12-18 13:17:18,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:17:18,258 INFO L462 AbstractCegarLoop]: Abstraction has 9003 states and 26933 transitions. [2019-12-18 13:17:18,258 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 13:17:18,258 INFO L276 IsEmpty]: Start isEmpty. Operand 9003 states and 26933 transitions. [2019-12-18 13:17:18,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 13:17:18,267 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:17:18,267 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:17:18,267 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:17:18,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:17:18,268 INFO L82 PathProgramCache]: Analyzing trace with hash -961619660, now seen corresponding path program 3 times [2019-12-18 13:17:18,268 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:17:18,268 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240086661] [2019-12-18 13:17:18,268 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:17:18,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:17:18,444 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 13:17:18,444 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240086661] [2019-12-18 13:17:18,444 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:17:18,445 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 13:17:18,445 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029475738] [2019-12-18 13:17:18,445 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 13:17:18,445 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:17:18,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 13:17:18,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 13:17:18,446 INFO L87 Difference]: Start difference. First operand 9003 states and 26933 transitions. Second operand 11 states. [2019-12-18 13:17:19,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:17:19,671 INFO L93 Difference]: Finished difference Result 14591 states and 42748 transitions. [2019-12-18 13:17:19,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-18 13:17:19,671 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 66 [2019-12-18 13:17:19,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:17:19,688 INFO L225 Difference]: With dead ends: 14591 [2019-12-18 13:17:19,689 INFO L226 Difference]: Without dead ends: 11767 [2019-12-18 13:17:19,689 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=341, Unknown=0, NotChecked=0, Total=420 [2019-12-18 13:17:19,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11767 states. [2019-12-18 13:17:19,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11767 to 8715. [2019-12-18 13:17:19,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8715 states. [2019-12-18 13:17:19,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8715 states to 8715 states and 26093 transitions. [2019-12-18 13:17:19,848 INFO L78 Accepts]: Start accepts. Automaton has 8715 states and 26093 transitions. Word has length 66 [2019-12-18 13:17:19,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:17:19,848 INFO L462 AbstractCegarLoop]: Abstraction has 8715 states and 26093 transitions. [2019-12-18 13:17:19,848 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 13:17:19,848 INFO L276 IsEmpty]: Start isEmpty. Operand 8715 states and 26093 transitions. [2019-12-18 13:17:19,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 13:17:19,857 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:17:19,857 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:17:19,857 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:17:19,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:17:19,857 INFO L82 PathProgramCache]: Analyzing trace with hash 1444762494, now seen corresponding path program 4 times [2019-12-18 13:17:19,858 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:17:19,858 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518774701] [2019-12-18 13:17:19,858 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:17:19,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:17:20,021 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 13:17:20,022 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518774701] [2019-12-18 13:17:20,022 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:17:20,022 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 13:17:20,022 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509551598] [2019-12-18 13:17:20,022 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 13:17:20,022 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:17:20,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 13:17:20,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 13:17:20,023 INFO L87 Difference]: Start difference. First operand 8715 states and 26093 transitions. Second operand 11 states. [2019-12-18 13:17:20,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:17:20,819 INFO L93 Difference]: Finished difference Result 13145 states and 38921 transitions. [2019-12-18 13:17:20,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-18 13:17:20,820 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 66 [2019-12-18 13:17:20,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:17:20,836 INFO L225 Difference]: With dead ends: 13145 [2019-12-18 13:17:20,836 INFO L226 Difference]: Without dead ends: 12125 [2019-12-18 13:17:20,837 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=148, Invalid=608, Unknown=0, NotChecked=0, Total=756 [2019-12-18 13:17:20,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12125 states. [2019-12-18 13:17:20,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12125 to 10299. [2019-12-18 13:17:20,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10299 states. [2019-12-18 13:17:21,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10299 states to 10299 states and 30725 transitions. [2019-12-18 13:17:21,008 INFO L78 Accepts]: Start accepts. Automaton has 10299 states and 30725 transitions. Word has length 66 [2019-12-18 13:17:21,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:17:21,008 INFO L462 AbstractCegarLoop]: Abstraction has 10299 states and 30725 transitions. [2019-12-18 13:17:21,008 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 13:17:21,008 INFO L276 IsEmpty]: Start isEmpty. Operand 10299 states and 30725 transitions. [2019-12-18 13:17:21,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 13:17:21,019 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:17:21,019 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:17:21,019 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:17:21,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:17:21,019 INFO L82 PathProgramCache]: Analyzing trace with hash -681492930, now seen corresponding path program 5 times [2019-12-18 13:17:21,019 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:17:21,019 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286752387] [2019-12-18 13:17:21,020 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:17:21,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:17:21,174 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 13:17:21,174 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286752387] [2019-12-18 13:17:21,174 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:17:21,175 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 13:17:21,175 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183857911] [2019-12-18 13:17:21,175 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 13:17:21,175 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:17:21,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 13:17:21,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 13:17:21,176 INFO L87 Difference]: Start difference. First operand 10299 states and 30725 transitions. Second operand 11 states. [2019-12-18 13:17:22,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:17:22,170 INFO L93 Difference]: Finished difference Result 12577 states and 36855 transitions. [2019-12-18 13:17:22,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 13:17:22,170 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 66 [2019-12-18 13:17:22,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:17:22,183 INFO L225 Difference]: With dead ends: 12577 [2019-12-18 13:17:22,184 INFO L226 Difference]: Without dead ends: 10561 [2019-12-18 13:17:22,184 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=141, Invalid=509, Unknown=0, NotChecked=0, Total=650 [2019-12-18 13:17:22,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10561 states. [2019-12-18 13:17:22,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10561 to 8417. [2019-12-18 13:17:22,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8417 states. [2019-12-18 13:17:22,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8417 states to 8417 states and 25161 transitions. [2019-12-18 13:17:22,326 INFO L78 Accepts]: Start accepts. Automaton has 8417 states and 25161 transitions. Word has length 66 [2019-12-18 13:17:22,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:17:22,326 INFO L462 AbstractCegarLoop]: Abstraction has 8417 states and 25161 transitions. [2019-12-18 13:17:22,326 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 13:17:22,327 INFO L276 IsEmpty]: Start isEmpty. Operand 8417 states and 25161 transitions. [2019-12-18 13:17:22,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 13:17:22,335 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:17:22,335 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:17:22,335 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:17:22,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:17:22,335 INFO L82 PathProgramCache]: Analyzing trace with hash -336670156, now seen corresponding path program 6 times [2019-12-18 13:17:22,335 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:17:22,335 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979492197] [2019-12-18 13:17:22,335 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:17:22,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:17:22,393 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 13:17:22,394 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979492197] [2019-12-18 13:17:22,394 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:17:22,394 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:17:22,394 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830927200] [2019-12-18 13:17:22,395 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:17:22,395 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:17:22,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:17:22,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:17:22,395 INFO L87 Difference]: Start difference. First operand 8417 states and 25161 transitions. Second operand 3 states. [2019-12-18 13:17:22,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:17:22,431 INFO L93 Difference]: Finished difference Result 8416 states and 25159 transitions. [2019-12-18 13:17:22,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:17:22,431 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-18 13:17:22,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:17:22,443 INFO L225 Difference]: With dead ends: 8416 [2019-12-18 13:17:22,443 INFO L226 Difference]: Without dead ends: 8416 [2019-12-18 13:17:22,444 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 13:17:22,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8416 states. [2019-12-18 13:17:22,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8416 to 8416. [2019-12-18 13:17:22,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8416 states. [2019-12-18 13:17:22,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8416 states to 8416 states and 25159 transitions. [2019-12-18 13:17:22,571 INFO L78 Accepts]: Start accepts. Automaton has 8416 states and 25159 transitions. Word has length 66 [2019-12-18 13:17:22,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:17:22,572 INFO L462 AbstractCegarLoop]: Abstraction has 8416 states and 25159 transitions. [2019-12-18 13:17:22,572 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:17:22,572 INFO L276 IsEmpty]: Start isEmpty. Operand 8416 states and 25159 transitions. [2019-12-18 13:17:22,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 13:17:22,580 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:17:22,580 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:17:22,580 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:17:22,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:17:22,580 INFO L82 PathProgramCache]: Analyzing trace with hash -945042827, now seen corresponding path program 1 times [2019-12-18 13:17:22,580 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:17:22,580 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924302772] [2019-12-18 13:17:22,581 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:17:22,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:17:22,728 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 13:17:22,728 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924302772] [2019-12-18 13:17:22,728 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:17:22,729 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 13:17:22,729 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085877972] [2019-12-18 13:17:22,729 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 13:17:22,730 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:17:22,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 13:17:22,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 13:17:22,730 INFO L87 Difference]: Start difference. First operand 8416 states and 25159 transitions. Second operand 11 states. [2019-12-18 13:17:23,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:17:23,419 INFO L93 Difference]: Finished difference Result 10608 states and 31112 transitions. [2019-12-18 13:17:23,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 13:17:23,419 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-18 13:17:23,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:17:23,434 INFO L225 Difference]: With dead ends: 10608 [2019-12-18 13:17:23,434 INFO L226 Difference]: Without dead ends: 10397 [2019-12-18 13:17:23,435 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=128, Invalid=522, Unknown=0, NotChecked=0, Total=650 [2019-12-18 13:17:23,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10397 states. [2019-12-18 13:17:23,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10397 to 8240. [2019-12-18 13:17:23,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8240 states. [2019-12-18 13:17:23,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8240 states to 8240 states and 24675 transitions. [2019-12-18 13:17:23,577 INFO L78 Accepts]: Start accepts. Automaton has 8240 states and 24675 transitions. Word has length 67 [2019-12-18 13:17:23,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:17:23,577 INFO L462 AbstractCegarLoop]: Abstraction has 8240 states and 24675 transitions. [2019-12-18 13:17:23,577 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 13:17:23,577 INFO L276 IsEmpty]: Start isEmpty. Operand 8240 states and 24675 transitions. [2019-12-18 13:17:23,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 13:17:23,585 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:17:23,585 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:17:23,585 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:17:23,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:17:23,586 INFO L82 PathProgramCache]: Analyzing trace with hash -1748623595, now seen corresponding path program 2 times [2019-12-18 13:17:23,586 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:17:23,586 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394428857] [2019-12-18 13:17:23,586 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:17:23,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 13:17:23,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 13:17:23,710 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 13:17:23,710 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 13:17:23,714 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [905] [905] ULTIMATE.startENTRY-->L842: Formula: (let ((.cse0 (store |v_#valid_67| 0 0))) (and (= v_~b$r_buff1_thd0~0_230 0) (= v_~b$w_buff1~0_176 0) (= v_~b$mem_tmp~0_20 0) (= |v_#valid_65| (store .cse0 |v_ULTIMATE.start_main_~#t861~0.base_25| 1)) (= v_~weak$$choice2~0_144 0) (= 0 v_~b$r_buff1_thd3~0_337) (= 0 v_~b$read_delayed~0_7) (= 0 v_~b$r_buff0_thd2~0_182) (= 0 v_~__unbuffered_p0_EAX~0_176) (= v_~__unbuffered_p1_EBX~0_38 0) (= v_~main$tmp_guard1~0_34 0) (= v_~y~0_19 0) (= 0 v_~__unbuffered_p1_EAX~0_38) (= v_~b$r_buff0_thd0~0_204 0) (< 0 |v_#StackHeapBarrier_17|) (= 0 v_~b$r_buff1_thd1~0_215) (= v_~a~0_14 0) (= 0 v_~x~0_124) (= 0 v_~b$r_buff0_thd3~0_395) (= v_~__unbuffered_p2_EBX~0_38 0) (= v_~b$read_delayed_var~0.offset_7 0) (= v_~z~0_23 0) (= 0 |v_#NULL.base_4|) (= 0 |v_ULTIMATE.start_main_~#t861~0.offset_17|) (= 0 v_~__unbuffered_p2_EAX~0_34) (= 0 v_~b$w_buff0_used~0_787) (= (store |v_#length_26| |v_ULTIMATE.start_main_~#t861~0.base_25| 4) |v_#length_25|) (= |v_#NULL.offset_4| 0) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t861~0.base_25| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t861~0.base_25|) |v_ULTIMATE.start_main_~#t861~0.offset_17| 0)) |v_#memory_int_23|) (= 0 v_~b$w_buff0~0_250) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t861~0.base_25|) (= v_~__unbuffered_cnt~0_137 0) (= 0 v_~b$w_buff1_used~0_450) (= 0 v_~b$r_buff1_thd2~0_222) (= 0 v_~weak$$choice0~0_13) (= v_~b~0_186 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t861~0.base_25|) 0) (= v_~main$tmp_guard0~0_24 0) (= v_~b$flush_delayed~0_35 0) (= 0 v_~b$read_delayed_var~0.base_7) (= 0 v_~b$r_buff0_thd1~0_323))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_67|, #memory_int=|v_#memory_int_24|, #length=|v_#length_26|} OutVars{~b$r_buff0_thd3~0=v_~b$r_buff0_thd3~0_395, ~b$r_buff1_thd1~0=v_~b$r_buff1_thd1~0_215, ~b$read_delayed_var~0.offset=v_~b$read_delayed_var~0.offset_7, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_35|, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_245|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_51|, ~b$w_buff0_used~0=v_~b$w_buff0_used~0_787, ~a~0=v_~a~0_14, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_68|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_176, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_38, #length=|v_#length_25|, ~b$w_buff0~0=v_~b$w_buff0~0_250, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_34, ULTIMATE.start_main_~#t861~0.base=|v_ULTIMATE.start_main_~#t861~0.base_25|, ~b$r_buff0_thd0~0=v_~b$r_buff0_thd0~0_204, ~b$r_buff0_thd2~0=v_~b$r_buff0_thd2~0_182, ~b$mem_tmp~0=v_~b$mem_tmp~0_20, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_38, ~b$flush_delayed~0=v_~b$flush_delayed~0_35, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_10|, ~b$read_delayed~0=v_~b$read_delayed~0_7, ~weak$$choice0~0=v_~weak$$choice0~0_13, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ~b$w_buff1~0=v_~b$w_buff1~0_176, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_137, ~x~0=v_~x~0_124, ~b$r_buff0_thd1~0=v_~b$r_buff0_thd1~0_323, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_34, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_37|, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_45|, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_450, ULTIMATE.start_main_~#t861~0.offset=|v_ULTIMATE.start_main_~#t861~0.offset_17|, ~y~0=v_~y~0_19, ~b$r_buff1_thd2~0=v_~b$r_buff1_thd2~0_222, ULTIMATE.start_main_~#t863~0.offset=|v_ULTIMATE.start_main_~#t863~0.offset_17|, ~b$r_buff1_thd0~0=v_~b$r_buff1_thd0~0_230, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_38, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_23|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_9|, ULTIMATE.start_main_~#t862~0.base=|v_ULTIMATE.start_main_~#t862~0.base_21|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_24, #NULL.base=|v_#NULL.base_4|, ~b$read_delayed_var~0.base=v_~b$read_delayed_var~0.base_7, ULTIMATE.start_main_~#t862~0.offset=|v_ULTIMATE.start_main_~#t862~0.offset_17|, ULTIMATE.start_main_~#t863~0.base=|v_ULTIMATE.start_main_~#t863~0.base_21|, ~b~0=v_~b~0_186, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_28|, #valid=|v_#valid_65|, #memory_int=|v_#memory_int_23|, ~z~0=v_~z~0_23, ~weak$$choice2~0=v_~weak$$choice2~0_144, ~b$r_buff1_thd3~0=v_~b$r_buff1_thd3~0_337} AuxVars[] AssignedVars[~b$r_buff0_thd3~0, ~b$r_buff1_thd1~0, ~b$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_#t~ite50, ~b$w_buff0_used~0, ~a~0, ULTIMATE.start_main_#t~ite52, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, #length, ~b$w_buff0~0, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t861~0.base, ~b$r_buff0_thd0~0, ~b$r_buff0_thd2~0, ~b$mem_tmp~0, ~__unbuffered_p2_EBX~0, ~b$flush_delayed~0, ULTIMATE.start_main_#t~nondet45, ~b$read_delayed~0, ~weak$$choice0~0, ~b$w_buff1~0, ~__unbuffered_cnt~0, ~x~0, ~b$r_buff0_thd1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ULTIMATE.start_main_#t~ite51, ~b$w_buff1_used~0, ULTIMATE.start_main_~#t861~0.offset, ~y~0, ~b$r_buff1_thd2~0, ULTIMATE.start_main_~#t863~0.offset, ~b$r_buff1_thd0~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~nondet46, ULTIMATE.start_main_#t~nondet44, ULTIMATE.start_main_~#t862~0.base, ~main$tmp_guard0~0, #NULL.base, ~b$read_delayed_var~0.base, ULTIMATE.start_main_~#t862~0.offset, ULTIMATE.start_main_~#t863~0.base, ~b~0, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~b$r_buff1_thd3~0] because there is no mapped edge [2019-12-18 13:17:23,715 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [864] [864] L842-1-->L844: Formula: (and (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t862~0.base_10|) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t862~0.base_10| 4)) (= |v_ULTIMATE.start_main_~#t862~0.offset_9| 0) (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t862~0.base_10| 1)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t862~0.base_10| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t862~0.base_10|) |v_ULTIMATE.start_main_~#t862~0.offset_9| 1)) |v_#memory_int_11|) (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t862~0.base_10|)) (not (= |v_ULTIMATE.start_main_~#t862~0.base_10| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_~#t862~0.offset=|v_ULTIMATE.start_main_~#t862~0.offset_9|, #StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_4|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t862~0.base=|v_ULTIMATE.start_main_~#t862~0.base_10|, #length=|v_#length_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t862~0.offset, ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, ULTIMATE.start_main_~#t862~0.base, #length] because there is no mapped edge [2019-12-18 13:17:23,716 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [880] [880] L844-1-->L846: Formula: (and (not (= 0 |v_ULTIMATE.start_main_~#t863~0.base_13|)) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t863~0.base_13| 4)) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t863~0.base_13| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t863~0.base_13|) |v_ULTIMATE.start_main_~#t863~0.offset_11| 2)) |v_#memory_int_15|) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t863~0.base_13|) (= 0 (select |v_#valid_37| |v_ULTIMATE.start_main_~#t863~0.base_13|)) (= 0 |v_ULTIMATE.start_main_~#t863~0.offset_11|) (= |v_#valid_36| (store |v_#valid_37| |v_ULTIMATE.start_main_~#t863~0.base_13| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t863~0.offset=|v_ULTIMATE.start_main_~#t863~0.offset_11|, ULTIMATE.start_main_~#t863~0.base=|v_ULTIMATE.start_main_~#t863~0.base_13|, #StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_36|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_6|, #memory_int=|v_#memory_int_15|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t863~0.offset, ULTIMATE.start_main_~#t863~0.base, #valid, ULTIMATE.start_main_#t~nondet45, #memory_int, #length] because there is no mapped edge [2019-12-18 13:17:23,719 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [883] [883] L4-->L754: Formula: (and (= ~b$r_buff1_thd0~0_Out-719492501 ~b$r_buff0_thd0~0_In-719492501) (= ~b$r_buff1_thd1~0_Out-719492501 ~b$r_buff0_thd1~0_In-719492501) (= ~b$r_buff1_thd2~0_Out-719492501 ~b$r_buff0_thd2~0_In-719492501) (= ~b$r_buff0_thd1~0_Out-719492501 1) (not (= 0 P0Thread1of1ForFork2___VERIFIER_assert_~expression_In-719492501)) (= ~x~0_In-719492501 ~__unbuffered_p0_EAX~0_Out-719492501) (= ~b$r_buff1_thd3~0_Out-719492501 ~b$r_buff0_thd3~0_In-719492501)) InVars {~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_In-719492501, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In-719492501, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In-719492501, P0Thread1of1ForFork2___VERIFIER_assert_~expression=P0Thread1of1ForFork2___VERIFIER_assert_~expression_In-719492501, ~x~0=~x~0_In-719492501, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In-719492501} OutVars{~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_Out-719492501, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In-719492501, ~__unbuffered_p0_EAX~0=~__unbuffered_p0_EAX~0_Out-719492501, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In-719492501, ~b$r_buff1_thd1~0=~b$r_buff1_thd1~0_Out-719492501, ~b$r_buff1_thd0~0=~b$r_buff1_thd0~0_Out-719492501, P0Thread1of1ForFork2___VERIFIER_assert_~expression=P0Thread1of1ForFork2___VERIFIER_assert_~expression_In-719492501, ~b$r_buff1_thd2~0=~b$r_buff1_thd2~0_Out-719492501, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_Out-719492501, ~x~0=~x~0_In-719492501, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In-719492501} AuxVars[] AssignedVars[~b$r_buff0_thd1~0, ~__unbuffered_p0_EAX~0, ~b$r_buff1_thd1~0, ~b$r_buff1_thd0~0, ~b$r_buff1_thd2~0, ~b$r_buff1_thd3~0] because there is no mapped edge [2019-12-18 13:17:23,721 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L780-2-->L780-4: Formula: (let ((.cse0 (= 0 (mod ~b$r_buff1_thd2~0_In-861518612 256))) (.cse1 (= 0 (mod ~b$w_buff1_used~0_In-861518612 256)))) (or (and (= ~b~0_In-861518612 |P1Thread1of1ForFork0_#t~ite9_Out-861518612|) (or .cse0 .cse1)) (and (= ~b$w_buff1~0_In-861518612 |P1Thread1of1ForFork0_#t~ite9_Out-861518612|) (not .cse0) (not .cse1)))) InVars {~b$w_buff1_used~0=~b$w_buff1_used~0_In-861518612, ~b~0=~b~0_In-861518612, ~b$w_buff1~0=~b$w_buff1~0_In-861518612, ~b$r_buff1_thd2~0=~b$r_buff1_thd2~0_In-861518612} OutVars{~b$w_buff1_used~0=~b$w_buff1_used~0_In-861518612, ~b~0=~b~0_In-861518612, ~b$w_buff1~0=~b$w_buff1~0_In-861518612, P1Thread1of1ForFork0_#t~ite9=|P1Thread1of1ForFork0_#t~ite9_Out-861518612|, ~b$r_buff1_thd2~0=~b$r_buff1_thd2~0_In-861518612} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite9] because there is no mapped edge [2019-12-18 13:17:23,721 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L780-4-->L781: Formula: (= v_~b~0_66 |v_P1Thread1of1ForFork0_#t~ite9_34|) InVars {P1Thread1of1ForFork0_#t~ite9=|v_P1Thread1of1ForFork0_#t~ite9_34|} OutVars{~b~0=v_~b~0_66, P1Thread1of1ForFork0_#t~ite10=|v_P1Thread1of1ForFork0_#t~ite10_53|, P1Thread1of1ForFork0_#t~ite9=|v_P1Thread1of1ForFork0_#t~ite9_33|} AuxVars[] AssignedVars[~b~0, P1Thread1of1ForFork0_#t~ite10, P1Thread1of1ForFork0_#t~ite9] because there is no mapped edge [2019-12-18 13:17:23,722 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [845] [845] L781-->L781-2: Formula: (let ((.cse1 (= 0 (mod ~b$w_buff0_used~0_In-98476805 256))) (.cse0 (= 0 (mod ~b$r_buff0_thd2~0_In-98476805 256)))) (or (and (= ~b$w_buff0_used~0_In-98476805 |P1Thread1of1ForFork0_#t~ite11_Out-98476805|) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= 0 |P1Thread1of1ForFork0_#t~ite11_Out-98476805|)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-98476805, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In-98476805} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In-98476805, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In-98476805, P1Thread1of1ForFork0_#t~ite11=|P1Thread1of1ForFork0_#t~ite11_Out-98476805|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite11] because there is no mapped edge [2019-12-18 13:17:23,722 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [827] [827] L782-->L782-2: Formula: (let ((.cse2 (= 0 (mod ~b$w_buff1_used~0_In1155804199 256))) (.cse3 (= 0 (mod ~b$r_buff1_thd2~0_In1155804199 256))) (.cse1 (= 0 (mod ~b$r_buff0_thd2~0_In1155804199 256))) (.cse0 (= (mod ~b$w_buff0_used~0_In1155804199 256) 0))) (or (and (= ~b$w_buff1_used~0_In1155804199 |P1Thread1of1ForFork0_#t~ite12_Out1155804199|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P1Thread1of1ForFork0_#t~ite12_Out1155804199|) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In1155804199, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In1155804199, ~b$w_buff1_used~0=~b$w_buff1_used~0_In1155804199, ~b$r_buff1_thd2~0=~b$r_buff1_thd2~0_In1155804199} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In1155804199, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In1155804199, ~b$w_buff1_used~0=~b$w_buff1_used~0_In1155804199, P1Thread1of1ForFork0_#t~ite12=|P1Thread1of1ForFork0_#t~ite12_Out1155804199|, ~b$r_buff1_thd2~0=~b$r_buff1_thd2~0_In1155804199} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite12] because there is no mapped edge [2019-12-18 13:17:23,722 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [848] [848] L783-->L783-2: Formula: (let ((.cse0 (= (mod ~b$w_buff0_used~0_In1548336103 256) 0)) (.cse1 (= (mod ~b$r_buff0_thd2~0_In1548336103 256) 0))) (or (and (= ~b$r_buff0_thd2~0_In1548336103 |P1Thread1of1ForFork0_#t~ite13_Out1548336103|) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork0_#t~ite13_Out1548336103|)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In1548336103, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In1548336103} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In1548336103, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In1548336103, P1Thread1of1ForFork0_#t~ite13=|P1Thread1of1ForFork0_#t~ite13_Out1548336103|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite13] because there is no mapped edge [2019-12-18 13:17:23,723 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [849] [849] L784-->L784-2: Formula: (let ((.cse1 (= 0 (mod ~b$r_buff1_thd2~0_In1438261682 256))) (.cse0 (= (mod ~b$w_buff1_used~0_In1438261682 256) 0)) (.cse2 (= (mod ~b$w_buff0_used~0_In1438261682 256) 0)) (.cse3 (= (mod ~b$r_buff0_thd2~0_In1438261682 256) 0))) (or (and (= 0 |P1Thread1of1ForFork0_#t~ite14_Out1438261682|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse2 .cse3) (= ~b$r_buff1_thd2~0_In1438261682 |P1Thread1of1ForFork0_#t~ite14_Out1438261682|)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In1438261682, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In1438261682, ~b$w_buff1_used~0=~b$w_buff1_used~0_In1438261682, ~b$r_buff1_thd2~0=~b$r_buff1_thd2~0_In1438261682} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In1438261682, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In1438261682, ~b$w_buff1_used~0=~b$w_buff1_used~0_In1438261682, P1Thread1of1ForFork0_#t~ite14=|P1Thread1of1ForFork0_#t~ite14_Out1438261682|, ~b$r_buff1_thd2~0=~b$r_buff1_thd2~0_In1438261682} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite14] because there is no mapped edge [2019-12-18 13:17:23,723 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [860] [860] L784-2-->P1EXIT: Formula: (and (= v_~__unbuffered_cnt~0_68 (+ v_~__unbuffered_cnt~0_69 1)) (= v_~b$r_buff1_thd2~0_85 |v_P1Thread1of1ForFork0_#t~ite14_32|) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_69, P1Thread1of1ForFork0_#t~ite14=|v_P1Thread1of1ForFork0_#t~ite14_32|} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_68, P1Thread1of1ForFork0_#t~ite14=|v_P1Thread1of1ForFork0_#t~ite14_31|, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_5|, ~b$r_buff1_thd2~0=v_~b$r_buff1_thd2~0_85, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_5|} AuxVars[] AssignedVars[~__unbuffered_cnt~0, P1Thread1of1ForFork0_#t~ite14, P1Thread1of1ForFork0_#res.offset, ~b$r_buff1_thd2~0, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-18 13:17:23,725 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [884] [884] L808-->L808-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In471297393 256)))) (or (and (= ~b$w_buff0~0_In471297393 |P2Thread1of1ForFork1_#t~ite21_Out471297393|) (= |P2Thread1of1ForFork1_#t~ite20_In471297393| |P2Thread1of1ForFork1_#t~ite20_Out471297393|) (not .cse0)) (and (= |P2Thread1of1ForFork1_#t~ite21_Out471297393| |P2Thread1of1ForFork1_#t~ite20_Out471297393|) .cse0 (= ~b$w_buff0~0_In471297393 |P2Thread1of1ForFork1_#t~ite20_Out471297393|) (let ((.cse1 (= 0 (mod ~b$r_buff0_thd3~0_In471297393 256)))) (or (and .cse1 (= 0 (mod ~b$r_buff1_thd3~0_In471297393 256))) (and (= 0 (mod ~b$w_buff1_used~0_In471297393 256)) .cse1) (= 0 (mod ~b$w_buff0_used~0_In471297393 256))))))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In471297393, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In471297393, P2Thread1of1ForFork1_#t~ite20=|P2Thread1of1ForFork1_#t~ite20_In471297393|, ~b$w_buff1_used~0=~b$w_buff1_used~0_In471297393, ~b$w_buff0~0=~b$w_buff0~0_In471297393, ~weak$$choice2~0=~weak$$choice2~0_In471297393, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In471297393} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In471297393, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In471297393, P2Thread1of1ForFork1_#t~ite20=|P2Thread1of1ForFork1_#t~ite20_Out471297393|, P2Thread1of1ForFork1_#t~ite21=|P2Thread1of1ForFork1_#t~ite21_Out471297393|, ~b$w_buff1_used~0=~b$w_buff1_used~0_In471297393, ~b$w_buff0~0=~b$w_buff0~0_In471297393, ~weak$$choice2~0=~weak$$choice2~0_In471297393, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In471297393} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite20, P2Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-18 13:17:23,726 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [885] [885] L810-->L810-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In-1660491313 256) 0))) (or (and (let ((.cse0 (= 0 (mod ~b$r_buff0_thd3~0_In-1660491313 256)))) (or (and .cse0 (= 0 (mod ~b$r_buff1_thd3~0_In-1660491313 256))) (= (mod ~b$w_buff0_used~0_In-1660491313 256) 0) (and (= (mod ~b$w_buff1_used~0_In-1660491313 256) 0) .cse0))) (= |P2Thread1of1ForFork1_#t~ite27_Out-1660491313| |P2Thread1of1ForFork1_#t~ite26_Out-1660491313|) .cse1 (= |P2Thread1of1ForFork1_#t~ite26_Out-1660491313| ~b$w_buff0_used~0_In-1660491313)) (and (not .cse1) (= |P2Thread1of1ForFork1_#t~ite27_Out-1660491313| ~b$w_buff0_used~0_In-1660491313) (= |P2Thread1of1ForFork1_#t~ite26_In-1660491313| |P2Thread1of1ForFork1_#t~ite26_Out-1660491313|)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-1660491313, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In-1660491313, P2Thread1of1ForFork1_#t~ite26=|P2Thread1of1ForFork1_#t~ite26_In-1660491313|, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-1660491313, ~weak$$choice2~0=~weak$$choice2~0_In-1660491313, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In-1660491313} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In-1660491313, P2Thread1of1ForFork1_#t~ite26=|P2Thread1of1ForFork1_#t~ite26_Out-1660491313|, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In-1660491313, P2Thread1of1ForFork1_#t~ite27=|P2Thread1of1ForFork1_#t~ite27_Out-1660491313|, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-1660491313, ~weak$$choice2~0=~weak$$choice2~0_In-1660491313, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In-1660491313} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite26, P2Thread1of1ForFork1_#t~ite27] because there is no mapped edge [2019-12-18 13:17:23,728 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [768] [768] L812-->L813: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_15 256))) (= v_~b$r_buff0_thd3~0_79 v_~b$r_buff0_thd3~0_78)) InVars {~b$r_buff0_thd3~0=v_~b$r_buff0_thd3~0_79, ~weak$$choice2~0=v_~weak$$choice2~0_15} OutVars{~b$r_buff0_thd3~0=v_~b$r_buff0_thd3~0_78, P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_9|, P2Thread1of1ForFork1_#t~ite31=|v_P2Thread1of1ForFork1_#t~ite31_8|, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_9|, ~weak$$choice2~0=v_~weak$$choice2~0_15} AuxVars[] AssignedVars[~b$r_buff0_thd3~0, P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite31, P2Thread1of1ForFork1_#t~ite33] because there is no mapped edge [2019-12-18 13:17:23,730 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [791] [791] L815-->L819: Formula: (and (= v_~b$flush_delayed~0_7 0) (not (= (mod v_~b$flush_delayed~0_8 256) 0)) (= v_~b~0_30 v_~b$mem_tmp~0_5)) InVars {~b$mem_tmp~0=v_~b$mem_tmp~0_5, ~b$flush_delayed~0=v_~b$flush_delayed~0_8} OutVars{~b$mem_tmp~0=v_~b$mem_tmp~0_5, P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_7|, ~b~0=v_~b~0_30, ~b$flush_delayed~0=v_~b$flush_delayed~0_7} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37, ~b~0, ~b$flush_delayed~0] because there is no mapped edge [2019-12-18 13:17:23,731 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [844] [844] L819-2-->L819-4: Formula: (let ((.cse1 (= 0 (mod ~b$r_buff1_thd3~0_In-1389637792 256))) (.cse0 (= (mod ~b$w_buff1_used~0_In-1389637792 256) 0))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork1_#t~ite38_Out-1389637792| ~b~0_In-1389637792)) (and (not .cse1) (not .cse0) (= |P2Thread1of1ForFork1_#t~ite38_Out-1389637792| ~b$w_buff1~0_In-1389637792)))) InVars {~b$w_buff1_used~0=~b$w_buff1_used~0_In-1389637792, ~b~0=~b~0_In-1389637792, ~b$w_buff1~0=~b$w_buff1~0_In-1389637792, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In-1389637792} OutVars{P2Thread1of1ForFork1_#t~ite38=|P2Thread1of1ForFork1_#t~ite38_Out-1389637792|, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-1389637792, ~b~0=~b~0_In-1389637792, ~b$w_buff1~0=~b$w_buff1~0_In-1389637792, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In-1389637792} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite38] because there is no mapped edge [2019-12-18 13:17:23,731 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [795] [795] L819-4-->L820: Formula: (= v_~b~0_46 |v_P2Thread1of1ForFork1_#t~ite38_12|) InVars {P2Thread1of1ForFork1_#t~ite38=|v_P2Thread1of1ForFork1_#t~ite38_12|} OutVars{P2Thread1of1ForFork1_#t~ite38=|v_P2Thread1of1ForFork1_#t~ite38_11|, ~b~0=v_~b~0_46, P2Thread1of1ForFork1_#t~ite39=|v_P2Thread1of1ForFork1_#t~ite39_7|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite38, ~b~0, P2Thread1of1ForFork1_#t~ite39] because there is no mapped edge [2019-12-18 13:17:23,731 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L820-->L820-2: Formula: (let ((.cse1 (= 0 (mod ~b$w_buff0_used~0_In-964569267 256))) (.cse0 (= (mod ~b$r_buff0_thd3~0_In-964569267 256) 0))) (or (and (or .cse0 .cse1) (= ~b$w_buff0_used~0_In-964569267 |P2Thread1of1ForFork1_#t~ite40_Out-964569267|)) (and (not .cse1) (= 0 |P2Thread1of1ForFork1_#t~ite40_Out-964569267|) (not .cse0)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-964569267, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In-964569267} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In-964569267, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In-964569267, P2Thread1of1ForFork1_#t~ite40=|P2Thread1of1ForFork1_#t~ite40_Out-964569267|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite40] because there is no mapped edge [2019-12-18 13:17:23,732 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [846] [846] L821-->L821-2: Formula: (let ((.cse3 (= (mod ~b$w_buff0_used~0_In-483753696 256) 0)) (.cse2 (= 0 (mod ~b$r_buff0_thd3~0_In-483753696 256))) (.cse0 (= (mod ~b$r_buff1_thd3~0_In-483753696 256) 0)) (.cse1 (= 0 (mod ~b$w_buff1_used~0_In-483753696 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork1_#t~ite41_Out-483753696|)) (and (or .cse3 .cse2) (= ~b$w_buff1_used~0_In-483753696 |P2Thread1of1ForFork1_#t~ite41_Out-483753696|) (or .cse0 .cse1)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-483753696, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In-483753696, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-483753696, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In-483753696} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In-483753696, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In-483753696, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-483753696, P2Thread1of1ForFork1_#t~ite41=|P2Thread1of1ForFork1_#t~ite41_Out-483753696|, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In-483753696} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite41] because there is no mapped edge [2019-12-18 13:17:23,732 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [839] [839] L822-->L822-2: Formula: (let ((.cse0 (= (mod ~b$w_buff0_used~0_In-248967723 256) 0)) (.cse1 (= 0 (mod ~b$r_buff0_thd3~0_In-248967723 256)))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork1_#t~ite42_Out-248967723| 0)) (and (or .cse0 .cse1) (= |P2Thread1of1ForFork1_#t~ite42_Out-248967723| ~b$r_buff0_thd3~0_In-248967723)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-248967723, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In-248967723} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In-248967723, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In-248967723, P2Thread1of1ForFork1_#t~ite42=|P2Thread1of1ForFork1_#t~ite42_Out-248967723|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite42] because there is no mapped edge [2019-12-18 13:17:23,733 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [829] [829] L823-->L823-2: Formula: (let ((.cse1 (= (mod ~b$w_buff1_used~0_In1471692451 256) 0)) (.cse0 (= 0 (mod ~b$r_buff1_thd3~0_In1471692451 256))) (.cse2 (= (mod ~b$r_buff0_thd3~0_In1471692451 256) 0)) (.cse3 (= 0 (mod ~b$w_buff0_used~0_In1471692451 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P2Thread1of1ForFork1_#t~ite43_Out1471692451| ~b$r_buff1_thd3~0_In1471692451)) (and (= |P2Thread1of1ForFork1_#t~ite43_Out1471692451| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In1471692451, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In1471692451, ~b$w_buff1_used~0=~b$w_buff1_used~0_In1471692451, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In1471692451} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In1471692451, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In1471692451, P2Thread1of1ForFork1_#t~ite43=|P2Thread1of1ForFork1_#t~ite43_Out1471692451|, ~b$w_buff1_used~0=~b$w_buff1_used~0_In1471692451, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In1471692451} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite43] because there is no mapped edge [2019-12-18 13:17:23,733 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [859] [859] L823-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork1_#res.offset_5|) (= 0 |v_P2Thread1of1ForFork1_#res.base_5|) (= |v_P2Thread1of1ForFork1_#t~ite43_44| v_~b$r_buff1_thd3~0_140) (= (+ v_~__unbuffered_cnt~0_63 1) v_~__unbuffered_cnt~0_62)) InVars {P2Thread1of1ForFork1_#t~ite43=|v_P2Thread1of1ForFork1_#t~ite43_44|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_63} OutVars{P2Thread1of1ForFork1_#t~ite43=|v_P2Thread1of1ForFork1_#t~ite43_43|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_62, ~b$r_buff1_thd3~0=v_~b$r_buff1_thd3~0_140, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite43, P2Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0, ~b$r_buff1_thd3~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-18 13:17:23,733 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [847] [847] L755-->L755-2: Formula: (let ((.cse1 (= 0 (mod ~b$w_buff0_used~0_In1076718043 256))) (.cse0 (= (mod ~b$r_buff0_thd1~0_In1076718043 256) 0))) (or (and (= ~b$w_buff0_used~0_In1076718043 |P0Thread1of1ForFork2_#t~ite5_Out1076718043|) (or .cse0 .cse1)) (and (not .cse1) (= |P0Thread1of1ForFork2_#t~ite5_Out1076718043| 0) (not .cse0)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In1076718043, ~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_In1076718043} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In1076718043, ~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_In1076718043, P0Thread1of1ForFork2_#t~ite5=|P0Thread1of1ForFork2_#t~ite5_Out1076718043|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite5] because there is no mapped edge [2019-12-18 13:17:23,734 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L756-->L756-2: Formula: (let ((.cse3 (= (mod ~b$w_buff1_used~0_In1380701415 256) 0)) (.cse2 (= (mod ~b$r_buff1_thd1~0_In1380701415 256) 0)) (.cse1 (= (mod ~b$w_buff0_used~0_In1380701415 256) 0)) (.cse0 (= 0 (mod ~b$r_buff0_thd1~0_In1380701415 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork2_#t~ite6_Out1380701415| 0)) (and (= |P0Thread1of1ForFork2_#t~ite6_Out1380701415| ~b$w_buff1_used~0_In1380701415) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In1380701415, ~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_In1380701415, ~b$r_buff1_thd1~0=~b$r_buff1_thd1~0_In1380701415, ~b$w_buff1_used~0=~b$w_buff1_used~0_In1380701415} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In1380701415, ~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_In1380701415, ~b$r_buff1_thd1~0=~b$r_buff1_thd1~0_In1380701415, ~b$w_buff1_used~0=~b$w_buff1_used~0_In1380701415, P0Thread1of1ForFork2_#t~ite6=|P0Thread1of1ForFork2_#t~ite6_Out1380701415|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite6] because there is no mapped edge [2019-12-18 13:17:23,734 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L757-->L758: Formula: (let ((.cse0 (= 0 (mod ~b$r_buff0_thd1~0_In-53963636 256))) (.cse1 (= (mod ~b$w_buff0_used~0_In-53963636 256) 0))) (or (and (= ~b$r_buff0_thd1~0_Out-53963636 0) (not .cse0) (not .cse1)) (and (= ~b$r_buff0_thd1~0_Out-53963636 ~b$r_buff0_thd1~0_In-53963636) (or .cse0 .cse1)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-53963636, ~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_In-53963636} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In-53963636, ~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_Out-53963636, P0Thread1of1ForFork2_#t~ite7=|P0Thread1of1ForFork2_#t~ite7_Out-53963636|} AuxVars[] AssignedVars[~b$r_buff0_thd1~0, P0Thread1of1ForFork2_#t~ite7] because there is no mapped edge [2019-12-18 13:17:23,734 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L758-->L758-2: Formula: (let ((.cse1 (= (mod ~b$w_buff0_used~0_In-1203215737 256) 0)) (.cse0 (= (mod ~b$r_buff0_thd1~0_In-1203215737 256) 0)) (.cse3 (= 0 (mod ~b$w_buff1_used~0_In-1203215737 256))) (.cse2 (= 0 (mod ~b$r_buff1_thd1~0_In-1203215737 256)))) (or (and (= |P0Thread1of1ForFork2_#t~ite8_Out-1203215737| ~b$r_buff1_thd1~0_In-1203215737) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P0Thread1of1ForFork2_#t~ite8_Out-1203215737|) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-1203215737, ~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_In-1203215737, ~b$r_buff1_thd1~0=~b$r_buff1_thd1~0_In-1203215737, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-1203215737} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In-1203215737, ~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_In-1203215737, ~b$r_buff1_thd1~0=~b$r_buff1_thd1~0_In-1203215737, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-1203215737, P0Thread1of1ForFork2_#t~ite8=|P0Thread1of1ForFork2_#t~ite8_Out-1203215737|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-18 13:17:23,735 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [868] [868] L758-2-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork2_#res.offset_5| 0) (= 0 |v_P0Thread1of1ForFork2_#res.base_5|) (= |v_P0Thread1of1ForFork2_#t~ite8_36| v_~b$r_buff1_thd1~0_103) (= (+ v_~__unbuffered_cnt~0_81 1) v_~__unbuffered_cnt~0_80)) InVars {P0Thread1of1ForFork2_#t~ite8=|v_P0Thread1of1ForFork2_#t~ite8_36|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_81} OutVars{~b$r_buff1_thd1~0=v_~b$r_buff1_thd1~0_103, P0Thread1of1ForFork2_#t~ite8=|v_P0Thread1of1ForFork2_#t~ite8_35|, P0Thread1of1ForFork2_#res.offset=|v_P0Thread1of1ForFork2_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_80, P0Thread1of1ForFork2_#res.base=|v_P0Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[~b$r_buff1_thd1~0, P0Thread1of1ForFork2_#t~ite8, P0Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-18 13:17:23,735 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L846-1-->L852: Formula: (and (= 3 v_~__unbuffered_cnt~0_33) (= v_~main$tmp_guard0~0_8 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_33} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_33, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-18 13:17:23,735 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L852-2-->L852-4: Formula: (let ((.cse0 (= (mod ~b$r_buff1_thd0~0_In-1728741000 256) 0)) (.cse1 (= 0 (mod ~b$w_buff1_used~0_In-1728741000 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite47_Out-1728741000| ~b$w_buff1~0_In-1728741000) (not .cse1)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite47_Out-1728741000| ~b~0_In-1728741000)))) InVars {~b$r_buff1_thd0~0=~b$r_buff1_thd0~0_In-1728741000, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-1728741000, ~b~0=~b~0_In-1728741000, ~b$w_buff1~0=~b$w_buff1~0_In-1728741000} OutVars{~b$r_buff1_thd0~0=~b$r_buff1_thd0~0_In-1728741000, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-1728741000, ~b~0=~b~0_In-1728741000, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out-1728741000|, ~b$w_buff1~0=~b$w_buff1~0_In-1728741000} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47] because there is no mapped edge [2019-12-18 13:17:23,735 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [798] [798] L852-4-->L853: Formula: (= v_~b~0_51 |v_ULTIMATE.start_main_#t~ite47_11|) InVars {ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_11|} OutVars{~b~0=v_~b~0_51, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_10|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_6|} AuxVars[] AssignedVars[~b~0, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-18 13:17:23,735 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [842] [842] L853-->L853-2: Formula: (let ((.cse0 (= 0 (mod ~b$w_buff0_used~0_In-300050243 256))) (.cse1 (= 0 (mod ~b$r_buff0_thd0~0_In-300050243 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite49_Out-300050243| ~b$w_buff0_used~0_In-300050243)) (and (= |ULTIMATE.start_main_#t~ite49_Out-300050243| 0) (not .cse0) (not .cse1)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-300050243, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In-300050243} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In-300050243, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out-300050243|, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In-300050243} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-18 13:17:23,736 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [853] [853] L854-->L854-2: Formula: (let ((.cse1 (= (mod ~b$w_buff0_used~0_In-2082268222 256) 0)) (.cse0 (= 0 (mod ~b$r_buff0_thd0~0_In-2082268222 256))) (.cse2 (= 0 (mod ~b$w_buff1_used~0_In-2082268222 256))) (.cse3 (= 0 (mod ~b$r_buff1_thd0~0_In-2082268222 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite50_Out-2082268222| ~b$w_buff1_used~0_In-2082268222) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite50_Out-2082268222| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-2082268222, ~b$r_buff1_thd0~0=~b$r_buff1_thd0~0_In-2082268222, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-2082268222, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In-2082268222} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out-2082268222|, ~b$w_buff0_used~0=~b$w_buff0_used~0_In-2082268222, ~b$r_buff1_thd0~0=~b$r_buff1_thd0~0_In-2082268222, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-2082268222, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In-2082268222} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-18 13:17:23,736 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [843] [843] L855-->L855-2: Formula: (let ((.cse1 (= 0 (mod ~b$w_buff0_used~0_In-267556537 256))) (.cse0 (= (mod ~b$r_buff0_thd0~0_In-267556537 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite51_Out-267556537|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite51_Out-267556537| ~b$r_buff0_thd0~0_In-267556537)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-267556537, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In-267556537} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In-267556537, ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out-267556537|, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In-267556537} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-18 13:17:23,737 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L856-->L856-2: Formula: (let ((.cse1 (= 0 (mod ~b$r_buff0_thd0~0_In-1139015774 256))) (.cse0 (= (mod ~b$w_buff0_used~0_In-1139015774 256) 0)) (.cse2 (= 0 (mod ~b$r_buff1_thd0~0_In-1139015774 256))) (.cse3 (= (mod ~b$w_buff1_used~0_In-1139015774 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite52_Out-1139015774| 0)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite52_Out-1139015774| ~b$r_buff1_thd0~0_In-1139015774) (or .cse2 .cse3)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-1139015774, ~b$r_buff1_thd0~0=~b$r_buff1_thd0~0_In-1139015774, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-1139015774, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In-1139015774} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In-1139015774, ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out-1139015774|, ~b$r_buff1_thd0~0=~b$r_buff1_thd0~0_In-1139015774, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-1139015774, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In-1139015774} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-18 13:17:23,737 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [890] [890] L856-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= 1 v_~__unbuffered_p2_EAX~0_19) (= v_~b$r_buff1_thd0~0_185 |v_ULTIMATE.start_main_#t~ite52_39|) (= v_~main$tmp_guard1~0_18 0) (= v_~__unbuffered_p1_EBX~0_20 0) (= 1 v_~__unbuffered_p1_EAX~0_20) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 0) (= 0 v_~__unbuffered_p0_EAX~0_139) (= v_~__unbuffered_p2_EBX~0_26 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11| (mod v_~main$tmp_guard1~0_18 256))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_139, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_39|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_20, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_26, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_20, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_19} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_139, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_38|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_20, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_26, ~b$r_buff1_thd0~0=v_~b$r_buff1_thd0~0_185, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_20, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_18, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_19, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~b$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 13:17:23,835 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 01:17:23 BasicIcfg [2019-12-18 13:17:23,836 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 13:17:23,837 INFO L168 Benchmark]: Toolchain (without parser) took 101967.34 ms. Allocated memory was 138.4 MB in the beginning and 3.0 GB in the end (delta: 2.9 GB). Free memory was 101.5 MB in the beginning and 1.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2019-12-18 13:17:23,838 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 138.4 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-18 13:17:23,838 INFO L168 Benchmark]: CACSL2BoogieTranslator took 854.25 ms. Allocated memory was 138.4 MB in the beginning and 200.3 MB in the end (delta: 61.9 MB). Free memory was 101.3 MB in the beginning and 153.4 MB in the end (delta: -52.1 MB). Peak memory consumption was 25.9 MB. Max. memory is 7.1 GB. [2019-12-18 13:17:23,839 INFO L168 Benchmark]: Boogie Procedure Inliner took 66.16 ms. Allocated memory is still 200.3 MB. Free memory was 153.4 MB in the beginning and 150.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-18 13:17:23,839 INFO L168 Benchmark]: Boogie Preprocessor took 40.83 ms. Allocated memory is still 200.3 MB. Free memory was 150.7 MB in the beginning and 148.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-18 13:17:23,840 INFO L168 Benchmark]: RCFGBuilder took 881.83 ms. Allocated memory is still 200.3 MB. Free memory was 148.0 MB in the beginning and 97.4 MB in the end (delta: 50.7 MB). Peak memory consumption was 50.7 MB. Max. memory is 7.1 GB. [2019-12-18 13:17:23,840 INFO L168 Benchmark]: TraceAbstraction took 100118.45 ms. Allocated memory was 200.3 MB in the beginning and 3.0 GB in the end (delta: 2.8 GB). Free memory was 96.7 MB in the beginning and 1.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2019-12-18 13:17:23,843 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 138.4 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 854.25 ms. Allocated memory was 138.4 MB in the beginning and 200.3 MB in the end (delta: 61.9 MB). Free memory was 101.3 MB in the beginning and 153.4 MB in the end (delta: -52.1 MB). Peak memory consumption was 25.9 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 66.16 ms. Allocated memory is still 200.3 MB. Free memory was 153.4 MB in the beginning and 150.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 40.83 ms. Allocated memory is still 200.3 MB. Free memory was 150.7 MB in the beginning and 148.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 881.83 ms. Allocated memory is still 200.3 MB. Free memory was 148.0 MB in the beginning and 97.4 MB in the end (delta: 50.7 MB). Peak memory consumption was 50.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 100118.45 ms. Allocated memory was 200.3 MB in the beginning and 3.0 GB in the end (delta: 2.8 GB). Free memory was 96.7 MB in the beginning and 1.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.7s, 180 ProgramPointsBefore, 96 ProgramPointsAfterwards, 217 TransitionsBefore, 105 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 7 FixpointIterations, 37 TrivialSequentialCompositions, 47 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 31 ConcurrentYvCompositions, 32 ChoiceCompositions, 7698 VarBasedMoverChecksPositive, 261 VarBasedMoverChecksNegative, 64 SemBasedMoverChecksPositive, 271 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.7s, 0 MoverChecksTotal, 83556 CheckedPairsTotal, 115 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L842] FCALL, FORK 0 pthread_create(&t861, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L844] FCALL, FORK 0 pthread_create(&t862, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L846] FCALL, FORK 0 pthread_create(&t863, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L739] 1 b$w_buff1 = b$w_buff0 [L740] 1 b$w_buff0 = 1 [L741] 1 b$w_buff1_used = b$w_buff0_used [L742] 1 b$w_buff0_used = (_Bool)1 [L754] EXPR 1 b$w_buff0_used && b$r_buff0_thd1 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd1 ? b$w_buff1 : b) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L768] 2 x = 1 [L771] 2 y = 1 [L774] 2 __unbuffered_p1_EAX = y [L777] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L780] 2 b$w_buff0_used && b$r_buff0_thd2 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd2 ? b$w_buff1 : b) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L754] 1 b = b$w_buff0_used && b$r_buff0_thd1 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd1 ? b$w_buff1 : b) [L781] 2 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$w_buff0_used [L782] 2 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$w_buff1_used [L783] 2 b$r_buff0_thd2 = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$r_buff0_thd2 [L794] 3 z = 1 [L797] 3 a = 1 [L800] 3 __unbuffered_p2_EAX = a [L803] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L804] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L805] 3 b$flush_delayed = weak$$choice2 [L806] 3 b$mem_tmp = b VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=1, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=1] [L807] EXPR 3 !b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : b$w_buff1) VAL [!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : b$w_buff1)=0, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=1, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=1] [L807] 3 b = !b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : b$w_buff1) [L808] 3 b$w_buff0 = weak$$choice2 ? b$w_buff0 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff0 : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : b$w_buff0)) [L809] EXPR 3 weak$$choice2 ? b$w_buff1 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff1 : b$w_buff1)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=1, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? b$w_buff1 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff1 : b$w_buff1))=0, x=1, y=1, z=1] [L809] 3 b$w_buff1 = weak$$choice2 ? b$w_buff1 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff1 : b$w_buff1)) [L810] 3 b$w_buff0_used = weak$$choice2 ? b$w_buff0_used : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff0_used : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used)) [L811] EXPR 3 weak$$choice2 ? b$w_buff1_used : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=1, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? b$w_buff1_used : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=1] [L811] 3 b$w_buff1_used = weak$$choice2 ? b$w_buff1_used : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L813] EXPR 3 weak$$choice2 ? b$r_buff1_thd3 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$r_buff1_thd3 : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=1, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? b$r_buff1_thd3 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$r_buff1_thd3 : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=1] [L813] 3 b$r_buff1_thd3 = weak$$choice2 ? b$r_buff1_thd3 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$r_buff1_thd3 : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L814] 3 __unbuffered_p2_EBX = b VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=1, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=1] [L819] 3 b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd3 ? b$w_buff1 : b) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=1] [L820] 3 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used [L821] 3 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$w_buff1_used [L822] 3 b$r_buff0_thd3 = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$r_buff0_thd3 [L755] 1 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$w_buff0_used [L756] 1 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$w_buff1_used [L852] 0 b$w_buff0_used && b$r_buff0_thd0 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd0 ? b$w_buff1 : b) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=1] [L853] 0 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$w_buff0_used [L854] 0 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$w_buff1_used [L855] 0 b$r_buff0_thd0 = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 171 locations, 2 error locations. Result: UNSAFE, OverallTime: 99.7s, OverallIterations: 32, TraceHistogramMax: 1, AutomataDifference: 29.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 6794 SDtfs, 10778 SDslu, 23422 SDs, 0 SdLazy, 10451 SolverSat, 424 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 402 GetRequests, 69 SyntacticMatches, 10 SemanticMatches, 323 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1161 ImplicationChecksByTransitivity, 3.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=171775occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 39.0s AutomataMinimizationTime, 31 MinimizatonAttempts, 168335 StatesRemovedByMinimization, 26 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 1574 NumberOfCodeBlocks, 1574 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 1476 ConstructedInterpolants, 0 QuantifiedInterpolants, 263296 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 31 InterpolantComputations, 31 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...