/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix046_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-26 22:43:01,730 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-26 22:43:01,732 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-26 22:43:01,744 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-26 22:43:01,745 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-26 22:43:01,746 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-26 22:43:01,747 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-26 22:43:01,749 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-26 22:43:01,751 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-26 22:43:01,752 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-26 22:43:01,753 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-26 22:43:01,754 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-26 22:43:01,754 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-26 22:43:01,755 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-26 22:43:01,756 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-26 22:43:01,757 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-26 22:43:01,758 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-26 22:43:01,759 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-26 22:43:01,761 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-26 22:43:01,763 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-26 22:43:01,769 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-26 22:43:01,770 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-26 22:43:01,773 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-26 22:43:01,774 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-26 22:43:01,776 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-26 22:43:01,776 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-26 22:43:01,776 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-26 22:43:01,778 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-26 22:43:01,779 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-26 22:43:01,780 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-26 22:43:01,780 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-26 22:43:01,781 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-26 22:43:01,782 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-26 22:43:01,783 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-26 22:43:01,784 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-26 22:43:01,784 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-26 22:43:01,785 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-26 22:43:01,785 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-26 22:43:01,785 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-26 22:43:01,788 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-26 22:43:01,791 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-26 22:43:01,792 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-26 22:43:01,817 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-26 22:43:01,817 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-26 22:43:01,819 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-26 22:43:01,820 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-26 22:43:01,820 INFO L138 SettingsManager]: * Use SBE=true [2019-12-26 22:43:01,820 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-26 22:43:01,820 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-26 22:43:01,820 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-26 22:43:01,821 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-26 22:43:01,821 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-26 22:43:01,822 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-26 22:43:01,822 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-26 22:43:01,822 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-26 22:43:01,823 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-26 22:43:01,823 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-26 22:43:01,823 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-26 22:43:01,823 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-26 22:43:01,824 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-26 22:43:01,824 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-26 22:43:01,824 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-26 22:43:01,825 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-26 22:43:01,825 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-26 22:43:01,825 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-26 22:43:01,825 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-26 22:43:01,825 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-26 22:43:01,825 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-26 22:43:01,826 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-26 22:43:01,826 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-26 22:43:01,826 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-26 22:43:01,826 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-26 22:43:02,134 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-26 22:43:02,153 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-26 22:43:02,157 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-26 22:43:02,158 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-26 22:43:02,159 INFO L275 PluginConnector]: CDTParser initialized [2019-12-26 22:43:02,160 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix046_pso.opt.i [2019-12-26 22:43:02,233 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1affc99ee/32d1ab7939044065808f932fae444950/FLAGeb8347ac3 [2019-12-26 22:43:02,855 INFO L306 CDTParser]: Found 1 translation units. [2019-12-26 22:43:02,856 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix046_pso.opt.i [2019-12-26 22:43:02,877 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1affc99ee/32d1ab7939044065808f932fae444950/FLAGeb8347ac3 [2019-12-26 22:43:03,084 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1affc99ee/32d1ab7939044065808f932fae444950 [2019-12-26 22:43:03,092 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-26 22:43:03,094 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-26 22:43:03,095 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-26 22:43:03,095 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-26 22:43:03,099 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-26 22:43:03,100 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 10:43:03" (1/1) ... [2019-12-26 22:43:03,103 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26c7cd9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:43:03, skipping insertion in model container [2019-12-26 22:43:03,103 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 10:43:03" (1/1) ... [2019-12-26 22:43:03,111 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-26 22:43:03,166 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-26 22:43:03,762 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 22:43:03,774 INFO L203 MainTranslator]: Completed pre-run [2019-12-26 22:43:03,858 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 22:43:03,937 INFO L208 MainTranslator]: Completed translation [2019-12-26 22:43:03,938 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:43:03 WrapperNode [2019-12-26 22:43:03,938 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-26 22:43:03,939 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-26 22:43:03,939 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-26 22:43:03,939 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-26 22:43:03,948 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:43:03" (1/1) ... [2019-12-26 22:43:03,969 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:43:03" (1/1) ... [2019-12-26 22:43:04,016 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-26 22:43:04,017 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-26 22:43:04,017 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-26 22:43:04,017 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-26 22:43:04,028 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:43:03" (1/1) ... [2019-12-26 22:43:04,028 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:43:03" (1/1) ... [2019-12-26 22:43:04,034 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:43:03" (1/1) ... [2019-12-26 22:43:04,034 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:43:03" (1/1) ... [2019-12-26 22:43:04,045 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:43:03" (1/1) ... [2019-12-26 22:43:04,049 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:43:03" (1/1) ... [2019-12-26 22:43:04,053 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:43:03" (1/1) ... [2019-12-26 22:43:04,058 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-26 22:43:04,058 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-26 22:43:04,059 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-26 22:43:04,059 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-26 22:43:04,060 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:43:03" (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-26 22:43:04,137 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-26 22:43:04,137 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-26 22:43:04,138 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-26 22:43:04,138 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-26 22:43:04,138 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-26 22:43:04,139 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-26 22:43:04,139 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-26 22:43:04,140 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-26 22:43:04,140 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-26 22:43:04,141 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-26 22:43:04,141 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-26 22:43:04,142 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-26 22:43:04,142 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-26 22:43:04,142 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-26 22:43:04,142 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-26 22:43:04,144 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-26 22:43:04,905 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-26 22:43:04,905 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-26 22:43:04,906 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 10:43:04 BoogieIcfgContainer [2019-12-26 22:43:04,907 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-26 22:43:04,908 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-26 22:43:04,909 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-26 22:43:04,912 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-26 22:43:04,912 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.12 10:43:03" (1/3) ... [2019-12-26 22:43:04,913 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78df1d85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 10:43:04, skipping insertion in model container [2019-12-26 22:43:04,914 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:43:03" (2/3) ... [2019-12-26 22:43:04,914 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78df1d85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 10:43:04, skipping insertion in model container [2019-12-26 22:43:04,914 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 10:43:04" (3/3) ... [2019-12-26 22:43:04,916 INFO L109 eAbstractionObserver]: Analyzing ICFG mix046_pso.opt.i [2019-12-26 22:43:04,927 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-26 22:43:04,928 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-26 22:43:04,936 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-26 22:43:04,937 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-26 22:43:04,977 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:43:04,978 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:43:04,978 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:43:04,978 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:43:04,979 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:43:04,979 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:43:04,980 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:43:04,980 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:43:04,980 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:43:04,980 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:43:04,981 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:43:04,981 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:43:04,982 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:43:04,982 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:43:04,982 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:43:04,982 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:43:04,982 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:43:04,983 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:43:04,983 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:43:04,983 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:43:04,983 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:43:04,984 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:43:04,984 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:43:04,984 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:43:04,985 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:43:04,985 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:43:04,985 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:43:04,985 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:43:04,986 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:43:04,986 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:43:04,986 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:43:04,986 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:43:04,987 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:43:04,987 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:43:04,987 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:43:04,987 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:43:04,988 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:43:04,988 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:43:04,988 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:43:04,989 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:43:04,989 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:43:04,989 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:43:04,990 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:43:04,990 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:43:04,990 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:43:04,991 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:43:04,991 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:43:04,991 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:43:04,992 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:43:04,992 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:43:04,992 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:43:04,993 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:43:04,993 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:43:04,993 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:43:04,993 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:43:04,993 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:43:04,994 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:43:04,994 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:43:04,994 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:43:04,994 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:43:04,995 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:43:04,995 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:43:04,995 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:43:04,995 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:43:04,996 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:43:04,996 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:43:04,996 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:43:04,996 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:43:04,997 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:43:04,997 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:43:04,997 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:43:04,997 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:43:05,016 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:43:05,017 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:43:05,017 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:43:05,017 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:43:05,021 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:43:05,021 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:43:05,022 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:43:05,023 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:43:05,026 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:43:05,026 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:43:05,027 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:43:05,028 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:43:05,030 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:43:05,030 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:43:05,031 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:43:05,031 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:43:05,031 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:43:05,031 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:43:05,031 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:43:05,032 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:43:05,032 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:43:05,032 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:43:05,034 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:43:05,034 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:43:05,034 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:43:05,035 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:43:05,035 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:43:05,035 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:43:05,035 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:43:05,036 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:43:05,036 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:43:05,036 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:43:05,036 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:43:05,036 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:43:05,053 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-26 22:43:05,074 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-26 22:43:05,074 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-26 22:43:05,074 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-26 22:43:05,075 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-26 22:43:05,075 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-26 22:43:05,075 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-26 22:43:05,075 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-26 22:43:05,075 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-26 22:43:05,093 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 181 places, 209 transitions [2019-12-26 22:43:05,095 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 181 places, 209 transitions [2019-12-26 22:43:05,200 INFO L132 PetriNetUnfolder]: 41/205 cut-off events. [2019-12-26 22:43:05,200 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 22:43:05,216 INFO L76 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 205 events. 41/205 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 263 event pairs. 0/162 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-26 22:43:05,237 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 181 places, 209 transitions [2019-12-26 22:43:05,290 INFO L132 PetriNetUnfolder]: 41/205 cut-off events. [2019-12-26 22:43:05,291 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 22:43:05,297 INFO L76 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 205 events. 41/205 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 263 event pairs. 0/162 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-26 22:43:05,313 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12668 [2019-12-26 22:43:05,314 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-26 22:43:10,434 WARN L192 SmtUtils]: Spent 326.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 97 [2019-12-26 22:43:10,575 WARN L192 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2019-12-26 22:43:10,600 INFO L206 etLargeBlockEncoding]: Checked pairs total: 52490 [2019-12-26 22:43:10,600 INFO L214 etLargeBlockEncoding]: Total number of compositions: 119 [2019-12-26 22:43:10,604 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 92 places, 100 transitions [2019-12-26 22:43:12,931 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 37086 states. [2019-12-26 22:43:12,933 INFO L276 IsEmpty]: Start isEmpty. Operand 37086 states. [2019-12-26 22:43:12,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-26 22:43:12,940 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:43:12,941 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:43:12,941 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:43:12,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:43:12,946 INFO L82 PathProgramCache]: Analyzing trace with hash -1862617909, now seen corresponding path program 1 times [2019-12-26 22:43:12,953 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:43:12,954 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919032855] [2019-12-26 22:43:12,954 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:43:13,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:43:13,259 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-26 22:43:13,260 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919032855] [2019-12-26 22:43:13,260 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:43:13,261 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-26 22:43:13,261 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809265663] [2019-12-26 22:43:13,265 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:43:13,266 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:43:13,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:43:13,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:43:13,280 INFO L87 Difference]: Start difference. First operand 37086 states. Second operand 3 states. [2019-12-26 22:43:14,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:43:14,753 INFO L93 Difference]: Finished difference Result 36830 states and 157144 transitions. [2019-12-26 22:43:14,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:43:14,754 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-26 22:43:14,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:43:15,070 INFO L225 Difference]: With dead ends: 36830 [2019-12-26 22:43:15,070 INFO L226 Difference]: Without dead ends: 36102 [2019-12-26 22:43:15,072 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-26 22:43:15,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36102 states. [2019-12-26 22:43:16,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36102 to 36102. [2019-12-26 22:43:16,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36102 states. [2019-12-26 22:43:16,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36102 states to 36102 states and 154176 transitions. [2019-12-26 22:43:16,962 INFO L78 Accepts]: Start accepts. Automaton has 36102 states and 154176 transitions. Word has length 9 [2019-12-26 22:43:16,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:43:16,963 INFO L462 AbstractCegarLoop]: Abstraction has 36102 states and 154176 transitions. [2019-12-26 22:43:16,963 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:43:16,963 INFO L276 IsEmpty]: Start isEmpty. Operand 36102 states and 154176 transitions. [2019-12-26 22:43:16,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-26 22:43:16,976 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:43:16,976 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:43:16,976 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:43:16,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:43:16,977 INFO L82 PathProgramCache]: Analyzing trace with hash 290643941, now seen corresponding path program 1 times [2019-12-26 22:43:16,977 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:43:16,977 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631152617] [2019-12-26 22:43:16,978 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:43:17,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:43:17,116 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-26 22:43:17,116 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631152617] [2019-12-26 22:43:17,118 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:43:17,118 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 22:43:17,119 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190342097] [2019-12-26 22:43:17,120 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 22:43:17,121 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:43:17,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 22:43:17,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 22:43:17,121 INFO L87 Difference]: Start difference. First operand 36102 states and 154176 transitions. Second operand 4 states. [2019-12-26 22:43:19,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:43:19,360 INFO L93 Difference]: Finished difference Result 56134 states and 231868 transitions. [2019-12-26 22:43:19,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 22:43:19,360 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-26 22:43:19,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:43:19,786 INFO L225 Difference]: With dead ends: 56134 [2019-12-26 22:43:19,786 INFO L226 Difference]: Without dead ends: 56106 [2019-12-26 22:43:19,787 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-26 22:43:20,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56106 states. [2019-12-26 22:43:21,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56106 to 51222. [2019-12-26 22:43:21,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51222 states. [2019-12-26 22:43:22,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51222 states to 51222 states and 213628 transitions. [2019-12-26 22:43:22,052 INFO L78 Accepts]: Start accepts. Automaton has 51222 states and 213628 transitions. Word has length 15 [2019-12-26 22:43:22,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:43:22,052 INFO L462 AbstractCegarLoop]: Abstraction has 51222 states and 213628 transitions. [2019-12-26 22:43:22,053 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 22:43:22,053 INFO L276 IsEmpty]: Start isEmpty. Operand 51222 states and 213628 transitions. [2019-12-26 22:43:22,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-26 22:43:22,056 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:43:22,056 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:43:22,056 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:43:22,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:43:22,057 INFO L82 PathProgramCache]: Analyzing trace with hash -497322091, now seen corresponding path program 1 times [2019-12-26 22:43:22,057 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:43:22,057 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860048192] [2019-12-26 22:43:22,057 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:43:22,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:43:22,110 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-26 22:43:22,111 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860048192] [2019-12-26 22:43:22,111 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:43:22,111 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 22:43:22,112 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117824650] [2019-12-26 22:43:22,112 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:43:22,112 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:43:22,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:43:22,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:43:22,117 INFO L87 Difference]: Start difference. First operand 51222 states and 213628 transitions. Second operand 3 states. [2019-12-26 22:43:22,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:43:22,341 INFO L93 Difference]: Finished difference Result 40168 states and 154828 transitions. [2019-12-26 22:43:22,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:43:22,342 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-12-26 22:43:22,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:43:22,465 INFO L225 Difference]: With dead ends: 40168 [2019-12-26 22:43:22,465 INFO L226 Difference]: Without dead ends: 40168 [2019-12-26 22:43:22,466 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-26 22:43:24,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40168 states. [2019-12-26 22:43:25,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40168 to 40168. [2019-12-26 22:43:25,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40168 states. [2019-12-26 22:43:25,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40168 states to 40168 states and 154828 transitions. [2019-12-26 22:43:25,810 INFO L78 Accepts]: Start accepts. Automaton has 40168 states and 154828 transitions. Word has length 15 [2019-12-26 22:43:25,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:43:25,810 INFO L462 AbstractCegarLoop]: Abstraction has 40168 states and 154828 transitions. [2019-12-26 22:43:25,810 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:43:25,811 INFO L276 IsEmpty]: Start isEmpty. Operand 40168 states and 154828 transitions. [2019-12-26 22:43:25,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-26 22:43:25,813 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:43:25,814 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:43:25,814 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:43:25,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:43:25,814 INFO L82 PathProgramCache]: Analyzing trace with hash -13987850, now seen corresponding path program 1 times [2019-12-26 22:43:25,815 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:43:25,815 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744365389] [2019-12-26 22:43:25,815 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:43:25,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:43:25,870 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-26 22:43:25,871 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744365389] [2019-12-26 22:43:25,871 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:43:25,871 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 22:43:25,872 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587341040] [2019-12-26 22:43:25,872 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 22:43:25,872 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:43:25,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 22:43:25,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-26 22:43:25,873 INFO L87 Difference]: Start difference. First operand 40168 states and 154828 transitions. Second operand 4 states. [2019-12-26 22:43:25,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:43:25,948 INFO L93 Difference]: Finished difference Result 16680 states and 53353 transitions. [2019-12-26 22:43:25,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 22:43:25,949 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-26 22:43:25,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:43:25,983 INFO L225 Difference]: With dead ends: 16680 [2019-12-26 22:43:25,984 INFO L226 Difference]: Without dead ends: 16680 [2019-12-26 22:43:25,984 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-26 22:43:26,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16680 states. [2019-12-26 22:43:26,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16680 to 16680. [2019-12-26 22:43:26,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16680 states. [2019-12-26 22:43:26,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16680 states to 16680 states and 53353 transitions. [2019-12-26 22:43:26,314 INFO L78 Accepts]: Start accepts. Automaton has 16680 states and 53353 transitions. Word has length 16 [2019-12-26 22:43:26,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:43:26,314 INFO L462 AbstractCegarLoop]: Abstraction has 16680 states and 53353 transitions. [2019-12-26 22:43:26,314 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 22:43:26,314 INFO L276 IsEmpty]: Start isEmpty. Operand 16680 states and 53353 transitions. [2019-12-26 22:43:26,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-26 22:43:26,316 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:43:26,317 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:43:26,317 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:43:26,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:43:26,317 INFO L82 PathProgramCache]: Analyzing trace with hash 1397943155, now seen corresponding path program 1 times [2019-12-26 22:43:26,317 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:43:26,318 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032641782] [2019-12-26 22:43:26,318 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:43:26,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:43:26,373 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-26 22:43:26,374 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032641782] [2019-12-26 22:43:26,374 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:43:26,374 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 22:43:26,374 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183304556] [2019-12-26 22:43:26,375 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 22:43:26,375 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:43:26,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 22:43:26,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-26 22:43:26,376 INFO L87 Difference]: Start difference. First operand 16680 states and 53353 transitions. Second operand 5 states. [2019-12-26 22:43:26,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:43:26,415 INFO L93 Difference]: Finished difference Result 2823 states and 7312 transitions. [2019-12-26 22:43:26,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 22:43:26,416 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-12-26 22:43:26,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:43:26,420 INFO L225 Difference]: With dead ends: 2823 [2019-12-26 22:43:26,420 INFO L226 Difference]: Without dead ends: 2823 [2019-12-26 22:43:26,421 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-26 22:43:26,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2823 states. [2019-12-26 22:43:26,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2823 to 2823. [2019-12-26 22:43:26,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2823 states. [2019-12-26 22:43:26,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2823 states to 2823 states and 7312 transitions. [2019-12-26 22:43:26,450 INFO L78 Accepts]: Start accepts. Automaton has 2823 states and 7312 transitions. Word has length 17 [2019-12-26 22:43:26,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:43:26,450 INFO L462 AbstractCegarLoop]: Abstraction has 2823 states and 7312 transitions. [2019-12-26 22:43:26,450 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 22:43:26,450 INFO L276 IsEmpty]: Start isEmpty. Operand 2823 states and 7312 transitions. [2019-12-26 22:43:26,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-26 22:43:26,454 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:43:26,454 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:43:26,454 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:43:26,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:43:26,455 INFO L82 PathProgramCache]: Analyzing trace with hash 34035109, now seen corresponding path program 1 times [2019-12-26 22:43:26,455 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:43:26,455 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130112522] [2019-12-26 22:43:26,455 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:43:26,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:43:26,531 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-26 22:43:26,532 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130112522] [2019-12-26 22:43:26,532 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:43:26,532 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 22:43:26,533 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010864357] [2019-12-26 22:43:26,533 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 22:43:26,533 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:43:26,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 22:43:26,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-26 22:43:26,534 INFO L87 Difference]: Start difference. First operand 2823 states and 7312 transitions. Second operand 6 states. [2019-12-26 22:43:26,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:43:26,583 INFO L93 Difference]: Finished difference Result 1357 states and 3889 transitions. [2019-12-26 22:43:26,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-26 22:43:26,583 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2019-12-26 22:43:26,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:43:26,586 INFO L225 Difference]: With dead ends: 1357 [2019-12-26 22:43:26,587 INFO L226 Difference]: Without dead ends: 1357 [2019-12-26 22:43:26,587 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-26 22:43:26,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1357 states. [2019-12-26 22:43:26,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1357 to 1217. [2019-12-26 22:43:26,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1217 states. [2019-12-26 22:43:26,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1217 states to 1217 states and 3489 transitions. [2019-12-26 22:43:26,605 INFO L78 Accepts]: Start accepts. Automaton has 1217 states and 3489 transitions. Word has length 29 [2019-12-26 22:43:26,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:43:26,606 INFO L462 AbstractCegarLoop]: Abstraction has 1217 states and 3489 transitions. [2019-12-26 22:43:26,606 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 22:43:26,606 INFO L276 IsEmpty]: Start isEmpty. Operand 1217 states and 3489 transitions. [2019-12-26 22:43:26,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-26 22:43:26,609 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:43:26,609 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] [2019-12-26 22:43:26,609 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:43:26,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:43:26,610 INFO L82 PathProgramCache]: Analyzing trace with hash 2028178460, now seen corresponding path program 1 times [2019-12-26 22:43:26,610 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:43:26,610 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466676728] [2019-12-26 22:43:26,611 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:43:26,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:43:26,699 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-26 22:43:26,699 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466676728] [2019-12-26 22:43:26,699 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:43:26,699 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 22:43:26,700 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598327110] [2019-12-26 22:43:26,701 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:43:26,701 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:43:26,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:43:26,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:43:26,702 INFO L87 Difference]: Start difference. First operand 1217 states and 3489 transitions. Second operand 3 states. [2019-12-26 22:43:26,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:43:26,753 INFO L93 Difference]: Finished difference Result 1228 states and 3505 transitions. [2019-12-26 22:43:26,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:43:26,753 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-12-26 22:43:26,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:43:26,756 INFO L225 Difference]: With dead ends: 1228 [2019-12-26 22:43:26,756 INFO L226 Difference]: Without dead ends: 1228 [2019-12-26 22:43:26,757 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-26 22:43:26,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1228 states. [2019-12-26 22:43:26,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1228 to 1222. [2019-12-26 22:43:26,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1222 states. [2019-12-26 22:43:26,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1222 states to 1222 states and 3498 transitions. [2019-12-26 22:43:26,775 INFO L78 Accepts]: Start accepts. Automaton has 1222 states and 3498 transitions. Word has length 58 [2019-12-26 22:43:26,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:43:26,776 INFO L462 AbstractCegarLoop]: Abstraction has 1222 states and 3498 transitions. [2019-12-26 22:43:26,776 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:43:26,776 INFO L276 IsEmpty]: Start isEmpty. Operand 1222 states and 3498 transitions. [2019-12-26 22:43:26,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-26 22:43:26,780 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:43:26,780 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] [2019-12-26 22:43:26,781 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:43:26,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:43:26,781 INFO L82 PathProgramCache]: Analyzing trace with hash 1114375606, now seen corresponding path program 1 times [2019-12-26 22:43:26,781 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:43:26,782 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910531032] [2019-12-26 22:43:26,782 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:43:26,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:43:26,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:43:26,875 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910531032] [2019-12-26 22:43:26,875 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:43:26,875 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 22:43:26,876 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903948403] [2019-12-26 22:43:26,876 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:43:26,876 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:43:26,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:43:26,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:43:26,877 INFO L87 Difference]: Start difference. First operand 1222 states and 3498 transitions. Second operand 3 states. [2019-12-26 22:43:26,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:43:26,933 INFO L93 Difference]: Finished difference Result 1228 states and 3497 transitions. [2019-12-26 22:43:26,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:43:26,934 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-12-26 22:43:26,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:43:26,936 INFO L225 Difference]: With dead ends: 1228 [2019-12-26 22:43:26,937 INFO L226 Difference]: Without dead ends: 1228 [2019-12-26 22:43:26,937 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-26 22:43:26,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1228 states. [2019-12-26 22:43:26,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1228 to 1223. [2019-12-26 22:43:26,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1223 states. [2019-12-26 22:43:26,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1223 states to 1223 states and 3492 transitions. [2019-12-26 22:43:26,958 INFO L78 Accepts]: Start accepts. Automaton has 1223 states and 3492 transitions. Word has length 58 [2019-12-26 22:43:26,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:43:26,958 INFO L462 AbstractCegarLoop]: Abstraction has 1223 states and 3492 transitions. [2019-12-26 22:43:26,958 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:43:26,959 INFO L276 IsEmpty]: Start isEmpty. Operand 1223 states and 3492 transitions. [2019-12-26 22:43:26,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-26 22:43:26,964 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:43:26,964 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] [2019-12-26 22:43:26,964 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:43:26,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:43:26,965 INFO L82 PathProgramCache]: Analyzing trace with hash 1114895507, now seen corresponding path program 1 times [2019-12-26 22:43:26,965 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:43:26,965 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677891564] [2019-12-26 22:43:26,965 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:43:26,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:43:27,104 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-26 22:43:27,105 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677891564] [2019-12-26 22:43:27,105 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:43:27,105 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 22:43:27,105 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593367519] [2019-12-26 22:43:27,106 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 22:43:27,106 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:43:27,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 22:43:27,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 22:43:27,107 INFO L87 Difference]: Start difference. First operand 1223 states and 3492 transitions. Second operand 5 states. [2019-12-26 22:43:27,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:43:27,596 INFO L93 Difference]: Finished difference Result 1764 states and 5014 transitions. [2019-12-26 22:43:27,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-26 22:43:27,597 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 58 [2019-12-26 22:43:27,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:43:27,599 INFO L225 Difference]: With dead ends: 1764 [2019-12-26 22:43:27,600 INFO L226 Difference]: Without dead ends: 1764 [2019-12-26 22:43:27,600 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-26 22:43:27,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1764 states. [2019-12-26 22:43:27,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1764 to 1419. [2019-12-26 22:43:27,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1419 states. [2019-12-26 22:43:27,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1419 states to 1419 states and 4068 transitions. [2019-12-26 22:43:27,632 INFO L78 Accepts]: Start accepts. Automaton has 1419 states and 4068 transitions. Word has length 58 [2019-12-26 22:43:27,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:43:27,632 INFO L462 AbstractCegarLoop]: Abstraction has 1419 states and 4068 transitions. [2019-12-26 22:43:27,632 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 22:43:27,632 INFO L276 IsEmpty]: Start isEmpty. Operand 1419 states and 4068 transitions. [2019-12-26 22:43:27,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-26 22:43:27,637 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:43:27,637 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] [2019-12-26 22:43:27,637 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:43:27,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:43:27,638 INFO L82 PathProgramCache]: Analyzing trace with hash -217131029, now seen corresponding path program 2 times [2019-12-26 22:43:27,638 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:43:27,638 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646927699] [2019-12-26 22:43:27,638 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:43:27,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:43:27,743 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-26 22:43:27,744 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646927699] [2019-12-26 22:43:27,744 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:43:27,744 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 22:43:27,745 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200992496] [2019-12-26 22:43:27,745 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 22:43:27,745 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:43:27,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 22:43:27,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-26 22:43:27,746 INFO L87 Difference]: Start difference. First operand 1419 states and 4068 transitions. Second operand 6 states. [2019-12-26 22:43:28,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:43:28,078 INFO L93 Difference]: Finished difference Result 2370 states and 6731 transitions. [2019-12-26 22:43:28,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-26 22:43:28,079 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 58 [2019-12-26 22:43:28,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:43:28,083 INFO L225 Difference]: With dead ends: 2370 [2019-12-26 22:43:28,083 INFO L226 Difference]: Without dead ends: 2370 [2019-12-26 22:43:28,084 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-26 22:43:28,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2370 states. [2019-12-26 22:43:28,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2370 to 1503. [2019-12-26 22:43:28,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1503 states. [2019-12-26 22:43:28,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1503 states to 1503 states and 4316 transitions. [2019-12-26 22:43:28,113 INFO L78 Accepts]: Start accepts. Automaton has 1503 states and 4316 transitions. Word has length 58 [2019-12-26 22:43:28,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:43:28,114 INFO L462 AbstractCegarLoop]: Abstraction has 1503 states and 4316 transitions. [2019-12-26 22:43:28,114 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 22:43:28,114 INFO L276 IsEmpty]: Start isEmpty. Operand 1503 states and 4316 transitions. [2019-12-26 22:43:28,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-26 22:43:28,119 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:43:28,119 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] [2019-12-26 22:43:28,119 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:43:28,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:43:28,119 INFO L82 PathProgramCache]: Analyzing trace with hash 1417485459, now seen corresponding path program 3 times [2019-12-26 22:43:28,120 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:43:28,120 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751920856] [2019-12-26 22:43:28,120 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:43:28,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:43:28,308 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-26 22:43:28,308 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751920856] [2019-12-26 22:43:28,308 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:43:28,308 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 22:43:28,309 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649168557] [2019-12-26 22:43:28,309 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 22:43:28,309 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:43:28,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 22:43:28,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-26 22:43:28,310 INFO L87 Difference]: Start difference. First operand 1503 states and 4316 transitions. Second operand 6 states. [2019-12-26 22:43:28,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:43:28,660 INFO L93 Difference]: Finished difference Result 2377 states and 6752 transitions. [2019-12-26 22:43:28,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-26 22:43:28,660 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 58 [2019-12-26 22:43:28,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:43:28,664 INFO L225 Difference]: With dead ends: 2377 [2019-12-26 22:43:28,665 INFO L226 Difference]: Without dead ends: 2377 [2019-12-26 22:43:28,665 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 8 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2019-12-26 22:43:28,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2377 states. [2019-12-26 22:43:28,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2377 to 1691. [2019-12-26 22:43:28,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1691 states. [2019-12-26 22:43:28,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1691 states to 1691 states and 4860 transitions. [2019-12-26 22:43:28,695 INFO L78 Accepts]: Start accepts. Automaton has 1691 states and 4860 transitions. Word has length 58 [2019-12-26 22:43:28,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:43:28,696 INFO L462 AbstractCegarLoop]: Abstraction has 1691 states and 4860 transitions. [2019-12-26 22:43:28,696 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 22:43:28,696 INFO L276 IsEmpty]: Start isEmpty. Operand 1691 states and 4860 transitions. [2019-12-26 22:43:28,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-26 22:43:28,700 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:43:28,701 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] [2019-12-26 22:43:28,701 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:43:28,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:43:28,701 INFO L82 PathProgramCache]: Analyzing trace with hash -687244225, now seen corresponding path program 4 times [2019-12-26 22:43:28,701 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:43:28,702 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428538589] [2019-12-26 22:43:28,702 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:43:28,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:43:28,808 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-26 22:43:28,809 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428538589] [2019-12-26 22:43:28,809 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:43:28,809 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-26 22:43:28,810 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175153400] [2019-12-26 22:43:28,810 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 22:43:28,810 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:43:28,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 22:43:28,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-26 22:43:28,811 INFO L87 Difference]: Start difference. First operand 1691 states and 4860 transitions. Second operand 7 states. [2019-12-26 22:43:29,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:43:29,230 INFO L93 Difference]: Finished difference Result 2634 states and 7483 transitions. [2019-12-26 22:43:29,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-26 22:43:29,230 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 58 [2019-12-26 22:43:29,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:43:29,235 INFO L225 Difference]: With dead ends: 2634 [2019-12-26 22:43:29,235 INFO L226 Difference]: Without dead ends: 2634 [2019-12-26 22:43:29,235 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-12-26 22:43:29,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2634 states. [2019-12-26 22:43:29,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2634 to 1607. [2019-12-26 22:43:29,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1607 states. [2019-12-26 22:43:29,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1607 states to 1607 states and 4612 transitions. [2019-12-26 22:43:29,271 INFO L78 Accepts]: Start accepts. Automaton has 1607 states and 4612 transitions. Word has length 58 [2019-12-26 22:43:29,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:43:29,271 INFO L462 AbstractCegarLoop]: Abstraction has 1607 states and 4612 transitions. [2019-12-26 22:43:29,271 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 22:43:29,271 INFO L276 IsEmpty]: Start isEmpty. Operand 1607 states and 4612 transitions. [2019-12-26 22:43:29,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-26 22:43:29,276 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:43:29,276 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] [2019-12-26 22:43:29,276 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:43:29,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:43:29,276 INFO L82 PathProgramCache]: Analyzing trace with hash 658273713, now seen corresponding path program 1 times [2019-12-26 22:43:29,277 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:43:29,277 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977597462] [2019-12-26 22:43:29,277 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:43:29,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:43:29,468 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-26 22:43:29,468 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977597462] [2019-12-26 22:43:29,468 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:43:29,468 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 22:43:29,469 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555564138] [2019-12-26 22:43:29,469 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 22:43:29,469 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:43:29,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 22:43:29,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-26 22:43:29,470 INFO L87 Difference]: Start difference. First operand 1607 states and 4612 transitions. Second operand 7 states. [2019-12-26 22:43:29,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:43:29,634 INFO L93 Difference]: Finished difference Result 3238 states and 8703 transitions. [2019-12-26 22:43:29,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-26 22:43:29,634 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 59 [2019-12-26 22:43:29,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:43:29,639 INFO L225 Difference]: With dead ends: 3238 [2019-12-26 22:43:29,639 INFO L226 Difference]: Without dead ends: 2335 [2019-12-26 22:43:29,641 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-12-26 22:43:29,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2335 states. [2019-12-26 22:43:29,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2335 to 1477. [2019-12-26 22:43:29,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1477 states. [2019-12-26 22:43:29,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1477 states to 1477 states and 4172 transitions. [2019-12-26 22:43:29,673 INFO L78 Accepts]: Start accepts. Automaton has 1477 states and 4172 transitions. Word has length 59 [2019-12-26 22:43:29,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:43:29,674 INFO L462 AbstractCegarLoop]: Abstraction has 1477 states and 4172 transitions. [2019-12-26 22:43:29,674 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 22:43:29,674 INFO L276 IsEmpty]: Start isEmpty. Operand 1477 states and 4172 transitions. [2019-12-26 22:43:29,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-26 22:43:29,678 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:43:29,679 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] [2019-12-26 22:43:29,679 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:43:29,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:43:29,679 INFO L82 PathProgramCache]: Analyzing trace with hash 726022051, now seen corresponding path program 2 times [2019-12-26 22:43:29,680 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:43:29,680 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155503246] [2019-12-26 22:43:29,681 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:43:29,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:43:29,760 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-26 22:43:29,761 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155503246] [2019-12-26 22:43:29,761 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:43:29,761 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 22:43:29,762 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276735374] [2019-12-26 22:43:29,762 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:43:29,762 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:43:29,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:43:29,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:43:29,763 INFO L87 Difference]: Start difference. First operand 1477 states and 4172 transitions. Second operand 3 states. [2019-12-26 22:43:29,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:43:29,807 INFO L93 Difference]: Finished difference Result 1476 states and 4170 transitions. [2019-12-26 22:43:29,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:43:29,808 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-12-26 22:43:29,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:43:29,811 INFO L225 Difference]: With dead ends: 1476 [2019-12-26 22:43:29,811 INFO L226 Difference]: Without dead ends: 1476 [2019-12-26 22:43:29,813 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-26 22:43:29,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1476 states. [2019-12-26 22:43:29,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1476 to 951. [2019-12-26 22:43:29,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 951 states. [2019-12-26 22:43:29,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 951 states to 951 states and 2688 transitions. [2019-12-26 22:43:29,832 INFO L78 Accepts]: Start accepts. Automaton has 951 states and 2688 transitions. Word has length 59 [2019-12-26 22:43:29,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:43:29,833 INFO L462 AbstractCegarLoop]: Abstraction has 951 states and 2688 transitions. [2019-12-26 22:43:29,833 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:43:29,833 INFO L276 IsEmpty]: Start isEmpty. Operand 951 states and 2688 transitions. [2019-12-26 22:43:29,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-26 22:43:29,835 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:43:29,836 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] [2019-12-26 22:43:29,836 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:43:29,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:43:29,836 INFO L82 PathProgramCache]: Analyzing trace with hash 1147587362, now seen corresponding path program 1 times [2019-12-26 22:43:29,836 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:43:29,837 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789281804] [2019-12-26 22:43:29,837 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:43:29,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:43:29,942 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-26 22:43:29,943 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789281804] [2019-12-26 22:43:29,943 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:43:29,943 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 22:43:29,943 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619157721] [2019-12-26 22:43:29,944 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 22:43:29,944 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:43:29,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 22:43:29,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-26 22:43:29,944 INFO L87 Difference]: Start difference. First operand 951 states and 2688 transitions. Second operand 6 states. [2019-12-26 22:43:30,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:43:30,003 INFO L93 Difference]: Finished difference Result 1190 states and 3130 transitions. [2019-12-26 22:43:30,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-26 22:43:30,003 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 59 [2019-12-26 22:43:30,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:43:30,005 INFO L225 Difference]: With dead ends: 1190 [2019-12-26 22:43:30,005 INFO L226 Difference]: Without dead ends: 694 [2019-12-26 22:43:30,006 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-26 22:43:30,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 694 states. [2019-12-26 22:43:30,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 694 to 694. [2019-12-26 22:43:30,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 694 states. [2019-12-26 22:43:30,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 694 states to 694 states and 1729 transitions. [2019-12-26 22:43:30,015 INFO L78 Accepts]: Start accepts. Automaton has 694 states and 1729 transitions. Word has length 59 [2019-12-26 22:43:30,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:43:30,015 INFO L462 AbstractCegarLoop]: Abstraction has 694 states and 1729 transitions. [2019-12-26 22:43:30,015 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 22:43:30,015 INFO L276 IsEmpty]: Start isEmpty. Operand 694 states and 1729 transitions. [2019-12-26 22:43:30,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-26 22:43:30,017 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:43:30,017 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] [2019-12-26 22:43:30,017 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:43:30,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:43:30,018 INFO L82 PathProgramCache]: Analyzing trace with hash 83225480, now seen corresponding path program 2 times [2019-12-26 22:43:30,018 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:43:30,018 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646248240] [2019-12-26 22:43:30,018 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:43:30,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:43:30,145 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-26 22:43:30,145 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646248240] [2019-12-26 22:43:30,148 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:43:30,148 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 22:43:30,148 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990807515] [2019-12-26 22:43:30,149 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 22:43:30,149 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:43:30,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 22:43:30,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-26 22:43:30,149 INFO L87 Difference]: Start difference. First operand 694 states and 1729 transitions. Second operand 6 states. [2019-12-26 22:43:30,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:43:30,588 INFO L93 Difference]: Finished difference Result 1065 states and 2579 transitions. [2019-12-26 22:43:30,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-26 22:43:30,589 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 59 [2019-12-26 22:43:30,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:43:30,590 INFO L225 Difference]: With dead ends: 1065 [2019-12-26 22:43:30,590 INFO L226 Difference]: Without dead ends: 330 [2019-12-26 22:43:30,591 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-26 22:43:30,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2019-12-26 22:43:30,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 290. [2019-12-26 22:43:30,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 290 states. [2019-12-26 22:43:30,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 531 transitions. [2019-12-26 22:43:30,597 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 531 transitions. Word has length 59 [2019-12-26 22:43:30,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:43:30,598 INFO L462 AbstractCegarLoop]: Abstraction has 290 states and 531 transitions. [2019-12-26 22:43:30,598 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 22:43:30,598 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 531 transitions. [2019-12-26 22:43:30,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-26 22:43:30,599 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:43:30,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] [2019-12-26 22:43:30,600 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:43:30,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:43:30,600 INFO L82 PathProgramCache]: Analyzing trace with hash 211375676, now seen corresponding path program 3 times [2019-12-26 22:43:30,600 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:43:30,600 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550733740] [2019-12-26 22:43:30,601 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:43:30,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:43:30,701 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-26 22:43:30,701 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550733740] [2019-12-26 22:43:30,701 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:43:30,701 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 22:43:30,702 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558196157] [2019-12-26 22:43:30,702 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:43:30,702 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:43:30,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:43:30,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:43:30,703 INFO L87 Difference]: Start difference. First operand 290 states and 531 transitions. Second operand 3 states. [2019-12-26 22:43:30,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:43:30,715 INFO L93 Difference]: Finished difference Result 269 states and 474 transitions. [2019-12-26 22:43:30,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:43:30,716 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-12-26 22:43:30,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:43:30,717 INFO L225 Difference]: With dead ends: 269 [2019-12-26 22:43:30,717 INFO L226 Difference]: Without dead ends: 269 [2019-12-26 22:43:30,717 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-26 22:43:30,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2019-12-26 22:43:30,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 237. [2019-12-26 22:43:30,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2019-12-26 22:43:30,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 414 transitions. [2019-12-26 22:43:30,722 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 414 transitions. Word has length 59 [2019-12-26 22:43:30,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:43:30,723 INFO L462 AbstractCegarLoop]: Abstraction has 237 states and 414 transitions. [2019-12-26 22:43:30,723 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:43:30,723 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 414 transitions. [2019-12-26 22:43:30,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-26 22:43:30,724 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:43:30,725 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] [2019-12-26 22:43:30,725 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:43:30,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:43:30,725 INFO L82 PathProgramCache]: Analyzing trace with hash -1893006908, now seen corresponding path program 1 times [2019-12-26 22:43:30,726 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:43:30,726 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187239625] [2019-12-26 22:43:30,726 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:43:30,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:43:31,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:43:31,035 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187239625] [2019-12-26 22:43:31,038 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:43:31,038 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-26 22:43:31,041 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870589330] [2019-12-26 22:43:31,041 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-26 22:43:31,041 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:43:31,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-26 22:43:31,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2019-12-26 22:43:31,042 INFO L87 Difference]: Start difference. First operand 237 states and 414 transitions. Second operand 14 states. [2019-12-26 22:43:31,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:43:31,501 INFO L93 Difference]: Finished difference Result 395 states and 671 transitions. [2019-12-26 22:43:31,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-26 22:43:31,501 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 60 [2019-12-26 22:43:31,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:43:31,502 INFO L225 Difference]: With dead ends: 395 [2019-12-26 22:43:31,502 INFO L226 Difference]: Without dead ends: 363 [2019-12-26 22:43:31,503 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=112, Invalid=488, Unknown=0, NotChecked=0, Total=600 [2019-12-26 22:43:31,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2019-12-26 22:43:31,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 345. [2019-12-26 22:43:31,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345 states. [2019-12-26 22:43:31,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 599 transitions. [2019-12-26 22:43:31,509 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 599 transitions. Word has length 60 [2019-12-26 22:43:31,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:43:31,510 INFO L462 AbstractCegarLoop]: Abstraction has 345 states and 599 transitions. [2019-12-26 22:43:31,510 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-26 22:43:31,510 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 599 transitions. [2019-12-26 22:43:31,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-26 22:43:31,511 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:43:31,511 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] [2019-12-26 22:43:31,511 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:43:31,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:43:31,512 INFO L82 PathProgramCache]: Analyzing trace with hash -1108974140, now seen corresponding path program 2 times [2019-12-26 22:43:31,512 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:43:31,512 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329393395] [2019-12-26 22:43:31,512 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:43:31,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 22:43:31,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 22:43:31,679 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-26 22:43:31,679 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-26 22:43:31,684 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [784] [784] ULTIMATE.startENTRY-->L833: Formula: (let ((.cse0 (store |v_#valid_72| 0 0))) (and (= 0 v_~__unbuffered_p0_EAX~0_33) (= |v_#length_29| (store |v_#length_30| |v_ULTIMATE.start_main_~#t1229~0.base_19| 4)) (= v_~z$w_buff0_used~0_862 0) (= 0 v_~z$r_buff1_thd3~0_308) (= 0 v_~z$r_buff0_thd3~0_195) (= |v_#NULL.offset_7| 0) (= v_~x~0_30 0) (= v_~z$r_buff1_thd1~0_233 0) (< 0 |v_#StackHeapBarrier_21|) (= v_~z$r_buff1_thd0~0_427 0) (= (store |v_#memory_int_26| |v_ULTIMATE.start_main_~#t1229~0.base_19| (store (select |v_#memory_int_26| |v_ULTIMATE.start_main_~#t1229~0.base_19|) |v_ULTIMATE.start_main_~#t1229~0.offset_16| 0)) |v_#memory_int_25|) (= v_~b~0_102 0) (= v_~__unbuffered_cnt~0_109 0) (= 0 v_~z$flush_delayed~0_82) (= 0 v_~weak$$choice0~0_17) (= v_~z$w_buff1~0_400 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t1229~0.base_19| 1) |v_#valid_70|) (= |v_ULTIMATE.start_main_~#t1229~0.offset_16| 0) (= v_~z$r_buff0_thd2~0_88 0) (= v_~z$read_delayed_var~0.offset_7 0) (= v_~__unbuffered_p3_EAX~0_243 0) (= v_~z$r_buff0_thd0~0_435 0) (= 0 v_~__unbuffered_p3_EBX~0_243) (= 0 v_~z$r_buff0_thd4~0_372) (= v_~y~0_50 0) (< |v_#StackHeapBarrier_21| |v_ULTIMATE.start_main_~#t1229~0.base_19|) (= v_~z$w_buff0~0_412 0) (= v_~weak$$choice2~0_150 0) (= 0 v_~z$r_buff1_thd4~0_281) (= v_~z~0_221 0) (= v_~z$read_delayed_var~0.base_7 0) (= v_~z$r_buff1_thd2~0_234 0) (= v_~z$read_delayed~0_7 0) (= 0 |v_#NULL.base_7|) (= v_~z$r_buff0_thd1~0_87 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t1229~0.base_19|) 0) (= v_~z$w_buff1_used~0_620 0) (= v_~main$tmp_guard1~0_25 0) (= v_~a~0_234 0) (= v_~main$tmp_guard0~0_24 0) (= v_~z$mem_tmp~0_23 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_21|, #valid=|v_#valid_72|, #memory_int=|v_#memory_int_26|, #length=|v_#length_30|} OutVars{ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_36|, ULTIMATE.start_main_~#t1230~0.offset=|v_ULTIMATE.start_main_~#t1230~0.offset_17|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_234, ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_44|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_101|, #NULL.offset=|v_#NULL.offset_7|, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_38|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_36|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_120|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_57|, ~a~0=v_~a~0_234, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_435, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_33, ULTIMATE.start_main_~#t1231~0.base=|v_ULTIMATE.start_main_~#t1231~0.base_21|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_372, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_243, #length=|v_#length_29|, ~z$mem_tmp~0=v_~z$mem_tmp~0_23, ULTIMATE.start_main_~#t1229~0.base=|v_ULTIMATE.start_main_~#t1229~0.base_19|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_45|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_41|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_620, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_40|, ~z$flush_delayed~0=v_~z$flush_delayed~0_82, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_36|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_69|, ~weak$$choice0~0=v_~weak$$choice0~0_17, #StackHeapBarrier=|v_#StackHeapBarrier_21|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_47|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_233, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_8|, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_195, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_109, ~x~0=v_~x~0_30, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_281, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_43|, ULTIMATE.start_main_~#t1230~0.base=|v_ULTIMATE.start_main_~#t1230~0.base_22|, ~z$read_delayed~0=v_~z$read_delayed~0_7, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_40|, ~z$w_buff1~0=v_~z$w_buff1~0_400, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_25, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_34|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_7, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_36|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_51|, ULTIMATE.start_main_#t~ite23=|v_ULTIMATE.start_main_#t~ite23_36|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_40|, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_55|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_427, ULTIMATE.start_main_#t~nondet26=|v_ULTIMATE.start_main_#t~nondet26_28|, ~y~0=v_~y~0_50, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_88, ULTIMATE.start_main_~#t1229~0.offset=|v_ULTIMATE.start_main_~#t1229~0.offset_16|, ULTIMATE.start_main_~#t1232~0.base=|v_ULTIMATE.start_main_~#t1232~0.base_22|, ULTIMATE.start_main_~#t1232~0.offset=|v_ULTIMATE.start_main_~#t1232~0.offset_17|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_862, ~z$w_buff0~0=v_~z$w_buff0~0_412, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_40|, ULTIMATE.start_main_#t~nondet25=|v_ULTIMATE.start_main_#t~nondet25_28|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_308, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_53|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_46|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_24, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_243, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_61|, #NULL.base=|v_#NULL.base_7|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_64|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_36|, ULTIMATE.start_main_~#t1231~0.offset=|v_ULTIMATE.start_main_~#t1231~0.offset_16|, ~b~0=v_~b~0_102, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_14|, #valid=|v_#valid_70|, #memory_int=|v_#memory_int_25|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_8|, ULTIMATE.start_main_#t~nondet18=|v_ULTIMATE.start_main_#t~nondet18_22|, ~z~0=v_~z~0_221, ~weak$$choice2~0=v_~weak$$choice2~0_150, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_87} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28, ULTIMATE.start_main_~#t1230~0.offset, ~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite45, ~a~0, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ULTIMATE.start_main_~#t1231~0.base, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, #length, ~z$mem_tmp~0, ULTIMATE.start_main_~#t1229~0.base, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite35, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite37, ~z$flush_delayed~0, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite33, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~z$r_buff1_thd1~0, ULTIMATE.start_main_#t~nondet15, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ULTIMATE.start_main_#t~nondet17, ~__unbuffered_cnt~0, ~x~0, ~z$r_buff1_thd4~0, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_~#t1230~0.base, ~z$read_delayed~0, ULTIMATE.start_main_#t~ite46, ~z$w_buff1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite23, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite30, ~z$r_buff1_thd0~0, ULTIMATE.start_main_#t~nondet26, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_~#t1229~0.offset, ULTIMATE.start_main_~#t1232~0.base, ULTIMATE.start_main_~#t1232~0.offset, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~nondet25, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_~#t1231~0.offset, ~b~0, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, ULTIMATE.start_main_#t~nondet18, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-26 22:43:31,685 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L833-1-->L835: Formula: (and (= 0 |v_ULTIMATE.start_main_~#t1230~0.offset_11|) (not (= |v_ULTIMATE.start_main_~#t1230~0.base_13| 0)) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t1230~0.base_13| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t1230~0.base_13|) |v_ULTIMATE.start_main_~#t1230~0.offset_11| 1)) |v_#memory_int_19|) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t1230~0.base_13| 4)) (= (store |v_#valid_49| |v_ULTIMATE.start_main_~#t1230~0.base_13| 1) |v_#valid_48|) (= (select |v_#valid_49| |v_ULTIMATE.start_main_~#t1230~0.base_13|) 0) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t1230~0.base_13|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_20|, #length=|v_#length_24|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_~#t1230~0.offset=|v_ULTIMATE.start_main_~#t1230~0.offset_11|, #valid=|v_#valid_48|, #memory_int=|v_#memory_int_19|, ULTIMATE.start_main_~#t1230~0.base=|v_ULTIMATE.start_main_~#t1230~0.base_13|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_5|, #length=|v_#length_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1230~0.offset, #valid, #memory_int, ULTIMATE.start_main_~#t1230~0.base, ULTIMATE.start_main_#t~nondet15, #length] because there is no mapped edge [2019-12-26 22:43:31,688 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L835-1-->L837: Formula: (and (not (= 0 |v_ULTIMATE.start_main_~#t1231~0.base_12|)) (= (select |v_#valid_47| |v_ULTIMATE.start_main_~#t1231~0.base_12|) 0) (= (store |v_#valid_47| |v_ULTIMATE.start_main_~#t1231~0.base_12| 1) |v_#valid_46|) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t1231~0.base_12| 4)) (= 0 |v_ULTIMATE.start_main_~#t1231~0.offset_10|) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1231~0.base_12|) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1231~0.base_12| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1231~0.base_12|) |v_ULTIMATE.start_main_~#t1231~0.offset_10| 2)) |v_#memory_int_17|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_18|, #length=|v_#length_22|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_~#t1231~0.base=|v_ULTIMATE.start_main_~#t1231~0.base_12|, ULTIMATE.start_main_~#t1231~0.offset=|v_ULTIMATE.start_main_~#t1231~0.offset_10|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_5|, #length=|v_#length_21|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1231~0.base, ULTIMATE.start_main_~#t1231~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, #length] because there is no mapped edge [2019-12-26 22:43:31,693 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L837-1-->L839: Formula: (and (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1232~0.base_12| 4)) (= 0 (select |v_#valid_40| |v_ULTIMATE.start_main_~#t1232~0.base_12|)) (= (store |v_#valid_40| |v_ULTIMATE.start_main_~#t1232~0.base_12| 1) |v_#valid_39|) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1232~0.base_12| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1232~0.base_12|) |v_ULTIMATE.start_main_~#t1232~0.offset_10| 3)) |v_#memory_int_13|) (= 0 |v_ULTIMATE.start_main_~#t1232~0.offset_10|) (not (= 0 |v_ULTIMATE.start_main_~#t1232~0.base_12|)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1232~0.base_12|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_~#t1232~0.base=|v_ULTIMATE.start_main_~#t1232~0.base_12|, ULTIMATE.start_main_~#t1232~0.offset=|v_ULTIMATE.start_main_~#t1232~0.offset_10|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_13|, #length=|v_#length_17|, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1232~0.base, ULTIMATE.start_main_~#t1232~0.offset, #valid, #memory_int, #length, ULTIMATE.start_main_#t~nondet17] because there is no mapped edge [2019-12-26 22:43:31,696 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [660] [660] L4-->L810: Formula: (and (= v_~z$r_buff0_thd0~0_60 v_~z$r_buff1_thd0~0_36) (= v_~__unbuffered_p3_EBX~0_4 v_~b~0_4) (not (= 0 v_P3Thread1of1ForFork3___VERIFIER_assert_~expression_8)) (= v_~__unbuffered_p3_EAX~0_4 v_~a~0_3) (= v_~z$r_buff1_thd1~0_3 v_~z$r_buff0_thd1~0_3) (= v_~z$r_buff1_thd2~0_4 v_~z$r_buff0_thd2~0_4) (= v_~z$r_buff0_thd4~0_20 v_~z$r_buff1_thd4~0_14) (= 1 v_~a~0_3) (= v_~z$r_buff0_thd4~0_19 1) (= v_~z$r_buff0_thd3~0_17 v_~z$r_buff1_thd3~0_11)) InVars {P3Thread1of1ForFork3___VERIFIER_assert_~expression=v_P3Thread1of1ForFork3___VERIFIER_assert_~expression_8, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_60, ~b~0=v_~b~0_4, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_20, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_17, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_3, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_4} OutVars{P3Thread1of1ForFork3___VERIFIER_assert_~expression=v_P3Thread1of1ForFork3___VERIFIER_assert_~expression_8, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_14, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_11, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_4, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_4, ~a~0=v_~a~0_3, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_60, ~b~0=v_~b~0_4, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_36, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_3, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_4, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_19, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_17, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_3, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_4} AuxVars[] AssignedVars[~a~0, ~z$r_buff1_thd4~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~__unbuffered_p3_EAX~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EBX~0] because there is no mapped edge [2019-12-26 22:43:31,696 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] P0ENTRY-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork0_#res.base_9|) (= v_~b~0_77 1) (= |v_P0Thread1of1ForFork0_#res.offset_9| 0) (= v_~x~0_21 v_~__unbuffered_p0_EAX~0_21) (= v_~__unbuffered_cnt~0_78 (+ v_~__unbuffered_cnt~0_79 1)) (= v_P0Thread1of1ForFork0_~arg.base_15 |v_P0Thread1of1ForFork0_#in~arg.base_15|) (= v_P0Thread1of1ForFork0_~arg.offset_15 |v_P0Thread1of1ForFork0_#in~arg.offset_15|)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_15|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_79, ~x~0=v_~x~0_21} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_15|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_21, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_9|, ~b~0=v_~b~0_77, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_15|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_78, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_15, ~x~0=v_~x~0_21, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_15} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, P0Thread1of1ForFork0_#res.offset, ~b~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-26 22:43:31,697 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [763] [763] P1ENTRY-->P1EXIT: Formula: (and (= v_P1Thread1of1ForFork1_~arg.base_12 |v_P1Thread1of1ForFork1_#in~arg.base_12|) (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~y~0_35 1) (= v_~x~0_26 1) (= |v_P1Thread1of1ForFork1_#in~arg.offset_12| v_P1Thread1of1ForFork1_~arg.offset_12) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_89 1) v_~__unbuffered_cnt~0_88)) InVars {P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_12|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_12|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_89} OutVars{P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_12, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_12, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_12|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_12|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_88, ~y~0=v_~y~0_35, ~x~0=v_~x~0_26, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork1_#res.offset, P1Thread1of1ForFork1_~arg.base, ~__unbuffered_cnt~0, ~y~0, ~x~0, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-26 22:43:31,699 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L811-->L811-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd4~0_In1739444140 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In1739444140 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P3Thread1of1ForFork3_#t~ite11_Out1739444140|)) (and (or .cse1 .cse0) (= |P3Thread1of1ForFork3_#t~ite11_Out1739444140| ~z$w_buff0_used~0_In1739444140)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1739444140, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1739444140} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1739444140, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1739444140, P3Thread1of1ForFork3_#t~ite11=|P3Thread1of1ForFork3_#t~ite11_Out1739444140|} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite11] because there is no mapped edge [2019-12-26 22:43:31,699 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [717] [717] L774-2-->L774-4: Formula: (let ((.cse1 (= (mod ~z$w_buff1_used~0_In2010815731 256) 0)) (.cse0 (= 0 (mod ~z$r_buff1_thd3~0_In2010815731 256)))) (or (and (not .cse0) (= ~z$w_buff1~0_In2010815731 |P2Thread1of1ForFork2_#t~ite3_Out2010815731|) (not .cse1)) (and (or .cse1 .cse0) (= ~z~0_In2010815731 |P2Thread1of1ForFork2_#t~ite3_Out2010815731|)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In2010815731, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2010815731, ~z$w_buff1~0=~z$w_buff1~0_In2010815731, ~z~0=~z~0_In2010815731} OutVars{P2Thread1of1ForFork2_#t~ite3=|P2Thread1of1ForFork2_#t~ite3_Out2010815731|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In2010815731, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2010815731, ~z$w_buff1~0=~z$w_buff1~0_In2010815731, ~z~0=~z~0_In2010815731} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite3] because there is no mapped edge [2019-12-26 22:43:31,700 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L812-->L812-2: Formula: (let ((.cse3 (= (mod ~z$w_buff0_used~0_In-229936918 256) 0)) (.cse2 (= (mod ~z$r_buff0_thd4~0_In-229936918 256) 0)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In-229936918 256))) (.cse0 (= (mod ~z$r_buff1_thd4~0_In-229936918 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P3Thread1of1ForFork3_#t~ite12_Out-229936918| ~z$w_buff1_used~0_In-229936918)) (and (= |P3Thread1of1ForFork3_#t~ite12_Out-229936918| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-229936918, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-229936918, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-229936918, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-229936918} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-229936918, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-229936918, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-229936918, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-229936918, P3Thread1of1ForFork3_#t~ite12=|P3Thread1of1ForFork3_#t~ite12_Out-229936918|} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite12] because there is no mapped edge [2019-12-26 22:43:31,701 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [730] [730] L813-->L814: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In1889921321 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd4~0_In1889921321 256) 0))) (or (and (or .cse0 .cse1) (= ~z$r_buff0_thd4~0_Out1889921321 ~z$r_buff0_thd4~0_In1889921321)) (and (not .cse1) (not .cse0) (= ~z$r_buff0_thd4~0_Out1889921321 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1889921321, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1889921321} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1889921321, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out1889921321, P3Thread1of1ForFork3_#t~ite13=|P3Thread1of1ForFork3_#t~ite13_Out1889921321|} AuxVars[] AssignedVars[~z$r_buff0_thd4~0, P3Thread1of1ForFork3_#t~ite13] because there is no mapped edge [2019-12-26 22:43:31,701 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [713] [713] L814-->L814-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff0_thd4~0_In1288545590 256))) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In1288545590 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd4~0_In1288545590 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In1288545590 256)))) (or (and (or .cse0 .cse1) (= |P3Thread1of1ForFork3_#t~ite14_Out1288545590| ~z$r_buff1_thd4~0_In1288545590) (or .cse2 .cse3)) (and (= 0 |P3Thread1of1ForFork3_#t~ite14_Out1288545590|) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1288545590, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1288545590, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1288545590, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1288545590} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1288545590, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1288545590, P3Thread1of1ForFork3_#t~ite14=|P3Thread1of1ForFork3_#t~ite14_Out1288545590|, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1288545590, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1288545590} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite14] because there is no mapped edge [2019-12-26 22:43:31,701 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [736] [736] L814-2-->P3EXIT: Formula: (and (= v_~__unbuffered_cnt~0_57 (+ v_~__unbuffered_cnt~0_58 1)) (= 0 |v_P3Thread1of1ForFork3_#res.offset_5|) (= |v_P3Thread1of1ForFork3_#t~ite14_32| v_~z$r_buff1_thd4~0_45) (= 0 |v_P3Thread1of1ForFork3_#res.base_5|)) InVars {P3Thread1of1ForFork3_#t~ite14=|v_P3Thread1of1ForFork3_#t~ite14_32|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_58} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_45, P3Thread1of1ForFork3_#t~ite14=|v_P3Thread1of1ForFork3_#t~ite14_31|, P3Thread1of1ForFork3_#res.base=|v_P3Thread1of1ForFork3_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_57, P3Thread1of1ForFork3_#res.offset=|v_P3Thread1of1ForFork3_#res.offset_5|} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, P3Thread1of1ForFork3_#t~ite14, P3Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P3Thread1of1ForFork3_#res.offset] because there is no mapped edge [2019-12-26 22:43:31,702 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] L774-4-->L775: Formula: (= |v_P2Thread1of1ForFork2_#t~ite3_16| v_~z~0_56) InVars {P2Thread1of1ForFork2_#t~ite3=|v_P2Thread1of1ForFork2_#t~ite3_16|} OutVars{P2Thread1of1ForFork2_#t~ite4=|v_P2Thread1of1ForFork2_#t~ite4_11|, P2Thread1of1ForFork2_#t~ite3=|v_P2Thread1of1ForFork2_#t~ite3_15|, ~z~0=v_~z~0_56} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite4, P2Thread1of1ForFork2_#t~ite3, ~z~0] because there is no mapped edge [2019-12-26 22:43:31,702 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L775-->L775-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-1115857139 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-1115857139 256)))) (or (and (not .cse0) (= |P2Thread1of1ForFork2_#t~ite5_Out-1115857139| 0) (not .cse1)) (and (= |P2Thread1of1ForFork2_#t~ite5_Out-1115857139| ~z$w_buff0_used~0_In-1115857139) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1115857139, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1115857139} OutVars{P2Thread1of1ForFork2_#t~ite5=|P2Thread1of1ForFork2_#t~ite5_Out-1115857139|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1115857139, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1115857139} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite5] because there is no mapped edge [2019-12-26 22:43:31,703 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L776-->L776-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In1550389143 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In1550389143 256))) (.cse2 (= 0 (mod ~z$r_buff1_thd3~0_In1550389143 256))) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In1550389143 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite6_Out1550389143| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P2Thread1of1ForFork2_#t~ite6_Out1550389143| ~z$w_buff1_used~0_In1550389143) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1550389143, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1550389143, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1550389143, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1550389143} OutVars{P2Thread1of1ForFork2_#t~ite6=|P2Thread1of1ForFork2_#t~ite6_Out1550389143|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1550389143, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1550389143, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1550389143, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1550389143} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite6] because there is no mapped edge [2019-12-26 22:43:31,703 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L777-->L777-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-1896235837 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-1896235837 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork2_#t~ite7_Out-1896235837|)) (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite7_Out-1896235837| ~z$r_buff0_thd3~0_In-1896235837)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1896235837, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1896235837} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1896235837, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1896235837, P2Thread1of1ForFork2_#t~ite7=|P2Thread1of1ForFork2_#t~ite7_Out-1896235837|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite7] because there is no mapped edge [2019-12-26 22:43:31,704 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [726] [726] L778-->L778-2: Formula: (let ((.cse2 (= (mod ~z$w_buff1_used~0_In-27704976 256) 0)) (.cse3 (= (mod ~z$r_buff1_thd3~0_In-27704976 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd3~0_In-27704976 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-27704976 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork2_#t~ite8_Out-27704976|)) (and (or .cse2 .cse3) (or .cse1 .cse0) (= ~z$r_buff1_thd3~0_In-27704976 |P2Thread1of1ForFork2_#t~ite8_Out-27704976|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-27704976, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-27704976, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-27704976, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-27704976} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-27704976, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-27704976, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-27704976, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-27704976, P2Thread1of1ForFork2_#t~ite8=|P2Thread1of1ForFork2_#t~ite8_Out-27704976|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-26 22:43:31,704 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [739] [739] L778-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork2_#t~ite8_30| v_~z$r_buff1_thd3~0_74) (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_70 1) v_~__unbuffered_cnt~0_69) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_70, P2Thread1of1ForFork2_#t~ite8=|v_P2Thread1of1ForFork2_#t~ite8_30|} OutVars{~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_74, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_69, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|, P2Thread1of1ForFork2_#t~ite8=|v_P2Thread1of1ForFork2_#t~ite8_29|} AuxVars[] AssignedVars[~z$r_buff1_thd3~0, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset, P2Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-26 22:43:31,705 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L839-1-->L845: Formula: (and (= 4 v_~__unbuffered_cnt~0_34) (= v_~main$tmp_guard0~0_13 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_34} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_34, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_13, ULTIMATE.start_main_#t~nondet18=|v_ULTIMATE.start_main_#t~nondet18_12|} AuxVars[] AssignedVars[~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet18] because there is no mapped edge [2019-12-26 22:43:31,705 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L845-2-->L845-4: Formula: (let ((.cse0 (= (mod ~z$r_buff1_thd0~0_In-290415273 256) 0)) (.cse1 (= (mod ~z$w_buff1_used~0_In-290415273 256) 0))) (or (and (or .cse0 .cse1) (= ~z~0_In-290415273 |ULTIMATE.start_main_#t~ite19_Out-290415273|)) (and (not .cse0) (not .cse1) (= ~z$w_buff1~0_In-290415273 |ULTIMATE.start_main_#t~ite19_Out-290415273|)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-290415273, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-290415273, ~z$w_buff1~0=~z$w_buff1~0_In-290415273, ~z~0=~z~0_In-290415273} OutVars{ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out-290415273|, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-290415273, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-290415273, ~z$w_buff1~0=~z$w_buff1~0_In-290415273, ~z~0=~z~0_In-290415273} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite19] because there is no mapped edge [2019-12-26 22:43:31,706 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [647] [647] L845-4-->L846: Formula: (= v_~z~0_30 |v_ULTIMATE.start_main_#t~ite19_9|) InVars {ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_9|} OutVars{ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_8|, ~z~0=v_~z~0_30, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite19, ~z~0, ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-26 22:43:31,706 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L846-->L846-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd0~0_In-442204280 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In-442204280 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite21_Out-442204280| ~z$w_buff0_used~0_In-442204280)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite21_Out-442204280| 0) (not .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-442204280, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-442204280} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-442204280, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-442204280, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out-442204280|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-26 22:43:31,707 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [728] [728] L847-->L847-2: Formula: (let ((.cse3 (= (mod ~z$w_buff0_used~0_In1023763671 256) 0)) (.cse2 (= (mod ~z$r_buff0_thd0~0_In1023763671 256) 0)) (.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In1023763671 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In1023763671 256)))) (or (and (= ~z$w_buff1_used~0_In1023763671 |ULTIMATE.start_main_#t~ite22_Out1023763671|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= 0 |ULTIMATE.start_main_#t~ite22_Out1023763671|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1023763671, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1023763671, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1023763671, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1023763671} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1023763671, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1023763671, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1023763671, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1023763671, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out1023763671|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-26 22:43:31,708 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L848-->L848-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-1499653506 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-1499653506 256)))) (or (and (= ~z$r_buff0_thd0~0_In-1499653506 |ULTIMATE.start_main_#t~ite23_Out-1499653506|) (or .cse0 .cse1)) (and (= |ULTIMATE.start_main_#t~ite23_Out-1499653506| 0) (not .cse0) (not .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1499653506, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1499653506} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1499653506, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1499653506, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out-1499653506|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite23] because there is no mapped edge [2019-12-26 22:43:31,708 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [727] [727] L849-->L849-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd0~0_In389116120 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In389116120 256))) (.cse3 (= (mod ~z$r_buff1_thd0~0_In389116120 256) 0)) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In389116120 256)))) (or (and (= |ULTIMATE.start_main_#t~ite24_Out389116120| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse3 .cse2) (= |ULTIMATE.start_main_#t~ite24_Out389116120| ~z$r_buff1_thd0~0_In389116120)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In389116120, ~z$w_buff0_used~0=~z$w_buff0_used~0_In389116120, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In389116120, ~z$w_buff1_used~0=~z$w_buff1_used~0_In389116120} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In389116120, ~z$w_buff0_used~0=~z$w_buff0_used~0_In389116120, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In389116120, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out389116120|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In389116120} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite24] because there is no mapped edge [2019-12-26 22:43:31,714 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L860-->L860-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In-146604545 256) 0))) (or (and (let ((.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In-146604545 256)))) (or (and (= 0 (mod ~z$w_buff1_used~0_In-146604545 256)) .cse0) (and .cse0 (= (mod ~z$r_buff1_thd0~0_In-146604545 256) 0)) (= 0 (mod ~z$w_buff0_used~0_In-146604545 256)))) .cse1 (= |ULTIMATE.start_main_#t~ite39_Out-146604545| |ULTIMATE.start_main_#t~ite40_Out-146604545|) (= |ULTIMATE.start_main_#t~ite39_Out-146604545| ~z$w_buff1_used~0_In-146604545)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite39_In-146604545| |ULTIMATE.start_main_#t~ite39_Out-146604545|) (= ~z$w_buff1_used~0_In-146604545 |ULTIMATE.start_main_#t~ite40_Out-146604545|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-146604545, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-146604545, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_In-146604545|, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-146604545, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-146604545, ~weak$$choice2~0=~weak$$choice2~0_In-146604545} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-146604545, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-146604545|, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out-146604545|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-146604545, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-146604545, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-146604545, ~weak$$choice2~0=~weak$$choice2~0_In-146604545} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-26 22:43:31,715 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [692] [692] L861-->L862: Formula: (and (= v_~z$r_buff0_thd0~0_125 v_~z$r_buff0_thd0~0_124) (not (= (mod v_~weak$$choice2~0_28 256) 0))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_125, ~weak$$choice2~0=v_~weak$$choice2~0_28} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_13|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_124, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_8|, ~weak$$choice2~0=v_~weak$$choice2~0_28, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_14|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ~z$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-26 22:43:31,716 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L862-->L862-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In642593583 256)))) (or (and (= |ULTIMATE.start_main_#t~ite46_Out642593583| |ULTIMATE.start_main_#t~ite45_Out642593583|) (let ((.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In642593583 256)))) (or (= (mod ~z$w_buff0_used~0_In642593583 256) 0) (and (= 0 (mod ~z$w_buff1_used~0_In642593583 256)) .cse0) (and .cse0 (= 0 (mod ~z$r_buff1_thd0~0_In642593583 256))))) .cse1 (= ~z$r_buff1_thd0~0_In642593583 |ULTIMATE.start_main_#t~ite45_Out642593583|)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite45_In642593583| |ULTIMATE.start_main_#t~ite45_Out642593583|) (= ~z$r_buff1_thd0~0_In642593583 |ULTIMATE.start_main_#t~ite46_Out642593583|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In642593583, ~z$w_buff0_used~0=~z$w_buff0_used~0_In642593583, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In642593583, ~z$w_buff1_used~0=~z$w_buff1_used~0_In642593583, ~weak$$choice2~0=~weak$$choice2~0_In642593583, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_In642593583|} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In642593583, ~z$w_buff0_used~0=~z$w_buff0_used~0_In642593583, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In642593583, ~z$w_buff1_used~0=~z$w_buff1_used~0_In642593583, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out642593583|, ~weak$$choice2~0=~weak$$choice2~0_In642593583, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out642593583|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46, ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-26 22:43:31,716 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [744] [744] L864-->L4: Formula: (and (= v_~z$mem_tmp~0_13 v_~z~0_110) (not (= 0 (mod v_~z$flush_delayed~0_38 256))) (= 0 v_~z$flush_delayed~0_37) (= (mod v_~main$tmp_guard1~0_9 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_13, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_9, ~z$flush_delayed~0=v_~z$flush_delayed~0_38} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_13, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_11, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_47|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_9, ~z$flush_delayed~0=v_~z$flush_delayed~0_37, ~z~0=v_~z~0_110, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite47, ~z$flush_delayed~0, ~z~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-26 22:43:31,717 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [732] [732] L4-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_8 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_8 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_8, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-26 22:43:31,820 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.12 10:43:31 BasicIcfg [2019-12-26 22:43:31,821 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-26 22:43:31,823 INFO L168 Benchmark]: Toolchain (without parser) took 28728.78 ms. Allocated memory was 144.2 MB in the beginning and 1.3 GB in the end (delta: 1.2 GB). Free memory was 99.1 MB in the beginning and 1.0 GB in the end (delta: -906.9 MB). Peak memory consumption was 268.6 MB. Max. memory is 7.1 GB. [2019-12-26 22:43:31,823 INFO L168 Benchmark]: CDTParser took 0.52 ms. Allocated memory is still 144.2 MB. Free memory was 119.3 MB in the beginning and 119.1 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-26 22:43:31,824 INFO L168 Benchmark]: CACSL2BoogieTranslator took 843.14 ms. Allocated memory was 144.2 MB in the beginning and 201.9 MB in the end (delta: 57.7 MB). Free memory was 98.6 MB in the beginning and 155.1 MB in the end (delta: -56.4 MB). Peak memory consumption was 20.6 MB. Max. memory is 7.1 GB. [2019-12-26 22:43:31,825 INFO L168 Benchmark]: Boogie Procedure Inliner took 77.45 ms. Allocated memory is still 201.9 MB. Free memory was 154.4 MB in the beginning and 151.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-26 22:43:31,826 INFO L168 Benchmark]: Boogie Preprocessor took 41.50 ms. Allocated memory is still 201.9 MB. Free memory was 151.7 MB in the beginning and 149.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-26 22:43:31,827 INFO L168 Benchmark]: RCFGBuilder took 848.81 ms. Allocated memory is still 201.9 MB. Free memory was 149.1 MB in the beginning and 100.1 MB in the end (delta: 49.0 MB). Peak memory consumption was 49.0 MB. Max. memory is 7.1 GB. [2019-12-26 22:43:31,828 INFO L168 Benchmark]: TraceAbstraction took 26912.39 ms. Allocated memory was 201.9 MB in the beginning and 1.3 GB in the end (delta: 1.1 GB). Free memory was 99.4 MB in the beginning and 1.0 GB in the end (delta: -906.5 MB). Peak memory consumption was 211.3 MB. Max. memory is 7.1 GB. [2019-12-26 22:43:31,837 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.52 ms. Allocated memory is still 144.2 MB. Free memory was 119.3 MB in the beginning and 119.1 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 843.14 ms. Allocated memory was 144.2 MB in the beginning and 201.9 MB in the end (delta: 57.7 MB). Free memory was 98.6 MB in the beginning and 155.1 MB in the end (delta: -56.4 MB). Peak memory consumption was 20.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 77.45 ms. Allocated memory is still 201.9 MB. Free memory was 154.4 MB in the beginning and 151.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 41.50 ms. Allocated memory is still 201.9 MB. Free memory was 151.7 MB in the beginning and 149.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 848.81 ms. Allocated memory is still 201.9 MB. Free memory was 149.1 MB in the beginning and 100.1 MB in the end (delta: 49.0 MB). Peak memory consumption was 49.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 26912.39 ms. Allocated memory was 201.9 MB in the beginning and 1.3 GB in the end (delta: 1.1 GB). Free memory was 99.4 MB in the beginning and 1.0 GB in the end (delta: -906.5 MB). Peak memory consumption was 211.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.5s, 181 ProgramPointsBefore, 92 ProgramPointsAfterwards, 209 TransitionsBefore, 100 TransitionsAfterwards, 12668 CoEnabledTransitionPairs, 7 FixpointIterations, 37 TrivialSequentialCompositions, 50 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 32 ConcurrentYvCompositions, 25 ChoiceCompositions, 4988 VarBasedMoverChecksPositive, 283 VarBasedMoverChecksNegative, 145 SemBasedMoverChecksPositive, 210 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.5s, 0 MoverChecksTotal, 52490 CheckedPairsTotal, 119 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L833] FCALL, FORK 0 pthread_create(&t1229, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L835] FCALL, FORK 0 pthread_create(&t1230, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L837] FCALL, FORK 0 pthread_create(&t1231, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L839] FCALL, FORK 0 pthread_create(&t1232, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L788] 4 z$w_buff1 = z$w_buff0 [L789] 4 z$w_buff0 = 2 [L790] 4 z$w_buff1_used = z$w_buff0_used [L791] 4 z$w_buff0_used = (_Bool)1 [L810] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L768] 3 y = 2 [L771] 3 z = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L810] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L774] 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L811] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L812] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L775] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L776] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L777] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L845] 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L846] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L847] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L848] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L849] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L852] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L853] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L854] 0 z$flush_delayed = weak$$choice2 [L855] 0 z$mem_tmp = z VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L856] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L856] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L857] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L857] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L858] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L858] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L859] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L859] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L860] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L862] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L863] 0 main$tmp_guard1 = !(y == 2 && z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 169 locations, 2 error locations. Result: UNSAFE, OverallTime: 26.6s, OverallIterations: 19, TraceHistogramMax: 1, AutomataDifference: 7.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2029 SDtfs, 1939 SDslu, 4481 SDs, 0 SdLazy, 1787 SolverSat, 141 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 141 GetRequests, 37 SyntacticMatches, 12 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=51222occurred 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: 8.0s AutomataMinimizationTime, 18 MinimizatonAttempts, 9433 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 864 NumberOfCodeBlocks, 864 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 786 ConstructedInterpolants, 0 QuantifiedInterpolants, 147701 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 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...