/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix016_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 20:27:13,988 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 20:27:13,993 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 20:27:14,005 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 20:27:14,006 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 20:27:14,007 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 20:27:14,008 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 20:27:14,010 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 20:27:14,011 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 20:27:14,012 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 20:27:14,013 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 20:27:14,014 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 20:27:14,015 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 20:27:14,016 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 20:27:14,017 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 20:27:14,018 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 20:27:14,018 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 20:27:14,019 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 20:27:14,021 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 20:27:14,023 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 20:27:14,025 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 20:27:14,026 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 20:27:14,027 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 20:27:14,028 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 20:27:14,030 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 20:27:14,030 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 20:27:14,031 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 20:27:14,032 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 20:27:14,032 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 20:27:14,033 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 20:27:14,034 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 20:27:14,034 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 20:27:14,035 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 20:27:14,036 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 20:27:14,037 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 20:27:14,037 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 20:27:14,038 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 20:27:14,038 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 20:27:14,039 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 20:27:14,039 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 20:27:14,040 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 20:27:14,041 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf [2019-12-18 20:27:14,055 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 20:27:14,055 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 20:27:14,057 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 20:27:14,057 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 20:27:14,057 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 20:27:14,057 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 20:27:14,057 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 20:27:14,058 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 20:27:14,058 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 20:27:14,058 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 20:27:14,058 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 20:27:14,058 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 20:27:14,059 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 20:27:14,059 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 20:27:14,059 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 20:27:14,059 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 20:27:14,059 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 20:27:14,060 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 20:27:14,060 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 20:27:14,060 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 20:27:14,060 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 20:27:14,060 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 20:27:14,061 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 20:27:14,061 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 20:27:14,061 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 20:27:14,061 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 20:27:14,061 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 20:27:14,062 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-18 20:27:14,062 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 20:27:14,062 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 20:27:14,352 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 20:27:14,364 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 20:27:14,367 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 20:27:14,369 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 20:27:14,369 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 20:27:14,370 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix016_rmo.opt.i [2019-12-18 20:27:14,433 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/278691735/a4a3b4d3b1ea411e86b6c53394be3dc2/FLAG84cdff90a [2019-12-18 20:27:14,881 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 20:27:14,881 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix016_rmo.opt.i [2019-12-18 20:27:14,898 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/278691735/a4a3b4d3b1ea411e86b6c53394be3dc2/FLAG84cdff90a [2019-12-18 20:27:15,186 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/278691735/a4a3b4d3b1ea411e86b6c53394be3dc2 [2019-12-18 20:27:15,195 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 20:27:15,196 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 20:27:15,197 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 20:27:15,198 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 20:27:15,201 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 20:27:15,202 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 08:27:15" (1/1) ... [2019-12-18 20:27:15,205 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71143ccb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:27:15, skipping insertion in model container [2019-12-18 20:27:15,206 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 08:27:15" (1/1) ... [2019-12-18 20:27:15,214 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 20:27:15,281 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 20:27:15,742 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 20:27:15,764 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 20:27:15,830 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 20:27:15,924 INFO L208 MainTranslator]: Completed translation [2019-12-18 20:27:15,924 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:27:15 WrapperNode [2019-12-18 20:27:15,924 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 20:27:15,925 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 20:27:15,925 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 20:27:15,925 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 20:27:15,933 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:27:15" (1/1) ... [2019-12-18 20:27:15,954 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:27:15" (1/1) ... [2019-12-18 20:27:15,985 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 20:27:15,986 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 20:27:15,986 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 20:27:15,986 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 20:27:15,996 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:27:15" (1/1) ... [2019-12-18 20:27:15,996 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:27:15" (1/1) ... [2019-12-18 20:27:16,002 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:27:15" (1/1) ... [2019-12-18 20:27:16,002 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:27:15" (1/1) ... [2019-12-18 20:27:16,015 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:27:15" (1/1) ... [2019-12-18 20:27:16,021 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:27:15" (1/1) ... [2019-12-18 20:27:16,025 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:27:15" (1/1) ... [2019-12-18 20:27:16,030 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 20:27:16,030 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 20:27:16,031 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 20:27:16,031 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 20:27:16,032 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:27:15" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 20:27:16,097 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 20:27:16,097 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 20:27:16,097 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 20:27:16,098 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 20:27:16,098 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 20:27:16,098 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 20:27:16,098 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 20:27:16,098 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 20:27:16,099 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 20:27:16,099 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 20:27:16,099 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 20:27:16,099 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 20:27:16,099 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 20:27:16,101 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 20:27:16,839 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 20:27:16,839 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 20:27:16,840 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 08:27:16 BoogieIcfgContainer [2019-12-18 20:27:16,841 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 20:27:16,842 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 20:27:16,842 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 20:27:16,845 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 20:27:16,845 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 08:27:15" (1/3) ... [2019-12-18 20:27:16,846 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bb62d5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 08:27:16, skipping insertion in model container [2019-12-18 20:27:16,846 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:27:15" (2/3) ... [2019-12-18 20:27:16,847 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bb62d5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 08:27:16, skipping insertion in model container [2019-12-18 20:27:16,847 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 08:27:16" (3/3) ... [2019-12-18 20:27:16,849 INFO L109 eAbstractionObserver]: Analyzing ICFG mix016_rmo.opt.i [2019-12-18 20:27:16,859 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 20:27:16,859 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 20:27:16,866 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 20:27:16,867 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 20:27:16,907 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:27:16,907 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:27:16,907 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:27:16,908 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:27:16,908 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:27:16,908 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:27:16,908 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:27:16,909 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:27:16,909 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:27:16,910 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:27:16,910 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:27:16,910 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:27:16,910 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:27:16,911 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:27:16,911 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:27:16,911 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:27:16,911 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:27:16,912 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:27:16,912 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:27:16,912 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:27:16,912 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:27:16,913 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:27:16,913 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:27:16,913 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:27:16,914 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:27:16,914 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:27:16,914 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:27:16,915 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:27:16,915 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:27:16,915 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:27:16,915 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:27:16,916 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:27:16,916 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:27:16,916 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:27:16,916 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:27:16,917 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:27:16,917 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:27:16,917 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:27:16,917 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:27:16,918 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:27:16,918 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:27:16,918 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:27:16,918 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:27:16,919 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:27:16,919 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:27:16,919 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:27:16,936 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:27:16,936 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:27:16,936 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:27:16,936 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:27:16,937 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:27:16,937 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:27:16,937 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:27:16,937 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:27:16,937 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:27:16,938 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:27:16,940 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:27:16,940 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:27:16,940 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:27:16,940 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:27:16,940 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:27:16,941 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:27:16,941 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:27:16,941 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:27:16,941 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:27:16,941 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:27:16,941 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:27:16,942 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:27:16,942 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:27:16,943 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:27:16,943 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:27:16,944 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:27:16,944 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:27:16,944 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:27:16,944 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:27:16,944 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:27:16,945 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:27:16,945 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:27:16,945 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:27:16,945 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:27:16,946 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:27:16,946 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:27:16,947 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:27:16,947 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:27:16,947 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:27:16,947 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:27:16,948 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:27:16,948 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:27:16,948 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:27:16,948 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:27:16,950 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:27:16,950 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:27:16,950 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:27:16,950 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:27:16,953 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:27:16,954 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:27:16,954 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:27:16,954 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:27:16,954 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:27:16,954 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:27:16,955 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:27:16,955 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:27:16,959 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:27:16,960 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:27:16,960 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:27:16,961 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:27:16,968 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:27:16,968 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:27:16,969 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:27:16,969 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:27:16,969 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:27:16,969 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:27:16,969 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:27:16,969 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:27:16,970 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:27:16,970 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:27:16,970 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:27:16,970 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:27:16,970 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:27:16,972 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:27:16,972 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:27:16,972 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:27:16,972 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:27:16,972 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:27:16,973 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:27:16,973 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:27:16,973 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:27:16,973 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:27:16,974 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:27:16,974 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:27:16,974 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:27:16,974 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:27:16,974 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:27:16,975 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:27:16,975 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:27:16,975 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:27:16,975 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:27:16,975 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:27:16,976 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:27:16,976 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:27:16,976 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:27:16,976 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:27:16,976 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:27:16,976 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:27:16,977 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:27:16,977 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:27:16,977 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:27:16,977 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:27:16,977 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:27:16,978 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:27:16,978 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:27:16,978 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:27:16,978 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:27:16,978 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:27:16,979 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:27:16,979 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:27:16,979 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:27:16,979 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:27:16,983 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:27:16,983 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:27:16,983 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:27:16,984 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:27:16,984 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:27:16,984 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:27:16,984 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:27:16,984 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:27:16,985 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:27:16,985 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:27:16,985 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:27:16,985 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:27:16,988 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:27:16,988 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:27:16,989 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:27:16,989 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:27:16,991 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:27:16,991 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:27:16,991 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:27:16,991 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:27:16,991 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:27:16,992 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:27:16,995 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:27:16,996 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:27:16,996 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:27:16,996 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:27:16,996 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:27:16,996 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:27:16,997 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:27:16,997 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:27:16,997 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:27:16,997 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:27:16,997 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:27:16,997 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:27:16,998 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:27:16,998 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:27:16,998 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:27:16,998 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:27:16,999 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:27:16,999 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:27:16,999 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:27:16,999 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:27:16,999 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:27:16,999 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:27:17,000 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:27:17,000 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:27:17,000 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:27:17,000 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:27:17,001 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:27:17,020 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 20:27:17,046 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 20:27:17,047 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 20:27:17,047 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 20:27:17,047 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 20:27:17,047 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 20:27:17,047 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 20:27:17,047 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 20:27:17,048 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 20:27:17,072 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 165 places, 196 transitions [2019-12-18 20:27:17,074 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 165 places, 196 transitions [2019-12-18 20:27:17,161 INFO L126 PetriNetUnfolder]: 41/193 cut-off events. [2019-12-18 20:27:17,161 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 20:27:17,179 INFO L76 FinitePrefix]: Finished finitePrefix Result has 203 conditions, 193 events. 41/193 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 439 event pairs. 9/159 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-18 20:27:17,205 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 165 places, 196 transitions [2019-12-18 20:27:17,253 INFO L126 PetriNetUnfolder]: 41/193 cut-off events. [2019-12-18 20:27:17,253 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 20:27:17,262 INFO L76 FinitePrefix]: Finished finitePrefix Result has 203 conditions, 193 events. 41/193 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 439 event pairs. 9/159 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-18 20:27:17,283 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 16696 [2019-12-18 20:27:17,284 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-18 20:27:21,117 WARN L192 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 91 [2019-12-18 20:27:21,238 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-12-18 20:27:21,319 INFO L206 etLargeBlockEncoding]: Checked pairs total: 79642 [2019-12-18 20:27:21,320 INFO L214 etLargeBlockEncoding]: Total number of compositions: 111 [2019-12-18 20:27:21,323 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 85 places, 94 transitions [2019-12-18 20:27:35,259 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 95102 states. [2019-12-18 20:27:35,260 INFO L276 IsEmpty]: Start isEmpty. Operand 95102 states. [2019-12-18 20:27:35,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-18 20:27:35,267 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:27:35,268 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-18 20:27:35,269 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:27:35,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:27:35,275 INFO L82 PathProgramCache]: Analyzing trace with hash 797531429, now seen corresponding path program 1 times [2019-12-18 20:27:35,291 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:27:35,292 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821629423] [2019-12-18 20:27:35,292 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:27:35,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:27:35,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:27:35,517 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821629423] [2019-12-18 20:27:35,520 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:27:35,520 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 20:27:35,521 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444303507] [2019-12-18 20:27:35,526 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:27:35,527 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:27:35,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:27:35,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:27:35,545 INFO L87 Difference]: Start difference. First operand 95102 states. Second operand 3 states. [2019-12-18 20:27:37,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:27:37,322 INFO L93 Difference]: Finished difference Result 93264 states and 402387 transitions. [2019-12-18 20:27:37,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:27:37,325 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-18 20:27:37,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:27:37,949 INFO L225 Difference]: With dead ends: 93264 [2019-12-18 20:27:37,949 INFO L226 Difference]: Without dead ends: 87384 [2019-12-18 20:27:37,950 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:27:43,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87384 states. [2019-12-18 20:27:48,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87384 to 87384. [2019-12-18 20:27:48,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87384 states. [2019-12-18 20:27:48,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87384 states to 87384 states and 376487 transitions. [2019-12-18 20:27:48,850 INFO L78 Accepts]: Start accepts. Automaton has 87384 states and 376487 transitions. Word has length 5 [2019-12-18 20:27:48,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:27:48,851 INFO L462 AbstractCegarLoop]: Abstraction has 87384 states and 376487 transitions. [2019-12-18 20:27:48,851 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:27:48,851 INFO L276 IsEmpty]: Start isEmpty. Operand 87384 states and 376487 transitions. [2019-12-18 20:27:48,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 20:27:48,860 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:27:48,860 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:27:48,861 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:27:48,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:27:48,861 INFO L82 PathProgramCache]: Analyzing trace with hash 429489199, now seen corresponding path program 1 times [2019-12-18 20:27:48,862 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:27:48,862 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592197278] [2019-12-18 20:27:48,862 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:27:48,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:27:48,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:27:48,955 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592197278] [2019-12-18 20:27:48,955 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:27:48,955 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 20:27:48,955 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385225149] [2019-12-18 20:27:48,957 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:27:48,957 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:27:48,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:27:48,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:27:48,958 INFO L87 Difference]: Start difference. First operand 87384 states and 376487 transitions. Second operand 3 states. [2019-12-18 20:27:49,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:27:49,264 INFO L93 Difference]: Finished difference Result 22591 states and 78202 transitions. [2019-12-18 20:27:49,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:27:49,264 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-18 20:27:49,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:27:49,331 INFO L225 Difference]: With dead ends: 22591 [2019-12-18 20:27:49,331 INFO L226 Difference]: Without dead ends: 22591 [2019-12-18 20:27:49,333 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:27:49,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22591 states. [2019-12-18 20:27:50,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22591 to 22591. [2019-12-18 20:27:50,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22591 states. [2019-12-18 20:27:50,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22591 states to 22591 states and 78202 transitions. [2019-12-18 20:27:50,588 INFO L78 Accepts]: Start accepts. Automaton has 22591 states and 78202 transitions. Word has length 13 [2019-12-18 20:27:50,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:27:50,589 INFO L462 AbstractCegarLoop]: Abstraction has 22591 states and 78202 transitions. [2019-12-18 20:27:50,589 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:27:50,589 INFO L276 IsEmpty]: Start isEmpty. Operand 22591 states and 78202 transitions. [2019-12-18 20:27:50,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 20:27:50,590 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:27:50,590 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:27:50,591 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:27:50,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:27:50,591 INFO L82 PathProgramCache]: Analyzing trace with hash 1420519725, now seen corresponding path program 1 times [2019-12-18 20:27:50,591 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:27:50,591 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106109147] [2019-12-18 20:27:50,591 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:27:50,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:27:50,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:27:50,672 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106109147] [2019-12-18 20:27:50,672 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:27:50,673 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 20:27:50,674 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67931669] [2019-12-18 20:27:50,675 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 20:27:50,675 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:27:50,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 20:27:50,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 20:27:50,675 INFO L87 Difference]: Start difference. First operand 22591 states and 78202 transitions. Second operand 4 states. [2019-12-18 20:27:51,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:27:51,032 INFO L93 Difference]: Finished difference Result 33180 states and 110963 transitions. [2019-12-18 20:27:51,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 20:27:51,033 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-18 20:27:51,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:27:51,177 INFO L225 Difference]: With dead ends: 33180 [2019-12-18 20:27:51,178 INFO L226 Difference]: Without dead ends: 33166 [2019-12-18 20:27:51,178 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 20:27:51,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33166 states. [2019-12-18 20:27:51,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33166 to 29831. [2019-12-18 20:27:51,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29831 states. [2019-12-18 20:27:52,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29831 states to 29831 states and 100864 transitions. [2019-12-18 20:27:52,066 INFO L78 Accepts]: Start accepts. Automaton has 29831 states and 100864 transitions. Word has length 13 [2019-12-18 20:27:52,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:27:52,067 INFO L462 AbstractCegarLoop]: Abstraction has 29831 states and 100864 transitions. [2019-12-18 20:27:52,067 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 20:27:52,067 INFO L276 IsEmpty]: Start isEmpty. Operand 29831 states and 100864 transitions. [2019-12-18 20:27:52,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 20:27:52,069 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:27:52,069 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:27:52,069 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:27:52,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:27:52,069 INFO L82 PathProgramCache]: Analyzing trace with hash 839242224, now seen corresponding path program 1 times [2019-12-18 20:27:52,069 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:27:52,070 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860198539] [2019-12-18 20:27:52,070 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:27:52,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:27:52,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:27:52,159 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860198539] [2019-12-18 20:27:52,159 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:27:52,159 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 20:27:52,160 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653485089] [2019-12-18 20:27:52,160 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 20:27:52,160 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:27:52,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 20:27:52,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 20:27:52,164 INFO L87 Difference]: Start difference. First operand 29831 states and 100864 transitions. Second operand 5 states. [2019-12-18 20:27:54,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:27:54,041 INFO L93 Difference]: Finished difference Result 42454 states and 141193 transitions. [2019-12-18 20:27:54,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 20:27:54,042 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-18 20:27:54,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:27:54,161 INFO L225 Difference]: With dead ends: 42454 [2019-12-18 20:27:54,162 INFO L226 Difference]: Without dead ends: 42438 [2019-12-18 20:27:54,162 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 20:27:54,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42438 states. [2019-12-18 20:27:55,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42438 to 34354. [2019-12-18 20:27:55,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34354 states. [2019-12-18 20:27:55,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34354 states to 34354 states and 115309 transitions. [2019-12-18 20:27:55,287 INFO L78 Accepts]: Start accepts. Automaton has 34354 states and 115309 transitions. Word has length 14 [2019-12-18 20:27:55,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:27:55,288 INFO L462 AbstractCegarLoop]: Abstraction has 34354 states and 115309 transitions. [2019-12-18 20:27:55,288 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 20:27:55,288 INFO L276 IsEmpty]: Start isEmpty. Operand 34354 states and 115309 transitions. [2019-12-18 20:27:55,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 20:27:55,300 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:27:55,301 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:27:55,301 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:27:55,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:27:55,301 INFO L82 PathProgramCache]: Analyzing trace with hash 1523113448, now seen corresponding path program 1 times [2019-12-18 20:27:55,302 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:27:55,302 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989882689] [2019-12-18 20:27:55,302 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:27:55,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:27:55,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:27:55,412 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989882689] [2019-12-18 20:27:55,413 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:27:55,413 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 20:27:55,413 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984168712] [2019-12-18 20:27:55,413 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 20:27:55,414 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:27:55,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 20:27:55,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 20:27:55,415 INFO L87 Difference]: Start difference. First operand 34354 states and 115309 transitions. Second operand 6 states. [2019-12-18 20:27:56,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:27:56,710 INFO L93 Difference]: Finished difference Result 51152 states and 167895 transitions. [2019-12-18 20:27:56,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 20:27:56,711 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-18 20:27:56,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:27:56,834 INFO L225 Difference]: With dead ends: 51152 [2019-12-18 20:27:56,835 INFO L226 Difference]: Without dead ends: 51124 [2019-12-18 20:27:56,835 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-18 20:27:57,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51124 states. [2019-12-18 20:27:57,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51124 to 34880. [2019-12-18 20:27:57,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34880 states. [2019-12-18 20:27:57,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34880 states to 34880 states and 116186 transitions. [2019-12-18 20:27:57,858 INFO L78 Accepts]: Start accepts. Automaton has 34880 states and 116186 transitions. Word has length 22 [2019-12-18 20:27:57,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:27:57,859 INFO L462 AbstractCegarLoop]: Abstraction has 34880 states and 116186 transitions. [2019-12-18 20:27:57,859 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 20:27:57,859 INFO L276 IsEmpty]: Start isEmpty. Operand 34880 states and 116186 transitions. [2019-12-18 20:27:57,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 20:27:57,876 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:27:57,876 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:27:57,876 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:27:57,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:27:57,877 INFO L82 PathProgramCache]: Analyzing trace with hash 142007166, now seen corresponding path program 1 times [2019-12-18 20:27:57,877 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:27:57,877 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94623526] [2019-12-18 20:27:57,877 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:27:57,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:27:57,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:27:57,952 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94623526] [2019-12-18 20:27:57,953 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:27:57,953 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 20:27:57,953 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708888330] [2019-12-18 20:27:57,954 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 20:27:57,955 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:27:57,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 20:27:57,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 20:27:57,956 INFO L87 Difference]: Start difference. First operand 34880 states and 116186 transitions. Second operand 4 states. [2019-12-18 20:27:58,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:27:58,040 INFO L93 Difference]: Finished difference Result 13858 states and 42891 transitions. [2019-12-18 20:27:58,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 20:27:58,040 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-18 20:27:58,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:27:58,066 INFO L225 Difference]: With dead ends: 13858 [2019-12-18 20:27:58,067 INFO L226 Difference]: Without dead ends: 13858 [2019-12-18 20:27:58,067 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 20:27:58,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13858 states. [2019-12-18 20:27:58,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13858 to 13658. [2019-12-18 20:27:58,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13658 states. [2019-12-18 20:27:58,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13658 states to 13658 states and 42311 transitions. [2019-12-18 20:27:58,593 INFO L78 Accepts]: Start accepts. Automaton has 13658 states and 42311 transitions. Word has length 25 [2019-12-18 20:27:58,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:27:58,594 INFO L462 AbstractCegarLoop]: Abstraction has 13658 states and 42311 transitions. [2019-12-18 20:27:58,594 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 20:27:58,594 INFO L276 IsEmpty]: Start isEmpty. Operand 13658 states and 42311 transitions. [2019-12-18 20:27:58,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-18 20:27:58,614 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:27:58,614 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:27:58,614 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:27:58,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:27:58,614 INFO L82 PathProgramCache]: Analyzing trace with hash 1724321301, now seen corresponding path program 1 times [2019-12-18 20:27:58,614 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:27:58,615 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305908504] [2019-12-18 20:27:58,615 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:27:58,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:27:58,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:27:58,734 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305908504] [2019-12-18 20:27:58,734 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:27:58,734 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 20:27:58,734 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756830883] [2019-12-18 20:27:58,735 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 20:27:58,735 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:27:58,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 20:27:58,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 20:27:58,736 INFO L87 Difference]: Start difference. First operand 13658 states and 42311 transitions. Second operand 5 states. [2019-12-18 20:27:59,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:27:59,270 INFO L93 Difference]: Finished difference Result 19447 states and 59645 transitions. [2019-12-18 20:27:59,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 20:27:59,271 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2019-12-18 20:27:59,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:27:59,307 INFO L225 Difference]: With dead ends: 19447 [2019-12-18 20:27:59,307 INFO L226 Difference]: Without dead ends: 19447 [2019-12-18 20:27:59,307 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-18 20:27:59,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19447 states. [2019-12-18 20:27:59,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19447 to 17858. [2019-12-18 20:27:59,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17858 states. [2019-12-18 20:27:59,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17858 states to 17858 states and 55181 transitions. [2019-12-18 20:27:59,608 INFO L78 Accepts]: Start accepts. Automaton has 17858 states and 55181 transitions. Word has length 39 [2019-12-18 20:27:59,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:27:59,608 INFO L462 AbstractCegarLoop]: Abstraction has 17858 states and 55181 transitions. [2019-12-18 20:27:59,608 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 20:27:59,609 INFO L276 IsEmpty]: Start isEmpty. Operand 17858 states and 55181 transitions. [2019-12-18 20:27:59,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-18 20:27:59,635 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:27:59,635 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:27:59,635 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:27:59,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:27:59,636 INFO L82 PathProgramCache]: Analyzing trace with hash 1837073981, now seen corresponding path program 2 times [2019-12-18 20:27:59,636 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:27:59,636 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746266345] [2019-12-18 20:27:59,636 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:27:59,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:27:59,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:27:59,752 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746266345] [2019-12-18 20:27:59,752 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:27:59,752 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 20:27:59,753 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920469069] [2019-12-18 20:27:59,753 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 20:27:59,753 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:27:59,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 20:27:59,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 20:27:59,754 INFO L87 Difference]: Start difference. First operand 17858 states and 55181 transitions. Second operand 6 states. [2019-12-18 20:28:00,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:28:00,541 INFO L93 Difference]: Finished difference Result 31341 states and 96616 transitions. [2019-12-18 20:28:00,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 20:28:00,541 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 39 [2019-12-18 20:28:00,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:28:00,594 INFO L225 Difference]: With dead ends: 31341 [2019-12-18 20:28:00,594 INFO L226 Difference]: Without dead ends: 31341 [2019-12-18 20:28:00,594 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 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-18 20:28:00,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31341 states. [2019-12-18 20:28:01,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31341 to 20012. [2019-12-18 20:28:01,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20012 states. [2019-12-18 20:28:01,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20012 states to 20012 states and 62050 transitions. [2019-12-18 20:28:01,187 INFO L78 Accepts]: Start accepts. Automaton has 20012 states and 62050 transitions. Word has length 39 [2019-12-18 20:28:01,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:28:01,187 INFO L462 AbstractCegarLoop]: Abstraction has 20012 states and 62050 transitions. [2019-12-18 20:28:01,187 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 20:28:01,188 INFO L276 IsEmpty]: Start isEmpty. Operand 20012 states and 62050 transitions. [2019-12-18 20:28:01,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-18 20:28:01,215 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:28:01,216 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:28:01,216 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:28:01,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:28:01,216 INFO L82 PathProgramCache]: Analyzing trace with hash 6353365, now seen corresponding path program 3 times [2019-12-18 20:28:01,216 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:28:01,216 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291392060] [2019-12-18 20:28:01,217 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:28:01,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:28:01,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:28:01,288 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291392060] [2019-12-18 20:28:01,288 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:28:01,288 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 20:28:01,288 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721416328] [2019-12-18 20:28:01,289 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 20:28:01,289 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:28:01,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 20:28:01,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 20:28:01,290 INFO L87 Difference]: Start difference. First operand 20012 states and 62050 transitions. Second operand 5 states. [2019-12-18 20:28:01,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:28:01,399 INFO L93 Difference]: Finished difference Result 18617 states and 58435 transitions. [2019-12-18 20:28:01,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 20:28:01,400 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2019-12-18 20:28:01,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:28:01,439 INFO L225 Difference]: With dead ends: 18617 [2019-12-18 20:28:01,439 INFO L226 Difference]: Without dead ends: 18617 [2019-12-18 20:28:01,440 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 20:28:01,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18617 states. [2019-12-18 20:28:01,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18617 to 17831. [2019-12-18 20:28:01,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17831 states. [2019-12-18 20:28:01,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17831 states to 17831 states and 56225 transitions. [2019-12-18 20:28:01,800 INFO L78 Accepts]: Start accepts. Automaton has 17831 states and 56225 transitions. Word has length 39 [2019-12-18 20:28:01,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:28:01,800 INFO L462 AbstractCegarLoop]: Abstraction has 17831 states and 56225 transitions. [2019-12-18 20:28:01,801 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 20:28:01,801 INFO L276 IsEmpty]: Start isEmpty. Operand 17831 states and 56225 transitions. [2019-12-18 20:28:01,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 20:28:01,820 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:28:01,820 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] [2019-12-18 20:28:01,820 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:28:01,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:28:01,821 INFO L82 PathProgramCache]: Analyzing trace with hash 1406487866, now seen corresponding path program 1 times [2019-12-18 20:28:01,821 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:28:01,821 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984020077] [2019-12-18 20:28:01,822 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:28:01,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:28:01,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:28:01,890 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984020077] [2019-12-18 20:28:01,890 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:28:01,891 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 20:28:01,891 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286123397] [2019-12-18 20:28:01,891 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:28:01,891 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:28:01,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:28:01,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:28:01,893 INFO L87 Difference]: Start difference. First operand 17831 states and 56225 transitions. Second operand 3 states. [2019-12-18 20:28:02,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:28:02,031 INFO L93 Difference]: Finished difference Result 24291 states and 75109 transitions. [2019-12-18 20:28:02,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:28:02,032 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-12-18 20:28:02,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:28:02,090 INFO L225 Difference]: With dead ends: 24291 [2019-12-18 20:28:02,090 INFO L226 Difference]: Without dead ends: 24291 [2019-12-18 20:28:02,090 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:28:02,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24291 states. [2019-12-18 20:28:02,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24291 to 19459. [2019-12-18 20:28:02,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19459 states. [2019-12-18 20:28:02,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19459 states to 19459 states and 61100 transitions. [2019-12-18 20:28:02,437 INFO L78 Accepts]: Start accepts. Automaton has 19459 states and 61100 transitions. Word has length 54 [2019-12-18 20:28:02,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:28:02,438 INFO L462 AbstractCegarLoop]: Abstraction has 19459 states and 61100 transitions. [2019-12-18 20:28:02,438 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:28:02,438 INFO L276 IsEmpty]: Start isEmpty. Operand 19459 states and 61100 transitions. [2019-12-18 20:28:02,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 20:28:02,457 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:28:02,458 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] [2019-12-18 20:28:02,458 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:28:02,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:28:02,458 INFO L82 PathProgramCache]: Analyzing trace with hash 370887878, now seen corresponding path program 1 times [2019-12-18 20:28:02,458 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:28:02,458 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494084511] [2019-12-18 20:28:02,459 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:28:02,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:28:02,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:28:02,534 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494084511] [2019-12-18 20:28:02,534 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:28:02,535 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 20:28:02,535 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601259718] [2019-12-18 20:28:02,535 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 20:28:02,535 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:28:02,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 20:28:02,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 20:28:02,536 INFO L87 Difference]: Start difference. First operand 19459 states and 61100 transitions. Second operand 4 states. [2019-12-18 20:28:02,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:28:02,880 INFO L93 Difference]: Finished difference Result 35122 states and 110454 transitions. [2019-12-18 20:28:02,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 20:28:02,881 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2019-12-18 20:28:02,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:28:02,913 INFO L225 Difference]: With dead ends: 35122 [2019-12-18 20:28:02,913 INFO L226 Difference]: Without dead ends: 16244 [2019-12-18 20:28:02,914 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 20:28:02,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16244 states. [2019-12-18 20:28:03,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16244 to 16244. [2019-12-18 20:28:03,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16244 states. [2019-12-18 20:28:03,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16244 states to 16244 states and 50964 transitions. [2019-12-18 20:28:03,189 INFO L78 Accepts]: Start accepts. Automaton has 16244 states and 50964 transitions. Word has length 54 [2019-12-18 20:28:03,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:28:03,189 INFO L462 AbstractCegarLoop]: Abstraction has 16244 states and 50964 transitions. [2019-12-18 20:28:03,189 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 20:28:03,189 INFO L276 IsEmpty]: Start isEmpty. Operand 16244 states and 50964 transitions. [2019-12-18 20:28:03,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 20:28:03,211 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:28:03,211 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] [2019-12-18 20:28:03,211 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:28:03,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:28:03,211 INFO L82 PathProgramCache]: Analyzing trace with hash 81413032, now seen corresponding path program 2 times [2019-12-18 20:28:03,211 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:28:03,212 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638548523] [2019-12-18 20:28:03,212 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:28:03,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:28:03,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:28:03,300 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638548523] [2019-12-18 20:28:03,300 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:28:03,301 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 20:28:03,301 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298162561] [2019-12-18 20:28:03,301 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 20:28:03,301 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:28:03,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 20:28:03,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 20:28:03,302 INFO L87 Difference]: Start difference. First operand 16244 states and 50964 transitions. Second operand 7 states. [2019-12-18 20:28:03,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:28:03,760 INFO L93 Difference]: Finished difference Result 42775 states and 132645 transitions. [2019-12-18 20:28:03,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 20:28:03,761 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-12-18 20:28:03,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:28:03,806 INFO L225 Difference]: With dead ends: 42775 [2019-12-18 20:28:03,806 INFO L226 Difference]: Without dead ends: 32484 [2019-12-18 20:28:03,806 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-18 20:28:03,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32484 states. [2019-12-18 20:28:04,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32484 to 19504. [2019-12-18 20:28:04,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19504 states. [2019-12-18 20:28:04,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19504 states to 19504 states and 61010 transitions. [2019-12-18 20:28:04,200 INFO L78 Accepts]: Start accepts. Automaton has 19504 states and 61010 transitions. Word has length 54 [2019-12-18 20:28:04,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:28:04,201 INFO L462 AbstractCegarLoop]: Abstraction has 19504 states and 61010 transitions. [2019-12-18 20:28:04,201 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 20:28:04,201 INFO L276 IsEmpty]: Start isEmpty. Operand 19504 states and 61010 transitions. [2019-12-18 20:28:04,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 20:28:04,229 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:28:04,230 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] [2019-12-18 20:28:04,230 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:28:04,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:28:04,230 INFO L82 PathProgramCache]: Analyzing trace with hash 990041374, now seen corresponding path program 3 times [2019-12-18 20:28:04,230 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:28:04,230 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411434291] [2019-12-18 20:28:04,231 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:28:04,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:28:04,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:28:04,316 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411434291] [2019-12-18 20:28:04,316 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:28:04,316 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 20:28:04,317 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491696652] [2019-12-18 20:28:04,317 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 20:28:04,317 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:28:04,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 20:28:04,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 20:28:04,318 INFO L87 Difference]: Start difference. First operand 19504 states and 61010 transitions. Second operand 7 states. [2019-12-18 20:28:04,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:28:04,758 INFO L93 Difference]: Finished difference Result 47348 states and 144938 transitions. [2019-12-18 20:28:04,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 20:28:04,758 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-12-18 20:28:04,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:28:04,810 INFO L225 Difference]: With dead ends: 47348 [2019-12-18 20:28:04,810 INFO L226 Difference]: Without dead ends: 33931 [2019-12-18 20:28:04,811 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-18 20:28:04,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33931 states. [2019-12-18 20:28:05,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33931 to 22584. [2019-12-18 20:28:05,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22584 states. [2019-12-18 20:28:05,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22584 states to 22584 states and 70219 transitions. [2019-12-18 20:28:05,483 INFO L78 Accepts]: Start accepts. Automaton has 22584 states and 70219 transitions. Word has length 54 [2019-12-18 20:28:05,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:28:05,484 INFO L462 AbstractCegarLoop]: Abstraction has 22584 states and 70219 transitions. [2019-12-18 20:28:05,484 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 20:28:05,484 INFO L276 IsEmpty]: Start isEmpty. Operand 22584 states and 70219 transitions. [2019-12-18 20:28:05,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 20:28:05,509 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:28:05,509 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] [2019-12-18 20:28:05,510 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:28:05,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:28:05,510 INFO L82 PathProgramCache]: Analyzing trace with hash 1620768744, now seen corresponding path program 4 times [2019-12-18 20:28:05,510 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:28:05,510 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529431811] [2019-12-18 20:28:05,510 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:28:05,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:28:05,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:28:05,590 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529431811] [2019-12-18 20:28:05,590 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:28:05,591 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 20:28:05,591 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175195096] [2019-12-18 20:28:05,591 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 20:28:05,591 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:28:05,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 20:28:05,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 20:28:05,592 INFO L87 Difference]: Start difference. First operand 22584 states and 70219 transitions. Second operand 7 states. [2019-12-18 20:28:05,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:28:05,993 INFO L93 Difference]: Finished difference Result 40795 states and 124041 transitions. [2019-12-18 20:28:05,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-18 20:28:05,994 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-12-18 20:28:05,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:28:06,046 INFO L225 Difference]: With dead ends: 40795 [2019-12-18 20:28:06,046 INFO L226 Difference]: Without dead ends: 38247 [2019-12-18 20:28:06,047 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2019-12-18 20:28:06,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38247 states. [2019-12-18 20:28:06,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38247 to 22729. [2019-12-18 20:28:06,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22729 states. [2019-12-18 20:28:06,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22729 states to 22729 states and 70717 transitions. [2019-12-18 20:28:06,529 INFO L78 Accepts]: Start accepts. Automaton has 22729 states and 70717 transitions. Word has length 54 [2019-12-18 20:28:06,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:28:06,529 INFO L462 AbstractCegarLoop]: Abstraction has 22729 states and 70717 transitions. [2019-12-18 20:28:06,529 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 20:28:06,530 INFO L276 IsEmpty]: Start isEmpty. Operand 22729 states and 70717 transitions. [2019-12-18 20:28:06,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 20:28:06,552 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:28:06,552 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] [2019-12-18 20:28:06,552 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:28:06,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:28:06,552 INFO L82 PathProgramCache]: Analyzing trace with hash -1685739649, now seen corresponding path program 1 times [2019-12-18 20:28:06,552 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:28:06,552 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832806006] [2019-12-18 20:28:06,553 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:28:06,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:28:06,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:28:06,597 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832806006] [2019-12-18 20:28:06,597 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:28:06,597 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 20:28:06,597 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084117657] [2019-12-18 20:28:06,598 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:28:06,598 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:28:06,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:28:06,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:28:06,598 INFO L87 Difference]: Start difference. First operand 22729 states and 70717 transitions. Second operand 3 states. [2019-12-18 20:28:06,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:28:06,734 INFO L93 Difference]: Finished difference Result 24263 states and 72825 transitions. [2019-12-18 20:28:06,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:28:06,734 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-12-18 20:28:06,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:28:06,786 INFO L225 Difference]: With dead ends: 24263 [2019-12-18 20:28:06,787 INFO L226 Difference]: Without dead ends: 24263 [2019-12-18 20:28:06,787 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:28:06,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24263 states. [2019-12-18 20:28:07,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24263 to 22729. [2019-12-18 20:28:07,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22729 states. [2019-12-18 20:28:07,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22729 states to 22729 states and 68338 transitions. [2019-12-18 20:28:07,531 INFO L78 Accepts]: Start accepts. Automaton has 22729 states and 68338 transitions. Word has length 54 [2019-12-18 20:28:07,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:28:07,531 INFO L462 AbstractCegarLoop]: Abstraction has 22729 states and 68338 transitions. [2019-12-18 20:28:07,531 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:28:07,531 INFO L276 IsEmpty]: Start isEmpty. Operand 22729 states and 68338 transitions. [2019-12-18 20:28:07,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 20:28:07,553 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:28:07,553 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] [2019-12-18 20:28:07,553 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:28:07,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:28:07,553 INFO L82 PathProgramCache]: Analyzing trace with hash 1519494854, now seen corresponding path program 5 times [2019-12-18 20:28:07,553 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:28:07,553 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641200074] [2019-12-18 20:28:07,554 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:28:07,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:28:07,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:28:07,647 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641200074] [2019-12-18 20:28:07,647 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:28:07,647 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 20:28:07,647 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070552190] [2019-12-18 20:28:07,648 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 20:28:07,648 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:28:07,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 20:28:07,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 20:28:07,648 INFO L87 Difference]: Start difference. First operand 22729 states and 68338 transitions. Second operand 7 states. [2019-12-18 20:28:08,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:28:08,738 INFO L93 Difference]: Finished difference Result 32390 states and 94875 transitions. [2019-12-18 20:28:08,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-18 20:28:08,739 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-12-18 20:28:08,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:28:08,781 INFO L225 Difference]: With dead ends: 32390 [2019-12-18 20:28:08,781 INFO L226 Difference]: Without dead ends: 32390 [2019-12-18 20:28:08,782 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2019-12-18 20:28:08,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32390 states. [2019-12-18 20:28:09,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32390 to 24018. [2019-12-18 20:28:09,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24018 states. [2019-12-18 20:28:09,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24018 states to 24018 states and 71916 transitions. [2019-12-18 20:28:09,213 INFO L78 Accepts]: Start accepts. Automaton has 24018 states and 71916 transitions. Word has length 54 [2019-12-18 20:28:09,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:28:09,213 INFO L462 AbstractCegarLoop]: Abstraction has 24018 states and 71916 transitions. [2019-12-18 20:28:09,213 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 20:28:09,213 INFO L276 IsEmpty]: Start isEmpty. Operand 24018 states and 71916 transitions. [2019-12-18 20:28:09,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 20:28:09,239 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:28:09,239 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] [2019-12-18 20:28:09,239 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:28:09,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:28:09,239 INFO L82 PathProgramCache]: Analyzing trace with hash -531095546, now seen corresponding path program 6 times [2019-12-18 20:28:09,239 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:28:09,240 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455984923] [2019-12-18 20:28:09,240 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:28:09,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:28:09,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:28:09,358 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455984923] [2019-12-18 20:28:09,359 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:28:09,359 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 20:28:09,359 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051860048] [2019-12-18 20:28:09,360 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 20:28:09,360 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:28:09,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 20:28:09,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-18 20:28:09,361 INFO L87 Difference]: Start difference. First operand 24018 states and 71916 transitions. Second operand 8 states. [2019-12-18 20:28:10,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:28:10,832 INFO L93 Difference]: Finished difference Result 39849 states and 117644 transitions. [2019-12-18 20:28:10,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-18 20:28:10,833 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 54 [2019-12-18 20:28:10,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:28:10,887 INFO L225 Difference]: With dead ends: 39849 [2019-12-18 20:28:10,887 INFO L226 Difference]: Without dead ends: 39849 [2019-12-18 20:28:10,888 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=99, Invalid=321, Unknown=0, NotChecked=0, Total=420 [2019-12-18 20:28:11,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39849 states. [2019-12-18 20:28:11,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39849 to 22497. [2019-12-18 20:28:11,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22497 states. [2019-12-18 20:28:11,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22497 states to 22497 states and 67511 transitions. [2019-12-18 20:28:11,552 INFO L78 Accepts]: Start accepts. Automaton has 22497 states and 67511 transitions. Word has length 54 [2019-12-18 20:28:11,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:28:11,552 INFO L462 AbstractCegarLoop]: Abstraction has 22497 states and 67511 transitions. [2019-12-18 20:28:11,552 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 20:28:11,552 INFO L276 IsEmpty]: Start isEmpty. Operand 22497 states and 67511 transitions. [2019-12-18 20:28:11,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 20:28:11,576 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:28:11,576 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] [2019-12-18 20:28:11,577 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:28:11,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:28:11,577 INFO L82 PathProgramCache]: Analyzing trace with hash 1105712334, now seen corresponding path program 7 times [2019-12-18 20:28:11,577 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:28:11,577 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302421906] [2019-12-18 20:28:11,577 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:28:11,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:28:11,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:28:11,638 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302421906] [2019-12-18 20:28:11,638 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:28:11,639 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 20:28:11,639 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973472523] [2019-12-18 20:28:11,639 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:28:11,639 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:28:11,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:28:11,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:28:11,640 INFO L87 Difference]: Start difference. First operand 22497 states and 67511 transitions. Second operand 3 states. [2019-12-18 20:28:11,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:28:11,733 INFO L93 Difference]: Finished difference Result 22497 states and 67509 transitions. [2019-12-18 20:28:11,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:28:11,734 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-12-18 20:28:11,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:28:11,772 INFO L225 Difference]: With dead ends: 22497 [2019-12-18 20:28:11,772 INFO L226 Difference]: Without dead ends: 22497 [2019-12-18 20:28:11,772 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:28:11,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22497 states. [2019-12-18 20:28:12,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22497 to 18304. [2019-12-18 20:28:12,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18304 states. [2019-12-18 20:28:12,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18304 states to 18304 states and 56103 transitions. [2019-12-18 20:28:12,122 INFO L78 Accepts]: Start accepts. Automaton has 18304 states and 56103 transitions. Word has length 54 [2019-12-18 20:28:12,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:28:12,122 INFO L462 AbstractCegarLoop]: Abstraction has 18304 states and 56103 transitions. [2019-12-18 20:28:12,122 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:28:12,122 INFO L276 IsEmpty]: Start isEmpty. Operand 18304 states and 56103 transitions. [2019-12-18 20:28:12,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 20:28:12,145 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:28:12,145 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] [2019-12-18 20:28:12,145 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:28:12,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:28:12,145 INFO L82 PathProgramCache]: Analyzing trace with hash -1839404346, now seen corresponding path program 1 times [2019-12-18 20:28:12,146 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:28:12,146 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585560671] [2019-12-18 20:28:12,146 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:28:12,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:28:12,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:28:12,226 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585560671] [2019-12-18 20:28:12,226 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:28:12,226 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 20:28:12,226 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939909673] [2019-12-18 20:28:12,227 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:28:12,227 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:28:12,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:28:12,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:28:12,227 INFO L87 Difference]: Start difference. First operand 18304 states and 56103 transitions. Second operand 3 states. [2019-12-18 20:28:12,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:28:12,293 INFO L93 Difference]: Finished difference Result 13851 states and 41687 transitions. [2019-12-18 20:28:12,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:28:12,293 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-18 20:28:12,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:28:12,316 INFO L225 Difference]: With dead ends: 13851 [2019-12-18 20:28:12,317 INFO L226 Difference]: Without dead ends: 13851 [2019-12-18 20:28:12,317 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:28:12,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13851 states. [2019-12-18 20:28:12,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13851 to 13112. [2019-12-18 20:28:12,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13112 states. [2019-12-18 20:28:12,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13112 states to 13112 states and 39476 transitions. [2019-12-18 20:28:12,621 INFO L78 Accepts]: Start accepts. Automaton has 13112 states and 39476 transitions. Word has length 55 [2019-12-18 20:28:12,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:28:12,622 INFO L462 AbstractCegarLoop]: Abstraction has 13112 states and 39476 transitions. [2019-12-18 20:28:12,622 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:28:12,622 INFO L276 IsEmpty]: Start isEmpty. Operand 13112 states and 39476 transitions. [2019-12-18 20:28:12,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 20:28:12,642 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:28:12,642 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] [2019-12-18 20:28:12,642 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:28:12,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:28:12,643 INFO L82 PathProgramCache]: Analyzing trace with hash 159664107, now seen corresponding path program 1 times [2019-12-18 20:28:12,643 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:28:12,643 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277973096] [2019-12-18 20:28:12,643 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:28:12,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:28:12,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:28:12,742 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277973096] [2019-12-18 20:28:12,742 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:28:12,742 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 20:28:12,743 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076153726] [2019-12-18 20:28:12,743 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 20:28:12,744 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:28:12,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 20:28:12,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-18 20:28:12,744 INFO L87 Difference]: Start difference. First operand 13112 states and 39476 transitions. Second operand 8 states. [2019-12-18 20:28:13,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:28:13,809 INFO L93 Difference]: Finished difference Result 25116 states and 75005 transitions. [2019-12-18 20:28:13,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 20:28:13,809 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 56 [2019-12-18 20:28:13,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:28:14,039 INFO L225 Difference]: With dead ends: 25116 [2019-12-18 20:28:14,039 INFO L226 Difference]: Without dead ends: 20175 [2019-12-18 20:28:14,039 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2019-12-18 20:28:14,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20175 states. [2019-12-18 20:28:14,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20175 to 13718. [2019-12-18 20:28:14,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13718 states. [2019-12-18 20:28:14,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13718 states to 13718 states and 40912 transitions. [2019-12-18 20:28:14,291 INFO L78 Accepts]: Start accepts. Automaton has 13718 states and 40912 transitions. Word has length 56 [2019-12-18 20:28:14,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:28:14,291 INFO L462 AbstractCegarLoop]: Abstraction has 13718 states and 40912 transitions. [2019-12-18 20:28:14,292 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 20:28:14,292 INFO L276 IsEmpty]: Start isEmpty. Operand 13718 states and 40912 transitions. [2019-12-18 20:28:14,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 20:28:14,305 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:28:14,305 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] [2019-12-18 20:28:14,305 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:28:14,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:28:14,305 INFO L82 PathProgramCache]: Analyzing trace with hash 806764797, now seen corresponding path program 2 times [2019-12-18 20:28:14,306 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:28:14,306 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446547973] [2019-12-18 20:28:14,306 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:28:14,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:28:14,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:28:14,411 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446547973] [2019-12-18 20:28:14,411 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:28:14,411 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 20:28:14,411 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614873479] [2019-12-18 20:28:14,412 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 20:28:14,412 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:28:14,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 20:28:14,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-18 20:28:14,413 INFO L87 Difference]: Start difference. First operand 13718 states and 40912 transitions. Second operand 9 states. [2019-12-18 20:28:15,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:28:15,574 INFO L93 Difference]: Finished difference Result 23342 states and 69188 transitions. [2019-12-18 20:28:15,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 20:28:15,575 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 56 [2019-12-18 20:28:15,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:28:15,602 INFO L225 Difference]: With dead ends: 23342 [2019-12-18 20:28:15,602 INFO L226 Difference]: Without dead ends: 19743 [2019-12-18 20:28:15,603 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2019-12-18 20:28:15,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19743 states. [2019-12-18 20:28:15,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19743 to 13550. [2019-12-18 20:28:15,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13550 states. [2019-12-18 20:28:15,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13550 states to 13550 states and 40388 transitions. [2019-12-18 20:28:15,847 INFO L78 Accepts]: Start accepts. Automaton has 13550 states and 40388 transitions. Word has length 56 [2019-12-18 20:28:15,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:28:15,847 INFO L462 AbstractCegarLoop]: Abstraction has 13550 states and 40388 transitions. [2019-12-18 20:28:15,847 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 20:28:15,848 INFO L276 IsEmpty]: Start isEmpty. Operand 13550 states and 40388 transitions. [2019-12-18 20:28:15,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 20:28:15,862 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:28:15,862 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] [2019-12-18 20:28:15,862 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:28:15,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:28:15,862 INFO L82 PathProgramCache]: Analyzing trace with hash 1852085971, now seen corresponding path program 3 times [2019-12-18 20:28:15,862 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:28:15,863 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236140012] [2019-12-18 20:28:15,863 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:28:15,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:28:16,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:28:16,031 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236140012] [2019-12-18 20:28:16,032 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:28:16,032 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 20:28:16,032 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238743175] [2019-12-18 20:28:16,032 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 20:28:16,033 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:28:16,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 20:28:16,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-18 20:28:16,033 INFO L87 Difference]: Start difference. First operand 13550 states and 40388 transitions. Second operand 10 states. [2019-12-18 20:28:16,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:28:16,988 INFO L93 Difference]: Finished difference Result 26141 states and 77392 transitions. [2019-12-18 20:28:16,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-18 20:28:16,989 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 56 [2019-12-18 20:28:16,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:28:17,027 INFO L225 Difference]: With dead ends: 26141 [2019-12-18 20:28:17,027 INFO L226 Difference]: Without dead ends: 25575 [2019-12-18 20:28:17,028 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=152, Invalid=604, Unknown=0, NotChecked=0, Total=756 [2019-12-18 20:28:17,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25575 states. [2019-12-18 20:28:17,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25575 to 16068. [2019-12-18 20:28:17,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16068 states. [2019-12-18 20:28:17,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16068 states to 16068 states and 47592 transitions. [2019-12-18 20:28:17,364 INFO L78 Accepts]: Start accepts. Automaton has 16068 states and 47592 transitions. Word has length 56 [2019-12-18 20:28:17,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:28:17,364 INFO L462 AbstractCegarLoop]: Abstraction has 16068 states and 47592 transitions. [2019-12-18 20:28:17,364 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 20:28:17,364 INFO L276 IsEmpty]: Start isEmpty. Operand 16068 states and 47592 transitions. [2019-12-18 20:28:17,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 20:28:17,383 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:28:17,383 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] [2019-12-18 20:28:17,383 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:28:17,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:28:17,383 INFO L82 PathProgramCache]: Analyzing trace with hash -1754541485, now seen corresponding path program 4 times [2019-12-18 20:28:17,384 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:28:17,384 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817121699] [2019-12-18 20:28:17,384 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:28:17,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:28:17,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:28:17,539 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817121699] [2019-12-18 20:28:17,539 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:28:17,539 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 20:28:17,539 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214442660] [2019-12-18 20:28:17,540 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 20:28:17,540 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:28:17,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 20:28:17,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-18 20:28:17,540 INFO L87 Difference]: Start difference. First operand 16068 states and 47592 transitions. Second operand 10 states. [2019-12-18 20:28:18,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:28:18,452 INFO L93 Difference]: Finished difference Result 25950 states and 76290 transitions. [2019-12-18 20:28:18,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-18 20:28:18,453 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 56 [2019-12-18 20:28:18,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:28:18,481 INFO L225 Difference]: With dead ends: 25950 [2019-12-18 20:28:18,481 INFO L226 Difference]: Without dead ends: 20993 [2019-12-18 20:28:18,482 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=362, Unknown=0, NotChecked=0, Total=462 [2019-12-18 20:28:18,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20993 states. [2019-12-18 20:28:18,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20993 to 13324. [2019-12-18 20:28:18,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13324 states. [2019-12-18 20:28:18,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13324 states to 13324 states and 39656 transitions. [2019-12-18 20:28:18,736 INFO L78 Accepts]: Start accepts. Automaton has 13324 states and 39656 transitions. Word has length 56 [2019-12-18 20:28:18,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:28:18,736 INFO L462 AbstractCegarLoop]: Abstraction has 13324 states and 39656 transitions. [2019-12-18 20:28:18,736 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 20:28:18,736 INFO L276 IsEmpty]: Start isEmpty. Operand 13324 states and 39656 transitions. [2019-12-18 20:28:18,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 20:28:18,750 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:28:18,750 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] [2019-12-18 20:28:18,751 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:28:18,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:28:18,751 INFO L82 PathProgramCache]: Analyzing trace with hash -879531663, now seen corresponding path program 5 times [2019-12-18 20:28:18,751 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:28:18,751 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263304212] [2019-12-18 20:28:18,751 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:28:18,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:28:18,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:28:18,916 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263304212] [2019-12-18 20:28:18,916 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:28:18,916 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 20:28:18,917 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735818433] [2019-12-18 20:28:18,917 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 20:28:18,917 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:28:18,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 20:28:18,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 20:28:18,918 INFO L87 Difference]: Start difference. First operand 13324 states and 39656 transitions. Second operand 11 states. [2019-12-18 20:28:19,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:28:19,818 INFO L93 Difference]: Finished difference Result 22477 states and 66731 transitions. [2019-12-18 20:28:19,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-18 20:28:19,818 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 56 [2019-12-18 20:28:19,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:28:19,850 INFO L225 Difference]: With dead ends: 22477 [2019-12-18 20:28:19,850 INFO L226 Difference]: Without dead ends: 22167 [2019-12-18 20:28:19,850 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=130, Invalid=572, Unknown=0, NotChecked=0, Total=702 [2019-12-18 20:28:19,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22167 states. [2019-12-18 20:28:20,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22167 to 15112. [2019-12-18 20:28:20,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15112 states. [2019-12-18 20:28:20,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15112 states to 15112 states and 44831 transitions. [2019-12-18 20:28:20,160 INFO L78 Accepts]: Start accepts. Automaton has 15112 states and 44831 transitions. Word has length 56 [2019-12-18 20:28:20,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:28:20,160 INFO L462 AbstractCegarLoop]: Abstraction has 15112 states and 44831 transitions. [2019-12-18 20:28:20,160 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 20:28:20,160 INFO L276 IsEmpty]: Start isEmpty. Operand 15112 states and 44831 transitions. [2019-12-18 20:28:20,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 20:28:20,181 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:28:20,181 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] [2019-12-18 20:28:20,181 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:28:20,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:28:20,182 INFO L82 PathProgramCache]: Analyzing trace with hash -191191823, now seen corresponding path program 6 times [2019-12-18 20:28:20,182 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:28:20,182 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806672410] [2019-12-18 20:28:20,182 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:28:20,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:28:20,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:28:20,772 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806672410] [2019-12-18 20:28:20,772 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:28:20,772 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 20:28:20,772 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900331675] [2019-12-18 20:28:20,773 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 20:28:20,773 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:28:20,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 20:28:20,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2019-12-18 20:28:20,773 INFO L87 Difference]: Start difference. First operand 15112 states and 44831 transitions. Second operand 16 states. [2019-12-18 20:28:23,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:28:23,156 INFO L93 Difference]: Finished difference Result 18287 states and 53926 transitions. [2019-12-18 20:28:23,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-18 20:28:23,158 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 56 [2019-12-18 20:28:23,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:28:23,179 INFO L225 Difference]: With dead ends: 18287 [2019-12-18 20:28:23,179 INFO L226 Difference]: Without dead ends: 15717 [2019-12-18 20:28:23,180 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=186, Invalid=870, Unknown=0, NotChecked=0, Total=1056 [2019-12-18 20:28:23,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15717 states. [2019-12-18 20:28:23,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15717 to 12860. [2019-12-18 20:28:23,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12860 states. [2019-12-18 20:28:23,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12860 states to 12860 states and 38348 transitions. [2019-12-18 20:28:23,550 INFO L78 Accepts]: Start accepts. Automaton has 12860 states and 38348 transitions. Word has length 56 [2019-12-18 20:28:23,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:28:23,550 INFO L462 AbstractCegarLoop]: Abstraction has 12860 states and 38348 transitions. [2019-12-18 20:28:23,551 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 20:28:23,551 INFO L276 IsEmpty]: Start isEmpty. Operand 12860 states and 38348 transitions. [2019-12-18 20:28:23,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 20:28:23,567 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:28:23,567 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] [2019-12-18 20:28:23,567 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:28:23,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:28:23,568 INFO L82 PathProgramCache]: Analyzing trace with hash 1279960527, now seen corresponding path program 7 times [2019-12-18 20:28:23,568 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:28:23,568 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047642527] [2019-12-18 20:28:23,568 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:28:23,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:28:23,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:28:23,729 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047642527] [2019-12-18 20:28:23,729 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:28:23,729 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 20:28:23,730 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586335557] [2019-12-18 20:28:23,730 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 20:28:23,730 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:28:23,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 20:28:23,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-18 20:28:23,731 INFO L87 Difference]: Start difference. First operand 12860 states and 38348 transitions. Second operand 12 states. [2019-12-18 20:28:24,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:28:24,667 INFO L93 Difference]: Finished difference Result 20193 states and 59812 transitions. [2019-12-18 20:28:24,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 20:28:24,668 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 56 [2019-12-18 20:28:24,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:28:24,694 INFO L225 Difference]: With dead ends: 20193 [2019-12-18 20:28:24,694 INFO L226 Difference]: Without dead ends: 20007 [2019-12-18 20:28:24,695 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=133, Invalid=569, Unknown=0, NotChecked=0, Total=702 [2019-12-18 20:28:24,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20007 states. [2019-12-18 20:28:24,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20007 to 12756. [2019-12-18 20:28:24,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12756 states. [2019-12-18 20:28:24,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12756 states to 12756 states and 38074 transitions. [2019-12-18 20:28:24,924 INFO L78 Accepts]: Start accepts. Automaton has 12756 states and 38074 transitions. Word has length 56 [2019-12-18 20:28:24,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:28:24,925 INFO L462 AbstractCegarLoop]: Abstraction has 12756 states and 38074 transitions. [2019-12-18 20:28:24,925 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 20:28:24,925 INFO L276 IsEmpty]: Start isEmpty. Operand 12756 states and 38074 transitions. [2019-12-18 20:28:24,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 20:28:24,937 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:28:24,938 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] [2019-12-18 20:28:24,938 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:28:24,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:28:24,938 INFO L82 PathProgramCache]: Analyzing trace with hash -1908396633, now seen corresponding path program 8 times [2019-12-18 20:28:24,938 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:28:24,938 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520454648] [2019-12-18 20:28:24,938 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:28:24,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 20:28:25,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 20:28:25,050 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 20:28:25,050 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 20:28:25,054 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [810] [810] ULTIMATE.startENTRY-->L823: Formula: (let ((.cse0 (store |v_#valid_64| 0 0))) (and (= 0 v_~weak$$choice0~0_8) (= v_~x$r_buff1_thd2~0_17 0) (= (store |v_#length_22| |v_ULTIMATE.start_main_~#t424~0.base_30| 4) |v_#length_21|) (= 0 v_~x$r_buff0_thd2~0_26) (= v_~__unbuffered_p2_EBX~0_10 0) (= 0 v_~x$r_buff0_thd1~0_68) (= 0 v_~__unbuffered_cnt~0_20) (= 0 v_~__unbuffered_p1_EAX~0_11) (= 0 v_~x$w_buff0_used~0_106) (= 0 v_~x$w_buff1~0_25) (= 0 v_~x$r_buff0_thd0~0_21) (= 0 v_~__unbuffered_p0_EAX~0_12) (= v_~x~0_26 0) (< |v_#StackHeapBarrier_16| |v_ULTIMATE.start_main_~#t424~0.base_30|) (= v_~main$tmp_guard0~0_8 0) (< 0 |v_#StackHeapBarrier_16|) (= 0 v_~weak$$choice2~0_34) (= |v_#memory_int_17| (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t424~0.base_30| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t424~0.base_30|) |v_ULTIMATE.start_main_~#t424~0.offset_23| 0))) (= 0 v_~x$read_delayed_var~0.base_7) (= (select .cse0 |v_ULTIMATE.start_main_~#t424~0.base_30|) 0) (= 0 v_~x$read_delayed~0_6) (= v_~x$r_buff1_thd1~0_41 0) (= 0 v_~__unbuffered_p2_EAX~0_10) (= v_~x$r_buff1_thd0~0_21 0) (= v_~x$flush_delayed~0_14 0) (= v_~x$w_buff1_used~0_65 0) (= 0 v_~x$r_buff0_thd3~0_20) (= |v_#valid_62| (store .cse0 |v_ULTIMATE.start_main_~#t424~0.base_30| 1)) (= |v_#NULL.offset_5| 0) (= v_~main$tmp_guard1~0_15 0) (= v_~x$mem_tmp~0_11 0) (= 0 v_~z~0_9) (= v_~y~0_10 0) (= 0 v_~x$read_delayed_var~0.offset_7) (= 0 |v_ULTIMATE.start_main_~#t424~0.offset_23|) (= 0 |v_#NULL.base_5|) (= v_~x$r_buff1_thd3~0_16 0) (= 0 v_~x$w_buff0~0_28))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_16|, #valid=|v_#valid_64|, #memory_int=|v_#memory_int_18|, #length=|v_#length_22|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_28, ULTIMATE.start_main_~#t425~0.offset=|v_ULTIMATE.start_main_~#t425~0.offset_18|, ~x$flush_delayed~0=v_~x$flush_delayed~0_14, ULTIMATE.start_main_~#t426~0.base=|v_ULTIMATE.start_main_~#t426~0.base_17|, #NULL.offset=|v_#NULL.offset_5|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_41, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_20, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_11|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_11|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_12, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_11, #length=|v_#length_21|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_10, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_21, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_10, ~x$w_buff1~0=v_~x$w_buff1~0_25, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_65, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_17, ULTIMATE.start_main_~#t426~0.offset=|v_ULTIMATE.start_main_~#t426~0.offset_15|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, ~weak$$choice0~0=v_~weak$$choice0~0_8, #StackHeapBarrier=|v_#StackHeapBarrier_16|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_20, ~x~0=v_~x~0_26, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_68, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_17|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_16, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_15, ~x$mem_tmp~0=v_~x$mem_tmp~0_11, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_13|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_11|, ULTIMATE.start_main_~#t424~0.offset=|v_ULTIMATE.start_main_~#t424~0.offset_23|, ULTIMATE.start_main_~#t425~0.base=|v_ULTIMATE.start_main_~#t425~0.base_22|, ~y~0=v_~y~0_10, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_9|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_21, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_26, #NULL.base=|v_#NULL.base_5|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_106, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_13|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_21|, #valid=|v_#valid_62|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_10|, ~z~0=v_~z~0_9, ~weak$$choice2~0=v_~weak$$choice2~0_34, ULTIMATE.start_main_~#t424~0.base=|v_ULTIMATE.start_main_~#t424~0.base_30|, ~x$read_delayed~0=v_~x$read_delayed~0_6} AuxVars[] AssignedVars[~x$w_buff0~0, ULTIMATE.start_main_~#t425~0.offset, ~x$flush_delayed~0, ULTIMATE.start_main_~#t426~0.base, #NULL.offset, ~x$r_buff1_thd1~0, ~x$r_buff0_thd3~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~x$r_buff0_thd0~0, ~__unbuffered_p2_EBX~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_~#t426~0.offset, ~x$read_delayed_var~0.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ~x~0, ~x$r_buff0_thd1~0, ULTIMATE.start_main_#t~ite46, ~x$r_buff1_thd3~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_~#t424~0.offset, ULTIMATE.start_main_~#t425~0.base, ~y~0, ULTIMATE.start_main_#t~nondet40, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, #NULL.base, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite41, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet39, ~z~0, ~weak$$choice2~0, ULTIMATE.start_main_~#t424~0.base, ~x$read_delayed~0] because there is no mapped edge [2019-12-18 20:28:25,055 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [780] [780] L823-1-->L825: Formula: (and (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t425~0.base_11| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t425~0.base_11|) |v_ULTIMATE.start_main_~#t425~0.offset_10| 1)) |v_#memory_int_11|) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t425~0.base_11|) (= 0 |v_ULTIMATE.start_main_~#t425~0.offset_10|) (= (select |v_#valid_38| |v_ULTIMATE.start_main_~#t425~0.base_11|) 0) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t425~0.base_11| 4) |v_#length_15|) (not (= 0 |v_ULTIMATE.start_main_~#t425~0.base_11|)) (= |v_#valid_37| (store |v_#valid_38| |v_ULTIMATE.start_main_~#t425~0.base_11| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t425~0.offset=|v_ULTIMATE.start_main_~#t425~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_~#t425~0.base=|v_ULTIMATE.start_main_~#t425~0.base_11|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_6|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t425~0.offset, ULTIMATE.start_main_~#t425~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length] because there is no mapped edge [2019-12-18 20:28:25,056 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [691] [691] P1ENTRY-->L5-3: Formula: (and (= v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_7 |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_5|) (= v_P1Thread1of1ForFork0_~arg.offset_5 |v_P1Thread1of1ForFork0_#in~arg.offset_5|) (= 1 v_~x$w_buff0_used~0_71) (= v_~x$w_buff1_used~0_41 v_~x$w_buff0_used~0_72) (= 1 v_~x$w_buff0~0_16) (= 1 |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_5|) (= (mod v_~x$w_buff1_used~0_41 256) 0) (= v_~x$w_buff0~0_17 v_~x$w_buff1~0_13) (= v_P1Thread1of1ForFork0_~arg.base_5 |v_P1Thread1of1ForFork0_#in~arg.base_5|)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_17, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_5|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_5|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_72} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_16, P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_7, P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_5, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_5, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_5|, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_5|, ~x$w_buff1~0=v_~x$w_buff1~0_13, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_5|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_41, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_71} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression, P1Thread1of1ForFork0_~arg.offset, P1Thread1of1ForFork0_~arg.base, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$w_buff0_used~0] because there is no mapped edge [2019-12-18 20:28:25,057 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [776] [776] L825-1-->L827: Formula: (and (= 0 |v_ULTIMATE.start_main_~#t426~0.offset_10|) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t426~0.base_11|) (not (= 0 |v_ULTIMATE.start_main_~#t426~0.base_11|)) (= |v_#valid_33| (store |v_#valid_34| |v_ULTIMATE.start_main_~#t426~0.base_11| 1)) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t426~0.base_11| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t426~0.base_11|) |v_ULTIMATE.start_main_~#t426~0.offset_10| 2))) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t426~0.base_11| 4)) (= 0 (select |v_#valid_34| |v_ULTIMATE.start_main_~#t426~0.base_11|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_10|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~#t426~0.base=|v_ULTIMATE.start_main_~#t426~0.base_11|, #length=|v_#length_13|, ULTIMATE.start_main_~#t426~0.offset=|v_ULTIMATE.start_main_~#t426~0.offset_10|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_6|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_~#t426~0.base, #length, ULTIMATE.start_main_~#t426~0.offset, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-18 20:28:25,059 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L800-2-->L800-4: Formula: (let ((.cse1 (= (mod ~x$r_buff1_thd3~0_In2131660596 256) 0)) (.cse0 (= (mod ~x$w_buff1_used~0_In2131660596 256) 0))) (or (and (= ~x~0_In2131660596 |P2Thread1of1ForFork1_#t~ite32_Out2131660596|) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= ~x$w_buff1~0_In2131660596 |P2Thread1of1ForFork1_#t~ite32_Out2131660596|)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In2131660596, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2131660596, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In2131660596, ~x~0=~x~0_In2131660596} OutVars{P2Thread1of1ForFork1_#t~ite32=|P2Thread1of1ForFork1_#t~ite32_Out2131660596|, ~x$w_buff1~0=~x$w_buff1~0_In2131660596, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2131660596, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In2131660596, ~x~0=~x~0_In2131660596} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-18 20:28:25,059 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] L778-->L778-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In1196357835 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In1196357835 256)))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork0_#t~ite28_Out1196357835| 0)) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork0_#t~ite28_Out1196357835| ~x$w_buff0_used~0_In1196357835)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1196357835, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1196357835} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1196357835, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out1196357835|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1196357835} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-18 20:28:25,060 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L779-->L779-2: Formula: (let ((.cse3 (= (mod ~x$w_buff1_used~0_In-1525993741 256) 0)) (.cse2 (= 0 (mod ~x$r_buff1_thd2~0_In-1525993741 256))) (.cse1 (= (mod ~x$r_buff0_thd2~0_In-1525993741 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In-1525993741 256) 0))) (or (and (or .cse0 .cse1) (= ~x$w_buff1_used~0_In-1525993741 |P1Thread1of1ForFork0_#t~ite29_Out-1525993741|) (or .cse2 .cse3)) (and (= 0 |P1Thread1of1ForFork0_#t~ite29_Out-1525993741|) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1525993741, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1525993741, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1525993741, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1525993741} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-1525993741, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1525993741, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1525993741, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out-1525993741|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1525993741} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-18 20:28:25,062 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [762] [762] L780-->L781: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1376975148 256))) (.cse1 (= (mod ~x$r_buff0_thd2~0_In-1376975148 256) 0))) (or (and (or .cse0 .cse1) (= ~x$r_buff0_thd2~0_Out-1376975148 ~x$r_buff0_thd2~0_In-1376975148)) (and (not .cse0) (= ~x$r_buff0_thd2~0_Out-1376975148 0) (not .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1376975148, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1376975148} OutVars{P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out-1376975148|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out-1376975148, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1376975148} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-18 20:28:25,062 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L781-->L781-2: Formula: (let ((.cse3 (= (mod ~x$w_buff1_used~0_In1602431681 256) 0)) (.cse2 (= 0 (mod ~x$r_buff1_thd2~0_In1602431681 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In1602431681 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In1602431681 256) 0))) (or (and (= |P1Thread1of1ForFork0_#t~ite31_Out1602431681| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse1 .cse0) (= |P1Thread1of1ForFork0_#t~ite31_Out1602431681| ~x$r_buff1_thd2~0_In1602431681)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1602431681, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1602431681, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1602431681, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1602431681} OutVars{P1Thread1of1ForFork0_#t~ite31=|P1Thread1of1ForFork0_#t~ite31_Out1602431681|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1602431681, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1602431681, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1602431681, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1602431681} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-18 20:28:25,062 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [774] [774] L781-2-->P1EXIT: Formula: (and (= v_~x$r_buff1_thd2~0_13 |v_P1Thread1of1ForFork0_#t~ite31_8|) (= v_~__unbuffered_cnt~0_14 (+ v_~__unbuffered_cnt~0_15 1)) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|)) InVars {P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15} OutVars{P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_7|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_13, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_5|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-18 20:28:25,065 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [787] [787] L744-->L744-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-203423123 256)))) (or (and (= |P0Thread1of1ForFork2_#t~ite14_Out-203423123| |P0Thread1of1ForFork2_#t~ite15_Out-203423123|) .cse0 (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In-203423123 256)))) (or (and .cse1 (= 0 (mod ~x$r_buff1_thd1~0_In-203423123 256))) (and .cse1 (= (mod ~x$w_buff1_used~0_In-203423123 256) 0)) (= (mod ~x$w_buff0_used~0_In-203423123 256) 0))) (= ~x$w_buff0_used~0_In-203423123 |P0Thread1of1ForFork2_#t~ite14_Out-203423123|)) (and (not .cse0) (= |P0Thread1of1ForFork2_#t~ite14_In-203423123| |P0Thread1of1ForFork2_#t~ite14_Out-203423123|) (= ~x$w_buff0_used~0_In-203423123 |P0Thread1of1ForFork2_#t~ite15_Out-203423123|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-203423123, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-203423123, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-203423123, P0Thread1of1ForFork2_#t~ite14=|P0Thread1of1ForFork2_#t~ite14_In-203423123|, ~weak$$choice2~0=~weak$$choice2~0_In-203423123, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-203423123} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-203423123, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-203423123, P0Thread1of1ForFork2_#t~ite15=|P0Thread1of1ForFork2_#t~ite15_Out-203423123|, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-203423123, P0Thread1of1ForFork2_#t~ite14=|P0Thread1of1ForFork2_#t~ite14_Out-203423123|, ~weak$$choice2~0=~weak$$choice2~0_In-203423123, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-203423123} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite15, P0Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-18 20:28:25,066 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [797] [797] L745-->L745-8: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff1_used~0_In48480105 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In48480105 256))) (.cse6 (= (mod ~x$r_buff0_thd1~0_In48480105 256) 0)) (.cse3 (= 0 (mod ~x$r_buff1_thd1~0_In48480105 256))) (.cse5 (= |P0Thread1of1ForFork2_#t~ite17_Out48480105| |P0Thread1of1ForFork2_#t~ite18_Out48480105|)) (.cse4 (= 0 (mod ~weak$$choice2~0_In48480105 256)))) (or (let ((.cse2 (not .cse6))) (and (not .cse0) (or (not .cse1) .cse2) (= |P0Thread1of1ForFork2_#t~ite16_Out48480105| 0) (or .cse2 (not .cse3)) .cse4 (= |P0Thread1of1ForFork2_#t~ite17_Out48480105| |P0Thread1of1ForFork2_#t~ite16_Out48480105|) .cse5)) (and (or (and (or (and .cse6 .cse1) .cse0 (and .cse6 .cse3)) .cse4 (= |P0Thread1of1ForFork2_#t~ite17_Out48480105| ~x$w_buff1_used~0_In48480105) .cse5) (and (= ~x$w_buff1_used~0_In48480105 |P0Thread1of1ForFork2_#t~ite18_Out48480105|) (not .cse4) (= |P0Thread1of1ForFork2_#t~ite17_Out48480105| |P0Thread1of1ForFork2_#t~ite17_In48480105|))) (= |P0Thread1of1ForFork2_#t~ite16_In48480105| |P0Thread1of1ForFork2_#t~ite16_Out48480105|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In48480105, P0Thread1of1ForFork2_#t~ite17=|P0Thread1of1ForFork2_#t~ite17_In48480105|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In48480105, P0Thread1of1ForFork2_#t~ite16=|P0Thread1of1ForFork2_#t~ite16_In48480105|, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In48480105, ~weak$$choice2~0=~weak$$choice2~0_In48480105, ~x$w_buff0_used~0=~x$w_buff0_used~0_In48480105} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In48480105, P0Thread1of1ForFork2_#t~ite18=|P0Thread1of1ForFork2_#t~ite18_Out48480105|, P0Thread1of1ForFork2_#t~ite17=|P0Thread1of1ForFork2_#t~ite17_Out48480105|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In48480105, P0Thread1of1ForFork2_#t~ite16=|P0Thread1of1ForFork2_#t~ite16_Out48480105|, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In48480105, ~weak$$choice2~0=~weak$$choice2~0_In48480105, ~x$w_buff0_used~0=~x$w_buff0_used~0_In48480105} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite18, P0Thread1of1ForFork2_#t~ite17, P0Thread1of1ForFork2_#t~ite16] because there is no mapped edge [2019-12-18 20:28:25,066 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [685] [685] L746-->L747: Formula: (and (= v_~x$r_buff0_thd1~0_36 v_~x$r_buff0_thd1~0_35) (not (= 0 (mod v_~weak$$choice2~0_16 256)))) InVars {~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_36, ~weak$$choice2~0=v_~weak$$choice2~0_16} OutVars{P0Thread1of1ForFork2_#t~ite20=|v_P0Thread1of1ForFork2_#t~ite20_7|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_35, P0Thread1of1ForFork2_#t~ite19=|v_P0Thread1of1ForFork2_#t~ite19_7|, ~weak$$choice2~0=v_~weak$$choice2~0_16, P0Thread1of1ForFork2_#t~ite21=|v_P0Thread1of1ForFork2_#t~ite21_7|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite20, ~x$r_buff0_thd1~0, P0Thread1of1ForFork2_#t~ite19, P0Thread1of1ForFork2_#t~ite21] because there is no mapped edge [2019-12-18 20:28:25,067 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L800-4-->L801: Formula: (= v_~x~0_17 |v_P2Thread1of1ForFork1_#t~ite32_8|) InVars {P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_8|} OutVars{P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_7|, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_7|, ~x~0=v_~x~0_17} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite33, ~x~0] because there is no mapped edge [2019-12-18 20:28:25,068 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [726] [726] L749-->L757: Formula: (and (= 0 v_~x$flush_delayed~0_7) (not (= 0 (mod v_~x$flush_delayed~0_8 256))) (= v_~x$mem_tmp~0_5 v_~x~0_20) (= (+ v_~__unbuffered_cnt~0_12 1) v_~__unbuffered_cnt~0_11)) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_8, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, ~x$mem_tmp~0=v_~x$mem_tmp~0_5} OutVars{P0Thread1of1ForFork2_#t~ite25=|v_P0Thread1of1ForFork2_#t~ite25_7|, ~x$flush_delayed~0=v_~x$flush_delayed~0_7, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, ~x$mem_tmp~0=v_~x$mem_tmp~0_5, ~x~0=v_~x~0_20} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite25, ~x$flush_delayed~0, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-12-18 20:28:25,068 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L801-->L801-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In1410076568 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd3~0_In1410076568 256) 0))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork1_#t~ite34_Out1410076568| 0)) (and (= ~x$w_buff0_used~0_In1410076568 |P2Thread1of1ForFork1_#t~ite34_Out1410076568|) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1410076568, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1410076568} OutVars{P2Thread1of1ForFork1_#t~ite34=|P2Thread1of1ForFork1_#t~ite34_Out1410076568|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1410076568, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1410076568} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-18 20:28:25,068 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L802-->L802-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff1_thd3~0_In539658985 256))) (.cse1 (= (mod ~x$w_buff1_used~0_In539658985 256) 0)) (.cse3 (= 0 (mod ~x$r_buff0_thd3~0_In539658985 256))) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In539658985 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$w_buff1_used~0_In539658985 |P2Thread1of1ForFork1_#t~ite35_Out539658985|)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= |P2Thread1of1ForFork1_#t~ite35_Out539658985| 0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In539658985, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In539658985, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In539658985, ~x$w_buff0_used~0=~x$w_buff0_used~0_In539658985} OutVars{P2Thread1of1ForFork1_#t~ite35=|P2Thread1of1ForFork1_#t~ite35_Out539658985|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In539658985, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In539658985, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In539658985, ~x$w_buff0_used~0=~x$w_buff0_used~0_In539658985} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-18 20:28:25,069 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [754] [754] L803-->L803-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd3~0_In-1617658214 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In-1617658214 256) 0))) (or (and (= |P2Thread1of1ForFork1_#t~ite36_Out-1617658214| ~x$r_buff0_thd3~0_In-1617658214) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork1_#t~ite36_Out-1617658214| 0)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1617658214, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1617658214} OutVars{P2Thread1of1ForFork1_#t~ite36=|P2Thread1of1ForFork1_#t~ite36_Out-1617658214|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1617658214, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1617658214} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-18 20:28:25,070 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] L804-->L804-2: Formula: (let ((.cse2 (= 0 (mod ~x$r_buff1_thd3~0_In1506706903 256))) (.cse3 (= (mod ~x$w_buff1_used~0_In1506706903 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd3~0_In1506706903 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In1506706903 256)))) (or (and (= |P2Thread1of1ForFork1_#t~ite37_Out1506706903| ~x$r_buff1_thd3~0_In1506706903) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= 0 |P2Thread1of1ForFork1_#t~ite37_Out1506706903|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1506706903, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1506706903, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1506706903, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1506706903} OutVars{P2Thread1of1ForFork1_#t~ite37=|P2Thread1of1ForFork1_#t~ite37_Out1506706903|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1506706903, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1506706903, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1506706903, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1506706903} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-18 20:28:25,070 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [786] [786] L804-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork1_#res.offset_5|) (= (+ v_~__unbuffered_cnt~0_17 1) v_~__unbuffered_cnt~0_16) (= 0 |v_P2Thread1of1ForFork1_#res.base_5|) (= v_~x$r_buff1_thd3~0_12 |v_P2Thread1of1ForFork1_#t~ite37_8|)) InVars {P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_17} OutVars{P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_7|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_5|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_12, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37, P2Thread1of1ForFork1_#res.base, ~x$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-18 20:28:25,070 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [680] [680] L827-1-->L833: Formula: (and (= v_~__unbuffered_cnt~0_9 3) (= v_~main$tmp_guard0~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9} OutVars{ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet40, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-18 20:28:25,071 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L833-2-->L833-5: Formula: (let ((.cse1 (= (mod ~x$r_buff1_thd0~0_In220299230 256) 0)) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In220299230 256))) (.cse2 (= |ULTIMATE.start_main_#t~ite42_Out220299230| |ULTIMATE.start_main_#t~ite41_Out220299230|))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite41_Out220299230| ~x$w_buff1~0_In220299230) .cse2) (and (or .cse1 .cse0) (= ~x~0_In220299230 |ULTIMATE.start_main_#t~ite41_Out220299230|) .cse2))) InVars {~x$w_buff1~0=~x$w_buff1~0_In220299230, ~x$w_buff1_used~0=~x$w_buff1_used~0_In220299230, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In220299230, ~x~0=~x~0_In220299230} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out220299230|, ~x$w_buff1~0=~x$w_buff1~0_In220299230, ~x$w_buff1_used~0=~x$w_buff1_used~0_In220299230, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In220299230, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out220299230|, ~x~0=~x~0_In220299230} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-18 20:28:25,071 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [760] [760] L834-->L834-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In-660881836 256))) (.cse1 (= (mod ~x$r_buff0_thd0~0_In-660881836 256) 0))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite43_Out-660881836| 0)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite43_Out-660881836| ~x$w_buff0_used~0_In-660881836)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-660881836, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-660881836} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-660881836, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-660881836|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-660881836} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-18 20:28:25,072 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] L835-->L835-2: Formula: (let ((.cse2 (= 0 (mod ~x$r_buff1_thd0~0_In346674081 256))) (.cse3 (= (mod ~x$w_buff1_used~0_In346674081 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd0~0_In346674081 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In346674081 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite44_Out346674081| ~x$w_buff1_used~0_In346674081) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite44_Out346674081|) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In346674081, ~x$w_buff1_used~0=~x$w_buff1_used~0_In346674081, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In346674081, ~x$w_buff0_used~0=~x$w_buff0_used~0_In346674081} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In346674081, ~x$w_buff1_used~0=~x$w_buff1_used~0_In346674081, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In346674081, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out346674081|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In346674081} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-18 20:28:25,073 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] L836-->L836-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In403530392 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In403530392 256)))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite45_Out403530392|) (not .cse1)) (and (or .cse0 .cse1) (= ~x$r_buff0_thd0~0_In403530392 |ULTIMATE.start_main_#t~ite45_Out403530392|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In403530392, ~x$w_buff0_used~0=~x$w_buff0_used~0_In403530392} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In403530392, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out403530392|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In403530392} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-18 20:28:25,073 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] L837-->L837-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In221900380 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In221900380 256) 0)) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In221900380 256))) (.cse3 (= (mod ~x$r_buff1_thd0~0_In221900380 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$r_buff1_thd0~0_In221900380 |ULTIMATE.start_main_#t~ite46_Out221900380|)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite46_Out221900380| 0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In221900380, ~x$w_buff1_used~0=~x$w_buff1_used~0_In221900380, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In221900380, ~x$w_buff0_used~0=~x$w_buff0_used~0_In221900380} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In221900380, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out221900380|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In221900380, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In221900380, ~x$w_buff0_used~0=~x$w_buff0_used~0_In221900380} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-18 20:28:25,074 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [803] [803] L837-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~__unbuffered_p0_EAX~0_9 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 0) (= v_~x$r_buff1_thd0~0_16 |v_ULTIMATE.start_main_#t~ite46_11|) (= v_~main$tmp_guard1~0_12 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|) (= 0 v_~__unbuffered_p1_EAX~0_8) (= v_~__unbuffered_p2_EAX~0_7 1) (= v_~__unbuffered_p2_EBX~0_7 0)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_9, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_7, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_8, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_11|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_7} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_9, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_7, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_8, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_10|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_12, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_7, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_16, 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~ite46, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 20:28:25,177 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 08:28:25 BasicIcfg [2019-12-18 20:28:25,177 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 20:28:25,180 INFO L168 Benchmark]: Toolchain (without parser) took 69982.49 ms. Allocated memory was 147.3 MB in the beginning and 2.2 GB in the end (delta: 2.0 GB). Free memory was 103.2 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 963.6 MB. Max. memory is 7.1 GB. [2019-12-18 20:28:25,180 INFO L168 Benchmark]: CDTParser took 1.58 ms. Allocated memory is still 147.3 MB. Free memory was 123.7 MB in the beginning and 123.5 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-18 20:28:25,182 INFO L168 Benchmark]: CACSL2BoogieTranslator took 726.96 ms. Allocated memory was 147.3 MB in the beginning and 203.9 MB in the end (delta: 56.6 MB). Free memory was 102.8 MB in the beginning and 158.0 MB in the end (delta: -55.2 MB). Peak memory consumption was 21.6 MB. Max. memory is 7.1 GB. [2019-12-18 20:28:25,185 INFO L168 Benchmark]: Boogie Procedure Inliner took 60.80 ms. Allocated memory is still 203.9 MB. Free memory was 157.4 MB in the beginning and 154.9 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. [2019-12-18 20:28:25,185 INFO L168 Benchmark]: Boogie Preprocessor took 44.32 ms. Allocated memory is still 203.9 MB. Free memory was 154.9 MB in the beginning and 153.0 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-12-18 20:28:25,185 INFO L168 Benchmark]: RCFGBuilder took 810.35 ms. Allocated memory is still 203.9 MB. Free memory was 153.0 MB in the beginning and 106.0 MB in the end (delta: 47.0 MB). Peak memory consumption was 47.0 MB. Max. memory is 7.1 GB. [2019-12-18 20:28:25,186 INFO L168 Benchmark]: TraceAbstraction took 68335.30 ms. Allocated memory was 203.9 MB in the beginning and 2.2 GB in the end (delta: 2.0 GB). Free memory was 105.4 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 909.1 MB. Max. memory is 7.1 GB. [2019-12-18 20:28:25,189 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.58 ms. Allocated memory is still 147.3 MB. Free memory was 123.7 MB in the beginning and 123.5 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 726.96 ms. Allocated memory was 147.3 MB in the beginning and 203.9 MB in the end (delta: 56.6 MB). Free memory was 102.8 MB in the beginning and 158.0 MB in the end (delta: -55.2 MB). Peak memory consumption was 21.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 60.80 ms. Allocated memory is still 203.9 MB. Free memory was 157.4 MB in the beginning and 154.9 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 44.32 ms. Allocated memory is still 203.9 MB. Free memory was 154.9 MB in the beginning and 153.0 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 810.35 ms. Allocated memory is still 203.9 MB. Free memory was 153.0 MB in the beginning and 106.0 MB in the end (delta: 47.0 MB). Peak memory consumption was 47.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 68335.30 ms. Allocated memory was 203.9 MB in the beginning and 2.2 GB in the end (delta: 2.0 GB). Free memory was 105.4 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 909.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.2s, 165 ProgramPointsBefore, 85 ProgramPointsAfterwards, 196 TransitionsBefore, 94 TransitionsAfterwards, 16696 CoEnabledTransitionPairs, 8 FixpointIterations, 34 TrivialSequentialCompositions, 45 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 32 ConcurrentYvCompositions, 26 ChoiceCompositions, 6815 VarBasedMoverChecksPositive, 208 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 79642 CheckedPairsTotal, 111 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L823] FCALL, FORK 0 pthread_create(&t424, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L825] FCALL, FORK 0 pthread_create(&t425, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L767] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L768] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L769] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L770] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L771] 2 x$r_buff0_thd2 = (_Bool)1 [L774] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L777] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L827] FCALL, FORK 0 pthread_create(&t426, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L791] 3 y = 1 [L794] 3 __unbuffered_p2_EAX = y [L797] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L800] 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L777] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L778] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L734] 1 z = 1 [L737] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L738] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L739] 1 x$flush_delayed = weak$$choice2 [L740] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=7, x=1, x$flush_delayed=7, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x=0, y=1, z=1] [L741] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)=1, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=7, x=1, x$flush_delayed=7, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x=0, y=1, z=1] [L779] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L741] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L742] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=7, weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0))=1, x=1, x$flush_delayed=7, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x=0, y=1, z=1] [L742] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L743] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=7, weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1))=0, x=1, x$flush_delayed=7, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x=0, y=1, z=1] [L743] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L744] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L745] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L747] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=7, weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=1, x$flush_delayed=7, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x=0, y=1, z=1] [L747] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L748] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=7, x=0, x$flush_delayed=7, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L801] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L802] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L803] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L833] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [\result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=7, x=1, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L833] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L834] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L835] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L836] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 156 locations, 2 error locations. Result: UNSAFE, OverallTime: 68.0s, OverallIterations: 27, TraceHistogramMax: 1, AutomataDifference: 22.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 5877 SDtfs, 7265 SDslu, 21262 SDs, 0 SdLazy, 10822 SolverSat, 265 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 334 GetRequests, 46 SyntacticMatches, 18 SemanticMatches, 270 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 868 ImplicationChecksByTransitivity, 3.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=95102occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 23.6s AutomataMinimizationTime, 26 MinimizatonAttempts, 165423 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 1198 NumberOfCodeBlocks, 1198 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 1116 ConstructedInterpolants, 0 QuantifiedInterpolants, 219734 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 26 InterpolantComputations, 26 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...