/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix035_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 21:11:22,708 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 21:11:22,710 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 21:11:22,722 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 21:11:22,722 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 21:11:22,723 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 21:11:22,724 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 21:11:22,726 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 21:11:22,728 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 21:11:22,728 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 21:11:22,729 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 21:11:22,730 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 21:11:22,731 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 21:11:22,732 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 21:11:22,733 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 21:11:22,734 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 21:11:22,734 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 21:11:22,735 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 21:11:22,737 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 21:11:22,739 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 21:11:22,740 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 21:11:22,741 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 21:11:22,742 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 21:11:22,743 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 21:11:22,745 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 21:11:22,745 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 21:11:22,746 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 21:11:22,746 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 21:11:22,747 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 21:11:22,748 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 21:11:22,748 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 21:11:22,749 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 21:11:22,749 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 21:11:22,750 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 21:11:22,751 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 21:11:22,751 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 21:11:22,752 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 21:11:22,752 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 21:11:22,752 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 21:11:22,753 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 21:11:22,753 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 21:11:22,754 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf [2019-12-18 21:11:22,768 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 21:11:22,768 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 21:11:22,769 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 21:11:22,769 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 21:11:22,769 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 21:11:22,770 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 21:11:22,770 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 21:11:22,770 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 21:11:22,770 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 21:11:22,770 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 21:11:22,771 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 21:11:22,771 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 21:11:22,771 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 21:11:22,771 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 21:11:22,771 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 21:11:22,772 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 21:11:22,772 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 21:11:22,772 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 21:11:22,772 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 21:11:22,772 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 21:11:22,773 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 21:11:22,773 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 21:11:22,773 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 21:11:22,773 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 21:11:22,773 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 21:11:22,774 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 21:11:22,774 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 21:11:22,774 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-18 21:11:22,774 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 21:11:22,774 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 21:11:23,064 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 21:11:23,084 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 21:11:23,088 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 21:11:23,089 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 21:11:23,090 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 21:11:23,091 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix035_power.oepc.i [2019-12-18 21:11:23,163 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/95a07a562/e05720aef7604e80b77b44ecce45949c/FLAG40dd73530 [2019-12-18 21:11:23,742 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 21:11:23,745 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix035_power.oepc.i [2019-12-18 21:11:23,771 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/95a07a562/e05720aef7604e80b77b44ecce45949c/FLAG40dd73530 [2019-12-18 21:11:23,978 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/95a07a562/e05720aef7604e80b77b44ecce45949c [2019-12-18 21:11:23,986 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 21:11:23,988 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 21:11:23,989 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 21:11:23,989 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 21:11:23,993 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 21:11:23,994 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 09:11:23" (1/1) ... [2019-12-18 21:11:23,997 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60a840ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:11:23, skipping insertion in model container [2019-12-18 21:11:23,998 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 09:11:23" (1/1) ... [2019-12-18 21:11:24,006 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 21:11:24,061 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 21:11:24,587 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 21:11:24,609 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 21:11:24,727 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 21:11:24,800 INFO L208 MainTranslator]: Completed translation [2019-12-18 21:11:24,800 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:11:24 WrapperNode [2019-12-18 21:11:24,801 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 21:11:24,801 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 21:11:24,802 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 21:11:24,802 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 21:11:24,811 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:11:24" (1/1) ... [2019-12-18 21:11:24,833 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:11:24" (1/1) ... [2019-12-18 21:11:24,867 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 21:11:24,868 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 21:11:24,868 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 21:11:24,868 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 21:11:24,879 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:11:24" (1/1) ... [2019-12-18 21:11:24,879 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:11:24" (1/1) ... [2019-12-18 21:11:24,885 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:11:24" (1/1) ... [2019-12-18 21:11:24,885 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:11:24" (1/1) ... [2019-12-18 21:11:24,913 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:11:24" (1/1) ... [2019-12-18 21:11:24,919 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:11:24" (1/1) ... [2019-12-18 21:11:24,923 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:11:24" (1/1) ... [2019-12-18 21:11:24,931 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 21:11:24,934 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 21:11:24,934 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 21:11:24,934 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 21:11:24,935 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:11:24" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 21:11:24,994 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 21:11:24,994 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 21:11:24,994 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 21:11:24,994 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 21:11:24,994 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 21:11:24,994 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 21:11:24,994 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 21:11:24,995 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 21:11:24,995 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 21:11:24,995 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 21:11:24,995 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 21:11:24,995 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 21:11:24,995 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 21:11:24,997 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 21:11:25,810 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 21:11:25,811 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 21:11:25,812 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 09:11:25 BoogieIcfgContainer [2019-12-18 21:11:25,812 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 21:11:25,813 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 21:11:25,813 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 21:11:25,816 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 21:11:25,817 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 09:11:23" (1/3) ... [2019-12-18 21:11:25,818 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20535e75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 09:11:25, skipping insertion in model container [2019-12-18 21:11:25,818 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:11:24" (2/3) ... [2019-12-18 21:11:25,819 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20535e75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 09:11:25, skipping insertion in model container [2019-12-18 21:11:25,819 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 09:11:25" (3/3) ... [2019-12-18 21:11:25,821 INFO L109 eAbstractionObserver]: Analyzing ICFG mix035_power.oepc.i [2019-12-18 21:11:25,829 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 21:11:25,830 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 21:11:25,839 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 21:11:25,840 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 21:11:25,883 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:25,883 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:25,884 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:25,884 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:25,884 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:25,885 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:25,885 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:25,886 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:25,886 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:25,887 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:25,887 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:25,887 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:25,887 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:25,888 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:25,888 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:25,888 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:25,889 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:25,889 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:25,889 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:25,889 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:25,890 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:25,890 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:25,890 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:25,891 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:25,891 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:25,891 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:25,892 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:25,892 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:25,892 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:25,892 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:25,893 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:25,893 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:25,893 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:25,893 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:25,894 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:25,894 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:25,894 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:25,895 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:25,895 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:25,895 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:25,896 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:25,896 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:25,896 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:25,896 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:25,897 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:25,897 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:25,897 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:25,897 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:25,898 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:25,898 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:25,898 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:25,898 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:25,899 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:25,899 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:25,899 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:25,899 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:25,900 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:25,900 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:25,900 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:25,901 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:25,901 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:25,901 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:25,901 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:25,902 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:25,903 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:25,903 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:25,903 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:25,903 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:25,904 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:25,904 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:25,904 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:25,904 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:25,905 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:25,905 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:25,905 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:25,906 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:25,906 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:25,906 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:25,923 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:25,923 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:25,924 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:25,924 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:25,924 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:25,924 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:25,924 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:25,925 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:25,925 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:25,925 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:25,925 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:25,926 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:25,926 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:25,926 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:25,926 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:25,926 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:25,927 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:25,927 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:25,927 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:25,928 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:25,928 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:25,928 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:25,928 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:25,928 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:25,929 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:25,929 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:25,929 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:25,929 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:25,929 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:25,930 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:25,930 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:25,930 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:25,930 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:25,931 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:25,931 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:25,931 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:25,931 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:25,932 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:25,932 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:25,932 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:25,932 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:25,932 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:25,933 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:25,933 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:25,933 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:25,933 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:25,933 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:25,934 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:25,934 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:25,936 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:25,936 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:25,936 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:25,936 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:25,936 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:25,937 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:25,937 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:25,937 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:25,937 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:25,940 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:25,940 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:25,940 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:25,941 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:25,941 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:25,941 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:25,941 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:25,941 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:25,943 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:25,943 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:25,943 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:25,943 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:25,943 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:25,943 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:25,946 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:25,946 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:25,946 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:25,947 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:25,947 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:25,947 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:25,947 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:25,947 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:25,948 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:25,948 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:25,948 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:25,948 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:25,948 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:25,949 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:25,949 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:25,949 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:25,949 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:25,949 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:25,950 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:25,951 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:25,951 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:25,952 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:25,952 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:25,952 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:25,952 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:25,952 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:25,953 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:25,953 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:25,953 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:25,954 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:25,954 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:25,954 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:25,958 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:25,959 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:25,959 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:25,959 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:25,959 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:25,959 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:25,960 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:25,960 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:25,960 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:25,961 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:25,961 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:25,961 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:25,961 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:25,961 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:25,962 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:25,962 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:25,962 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:25,963 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:25,963 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:25,963 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:25,963 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:25,963 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:25,963 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:25,964 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:25,964 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:25,964 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:25,965 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:25,965 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:25,965 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:25,966 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:25,966 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:25,966 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:25,967 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:25,970 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:25,971 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:25,971 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:25,971 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:25,971 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:25,972 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:25,972 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:25,972 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:25,972 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:25,972 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:25,973 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:25,973 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:25,974 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:25,975 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:25,975 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:25,975 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:25,975 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:25,976 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:25,976 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:25,976 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:25,976 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:25,976 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:11:25,996 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 21:11:26,018 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 21:11:26,019 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 21:11:26,019 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 21:11:26,019 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 21:11:26,019 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 21:11:26,019 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 21:11:26,020 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 21:11:26,020 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 21:11:26,037 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 178 places, 215 transitions [2019-12-18 21:11:26,039 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 178 places, 215 transitions [2019-12-18 21:11:26,139 INFO L126 PetriNetUnfolder]: 47/212 cut-off events. [2019-12-18 21:11:26,139 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 21:11:26,160 INFO L76 FinitePrefix]: Finished finitePrefix Result has 222 conditions, 212 events. 47/212 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 435 event pairs. 9/172 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 21:11:26,192 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 178 places, 215 transitions [2019-12-18 21:11:26,244 INFO L126 PetriNetUnfolder]: 47/212 cut-off events. [2019-12-18 21:11:26,244 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 21:11:26,255 INFO L76 FinitePrefix]: Finished finitePrefix Result has 222 conditions, 212 events. 47/212 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 435 event pairs. 9/172 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 21:11:26,278 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-18 21:11:26,280 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-18 21:11:29,884 WARN L192 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 93 [2019-12-18 21:11:30,041 WARN L192 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2019-12-18 21:11:30,070 INFO L206 etLargeBlockEncoding]: Checked pairs total: 86659 [2019-12-18 21:11:30,070 INFO L214 etLargeBlockEncoding]: Total number of compositions: 114 [2019-12-18 21:11:30,074 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 96 places, 107 transitions [2019-12-18 21:11:52,014 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 123932 states. [2019-12-18 21:11:52,016 INFO L276 IsEmpty]: Start isEmpty. Operand 123932 states. [2019-12-18 21:11:52,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-18 21:11:52,022 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:11:52,022 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-18 21:11:52,023 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 21:11:52,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:11:52,029 INFO L82 PathProgramCache]: Analyzing trace with hash 916959, now seen corresponding path program 1 times [2019-12-18 21:11:52,038 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:11:52,038 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938886164] [2019-12-18 21:11:52,039 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:11:52,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:11:52,246 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 21:11:52,247 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938886164] [2019-12-18 21:11:52,248 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:11:52,248 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 21:11:52,249 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242111005] [2019-12-18 21:11:52,254 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:11:52,254 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:11:52,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:11:52,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:11:52,273 INFO L87 Difference]: Start difference. First operand 123932 states. Second operand 3 states. [2019-12-18 21:11:55,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:11:55,870 INFO L93 Difference]: Finished difference Result 123002 states and 528862 transitions. [2019-12-18 21:11:55,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:11:55,872 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-18 21:11:55,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:11:56,612 INFO L225 Difference]: With dead ends: 123002 [2019-12-18 21:11:56,612 INFO L226 Difference]: Without dead ends: 115358 [2019-12-18 21:11:56,614 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 21:12:02,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115358 states. [2019-12-18 21:12:07,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115358 to 115358. [2019-12-18 21:12:07,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115358 states. [2019-12-18 21:12:07,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115358 states to 115358 states and 495332 transitions. [2019-12-18 21:12:07,904 INFO L78 Accepts]: Start accepts. Automaton has 115358 states and 495332 transitions. Word has length 3 [2019-12-18 21:12:07,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:12:07,904 INFO L462 AbstractCegarLoop]: Abstraction has 115358 states and 495332 transitions. [2019-12-18 21:12:07,904 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:12:07,904 INFO L276 IsEmpty]: Start isEmpty. Operand 115358 states and 495332 transitions. [2019-12-18 21:12:07,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 21:12:07,908 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:12:07,909 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:12:07,909 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 21:12:07,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:12:07,910 INFO L82 PathProgramCache]: Analyzing trace with hash 1587788746, now seen corresponding path program 1 times [2019-12-18 21:12:07,910 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:12:07,910 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322830092] [2019-12-18 21:12:07,910 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:12:07,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:12:08,040 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 21:12:08,041 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322830092] [2019-12-18 21:12:08,041 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:12:08,041 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:12:08,041 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954101589] [2019-12-18 21:12:08,043 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:12:08,043 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:12:08,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:12:08,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:12:08,044 INFO L87 Difference]: Start difference. First operand 115358 states and 495332 transitions. Second operand 4 states. [2019-12-18 21:12:13,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:12:13,987 INFO L93 Difference]: Finished difference Result 179368 states and 739568 transitions. [2019-12-18 21:12:13,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 21:12:13,987 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 21:12:13,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:12:14,647 INFO L225 Difference]: With dead ends: 179368 [2019-12-18 21:12:14,647 INFO L226 Difference]: Without dead ends: 179319 [2019-12-18 21:12:14,648 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 21:12:21,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179319 states. [2019-12-18 21:12:25,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179319 to 163842. [2019-12-18 21:12:25,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163842 states. [2019-12-18 21:12:32,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163842 states to 163842 states and 684578 transitions. [2019-12-18 21:12:32,944 INFO L78 Accepts]: Start accepts. Automaton has 163842 states and 684578 transitions. Word has length 11 [2019-12-18 21:12:32,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:12:32,944 INFO L462 AbstractCegarLoop]: Abstraction has 163842 states and 684578 transitions. [2019-12-18 21:12:32,944 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:12:32,944 INFO L276 IsEmpty]: Start isEmpty. Operand 163842 states and 684578 transitions. [2019-12-18 21:12:32,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 21:12:32,952 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:12:32,952 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:12:32,952 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 21:12:32,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:12:32,952 INFO L82 PathProgramCache]: Analyzing trace with hash 245340836, now seen corresponding path program 1 times [2019-12-18 21:12:32,953 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:12:32,953 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412266508] [2019-12-18 21:12:32,953 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:12:32,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:12:33,014 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 21:12:33,014 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412266508] [2019-12-18 21:12:33,014 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:12:33,016 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:12:33,016 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697054392] [2019-12-18 21:12:33,017 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:12:33,017 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:12:33,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:12:33,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:12:33,017 INFO L87 Difference]: Start difference. First operand 163842 states and 684578 transitions. Second operand 3 states. [2019-12-18 21:12:33,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:12:33,161 INFO L93 Difference]: Finished difference Result 35474 states and 116324 transitions. [2019-12-18 21:12:33,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:12:33,161 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-18 21:12:33,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:12:33,234 INFO L225 Difference]: With dead ends: 35474 [2019-12-18 21:12:33,234 INFO L226 Difference]: Without dead ends: 35474 [2019-12-18 21:12:33,235 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 21:12:33,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35474 states. [2019-12-18 21:12:33,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35474 to 35474. [2019-12-18 21:12:33,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35474 states. [2019-12-18 21:12:34,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35474 states to 35474 states and 116324 transitions. [2019-12-18 21:12:34,004 INFO L78 Accepts]: Start accepts. Automaton has 35474 states and 116324 transitions. Word has length 13 [2019-12-18 21:12:34,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:12:34,004 INFO L462 AbstractCegarLoop]: Abstraction has 35474 states and 116324 transitions. [2019-12-18 21:12:34,004 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:12:34,004 INFO L276 IsEmpty]: Start isEmpty. Operand 35474 states and 116324 transitions. [2019-12-18 21:12:34,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 21:12:34,007 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:12:34,007 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:12:34,007 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 21:12:34,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:12:34,007 INFO L82 PathProgramCache]: Analyzing trace with hash -1764199357, now seen corresponding path program 1 times [2019-12-18 21:12:34,008 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:12:34,008 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284955564] [2019-12-18 21:12:34,008 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:12:34,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:12:34,094 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 21:12:34,095 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284955564] [2019-12-18 21:12:34,095 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:12:34,095 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:12:34,095 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319988863] [2019-12-18 21:12:34,096 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:12:34,096 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:12:34,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:12:34,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:12:34,097 INFO L87 Difference]: Start difference. First operand 35474 states and 116324 transitions. Second operand 3 states. [2019-12-18 21:12:34,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:12:34,309 INFO L93 Difference]: Finished difference Result 53873 states and 176061 transitions. [2019-12-18 21:12:34,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:12:34,310 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-18 21:12:34,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:12:34,439 INFO L225 Difference]: With dead ends: 53873 [2019-12-18 21:12:34,439 INFO L226 Difference]: Without dead ends: 53873 [2019-12-18 21:12:34,440 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 21:12:34,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53873 states. [2019-12-18 21:12:36,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53873 to 40386. [2019-12-18 21:12:36,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40386 states. [2019-12-18 21:12:36,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40386 states to 40386 states and 133919 transitions. [2019-12-18 21:12:36,737 INFO L78 Accepts]: Start accepts. Automaton has 40386 states and 133919 transitions. Word has length 16 [2019-12-18 21:12:36,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:12:36,738 INFO L462 AbstractCegarLoop]: Abstraction has 40386 states and 133919 transitions. [2019-12-18 21:12:36,738 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:12:36,738 INFO L276 IsEmpty]: Start isEmpty. Operand 40386 states and 133919 transitions. [2019-12-18 21:12:36,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 21:12:36,742 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:12:36,742 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:12:36,742 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 21:12:36,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:12:36,742 INFO L82 PathProgramCache]: Analyzing trace with hash -1679414171, now seen corresponding path program 1 times [2019-12-18 21:12:36,742 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:12:36,743 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678684514] [2019-12-18 21:12:36,743 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:12:36,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:12:36,807 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 21:12:36,808 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678684514] [2019-12-18 21:12:36,808 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:12:36,808 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:12:36,808 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084389041] [2019-12-18 21:12:36,809 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:12:36,809 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:12:36,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:12:36,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:12:36,810 INFO L87 Difference]: Start difference. First operand 40386 states and 133919 transitions. Second operand 4 states. [2019-12-18 21:12:37,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:12:37,242 INFO L93 Difference]: Finished difference Result 48153 states and 157153 transitions. [2019-12-18 21:12:37,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 21:12:37,243 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-18 21:12:37,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:12:37,343 INFO L225 Difference]: With dead ends: 48153 [2019-12-18 21:12:37,344 INFO L226 Difference]: Without dead ends: 48153 [2019-12-18 21:12:37,344 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 21:12:37,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48153 states. [2019-12-18 21:12:38,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48153 to 44290. [2019-12-18 21:12:38,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44290 states. [2019-12-18 21:12:38,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44290 states to 44290 states and 145673 transitions. [2019-12-18 21:12:38,150 INFO L78 Accepts]: Start accepts. Automaton has 44290 states and 145673 transitions. Word has length 16 [2019-12-18 21:12:38,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:12:38,150 INFO L462 AbstractCegarLoop]: Abstraction has 44290 states and 145673 transitions. [2019-12-18 21:12:38,150 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:12:38,150 INFO L276 IsEmpty]: Start isEmpty. Operand 44290 states and 145673 transitions. [2019-12-18 21:12:38,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 21:12:38,156 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:12:38,157 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:12:38,157 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 21:12:38,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:12:38,158 INFO L82 PathProgramCache]: Analyzing trace with hash -1745863415, now seen corresponding path program 1 times [2019-12-18 21:12:38,158 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:12:38,158 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133616946] [2019-12-18 21:12:38,158 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:12:38,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:12:39,207 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 21:12:39,208 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133616946] [2019-12-18 21:12:39,208 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:12:39,208 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:12:39,209 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226190821] [2019-12-18 21:12:39,209 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:12:39,209 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:12:39,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:12:39,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:12:39,210 INFO L87 Difference]: Start difference. First operand 44290 states and 145673 transitions. Second operand 4 states. [2019-12-18 21:12:39,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:12:39,595 INFO L93 Difference]: Finished difference Result 52593 states and 171527 transitions. [2019-12-18 21:12:39,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 21:12:39,596 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-18 21:12:39,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:12:39,685 INFO L225 Difference]: With dead ends: 52593 [2019-12-18 21:12:39,686 INFO L226 Difference]: Without dead ends: 52593 [2019-12-18 21:12:39,686 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 21:12:39,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52593 states. [2019-12-18 21:12:40,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52593 to 45862. [2019-12-18 21:12:40,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45862 states. [2019-12-18 21:12:40,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45862 states to 45862 states and 150892 transitions. [2019-12-18 21:12:40,532 INFO L78 Accepts]: Start accepts. Automaton has 45862 states and 150892 transitions. Word has length 16 [2019-12-18 21:12:40,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:12:40,533 INFO L462 AbstractCegarLoop]: Abstraction has 45862 states and 150892 transitions. [2019-12-18 21:12:40,533 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:12:40,533 INFO L276 IsEmpty]: Start isEmpty. Operand 45862 states and 150892 transitions. [2019-12-18 21:12:40,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 21:12:40,543 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:12:40,543 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 21:12:40,544 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 21:12:40,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:12:40,544 INFO L82 PathProgramCache]: Analyzing trace with hash 1921236917, now seen corresponding path program 1 times [2019-12-18 21:12:40,544 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:12:40,545 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932233617] [2019-12-18 21:12:40,545 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:12:40,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:12:40,628 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 21:12:40,628 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932233617] [2019-12-18 21:12:40,629 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:12:40,629 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:12:40,629 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433490548] [2019-12-18 21:12:40,629 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 21:12:40,630 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:12:40,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 21:12:40,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:12:40,630 INFO L87 Difference]: Start difference. First operand 45862 states and 150892 transitions. Second operand 5 states. [2019-12-18 21:12:41,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:12:41,299 INFO L93 Difference]: Finished difference Result 62673 states and 200938 transitions. [2019-12-18 21:12:41,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 21:12:41,300 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-18 21:12:41,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:12:41,407 INFO L225 Difference]: With dead ends: 62673 [2019-12-18 21:12:41,407 INFO L226 Difference]: Without dead ends: 62666 [2019-12-18 21:12:41,408 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-18 21:12:44,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62666 states. [2019-12-18 21:12:44,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62666 to 47202. [2019-12-18 21:12:44,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47202 states. [2019-12-18 21:12:44,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47202 states to 47202 states and 154985 transitions. [2019-12-18 21:12:44,909 INFO L78 Accepts]: Start accepts. Automaton has 47202 states and 154985 transitions. Word has length 22 [2019-12-18 21:12:44,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:12:44,909 INFO L462 AbstractCegarLoop]: Abstraction has 47202 states and 154985 transitions. [2019-12-18 21:12:44,909 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 21:12:44,910 INFO L276 IsEmpty]: Start isEmpty. Operand 47202 states and 154985 transitions. [2019-12-18 21:12:44,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 21:12:44,919 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:12:44,920 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 21:12:44,920 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 21:12:44,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:12:44,920 INFO L82 PathProgramCache]: Analyzing trace with hash 1854787673, now seen corresponding path program 1 times [2019-12-18 21:12:44,920 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:12:44,921 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318756459] [2019-12-18 21:12:44,921 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:12:44,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:12:44,999 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 21:12:45,000 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318756459] [2019-12-18 21:12:45,000 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:12:45,001 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:12:45,001 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102813766] [2019-12-18 21:12:45,001 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 21:12:45,002 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:12:45,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 21:12:45,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:12:45,002 INFO L87 Difference]: Start difference. First operand 47202 states and 154985 transitions. Second operand 5 states. [2019-12-18 21:12:45,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:12:45,762 INFO L93 Difference]: Finished difference Result 65940 states and 210721 transitions. [2019-12-18 21:12:45,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 21:12:45,762 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-18 21:12:45,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:12:45,930 INFO L225 Difference]: With dead ends: 65940 [2019-12-18 21:12:45,931 INFO L226 Difference]: Without dead ends: 65933 [2019-12-18 21:12:45,932 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-18 21:12:46,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65933 states. [2019-12-18 21:12:47,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65933 to 45465. [2019-12-18 21:12:47,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45465 states. [2019-12-18 21:12:47,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45465 states to 45465 states and 149394 transitions. [2019-12-18 21:12:47,316 INFO L78 Accepts]: Start accepts. Automaton has 45465 states and 149394 transitions. Word has length 22 [2019-12-18 21:12:47,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:12:47,317 INFO L462 AbstractCegarLoop]: Abstraction has 45465 states and 149394 transitions. [2019-12-18 21:12:47,317 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 21:12:47,317 INFO L276 IsEmpty]: Start isEmpty. Operand 45465 states and 149394 transitions. [2019-12-18 21:12:47,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 21:12:47,329 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:12:47,330 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:12:47,330 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 21:12:47,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:12:47,330 INFO L82 PathProgramCache]: Analyzing trace with hash 145172187, now seen corresponding path program 1 times [2019-12-18 21:12:47,330 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:12:47,331 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987181723] [2019-12-18 21:12:47,331 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:12:47,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:12:47,380 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 21:12:47,381 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987181723] [2019-12-18 21:12:47,381 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:12:47,381 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:12:47,381 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698178283] [2019-12-18 21:12:47,384 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:12:47,385 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:12:47,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:12:47,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:12:47,385 INFO L87 Difference]: Start difference. First operand 45465 states and 149394 transitions. Second operand 4 states. [2019-12-18 21:12:47,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:12:47,465 INFO L93 Difference]: Finished difference Result 18727 states and 58359 transitions. [2019-12-18 21:12:47,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 21:12:47,465 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-18 21:12:47,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:12:47,491 INFO L225 Difference]: With dead ends: 18727 [2019-12-18 21:12:47,491 INFO L226 Difference]: Without dead ends: 18727 [2019-12-18 21:12:47,492 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 21:12:47,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18727 states. [2019-12-18 21:12:47,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18727 to 18364. [2019-12-18 21:12:47,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18364 states. [2019-12-18 21:12:47,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18364 states to 18364 states and 57323 transitions. [2019-12-18 21:12:47,780 INFO L78 Accepts]: Start accepts. Automaton has 18364 states and 57323 transitions. Word has length 25 [2019-12-18 21:12:47,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:12:47,780 INFO L462 AbstractCegarLoop]: Abstraction has 18364 states and 57323 transitions. [2019-12-18 21:12:47,780 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:12:47,780 INFO L276 IsEmpty]: Start isEmpty. Operand 18364 states and 57323 transitions. [2019-12-18 21:12:47,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 21:12:47,794 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:12:47,795 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 21:12:47,795 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 21:12:47,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:12:47,795 INFO L82 PathProgramCache]: Analyzing trace with hash -2016642455, now seen corresponding path program 1 times [2019-12-18 21:12:47,795 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:12:47,795 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821999289] [2019-12-18 21:12:47,796 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:12:47,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:12:47,840 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 21:12:47,840 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821999289] [2019-12-18 21:12:47,841 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:12:47,841 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:12:47,841 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012996545] [2019-12-18 21:12:47,841 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:12:47,841 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:12:47,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:12:47,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:12:47,842 INFO L87 Difference]: Start difference. First operand 18364 states and 57323 transitions. Second operand 3 states. [2019-12-18 21:12:47,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:12:47,946 INFO L93 Difference]: Finished difference Result 24105 states and 71434 transitions. [2019-12-18 21:12:47,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:12:47,947 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-12-18 21:12:47,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:12:47,977 INFO L225 Difference]: With dead ends: 24105 [2019-12-18 21:12:47,977 INFO L226 Difference]: Without dead ends: 24105 [2019-12-18 21:12:47,978 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 21:12:48,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24105 states. [2019-12-18 21:12:48,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24105 to 18364. [2019-12-18 21:12:48,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18364 states. [2019-12-18 21:12:48,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18364 states to 18364 states and 54802 transitions. [2019-12-18 21:12:48,294 INFO L78 Accepts]: Start accepts. Automaton has 18364 states and 54802 transitions. Word has length 27 [2019-12-18 21:12:48,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:12:48,295 INFO L462 AbstractCegarLoop]: Abstraction has 18364 states and 54802 transitions. [2019-12-18 21:12:48,295 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:12:48,295 INFO L276 IsEmpty]: Start isEmpty. Operand 18364 states and 54802 transitions. [2019-12-18 21:12:48,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 21:12:48,307 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:12:48,307 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 21:12:48,308 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 21:12:48,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:12:48,308 INFO L82 PathProgramCache]: Analyzing trace with hash -364349975, now seen corresponding path program 1 times [2019-12-18 21:12:48,308 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:12:48,309 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188369672] [2019-12-18 21:12:48,309 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:12:48,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:12:48,367 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 21:12:48,367 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188369672] [2019-12-18 21:12:48,367 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:12:48,367 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:12:48,368 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969266240] [2019-12-18 21:12:48,368 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 21:12:48,368 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:12:48,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 21:12:48,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:12:48,369 INFO L87 Difference]: Start difference. First operand 18364 states and 54802 transitions. Second operand 5 states. [2019-12-18 21:12:48,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:12:48,701 INFO L93 Difference]: Finished difference Result 22570 states and 66509 transitions. [2019-12-18 21:12:48,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 21:12:48,701 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-18 21:12:48,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:12:48,733 INFO L225 Difference]: With dead ends: 22570 [2019-12-18 21:12:48,733 INFO L226 Difference]: Without dead ends: 22570 [2019-12-18 21:12:48,734 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 21:12:49,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22570 states. [2019-12-18 21:12:49,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22570 to 21200. [2019-12-18 21:12:49,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21200 states. [2019-12-18 21:12:49,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21200 states to 21200 states and 63046 transitions. [2019-12-18 21:12:49,363 INFO L78 Accepts]: Start accepts. Automaton has 21200 states and 63046 transitions. Word has length 27 [2019-12-18 21:12:49,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:12:49,363 INFO L462 AbstractCegarLoop]: Abstraction has 21200 states and 63046 transitions. [2019-12-18 21:12:49,363 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 21:12:49,363 INFO L276 IsEmpty]: Start isEmpty. Operand 21200 states and 63046 transitions. [2019-12-18 21:12:49,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-18 21:12:49,378 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:12:49,378 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:12:49,378 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 21:12:49,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:12:49,378 INFO L82 PathProgramCache]: Analyzing trace with hash 587647727, now seen corresponding path program 1 times [2019-12-18 21:12:49,379 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:12:49,379 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237979572] [2019-12-18 21:12:49,379 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:12:49,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:12:49,440 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 21:12:49,440 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237979572] [2019-12-18 21:12:49,440 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:12:49,440 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:12:49,441 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488974855] [2019-12-18 21:12:49,442 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 21:12:49,442 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:12:49,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 21:12:49,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:12:49,443 INFO L87 Difference]: Start difference. First operand 21200 states and 63046 transitions. Second operand 5 states. [2019-12-18 21:12:49,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:12:49,908 INFO L93 Difference]: Finished difference Result 24672 states and 72522 transitions. [2019-12-18 21:12:49,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 21:12:49,909 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-18 21:12:49,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:12:49,958 INFO L225 Difference]: With dead ends: 24672 [2019-12-18 21:12:49,958 INFO L226 Difference]: Without dead ends: 24672 [2019-12-18 21:12:49,959 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 21:12:50,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24672 states. [2019-12-18 21:12:50,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24672 to 21106. [2019-12-18 21:12:50,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21106 states. [2019-12-18 21:12:50,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21106 states to 21106 states and 62614 transitions. [2019-12-18 21:12:50,387 INFO L78 Accepts]: Start accepts. Automaton has 21106 states and 62614 transitions. Word has length 28 [2019-12-18 21:12:50,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:12:50,387 INFO L462 AbstractCegarLoop]: Abstraction has 21106 states and 62614 transitions. [2019-12-18 21:12:50,387 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 21:12:50,388 INFO L276 IsEmpty]: Start isEmpty. Operand 21106 states and 62614 transitions. [2019-12-18 21:12:50,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-18 21:12:50,408 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:12:50,408 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 21:12:50,408 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 21:12:50,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:12:50,409 INFO L82 PathProgramCache]: Analyzing trace with hash 688173209, now seen corresponding path program 1 times [2019-12-18 21:12:50,409 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:12:50,409 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83140507] [2019-12-18 21:12:50,409 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:12:50,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:12:50,469 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 21:12:50,470 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83140507] [2019-12-18 21:12:50,470 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:12:50,470 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 21:12:50,471 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94305575] [2019-12-18 21:12:50,471 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 21:12:50,471 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:12:50,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 21:12:50,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 21:12:50,472 INFO L87 Difference]: Start difference. First operand 21106 states and 62614 transitions. Second operand 6 states. [2019-12-18 21:12:51,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:12:51,163 INFO L93 Difference]: Finished difference Result 28374 states and 82992 transitions. [2019-12-18 21:12:51,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 21:12:51,164 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2019-12-18 21:12:51,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:12:51,217 INFO L225 Difference]: With dead ends: 28374 [2019-12-18 21:12:51,218 INFO L226 Difference]: Without dead ends: 28374 [2019-12-18 21:12:51,226 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-12-18 21:12:51,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28374 states. [2019-12-18 21:12:51,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28374 to 22550. [2019-12-18 21:12:51,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22550 states. [2019-12-18 21:12:51,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22550 states to 22550 states and 66975 transitions. [2019-12-18 21:12:51,650 INFO L78 Accepts]: Start accepts. Automaton has 22550 states and 66975 transitions. Word has length 33 [2019-12-18 21:12:51,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:12:51,650 INFO L462 AbstractCegarLoop]: Abstraction has 22550 states and 66975 transitions. [2019-12-18 21:12:51,650 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 21:12:51,650 INFO L276 IsEmpty]: Start isEmpty. Operand 22550 states and 66975 transitions. [2019-12-18 21:12:51,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-18 21:12:51,670 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:12:51,670 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] [2019-12-18 21:12:51,671 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 21:12:51,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:12:51,671 INFO L82 PathProgramCache]: Analyzing trace with hash -1143871937, now seen corresponding path program 1 times [2019-12-18 21:12:51,671 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:12:51,672 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132871256] [2019-12-18 21:12:51,672 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:12:51,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:12:51,794 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 21:12:51,794 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132871256] [2019-12-18 21:12:51,794 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:12:51,795 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 21:12:51,795 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443166875] [2019-12-18 21:12:51,795 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 21:12:51,796 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:12:51,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 21:12:51,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 21:12:51,796 INFO L87 Difference]: Start difference. First operand 22550 states and 66975 transitions. Second operand 6 states. [2019-12-18 21:12:52,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:12:52,797 INFO L93 Difference]: Finished difference Result 27535 states and 80686 transitions. [2019-12-18 21:12:52,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 21:12:52,797 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2019-12-18 21:12:52,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:12:52,848 INFO L225 Difference]: With dead ends: 27535 [2019-12-18 21:12:52,849 INFO L226 Difference]: Without dead ends: 27535 [2019-12-18 21:12:52,849 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-12-18 21:12:52,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27535 states. [2019-12-18 21:12:53,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27535 to 19269. [2019-12-18 21:12:53,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19269 states. [2019-12-18 21:12:53,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19269 states to 19269 states and 57413 transitions. [2019-12-18 21:12:53,203 INFO L78 Accepts]: Start accepts. Automaton has 19269 states and 57413 transitions. Word has length 34 [2019-12-18 21:12:53,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:12:53,204 INFO L462 AbstractCegarLoop]: Abstraction has 19269 states and 57413 transitions. [2019-12-18 21:12:53,204 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 21:12:53,204 INFO L276 IsEmpty]: Start isEmpty. Operand 19269 states and 57413 transitions. [2019-12-18 21:12:53,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-18 21:12:53,223 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:12:53,223 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 21:12:53,223 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 21:12:53,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:12:53,223 INFO L82 PathProgramCache]: Analyzing trace with hash 1024843726, now seen corresponding path program 1 times [2019-12-18 21:12:53,223 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:12:53,224 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963245337] [2019-12-18 21:12:53,224 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:12:53,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:12:53,272 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 21:12:53,272 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963245337] [2019-12-18 21:12:53,272 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:12:53,272 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 21:12:53,273 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519947238] [2019-12-18 21:12:53,273 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:12:53,273 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:12:53,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:12:53,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:12:53,274 INFO L87 Difference]: Start difference. First operand 19269 states and 57413 transitions. Second operand 3 states. [2019-12-18 21:12:53,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:12:53,370 INFO L93 Difference]: Finished difference Result 19268 states and 57411 transitions. [2019-12-18 21:12:53,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:12:53,371 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-18 21:12:53,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:12:53,410 INFO L225 Difference]: With dead ends: 19268 [2019-12-18 21:12:53,410 INFO L226 Difference]: Without dead ends: 19268 [2019-12-18 21:12:53,412 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 21:12:53,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19268 states. [2019-12-18 21:12:53,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19268 to 19268. [2019-12-18 21:12:53,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19268 states. [2019-12-18 21:12:53,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19268 states to 19268 states and 57411 transitions. [2019-12-18 21:12:53,742 INFO L78 Accepts]: Start accepts. Automaton has 19268 states and 57411 transitions. Word has length 39 [2019-12-18 21:12:53,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:12:53,742 INFO L462 AbstractCegarLoop]: Abstraction has 19268 states and 57411 transitions. [2019-12-18 21:12:53,742 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:12:53,742 INFO L276 IsEmpty]: Start isEmpty. Operand 19268 states and 57411 transitions. [2019-12-18 21:12:53,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 21:12:53,762 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:12:53,763 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 21:12:53,763 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 21:12:53,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:12:53,763 INFO L82 PathProgramCache]: Analyzing trace with hash -1293195895, now seen corresponding path program 1 times [2019-12-18 21:12:53,763 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:12:53,764 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458385650] [2019-12-18 21:12:53,764 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:12:53,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:12:53,850 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 21:12:53,851 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458385650] [2019-12-18 21:12:53,851 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:12:53,851 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:12:53,851 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452449652] [2019-12-18 21:12:53,852 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:12:53,852 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:12:53,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:12:53,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:12:53,853 INFO L87 Difference]: Start difference. First operand 19268 states and 57411 transitions. Second operand 3 states. [2019-12-18 21:12:53,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:12:53,942 INFO L93 Difference]: Finished difference Result 19268 states and 57334 transitions. [2019-12-18 21:12:53,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:12:53,942 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-12-18 21:12:53,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:12:53,983 INFO L225 Difference]: With dead ends: 19268 [2019-12-18 21:12:53,983 INFO L226 Difference]: Without dead ends: 19268 [2019-12-18 21:12:53,984 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 21:12:54,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19268 states. [2019-12-18 21:12:54,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19268 to 17219. [2019-12-18 21:12:54,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17219 states. [2019-12-18 21:12:54,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17219 states to 17219 states and 51708 transitions. [2019-12-18 21:12:54,457 INFO L78 Accepts]: Start accepts. Automaton has 17219 states and 51708 transitions. Word has length 40 [2019-12-18 21:12:54,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:12:54,457 INFO L462 AbstractCegarLoop]: Abstraction has 17219 states and 51708 transitions. [2019-12-18 21:12:54,457 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:12:54,457 INFO L276 IsEmpty]: Start isEmpty. Operand 17219 states and 51708 transitions. [2019-12-18 21:12:54,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-18 21:12:54,481 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:12:54,481 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:12:54,481 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 21:12:54,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:12:54,482 INFO L82 PathProgramCache]: Analyzing trace with hash -1998295176, now seen corresponding path program 1 times [2019-12-18 21:12:54,482 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:12:54,482 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946420531] [2019-12-18 21:12:54,482 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:12:54,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:12:54,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 21:12:54,538 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946420531] [2019-12-18 21:12:54,538 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:12:54,538 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 21:12:54,539 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545443511] [2019-12-18 21:12:54,539 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 21:12:54,539 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:12:54,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 21:12:54,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:12:54,540 INFO L87 Difference]: Start difference. First operand 17219 states and 51708 transitions. Second operand 5 states. [2019-12-18 21:12:54,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:12:54,622 INFO L93 Difference]: Finished difference Result 16023 states and 49133 transitions. [2019-12-18 21:12:54,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 21:12:54,623 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2019-12-18 21:12:54,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:12:54,644 INFO L225 Difference]: With dead ends: 16023 [2019-12-18 21:12:54,645 INFO L226 Difference]: Without dead ends: 16023 [2019-12-18 21:12:54,645 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 21:12:54,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16023 states. [2019-12-18 21:12:54,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16023 to 16023. [2019-12-18 21:12:54,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16023 states. [2019-12-18 21:12:54,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16023 states to 16023 states and 49133 transitions. [2019-12-18 21:12:54,992 INFO L78 Accepts]: Start accepts. Automaton has 16023 states and 49133 transitions. Word has length 41 [2019-12-18 21:12:54,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:12:54,992 INFO L462 AbstractCegarLoop]: Abstraction has 16023 states and 49133 transitions. [2019-12-18 21:12:54,992 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 21:12:54,992 INFO L276 IsEmpty]: Start isEmpty. Operand 16023 states and 49133 transitions. [2019-12-18 21:12:55,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 21:12:55,013 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:12:55,013 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 21:12:55,013 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 21:12:55,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:12:55,014 INFO L82 PathProgramCache]: Analyzing trace with hash 1498292074, now seen corresponding path program 1 times [2019-12-18 21:12:55,014 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:12:55,014 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787942327] [2019-12-18 21:12:55,014 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:12:55,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:12:55,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:12:55,102 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787942327] [2019-12-18 21:12:55,103 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:12:55,104 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 21:12:55,104 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783228920] [2019-12-18 21:12:55,104 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 21:12:55,104 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:12:55,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 21:12:55,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 21:12:55,108 INFO L87 Difference]: Start difference. First operand 16023 states and 49133 transitions. Second operand 7 states. [2019-12-18 21:12:55,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:12:55,620 INFO L93 Difference]: Finished difference Result 44825 states and 136460 transitions. [2019-12-18 21:12:55,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 21:12:55,620 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-18 21:12:55,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:12:55,687 INFO L225 Difference]: With dead ends: 44825 [2019-12-18 21:12:55,687 INFO L226 Difference]: Without dead ends: 34913 [2019-12-18 21:12:55,689 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-18 21:12:55,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34913 states. [2019-12-18 21:12:56,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34913 to 19456. [2019-12-18 21:12:56,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19456 states. [2019-12-18 21:12:56,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19456 states to 19456 states and 59789 transitions. [2019-12-18 21:12:56,141 INFO L78 Accepts]: Start accepts. Automaton has 19456 states and 59789 transitions. Word has length 65 [2019-12-18 21:12:56,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:12:56,141 INFO L462 AbstractCegarLoop]: Abstraction has 19456 states and 59789 transitions. [2019-12-18 21:12:56,142 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 21:12:56,142 INFO L276 IsEmpty]: Start isEmpty. Operand 19456 states and 59789 transitions. [2019-12-18 21:12:56,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 21:12:56,167 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:12:56,167 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 21:12:56,167 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 21:12:56,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:12:56,168 INFO L82 PathProgramCache]: Analyzing trace with hash -1514990150, now seen corresponding path program 2 times [2019-12-18 21:12:56,168 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:12:56,168 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321239525] [2019-12-18 21:12:56,168 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:12:56,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:12:56,266 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 21:12:56,266 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321239525] [2019-12-18 21:12:56,267 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:12:56,267 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 21:12:56,267 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067349401] [2019-12-18 21:12:56,268 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 21:12:56,268 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:12:56,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 21:12:56,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 21:12:56,268 INFO L87 Difference]: Start difference. First operand 19456 states and 59789 transitions. Second operand 7 states. [2019-12-18 21:12:56,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:12:56,727 INFO L93 Difference]: Finished difference Result 51791 states and 156015 transitions. [2019-12-18 21:12:56,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 21:12:56,727 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-18 21:12:56,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:12:56,780 INFO L225 Difference]: With dead ends: 51791 [2019-12-18 21:12:56,780 INFO L226 Difference]: Without dead ends: 38002 [2019-12-18 21:12:56,780 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-18 21:12:56,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38002 states. [2019-12-18 21:12:57,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38002 to 23226. [2019-12-18 21:12:57,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23226 states. [2019-12-18 21:12:57,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23226 states to 23226 states and 70989 transitions. [2019-12-18 21:12:57,280 INFO L78 Accepts]: Start accepts. Automaton has 23226 states and 70989 transitions. Word has length 65 [2019-12-18 21:12:57,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:12:57,280 INFO L462 AbstractCegarLoop]: Abstraction has 23226 states and 70989 transitions. [2019-12-18 21:12:57,280 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 21:12:57,281 INFO L276 IsEmpty]: Start isEmpty. Operand 23226 states and 70989 transitions. [2019-12-18 21:12:57,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 21:12:57,307 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:12:57,307 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 21:12:57,307 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 21:12:57,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:12:57,307 INFO L82 PathProgramCache]: Analyzing trace with hash -118142618, now seen corresponding path program 3 times [2019-12-18 21:12:57,308 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:12:57,308 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118593090] [2019-12-18 21:12:57,308 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:12:57,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:12:57,392 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 21:12:57,392 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118593090] [2019-12-18 21:12:57,392 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:12:57,392 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 21:12:57,393 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335643222] [2019-12-18 21:12:57,393 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 21:12:57,393 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:12:57,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 21:12:57,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 21:12:57,394 INFO L87 Difference]: Start difference. First operand 23226 states and 70989 transitions. Second operand 7 states. [2019-12-18 21:12:57,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:12:57,930 INFO L93 Difference]: Finished difference Result 43950 states and 132286 transitions. [2019-12-18 21:12:57,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-18 21:12:57,930 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-18 21:12:57,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:12:57,985 INFO L225 Difference]: With dead ends: 43950 [2019-12-18 21:12:57,985 INFO L226 Difference]: Without dead ends: 41239 [2019-12-18 21:12:57,985 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2019-12-18 21:12:58,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41239 states. [2019-12-18 21:12:58,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41239 to 23322. [2019-12-18 21:12:58,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23322 states. [2019-12-18 21:12:58,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23322 states to 23322 states and 71333 transitions. [2019-12-18 21:12:58,496 INFO L78 Accepts]: Start accepts. Automaton has 23322 states and 71333 transitions. Word has length 65 [2019-12-18 21:12:58,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:12:58,497 INFO L462 AbstractCegarLoop]: Abstraction has 23322 states and 71333 transitions. [2019-12-18 21:12:58,497 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 21:12:58,497 INFO L276 IsEmpty]: Start isEmpty. Operand 23322 states and 71333 transitions. [2019-12-18 21:12:58,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 21:12:58,520 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:12:58,520 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:12:58,520 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 21:12:58,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:12:58,521 INFO L82 PathProgramCache]: Analyzing trace with hash 659589900, now seen corresponding path program 4 times [2019-12-18 21:12:58,521 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:12:58,521 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026255099] [2019-12-18 21:12:58,521 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:12:58,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:12:58,583 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 21:12:58,583 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026255099] [2019-12-18 21:12:58,583 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:12:58,584 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:12:58,584 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194524259] [2019-12-18 21:12:58,584 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:12:58,584 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:12:58,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:12:58,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:12:58,585 INFO L87 Difference]: Start difference. First operand 23322 states and 71333 transitions. Second operand 3 states. [2019-12-18 21:12:58,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:12:58,669 INFO L93 Difference]: Finished difference Result 19336 states and 58062 transitions. [2019-12-18 21:12:58,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:12:58,669 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-18 21:12:58,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:12:58,704 INFO L225 Difference]: With dead ends: 19336 [2019-12-18 21:12:58,704 INFO L226 Difference]: Without dead ends: 19336 [2019-12-18 21:12:58,704 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 21:12:58,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19336 states. [2019-12-18 21:12:59,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19336 to 18026. [2019-12-18 21:12:59,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18026 states. [2019-12-18 21:12:59,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18026 states to 18026 states and 54104 transitions. [2019-12-18 21:12:59,141 INFO L78 Accepts]: Start accepts. Automaton has 18026 states and 54104 transitions. Word has length 65 [2019-12-18 21:12:59,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:12:59,141 INFO L462 AbstractCegarLoop]: Abstraction has 18026 states and 54104 transitions. [2019-12-18 21:12:59,142 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:12:59,142 INFO L276 IsEmpty]: Start isEmpty. Operand 18026 states and 54104 transitions. [2019-12-18 21:12:59,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 21:12:59,166 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:12:59,166 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 21:12:59,166 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 21:12:59,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:12:59,167 INFO L82 PathProgramCache]: Analyzing trace with hash -1170584375, now seen corresponding path program 1 times [2019-12-18 21:12:59,167 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:12:59,167 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918240989] [2019-12-18 21:12:59,167 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:12:59,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:12:59,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:12:59,326 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918240989] [2019-12-18 21:12:59,326 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:12:59,326 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 21:12:59,327 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543566713] [2019-12-18 21:12:59,327 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 21:12:59,327 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:12:59,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 21:12:59,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-12-18 21:12:59,328 INFO L87 Difference]: Start difference. First operand 18026 states and 54104 transitions. Second operand 10 states. [2019-12-18 21:13:00,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:13:00,578 INFO L93 Difference]: Finished difference Result 26751 states and 79972 transitions. [2019-12-18 21:13:00,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-18 21:13:00,579 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 66 [2019-12-18 21:13:00,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:13:00,608 INFO L225 Difference]: With dead ends: 26751 [2019-12-18 21:13:00,608 INFO L226 Difference]: Without dead ends: 21704 [2019-12-18 21:13:00,608 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2019-12-18 21:13:00,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21704 states. [2019-12-18 21:13:00,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21704 to 18388. [2019-12-18 21:13:00,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18388 states. [2019-12-18 21:13:00,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18388 states to 18388 states and 55085 transitions. [2019-12-18 21:13:00,914 INFO L78 Accepts]: Start accepts. Automaton has 18388 states and 55085 transitions. Word has length 66 [2019-12-18 21:13:00,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:13:00,915 INFO L462 AbstractCegarLoop]: Abstraction has 18388 states and 55085 transitions. [2019-12-18 21:13:00,915 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 21:13:00,915 INFO L276 IsEmpty]: Start isEmpty. Operand 18388 states and 55085 transitions. [2019-12-18 21:13:00,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 21:13:00,933 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:13:00,934 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 21:13:00,934 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 21:13:00,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:13:00,934 INFO L82 PathProgramCache]: Analyzing trace with hash -1395385759, now seen corresponding path program 2 times [2019-12-18 21:13:00,934 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:13:00,934 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760269018] [2019-12-18 21:13:00,934 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:13:00,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:13:01,252 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 21:13:01,255 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760269018] [2019-12-18 21:13:01,255 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:13:01,256 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 21:13:01,256 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255799371] [2019-12-18 21:13:01,257 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 21:13:01,257 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:13:01,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 21:13:01,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 21:13:01,258 INFO L87 Difference]: Start difference. First operand 18388 states and 55085 transitions. Second operand 9 states. [2019-12-18 21:13:03,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:13:03,601 INFO L93 Difference]: Finished difference Result 32317 states and 95157 transitions. [2019-12-18 21:13:03,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-18 21:13:03,602 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 66 [2019-12-18 21:13:03,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:13:03,645 INFO L225 Difference]: With dead ends: 32317 [2019-12-18 21:13:03,645 INFO L226 Difference]: Without dead ends: 32101 [2019-12-18 21:13:03,645 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=112, Invalid=488, Unknown=0, NotChecked=0, Total=600 [2019-12-18 21:13:03,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32101 states. [2019-12-18 21:13:04,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32101 to 21436. [2019-12-18 21:13:04,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21436 states. [2019-12-18 21:13:04,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21436 states to 21436 states and 63981 transitions. [2019-12-18 21:13:04,050 INFO L78 Accepts]: Start accepts. Automaton has 21436 states and 63981 transitions. Word has length 66 [2019-12-18 21:13:04,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:13:04,050 INFO L462 AbstractCegarLoop]: Abstraction has 21436 states and 63981 transitions. [2019-12-18 21:13:04,050 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 21:13:04,050 INFO L276 IsEmpty]: Start isEmpty. Operand 21436 states and 63981 transitions. [2019-12-18 21:13:04,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 21:13:04,075 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:13:04,075 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 21:13:04,075 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 21:13:04,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:13:04,076 INFO L82 PathProgramCache]: Analyzing trace with hash 562079971, now seen corresponding path program 3 times [2019-12-18 21:13:04,076 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:13:04,076 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478164] [2019-12-18 21:13:04,076 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:13:04,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:13:04,267 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 21:13:04,268 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478164] [2019-12-18 21:13:04,268 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:13:04,268 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 21:13:04,269 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485940188] [2019-12-18 21:13:04,269 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 21:13:04,269 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:13:04,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 21:13:04,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-18 21:13:04,270 INFO L87 Difference]: Start difference. First operand 21436 states and 63981 transitions. Second operand 10 states. [2019-12-18 21:13:05,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:13:05,632 INFO L93 Difference]: Finished difference Result 33465 states and 98764 transitions. [2019-12-18 21:13:05,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 21:13:05,633 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 66 [2019-12-18 21:13:05,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:13:05,670 INFO L225 Difference]: With dead ends: 33465 [2019-12-18 21:13:05,671 INFO L226 Difference]: Without dead ends: 27949 [2019-12-18 21:13:05,671 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2019-12-18 21:13:05,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27949 states. [2019-12-18 21:13:06,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27949 to 22039. [2019-12-18 21:13:06,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22039 states. [2019-12-18 21:13:06,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22039 states to 22039 states and 65385 transitions. [2019-12-18 21:13:06,041 INFO L78 Accepts]: Start accepts. Automaton has 22039 states and 65385 transitions. Word has length 66 [2019-12-18 21:13:06,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:13:06,041 INFO L462 AbstractCegarLoop]: Abstraction has 22039 states and 65385 transitions. [2019-12-18 21:13:06,041 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 21:13:06,042 INFO L276 IsEmpty]: Start isEmpty. Operand 22039 states and 65385 transitions. [2019-12-18 21:13:06,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 21:13:06,062 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:13:06,062 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 21:13:06,062 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 21:13:06,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:13:06,062 INFO L82 PathProgramCache]: Analyzing trace with hash -2145503905, now seen corresponding path program 4 times [2019-12-18 21:13:06,062 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:13:06,062 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127874943] [2019-12-18 21:13:06,063 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:13:06,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:13:06,254 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 21:13:06,255 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127874943] [2019-12-18 21:13:06,255 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:13:06,255 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 21:13:06,255 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920481172] [2019-12-18 21:13:06,256 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 21:13:06,256 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:13:06,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 21:13:06,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 21:13:06,256 INFO L87 Difference]: Start difference. First operand 22039 states and 65385 transitions. Second operand 11 states. [2019-12-18 21:13:06,517 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-12-18 21:13:07,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:13:07,717 INFO L93 Difference]: Finished difference Result 32079 states and 94432 transitions. [2019-12-18 21:13:07,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-18 21:13:07,717 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 66 [2019-12-18 21:13:07,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:13:07,753 INFO L225 Difference]: With dead ends: 32079 [2019-12-18 21:13:07,753 INFO L226 Difference]: Without dead ends: 27629 [2019-12-18 21:13:07,754 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2019-12-18 21:13:07,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27629 states. [2019-12-18 21:13:08,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27629 to 21567. [2019-12-18 21:13:08,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21567 states. [2019-12-18 21:13:08,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21567 states to 21567 states and 64023 transitions. [2019-12-18 21:13:08,119 INFO L78 Accepts]: Start accepts. Automaton has 21567 states and 64023 transitions. Word has length 66 [2019-12-18 21:13:08,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:13:08,119 INFO L462 AbstractCegarLoop]: Abstraction has 21567 states and 64023 transitions. [2019-12-18 21:13:08,119 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 21:13:08,119 INFO L276 IsEmpty]: Start isEmpty. Operand 21567 states and 64023 transitions. [2019-12-18 21:13:08,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 21:13:08,139 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:13:08,139 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 21:13:08,140 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 21:13:08,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:13:08,140 INFO L82 PathProgramCache]: Analyzing trace with hash 1023003475, now seen corresponding path program 5 times [2019-12-18 21:13:08,140 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:13:08,140 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190349554] [2019-12-18 21:13:08,141 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:13:08,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:13:08,309 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 21:13:08,309 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190349554] [2019-12-18 21:13:08,309 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:13:08,310 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 21:13:08,310 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505810795] [2019-12-18 21:13:08,310 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 21:13:08,310 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:13:08,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 21:13:08,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 21:13:08,311 INFO L87 Difference]: Start difference. First operand 21567 states and 64023 transitions. Second operand 11 states. [2019-12-18 21:13:09,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:13:09,560 INFO L93 Difference]: Finished difference Result 46782 states and 138339 transitions. [2019-12-18 21:13:09,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-12-18 21:13:09,560 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 66 [2019-12-18 21:13:09,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:13:09,609 INFO L225 Difference]: With dead ends: 46782 [2019-12-18 21:13:09,609 INFO L226 Difference]: Without dead ends: 35869 [2019-12-18 21:13:09,609 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 235 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=203, Invalid=853, Unknown=0, NotChecked=0, Total=1056 [2019-12-18 21:13:09,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35869 states. [2019-12-18 21:13:10,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35869 to 20487. [2019-12-18 21:13:10,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20487 states. [2019-12-18 21:13:10,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20487 states to 20487 states and 60660 transitions. [2019-12-18 21:13:10,045 INFO L78 Accepts]: Start accepts. Automaton has 20487 states and 60660 transitions. Word has length 66 [2019-12-18 21:13:10,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:13:10,045 INFO L462 AbstractCegarLoop]: Abstraction has 20487 states and 60660 transitions. [2019-12-18 21:13:10,045 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 21:13:10,046 INFO L276 IsEmpty]: Start isEmpty. Operand 20487 states and 60660 transitions. [2019-12-18 21:13:10,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 21:13:10,067 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:13:10,067 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 21:13:10,067 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 21:13:10,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:13:10,068 INFO L82 PathProgramCache]: Analyzing trace with hash 1192462261, now seen corresponding path program 6 times [2019-12-18 21:13:10,068 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:13:10,068 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965263888] [2019-12-18 21:13:10,068 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:13:10,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:13:10,215 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 21:13:10,215 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965263888] [2019-12-18 21:13:10,215 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:13:10,216 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 21:13:10,216 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973394909] [2019-12-18 21:13:10,216 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 21:13:10,216 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:13:10,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 21:13:10,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-18 21:13:10,217 INFO L87 Difference]: Start difference. First operand 20487 states and 60660 transitions. Second operand 9 states. [2019-12-18 21:13:12,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:13:12,932 INFO L93 Difference]: Finished difference Result 36391 states and 105669 transitions. [2019-12-18 21:13:12,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 21:13:12,932 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 66 [2019-12-18 21:13:12,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:13:12,978 INFO L225 Difference]: With dead ends: 36391 [2019-12-18 21:13:12,978 INFO L226 Difference]: Without dead ends: 36007 [2019-12-18 21:13:12,979 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=105, Invalid=447, Unknown=0, NotChecked=0, Total=552 [2019-12-18 21:13:13,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36007 states. [2019-12-18 21:13:13,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36007 to 21924. [2019-12-18 21:13:13,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21924 states. [2019-12-18 21:13:13,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21924 states to 21924 states and 65160 transitions. [2019-12-18 21:13:13,426 INFO L78 Accepts]: Start accepts. Automaton has 21924 states and 65160 transitions. Word has length 66 [2019-12-18 21:13:13,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:13:13,426 INFO L462 AbstractCegarLoop]: Abstraction has 21924 states and 65160 transitions. [2019-12-18 21:13:13,426 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 21:13:13,426 INFO L276 IsEmpty]: Start isEmpty. Operand 21924 states and 65160 transitions. [2019-12-18 21:13:13,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 21:13:13,449 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:13:13,449 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 21:13:13,449 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 21:13:13,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:13:13,449 INFO L82 PathProgramCache]: Analyzing trace with hash 781937257, now seen corresponding path program 7 times [2019-12-18 21:13:13,450 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:13:13,450 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663003802] [2019-12-18 21:13:13,450 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:13:13,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:13:13,697 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 21:13:13,697 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663003802] [2019-12-18 21:13:13,698 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:13:13,698 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-18 21:13:13,698 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128121446] [2019-12-18 21:13:13,698 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 21:13:13,698 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:13:13,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 21:13:13,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-12-18 21:13:13,699 INFO L87 Difference]: Start difference. First operand 21924 states and 65160 transitions. Second operand 12 states. [2019-12-18 21:13:17,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:13:17,283 INFO L93 Difference]: Finished difference Result 40679 states and 118594 transitions. [2019-12-18 21:13:17,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-12-18 21:13:17,288 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 66 [2019-12-18 21:13:17,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:13:17,363 INFO L225 Difference]: With dead ends: 40679 [2019-12-18 21:13:17,363 INFO L226 Difference]: Without dead ends: 40483 [2019-12-18 21:13:17,364 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 256 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=230, Invalid=892, Unknown=0, NotChecked=0, Total=1122 [2019-12-18 21:13:17,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40483 states. [2019-12-18 21:13:18,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40483 to 23767. [2019-12-18 21:13:18,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23767 states. [2019-12-18 21:13:18,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23767 states to 23767 states and 70202 transitions. [2019-12-18 21:13:18,207 INFO L78 Accepts]: Start accepts. Automaton has 23767 states and 70202 transitions. Word has length 66 [2019-12-18 21:13:18,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:13:18,207 INFO L462 AbstractCegarLoop]: Abstraction has 23767 states and 70202 transitions. [2019-12-18 21:13:18,207 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 21:13:18,207 INFO L276 IsEmpty]: Start isEmpty. Operand 23767 states and 70202 transitions. [2019-12-18 21:13:18,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 21:13:18,229 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:13:18,229 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 21:13:18,229 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 21:13:18,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:13:18,230 INFO L82 PathProgramCache]: Analyzing trace with hash 2031770045, now seen corresponding path program 8 times [2019-12-18 21:13:18,230 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:13:18,230 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297361767] [2019-12-18 21:13:18,230 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:13:18,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:13:18,301 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 21:13:18,302 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297361767] [2019-12-18 21:13:18,302 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:13:18,302 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:13:18,302 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602980226] [2019-12-18 21:13:18,303 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:13:18,303 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:13:18,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:13:18,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:13:18,303 INFO L87 Difference]: Start difference. First operand 23767 states and 70202 transitions. Second operand 4 states. [2019-12-18 21:13:18,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:13:18,453 INFO L93 Difference]: Finished difference Result 27232 states and 80790 transitions. [2019-12-18 21:13:18,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:13:18,453 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-12-18 21:13:18,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:13:18,501 INFO L225 Difference]: With dead ends: 27232 [2019-12-18 21:13:18,501 INFO L226 Difference]: Without dead ends: 27232 [2019-12-18 21:13:18,501 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 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 21:13:18,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27232 states. [2019-12-18 21:13:18,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27232 to 21030. [2019-12-18 21:13:18,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21030 states. [2019-12-18 21:13:18,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21030 states to 21030 states and 62871 transitions. [2019-12-18 21:13:18,858 INFO L78 Accepts]: Start accepts. Automaton has 21030 states and 62871 transitions. Word has length 66 [2019-12-18 21:13:18,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:13:18,858 INFO L462 AbstractCegarLoop]: Abstraction has 21030 states and 62871 transitions. [2019-12-18 21:13:18,859 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:13:18,859 INFO L276 IsEmpty]: Start isEmpty. Operand 21030 states and 62871 transitions. [2019-12-18 21:13:18,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 21:13:18,878 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:13:18,878 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 21:13:18,878 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 21:13:18,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:13:18,879 INFO L82 PathProgramCache]: Analyzing trace with hash -328200473, now seen corresponding path program 1 times [2019-12-18 21:13:18,879 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:13:18,879 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224151930] [2019-12-18 21:13:18,879 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:13:18,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:13:18,929 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 21:13:18,929 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224151930] [2019-12-18 21:13:18,929 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:13:18,929 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:13:18,930 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135161464] [2019-12-18 21:13:18,930 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:13:18,930 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:13:18,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:13:18,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:13:18,931 INFO L87 Difference]: Start difference. First operand 21030 states and 62871 transitions. Second operand 3 states. [2019-12-18 21:13:19,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:13:19,157 INFO L93 Difference]: Finished difference Result 28858 states and 86366 transitions. [2019-12-18 21:13:19,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:13:19,157 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-12-18 21:13:19,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:13:19,197 INFO L225 Difference]: With dead ends: 28858 [2019-12-18 21:13:19,197 INFO L226 Difference]: Without dead ends: 28858 [2019-12-18 21:13:19,197 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 21:13:19,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28858 states. [2019-12-18 21:13:19,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28858 to 21556. [2019-12-18 21:13:19,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21556 states. [2019-12-18 21:13:19,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21556 states to 21556 states and 64570 transitions. [2019-12-18 21:13:19,577 INFO L78 Accepts]: Start accepts. Automaton has 21556 states and 64570 transitions. Word has length 67 [2019-12-18 21:13:19,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:13:19,578 INFO L462 AbstractCegarLoop]: Abstraction has 21556 states and 64570 transitions. [2019-12-18 21:13:19,578 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:13:19,578 INFO L276 IsEmpty]: Start isEmpty. Operand 21556 states and 64570 transitions. [2019-12-18 21:13:19,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 21:13:19,599 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:13:19,599 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 21:13:19,599 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 21:13:19,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:13:19,599 INFO L82 PathProgramCache]: Analyzing trace with hash 608064189, now seen corresponding path program 1 times [2019-12-18 21:13:19,600 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:13:19,600 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797634567] [2019-12-18 21:13:19,600 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:13:19,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:13:19,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:13:19,750 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797634567] [2019-12-18 21:13:19,750 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:13:19,750 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 21:13:19,751 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373800826] [2019-12-18 21:13:19,751 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 21:13:19,751 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:13:19,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 21:13:19,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 21:13:19,752 INFO L87 Difference]: Start difference. First operand 21556 states and 64570 transitions. Second operand 11 states. [2019-12-18 21:13:20,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:13:20,933 INFO L93 Difference]: Finished difference Result 25773 states and 76402 transitions. [2019-12-18 21:13:20,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-18 21:13:20,933 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-18 21:13:20,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:13:20,968 INFO L225 Difference]: With dead ends: 25773 [2019-12-18 21:13:20,968 INFO L226 Difference]: Without dead ends: 25378 [2019-12-18 21:13:20,969 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2019-12-18 21:13:21,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25378 states. [2019-12-18 21:13:21,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25378 to 21548. [2019-12-18 21:13:21,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21548 states. [2019-12-18 21:13:21,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21548 states to 21548 states and 64540 transitions. [2019-12-18 21:13:21,328 INFO L78 Accepts]: Start accepts. Automaton has 21548 states and 64540 transitions. Word has length 67 [2019-12-18 21:13:21,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:13:21,328 INFO L462 AbstractCegarLoop]: Abstraction has 21548 states and 64540 transitions. [2019-12-18 21:13:21,328 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 21:13:21,328 INFO L276 IsEmpty]: Start isEmpty. Operand 21548 states and 64540 transitions. [2019-12-18 21:13:21,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 21:13:21,351 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:13:21,351 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 21:13:21,351 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 21:13:21,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:13:21,351 INFO L82 PathProgramCache]: Analyzing trace with hash 1394809923, now seen corresponding path program 2 times [2019-12-18 21:13:21,352 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:13:21,352 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113515428] [2019-12-18 21:13:21,352 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:13:21,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:13:21,675 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 21:13:21,675 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113515428] [2019-12-18 21:13:21,675 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:13:21,675 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 21:13:21,676 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382857542] [2019-12-18 21:13:21,676 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 21:13:21,676 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:13:21,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 21:13:21,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 21:13:21,677 INFO L87 Difference]: Start difference. First operand 21548 states and 64540 transitions. Second operand 11 states. [2019-12-18 21:13:23,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:13:23,136 INFO L93 Difference]: Finished difference Result 26564 states and 78734 transitions. [2019-12-18 21:13:23,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-18 21:13:23,136 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-18 21:13:23,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:13:23,171 INFO L225 Difference]: With dead ends: 26564 [2019-12-18 21:13:23,171 INFO L226 Difference]: Without dead ends: 26093 [2019-12-18 21:13:23,172 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=367, Unknown=0, NotChecked=0, Total=462 [2019-12-18 21:13:23,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26093 states. [2019-12-18 21:13:23,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26093 to 21288. [2019-12-18 21:13:23,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21288 states. [2019-12-18 21:13:23,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21288 states to 21288 states and 63874 transitions. [2019-12-18 21:13:23,537 INFO L78 Accepts]: Start accepts. Automaton has 21288 states and 63874 transitions. Word has length 67 [2019-12-18 21:13:23,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:13:23,538 INFO L462 AbstractCegarLoop]: Abstraction has 21288 states and 63874 transitions. [2019-12-18 21:13:23,538 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 21:13:23,538 INFO L276 IsEmpty]: Start isEmpty. Operand 21288 states and 63874 transitions. [2019-12-18 21:13:23,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 21:13:23,561 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:13:23,562 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 21:13:23,562 INFO L410 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:13:23,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:13:23,562 INFO L82 PathProgramCache]: Analyzing trace with hash -614399051, now seen corresponding path program 3 times [2019-12-18 21:13:23,562 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:13:23,562 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448085869] [2019-12-18 21:13:23,562 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:13:23,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 21:13:23,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 21:13:23,680 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 21:13:23,680 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 21:13:23,684 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [898] [898] ULTIMATE.startENTRY-->L832: Formula: (let ((.cse0 (store |v_#valid_66| 0 0))) (and (< |v_#StackHeapBarrier_16| |v_ULTIMATE.start_main_~#t913~0.base_26|) (= 0 v_~__unbuffered_p1_EAX~0_15) (= |v_#NULL.offset_7| 0) (= 0 v_~a$read_delayed_var~0.base_7) (= |v_#valid_64| (store .cse0 |v_ULTIMATE.start_main_~#t913~0.base_26| 1)) (= v_~main$tmp_guard0~0_9 0) (= 0 v_~a$read_delayed~0_7) (= v_~a$read_delayed_var~0.offset_7 0) (= 0 v_~__unbuffered_cnt~0_21) (= 0 v_~a$r_buff1_thd3~0_48) (= v_~__unbuffered_p2_EBX~0_16 0) (< 0 |v_#StackHeapBarrier_16|) (= 0 v_~weak$$choice2~0_32) (= v_~x~0_10 0) (= 0 v_~z~0_7) (= 0 v_~a$r_buff1_thd0~0_26) (= 0 v_~a$w_buff1~0_23) (= 0 v_~a$w_buff0_used~0_113) (= v_~a$flush_delayed~0_13 0) (= 0 v_~a$r_buff1_thd1~0_18) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t913~0.base_26| 4)) (= 0 v_~__unbuffered_p2_EAX~0_15) (= 0 v_~weak$$choice0~0_7) (= v_~a$r_buff0_thd1~0_28 0) (= v_~a$mem_tmp~0_10 0) (= 0 v_~__unbuffered_p0_EAX~0_17) (= 0 |v_#NULL.base_7|) (= 0 v_~y~0_8) (= v_~a$r_buff0_thd2~0_21 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t913~0.base_26|)) (= v_~main$tmp_guard1~0_15 0) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t913~0.base_26| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t913~0.base_26|) |v_ULTIMATE.start_main_~#t913~0.offset_19| 0)) |v_#memory_int_19|) (= 0 v_~a$w_buff0~0_26) (= 0 |v_ULTIMATE.start_main_~#t913~0.offset_19|) (= v_~a$r_buff0_thd3~0_79 0) (= 0 v_~a$w_buff1_used~0_68) (= 0 v_~a$r_buff1_thd2~0_18) (= v_~a~0_27 0) (= v_~a$r_buff0_thd0~0_21 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_16|, #valid=|v_#valid_66|, #memory_int=|v_#memory_int_20|, #length=|v_#length_22|} OutVars{~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_18, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_11|, #NULL.offset=|v_#NULL.offset_7|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_9|, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_21, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_9|, ~a~0=v_~a~0_27, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_22|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_17, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_15, #length=|v_#length_21|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_15, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_16, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_7|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_48, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_113, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_28, ULTIMATE.start_main_~#t914~0.base=|v_ULTIMATE.start_main_~#t914~0.base_21|, ~weak$$choice0~0=v_~weak$$choice0~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_16|, ~a$read_delayed_var~0.offset=v_~a$read_delayed_var~0.offset_7, ~a$w_buff0~0=v_~a$w_buff0~0_26, ULTIMATE.start_main_~#t913~0.base=|v_ULTIMATE.start_main_~#t913~0.base_26|, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_26, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_21, ~x~0=v_~x~0_10, ~a$read_delayed~0=v_~a$read_delayed~0_7, ULTIMATE.start_main_~#t915~0.base=|v_ULTIMATE.start_main_~#t915~0.base_17|, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_21, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_15, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_11|, ULTIMATE.start_main_~#t915~0.offset=|v_ULTIMATE.start_main_~#t915~0.offset_14|, ~a$mem_tmp~0=v_~a$mem_tmp~0_10, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_9|, ~a$w_buff1~0=v_~a$w_buff1~0_23, ~y~0=v_~y~0_8, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_7|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_7|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_18, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_79, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_9, ULTIMATE.start_main_~#t913~0.offset=|v_ULTIMATE.start_main_~#t913~0.offset_19|, #NULL.base=|v_#NULL.base_7|, ~a$flush_delayed~0=v_~a$flush_delayed~0_13, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_19|, #valid=|v_#valid_64|, #memory_int=|v_#memory_int_19|, ULTIMATE.start_main_~#t914~0.offset=|v_ULTIMATE.start_main_~#t914~0.offset_16|, ~z~0=v_~z~0_7, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_68, ~weak$$choice2~0=v_~weak$$choice2~0_32, ~a$read_delayed_var~0.base=v_~a$read_delayed_var~0.base_7} AuxVars[] AssignedVars[~a$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite49, ~a$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite50, ~a~0, ULTIMATE.start_main_#t~ite52, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~nondet45, ~a$r_buff1_thd3~0, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, ULTIMATE.start_main_~#t914~0.base, ~weak$$choice0~0, ~a$read_delayed_var~0.offset, ~a$w_buff0~0, ULTIMATE.start_main_~#t913~0.base, ~a$r_buff1_thd0~0, ~__unbuffered_cnt~0, ~x~0, ~a$read_delayed~0, ULTIMATE.start_main_~#t915~0.base, ~a$r_buff0_thd2~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ULTIMATE.start_main_~#t915~0.offset, ~a$mem_tmp~0, ULTIMATE.start_main_#t~ite51, ~a$w_buff1~0, ~y~0, ULTIMATE.start_main_#t~nondet46, ULTIMATE.start_main_#t~nondet44, ~a$r_buff1_thd1~0, ~a$r_buff0_thd3~0, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t913~0.offset, #NULL.base, ~a$flush_delayed~0, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_~#t914~0.offset, ~z~0, ~a$w_buff1_used~0, ~weak$$choice2~0, ~a$read_delayed_var~0.base] because there is no mapped edge [2019-12-18 21:13:23,686 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [880] [880] L4-->L750: Formula: (and (= ~a$r_buff0_thd2~0_In2034466814 ~a$r_buff1_thd2~0_Out2034466814) (not (= P0Thread1of1ForFork1___VERIFIER_assert_~expression_In2034466814 0)) (= ~x~0_In2034466814 ~__unbuffered_p0_EAX~0_Out2034466814) (= ~a$r_buff1_thd3~0_Out2034466814 ~a$r_buff0_thd3~0_In2034466814) (= ~a$r_buff0_thd0~0_In2034466814 ~a$r_buff1_thd0~0_Out2034466814) (= ~a$r_buff0_thd1~0_In2034466814 ~a$r_buff1_thd1~0_Out2034466814) (= 1 ~a$r_buff0_thd1~0_Out2034466814)) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In2034466814, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In2034466814, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In2034466814, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In2034466814, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In2034466814, ~x~0=~x~0_In2034466814} OutVars{~__unbuffered_p0_EAX~0=~__unbuffered_p0_EAX~0_Out2034466814, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_Out2034466814, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_Out2034466814, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_Out2034466814, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In2034466814, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_Out2034466814, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In2034466814, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In2034466814, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_Out2034466814, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In2034466814, ~x~0=~x~0_In2034466814} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, ~a$r_buff1_thd1~0, ~a$r_buff1_thd3~0, ~a$r_buff1_thd2~0, ~a$r_buff1_thd0~0, ~a$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 21:13:23,686 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [877] [877] L832-1-->L834: Formula: (and (= 0 |v_ULTIMATE.start_main_~#t914~0.offset_10|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t914~0.base_11| 4)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t914~0.base_11|) (= |v_#valid_41| (store |v_#valid_42| |v_ULTIMATE.start_main_~#t914~0.base_11| 1)) (= (select |v_#valid_42| |v_ULTIMATE.start_main_~#t914~0.base_11|) 0) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t914~0.base_11| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t914~0.base_11|) |v_ULTIMATE.start_main_~#t914~0.offset_10| 1)) |v_#memory_int_15|) (not (= |v_ULTIMATE.start_main_~#t914~0.base_11| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_5|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~#t914~0.offset=|v_ULTIMATE.start_main_~#t914~0.offset_10|, #length=|v_#length_17|, ULTIMATE.start_main_~#t914~0.base=|v_ULTIMATE.start_main_~#t914~0.base_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, ULTIMATE.start_main_~#t914~0.offset, #length, ULTIMATE.start_main_~#t914~0.base] because there is no mapped edge [2019-12-18 21:13:23,688 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L770-2-->L770-4: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff1_thd2~0_In117522236 256))) (.cse0 (= (mod ~a$w_buff1_used~0_In117522236 256) 0))) (or (and (not .cse0) (= |P1Thread1of1ForFork2_#t~ite9_Out117522236| ~a$w_buff1~0_In117522236) (not .cse1)) (and (= |P1Thread1of1ForFork2_#t~ite9_Out117522236| ~a~0_In117522236) (or .cse1 .cse0)))) InVars {~a~0=~a~0_In117522236, ~a$w_buff1~0=~a$w_buff1~0_In117522236, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In117522236, ~a$w_buff1_used~0=~a$w_buff1_used~0_In117522236} OutVars{~a~0=~a~0_In117522236, P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out117522236|, ~a$w_buff1~0=~a$w_buff1~0_In117522236, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In117522236, ~a$w_buff1_used~0=~a$w_buff1_used~0_In117522236} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9] because there is no mapped edge [2019-12-18 21:13:23,689 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [820] [820] L770-4-->L771: Formula: (= v_~a~0_22 |v_P1Thread1of1ForFork2_#t~ite9_8|) InVars {P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_8|} OutVars{~a~0=v_~a~0_22, P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_7|, P1Thread1of1ForFork2_#t~ite10=|v_P1Thread1of1ForFork2_#t~ite10_7|} AuxVars[] AssignedVars[~a~0, P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite10] because there is no mapped edge [2019-12-18 21:13:23,689 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [842] [842] L771-->L771-2: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff0_thd2~0_In-1777738785 256))) (.cse0 (= (mod ~a$w_buff0_used~0_In-1777738785 256) 0))) (or (and (or .cse0 .cse1) (= ~a$w_buff0_used~0_In-1777738785 |P1Thread1of1ForFork2_#t~ite11_Out-1777738785|)) (and (not .cse1) (not .cse0) (= 0 |P1Thread1of1ForFork2_#t~ite11_Out-1777738785|)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1777738785, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1777738785} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1777738785, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1777738785, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out-1777738785|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-18 21:13:23,690 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L772-->L772-2: Formula: (let ((.cse3 (= 0 (mod ~a$r_buff1_thd2~0_In293090503 256))) (.cse2 (= (mod ~a$w_buff1_used~0_In293090503 256) 0)) (.cse0 (= (mod ~a$r_buff0_thd2~0_In293090503 256) 0)) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In293090503 256)))) (or (and (= |P1Thread1of1ForFork2_#t~ite12_Out293090503| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse0 .cse1) (= ~a$w_buff1_used~0_In293090503 |P1Thread1of1ForFork2_#t~ite12_Out293090503|)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In293090503, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In293090503, ~a$w_buff0_used~0=~a$w_buff0_used~0_In293090503, ~a$w_buff1_used~0=~a$w_buff1_used~0_In293090503} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In293090503, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In293090503, ~a$w_buff0_used~0=~a$w_buff0_used~0_In293090503, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out293090503|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In293090503} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-18 21:13:23,690 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [829] [829] L773-->L773-2: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff0_used~0_In-1479177383 256))) (.cse1 (= (mod ~a$r_buff0_thd2~0_In-1479177383 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork2_#t~ite13_Out-1479177383| ~a$r_buff0_thd2~0_In-1479177383)) (and (not .cse0) (= |P1Thread1of1ForFork2_#t~ite13_Out-1479177383| 0) (not .cse1)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1479177383, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1479177383} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1479177383, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1479177383, P1Thread1of1ForFork2_#t~ite13=|P1Thread1of1ForFork2_#t~ite13_Out-1479177383|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite13] because there is no mapped edge [2019-12-18 21:13:23,691 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [838] [838] L774-->L774-2: Formula: (let ((.cse1 (= (mod ~a$r_buff0_thd2~0_In91546019 256) 0)) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In91546019 256))) (.cse2 (= 0 (mod ~a$r_buff1_thd2~0_In91546019 256))) (.cse3 (= (mod ~a$w_buff1_used~0_In91546019 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork2_#t~ite14_Out91546019| ~a$r_buff1_thd2~0_In91546019) (or .cse2 .cse3)) (and (= |P1Thread1of1ForFork2_#t~ite14_Out91546019| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In91546019, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In91546019, ~a$w_buff0_used~0=~a$w_buff0_used~0_In91546019, ~a$w_buff1_used~0=~a$w_buff1_used~0_In91546019} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In91546019, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In91546019, ~a$w_buff0_used~0=~a$w_buff0_used~0_In91546019, ~a$w_buff1_used~0=~a$w_buff1_used~0_In91546019, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out91546019|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-18 21:13:23,691 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [857] [857] L774-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= (+ v_~__unbuffered_cnt~0_12 1) v_~__unbuffered_cnt~0_11) (= |v_P1Thread1of1ForFork2_#t~ite14_8| v_~a$r_buff1_thd2~0_13) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_8|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_13, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_7|, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~a$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-18 21:13:23,691 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [846] [846] L751-->L751-2: Formula: (let ((.cse1 (= (mod ~a$r_buff0_thd1~0_In467789190 256) 0)) (.cse0 (= (mod ~a$w_buff0_used~0_In467789190 256) 0))) (or (and (not .cse0) (= 0 |P0Thread1of1ForFork1_#t~ite5_Out467789190|) (not .cse1)) (and (or .cse1 .cse0) (= |P0Thread1of1ForFork1_#t~ite5_Out467789190| ~a$w_buff0_used~0_In467789190)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In467789190, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In467789190} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out467789190|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In467789190, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In467789190} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-18 21:13:23,692 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [849] [849] L752-->L752-2: Formula: (let ((.cse3 (= 0 (mod ~a$w_buff0_used~0_In-2047977176 256))) (.cse2 (= (mod ~a$r_buff0_thd1~0_In-2047977176 256) 0)) (.cse0 (= (mod ~a$r_buff1_thd1~0_In-2047977176 256) 0)) (.cse1 (= (mod ~a$w_buff1_used~0_In-2047977176 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork1_#t~ite6_Out-2047977176| 0)) (and (= |P0Thread1of1ForFork1_#t~ite6_Out-2047977176| ~a$w_buff1_used~0_In-2047977176) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-2047977176, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-2047977176, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-2047977176, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-2047977176} OutVars{P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out-2047977176|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-2047977176, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-2047977176, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-2047977176, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-2047977176} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-18 21:13:23,693 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [848] [848] L753-->L754: Formula: (let ((.cse0 (= (mod ~a$r_buff0_thd1~0_In-247113926 256) 0)) (.cse1 (= (mod ~a$w_buff0_used~0_In-247113926 256) 0))) (or (and (= ~a$r_buff0_thd1~0_Out-247113926 ~a$r_buff0_thd1~0_In-247113926) (or .cse0 .cse1)) (and (not .cse0) (= ~a$r_buff0_thd1~0_Out-247113926 0) (not .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-247113926, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-247113926} OutVars{P0Thread1of1ForFork1_#t~ite7=|P0Thread1of1ForFork1_#t~ite7_Out-247113926|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-247113926, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_Out-247113926} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite7, ~a$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 21:13:23,693 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [845] [845] L754-->L754-2: Formula: (let ((.cse0 (= (mod ~a$w_buff0_used~0_In2104893378 256) 0)) (.cse1 (= 0 (mod ~a$r_buff0_thd1~0_In2104893378 256))) (.cse2 (= (mod ~a$w_buff1_used~0_In2104893378 256) 0)) (.cse3 (= (mod ~a$r_buff1_thd1~0_In2104893378 256) 0))) (or (and (= |P0Thread1of1ForFork1_#t~ite8_Out2104893378| ~a$r_buff1_thd1~0_In2104893378) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P0Thread1of1ForFork1_#t~ite8_Out2104893378| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In2104893378, ~a$w_buff0_used~0=~a$w_buff0_used~0_In2104893378, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In2104893378, ~a$w_buff1_used~0=~a$w_buff1_used~0_In2104893378} OutVars{P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out2104893378|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In2104893378, ~a$w_buff0_used~0=~a$w_buff0_used~0_In2104893378, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In2104893378, ~a$w_buff1_used~0=~a$w_buff1_used~0_In2104893378} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-18 21:13:23,693 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [866] [866] L754-2-->P0EXIT: Formula: (and (= v_~__unbuffered_cnt~0_14 (+ v_~__unbuffered_cnt~0_15 1)) (= v_~a$r_buff1_thd1~0_13 |v_P0Thread1of1ForFork1_#t~ite8_8|) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15} OutVars{P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_7|, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_13, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8, P0Thread1of1ForFork1_#res.offset, ~a$r_buff1_thd1~0, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-18 21:13:23,693 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [863] [863] L834-1-->L836: Formula: (and (= 0 |v_ULTIMATE.start_main_~#t915~0.offset_10|) (= |v_#valid_31| (store |v_#valid_32| |v_ULTIMATE.start_main_~#t915~0.base_11| 1)) (not (= 0 |v_ULTIMATE.start_main_~#t915~0.base_11|)) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t915~0.base_11| 4)) (= 0 (select |v_#valid_32| |v_ULTIMATE.start_main_~#t915~0.base_11|)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t915~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t915~0.base_11|) |v_ULTIMATE.start_main_~#t915~0.offset_10| 2)) |v_#memory_int_13|) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t915~0.base_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_~#t915~0.base=|v_ULTIMATE.start_main_~#t915~0.base_11|, #valid=|v_#valid_31|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_5|, #memory_int=|v_#memory_int_13|, #length=|v_#length_15|, ULTIMATE.start_main_~#t915~0.offset=|v_ULTIMATE.start_main_~#t915~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t915~0.base, #valid, ULTIMATE.start_main_#t~nondet45, #memory_int, #length, ULTIMATE.start_main_~#t915~0.offset] because there is no mapped edge [2019-12-18 21:13:23,699 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [879] [879] L801-->L801-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In2119007598 256) 0))) (or (and (not .cse0) (= ~a$w_buff1_used~0_In2119007598 |P2Thread1of1ForFork0_#t~ite30_Out2119007598|) (= |P2Thread1of1ForFork0_#t~ite29_In2119007598| |P2Thread1of1ForFork0_#t~ite29_Out2119007598|)) (and (let ((.cse1 (= 0 (mod ~a$r_buff0_thd3~0_In2119007598 256)))) (or (= 0 (mod ~a$w_buff0_used~0_In2119007598 256)) (and .cse1 (= 0 (mod ~a$w_buff1_used~0_In2119007598 256))) (and (= (mod ~a$r_buff1_thd3~0_In2119007598 256) 0) .cse1))) .cse0 (= |P2Thread1of1ForFork0_#t~ite29_Out2119007598| ~a$w_buff1_used~0_In2119007598) (= |P2Thread1of1ForFork0_#t~ite29_Out2119007598| |P2Thread1of1ForFork0_#t~ite30_Out2119007598|)))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In2119007598, ~a$w_buff0_used~0=~a$w_buff0_used~0_In2119007598, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In2119007598, ~a$w_buff1_used~0=~a$w_buff1_used~0_In2119007598, ~weak$$choice2~0=~weak$$choice2~0_In2119007598, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_In2119007598|} OutVars{~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In2119007598, ~a$w_buff0_used~0=~a$w_buff0_used~0_In2119007598, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In2119007598, ~a$w_buff1_used~0=~a$w_buff1_used~0_In2119007598, P2Thread1of1ForFork0_#t~ite30=|P2Thread1of1ForFork0_#t~ite30_Out2119007598|, ~weak$$choice2~0=~weak$$choice2~0_In2119007598, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_Out2119007598|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite30, P2Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-18 21:13:23,700 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] L802-->L803: Formula: (and (= v_~a$r_buff0_thd3~0_52 v_~a$r_buff0_thd3~0_51) (not (= 0 (mod v_~weak$$choice2~0_17 256)))) InVars {~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_52, ~weak$$choice2~0=v_~weak$$choice2~0_17} OutVars{P2Thread1of1ForFork0_#t~ite33=|v_P2Thread1of1ForFork0_#t~ite33_9|, P2Thread1of1ForFork0_#t~ite32=|v_P2Thread1of1ForFork0_#t~ite32_9|, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_51, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_8|, ~weak$$choice2~0=v_~weak$$choice2~0_17} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite33, P2Thread1of1ForFork0_#t~ite32, ~a$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-18 21:13:23,701 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [799] [799] L805-->L809: Formula: (and (not (= 0 (mod v_~a$flush_delayed~0_8 256))) (= v_~a$flush_delayed~0_7 0) (= v_~a~0_20 v_~a$mem_tmp~0_5)) InVars {~a$mem_tmp~0=v_~a$mem_tmp~0_5, ~a$flush_delayed~0=v_~a$flush_delayed~0_8} OutVars{P2Thread1of1ForFork0_#t~ite37=|v_P2Thread1of1ForFork0_#t~ite37_7|, ~a~0=v_~a~0_20, ~a$mem_tmp~0=v_~a$mem_tmp~0_5, ~a$flush_delayed~0=v_~a$flush_delayed~0_7} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite37, ~a~0, ~a$flush_delayed~0] because there is no mapped edge [2019-12-18 21:13:23,702 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L809-2-->L809-4: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff1_used~0_In-57959045 256))) (.cse0 (= 0 (mod ~a$r_buff1_thd3~0_In-57959045 256)))) (or (and (or .cse0 .cse1) (= ~a~0_In-57959045 |P2Thread1of1ForFork0_#t~ite38_Out-57959045|)) (and (not .cse1) (not .cse0) (= |P2Thread1of1ForFork0_#t~ite38_Out-57959045| ~a$w_buff1~0_In-57959045)))) InVars {~a~0=~a~0_In-57959045, ~a$w_buff1~0=~a$w_buff1~0_In-57959045, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-57959045, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-57959045} OutVars{~a~0=~a~0_In-57959045, P2Thread1of1ForFork0_#t~ite38=|P2Thread1of1ForFork0_#t~ite38_Out-57959045|, ~a$w_buff1~0=~a$w_buff1~0_In-57959045, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-57959045, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-57959045} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-18 21:13:23,702 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [788] [788] L809-4-->L810: Formula: (= v_~a~0_18 |v_P2Thread1of1ForFork0_#t~ite38_8|) InVars {P2Thread1of1ForFork0_#t~ite38=|v_P2Thread1of1ForFork0_#t~ite38_8|} OutVars{~a~0=v_~a~0_18, P2Thread1of1ForFork0_#t~ite39=|v_P2Thread1of1ForFork0_#t~ite39_7|, P2Thread1of1ForFork0_#t~ite38=|v_P2Thread1of1ForFork0_#t~ite38_7|} AuxVars[] AssignedVars[~a~0, P2Thread1of1ForFork0_#t~ite39, P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-18 21:13:23,702 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L810-->L810-2: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff0_used~0_In-576776579 256))) (.cse0 (= 0 (mod ~a$r_buff0_thd3~0_In-576776579 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite40_Out-576776579| ~a$w_buff0_used~0_In-576776579) (or .cse0 .cse1)) (and (not .cse1) (= |P2Thread1of1ForFork0_#t~ite40_Out-576776579| 0) (not .cse0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-576776579, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-576776579} OutVars{P2Thread1of1ForFork0_#t~ite40=|P2Thread1of1ForFork0_#t~ite40_Out-576776579|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-576776579, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-576776579} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite40] because there is no mapped edge [2019-12-18 21:13:23,703 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L811-->L811-2: Formula: (let ((.cse3 (= 0 (mod ~a$r_buff1_thd3~0_In-1980040914 256))) (.cse2 (= (mod ~a$w_buff1_used~0_In-1980040914 256) 0)) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In-1980040914 256))) (.cse0 (= 0 (mod ~a$r_buff0_thd3~0_In-1980040914 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork0_#t~ite41_Out-1980040914|)) (and (or .cse3 .cse2) (or .cse1 .cse0) (= |P2Thread1of1ForFork0_#t~ite41_Out-1980040914| ~a$w_buff1_used~0_In-1980040914)))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1980040914, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1980040914, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1980040914, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1980040914} OutVars{~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1980040914, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1980040914, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1980040914, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1980040914, P2Thread1of1ForFork0_#t~ite41=|P2Thread1of1ForFork0_#t~ite41_Out-1980040914|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite41] because there is no mapped edge [2019-12-18 21:13:23,704 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [847] [847] L812-->L812-2: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff0_used~0_In1493621512 256))) (.cse1 (= 0 (mod ~a$r_buff0_thd3~0_In1493621512 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite42_Out1493621512| ~a$r_buff0_thd3~0_In1493621512) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork0_#t~ite42_Out1493621512| 0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In1493621512, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1493621512} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In1493621512, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1493621512, P2Thread1of1ForFork0_#t~ite42=|P2Thread1of1ForFork0_#t~ite42_Out1493621512|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-18 21:13:23,705 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L813-->L813-2: Formula: (let ((.cse0 (= (mod ~a$r_buff1_thd3~0_In-388182011 256) 0)) (.cse1 (= 0 (mod ~a$w_buff1_used~0_In-388182011 256))) (.cse2 (= 0 (mod ~a$r_buff0_thd3~0_In-388182011 256))) (.cse3 (= (mod ~a$w_buff0_used~0_In-388182011 256) 0))) (or (and (= 0 |P2Thread1of1ForFork0_#t~ite43_Out-388182011|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~a$r_buff1_thd3~0_In-388182011 |P2Thread1of1ForFork0_#t~ite43_Out-388182011|) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-388182011, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-388182011, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-388182011, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-388182011} OutVars{P2Thread1of1ForFork0_#t~ite43=|P2Thread1of1ForFork0_#t~ite43_Out-388182011|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-388182011, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-388182011, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-388182011, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-388182011} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite43] because there is no mapped edge [2019-12-18 21:13:23,705 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [874] [874] L813-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= v_~a$r_buff1_thd3~0_43 |v_P2Thread1of1ForFork0_#t~ite43_8|) (= (+ v_~__unbuffered_cnt~0_17 1) v_~__unbuffered_cnt~0_16) (= |v_P2Thread1of1ForFork0_#res.base_5| 0)) InVars {P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_17} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_7|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_43, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite43, ~a$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-18 21:13:23,705 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [794] [794] L836-1-->L842: Formula: (and (= 3 v_~__unbuffered_cnt~0_10) (= v_~main$tmp_guard0~0_5 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_4|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-18 21:13:23,706 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [852] [852] L842-2-->L842-5: Formula: (let ((.cse0 (= |ULTIMATE.start_main_#t~ite48_Out238969419| |ULTIMATE.start_main_#t~ite47_Out238969419|)) (.cse1 (= 0 (mod ~a$r_buff1_thd0~0_In238969419 256))) (.cse2 (= (mod ~a$w_buff1_used~0_In238969419 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite47_Out238969419| ~a$w_buff1~0_In238969419) .cse0 (not .cse1) (not .cse2)) (and (= ~a~0_In238969419 |ULTIMATE.start_main_#t~ite47_Out238969419|) .cse0 (or .cse1 .cse2)))) InVars {~a~0=~a~0_In238969419, ~a$w_buff1~0=~a$w_buff1~0_In238969419, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In238969419, ~a$w_buff1_used~0=~a$w_buff1_used~0_In238969419} OutVars{~a~0=~a~0_In238969419, ~a$w_buff1~0=~a$w_buff1~0_In238969419, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out238969419|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In238969419, ULTIMATE.start_main_#t~ite48=|ULTIMATE.start_main_#t~ite48_Out238969419|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In238969419} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-18 21:13:23,706 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [830] [830] L843-->L843-2: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff0_thd0~0_In-1108939919 256))) (.cse0 (= (mod ~a$w_buff0_used~0_In-1108939919 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite49_Out-1108939919|)) (and (= ~a$w_buff0_used~0_In-1108939919 |ULTIMATE.start_main_#t~ite49_Out-1108939919|) (or .cse1 .cse0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-1108939919, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1108939919} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In-1108939919, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out-1108939919|, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1108939919} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-18 21:13:23,707 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [843] [843] L844-->L844-2: Formula: (let ((.cse0 (= (mod ~a$r_buff0_thd0~0_In900765493 256) 0)) (.cse1 (= (mod ~a$w_buff0_used~0_In900765493 256) 0)) (.cse3 (= 0 (mod ~a$w_buff1_used~0_In900765493 256))) (.cse2 (= 0 (mod ~a$r_buff1_thd0~0_In900765493 256)))) (or (and (= |ULTIMATE.start_main_#t~ite50_Out900765493| ~a$w_buff1_used~0_In900765493) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= |ULTIMATE.start_main_#t~ite50_Out900765493| 0)))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In900765493, ~a$w_buff0_used~0=~a$w_buff0_used~0_In900765493, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In900765493, ~a$w_buff1_used~0=~a$w_buff1_used~0_In900765493} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out900765493|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In900765493, ~a$w_buff0_used~0=~a$w_buff0_used~0_In900765493, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In900765493, ~a$w_buff1_used~0=~a$w_buff1_used~0_In900765493} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-18 21:13:23,708 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L845-->L845-2: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff0_thd0~0_In1273260924 256))) (.cse0 (= (mod ~a$w_buff0_used~0_In1273260924 256) 0))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite51_Out1273260924|) (not .cse1)) (and (or .cse1 .cse0) (= ~a$r_buff0_thd0~0_In1273260924 |ULTIMATE.start_main_#t~ite51_Out1273260924|)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In1273260924, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1273260924} OutVars{ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out1273260924|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1273260924, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1273260924} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-18 21:13:23,709 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [851] [851] L846-->L846-2: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff0_thd0~0_In-386168452 256))) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In-386168452 256))) (.cse3 (= (mod ~a$w_buff1_used~0_In-386168452 256) 0)) (.cse2 (= (mod ~a$r_buff1_thd0~0_In-386168452 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite52_Out-386168452| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |ULTIMATE.start_main_#t~ite52_Out-386168452| ~a$r_buff1_thd0~0_In-386168452) (or .cse0 .cse1) (or .cse3 .cse2)))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-386168452, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-386168452, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-386168452, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-386168452} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out-386168452|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-386168452, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-386168452, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-386168452, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-386168452} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-18 21:13:23,709 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [886] [886] L846-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start_main_#t~ite52_13| v_~a$r_buff1_thd0~0_19) (= v_~main$tmp_guard1~0_9 0) (= v_~__unbuffered_p2_EBX~0_9 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 0) (= (mod v_~main$tmp_guard1~0_9 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= 0 v_~__unbuffered_p0_EAX~0_11) (= 0 v_~__unbuffered_p1_EAX~0_9) (= v_~__unbuffered_p2_EAX~0_9 1)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_11, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_13|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_9, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_9, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_9} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_11, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_12|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_9, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_9, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_19, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_9, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_9, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~a$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 21:13:23,809 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 09:13:23 BasicIcfg [2019-12-18 21:13:23,809 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 21:13:23,811 INFO L168 Benchmark]: Toolchain (without parser) took 119823.17 ms. Allocated memory was 144.7 MB in the beginning and 3.1 GB in the end (delta: 2.9 GB). Free memory was 101.4 MB in the beginning and 1.7 GB in the end (delta: -1.6 GB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. [2019-12-18 21:13:23,811 INFO L168 Benchmark]: CDTParser took 0.50 ms. Allocated memory is still 144.7 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-18 21:13:23,812 INFO L168 Benchmark]: CACSL2BoogieTranslator took 812.08 ms. Allocated memory was 144.7 MB in the beginning and 201.3 MB in the end (delta: 56.6 MB). Free memory was 101.0 MB in the beginning and 155.7 MB in the end (delta: -54.7 MB). Peak memory consumption was 24.4 MB. Max. memory is 7.1 GB. [2019-12-18 21:13:23,812 INFO L168 Benchmark]: Boogie Procedure Inliner took 66.05 ms. Allocated memory is still 201.3 MB. Free memory was 155.7 MB in the beginning and 153.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 21:13:23,812 INFO L168 Benchmark]: Boogie Preprocessor took 63.20 ms. Allocated memory is still 201.3 MB. Free memory was 153.0 MB in the beginning and 150.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-18 21:13:23,817 INFO L168 Benchmark]: RCFGBuilder took 878.33 ms. Allocated memory is still 201.3 MB. Free memory was 150.4 MB in the beginning and 100.0 MB in the end (delta: 50.3 MB). Peak memory consumption was 50.3 MB. Max. memory is 7.1 GB. [2019-12-18 21:13:23,817 INFO L168 Benchmark]: TraceAbstraction took 117995.83 ms. Allocated memory was 201.3 MB in the beginning and 3.1 GB in the end (delta: 2.9 GB). Free memory was 99.4 MB in the beginning and 1.7 GB in the end (delta: -1.6 GB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. [2019-12-18 21:13:23,822 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.50 ms. Allocated memory is still 144.7 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 812.08 ms. Allocated memory was 144.7 MB in the beginning and 201.3 MB in the end (delta: 56.6 MB). Free memory was 101.0 MB in the beginning and 155.7 MB in the end (delta: -54.7 MB). Peak memory consumption was 24.4 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 66.05 ms. Allocated memory is still 201.3 MB. Free memory was 155.7 MB in the beginning and 153.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 63.20 ms. Allocated memory is still 201.3 MB. Free memory was 153.0 MB in the beginning and 150.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 878.33 ms. Allocated memory is still 201.3 MB. Free memory was 150.4 MB in the beginning and 100.0 MB in the end (delta: 50.3 MB). Peak memory consumption was 50.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 117995.83 ms. Allocated memory was 201.3 MB in the beginning and 3.1 GB in the end (delta: 2.9 GB). Free memory was 99.4 MB in the beginning and 1.7 GB in the end (delta: -1.6 GB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.0s, 178 ProgramPointsBefore, 96 ProgramPointsAfterwards, 215 TransitionsBefore, 107 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 7 FixpointIterations, 35 TrivialSequentialCompositions, 45 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 34 ConcurrentYvCompositions, 30 ChoiceCompositions, 7337 VarBasedMoverChecksPositive, 224 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 86659 CheckedPairsTotal, 114 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L832] FCALL, FORK 0 pthread_create(&t913, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L735] 1 a$w_buff1 = a$w_buff0 [L736] 1 a$w_buff0 = 1 [L737] 1 a$w_buff1_used = a$w_buff0_used [L738] 1 a$w_buff0_used = (_Bool)1 [L750] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L834] FCALL, FORK 0 pthread_create(&t914, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L764] 2 x = 1 [L767] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L770] 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L750] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L771] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L772] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L773] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L751] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L752] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L836] FCALL, FORK 0 pthread_create(&t915, ((void *)0), P2, ((void *)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L784] 3 y = 1 [L787] 3 z = 1 [L790] 3 __unbuffered_p2_EAX = z [L793] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L794] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L795] 3 a$flush_delayed = weak$$choice2 [L796] 3 a$mem_tmp = a VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=1] [L797] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) VAL [!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1)=0, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=1] [L797] 3 a = !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L798] EXPR 3 weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0))=1, x=1, y=1, z=1] [L798] 3 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L799] EXPR 3 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1))=0, x=1, y=1, z=1] [L799] 3 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L800] EXPR 3 weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used))=0, x=1, y=1, z=1] [L800] 3 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L801] 3 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L803] EXPR 3 weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=1] [L803] 3 a$r_buff1_thd3 = weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L804] 3 __unbuffered_p2_EBX = a VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=1] [L809] 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=1] [L810] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L811] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L812] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L842] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=1] [L842] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L843] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L844] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L845] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 169 locations, 2 error locations. Result: UNSAFE, OverallTime: 117.6s, OverallIterations: 33, TraceHistogramMax: 1, AutomataDifference: 36.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 8186 SDtfs, 8445 SDslu, 27807 SDs, 0 SdLazy, 17622 SolverSat, 287 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 14.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 370 GetRequests, 54 SyntacticMatches, 16 SemanticMatches, 300 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 977 ImplicationChecksByTransitivity, 3.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=163842occurred 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: 49.2s AutomataMinimizationTime, 32 MinimizatonAttempts, 246402 StatesRemovedByMinimization, 28 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.8s InterpolantComputationTime, 1469 NumberOfCodeBlocks, 1469 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 1370 ConstructedInterpolants, 0 QuantifiedInterpolants, 284071 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 32 InterpolantComputations, 32 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...