/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/mix049_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 06:43:14,857 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 06:43:14,859 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 06:43:14,878 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 06:43:14,878 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 06:43:14,880 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 06:43:14,882 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 06:43:14,896 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 06:43:14,897 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 06:43:14,898 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 06:43:14,901 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 06:43:14,903 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 06:43:14,903 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 06:43:14,907 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 06:43:14,908 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 06:43:14,911 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 06:43:14,914 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 06:43:14,917 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 06:43:14,918 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 06:43:14,924 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 06:43:14,928 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 06:43:14,929 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 06:43:14,930 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 06:43:14,931 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 06:43:14,933 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 06:43:14,933 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 06:43:14,933 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 06:43:14,935 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 06:43:14,937 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 06:43:14,938 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 06:43:14,938 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 06:43:14,939 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 06:43:14,939 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 06:43:14,941 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 06:43:14,942 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 06:43:14,942 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 06:43:14,944 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 06:43:14,944 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 06:43:14,944 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 06:43:14,948 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 06:43:14,949 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 06:43:14,950 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-27 06:43:14,963 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 06:43:14,964 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 06:43:14,965 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 06:43:14,965 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 06:43:14,966 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 06:43:14,966 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 06:43:14,966 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 06:43:14,966 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 06:43:14,967 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 06:43:14,967 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 06:43:14,967 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 06:43:14,967 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 06:43:14,967 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 06:43:14,968 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 06:43:14,968 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 06:43:14,968 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 06:43:14,968 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 06:43:14,969 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 06:43:14,969 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 06:43:14,969 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 06:43:14,969 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 06:43:14,969 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 06:43:14,970 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 06:43:14,970 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 06:43:14,970 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 06:43:14,970 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 06:43:14,970 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 06:43:14,971 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 06:43:14,971 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 06:43:14,971 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 06:43:15,279 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 06:43:15,295 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 06:43:15,298 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 06:43:15,300 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 06:43:15,300 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 06:43:15,301 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix049_tso.oepc.i [2019-12-27 06:43:15,363 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d804de5a2/74d9180cd8344ada99bc43edc351ba16/FLAG7c3c37518 [2019-12-27 06:43:15,880 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 06:43:15,881 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix049_tso.oepc.i [2019-12-27 06:43:15,899 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d804de5a2/74d9180cd8344ada99bc43edc351ba16/FLAG7c3c37518 [2019-12-27 06:43:16,208 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d804de5a2/74d9180cd8344ada99bc43edc351ba16 [2019-12-27 06:43:16,217 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 06:43:16,218 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 06:43:16,219 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 06:43:16,219 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 06:43:16,222 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 06:43:16,223 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 06:43:16" (1/1) ... [2019-12-27 06:43:16,225 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2bfdc9a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:43:16, skipping insertion in model container [2019-12-27 06:43:16,225 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 06:43:16" (1/1) ... [2019-12-27 06:43:16,233 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 06:43:16,292 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 06:43:16,911 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 06:43:16,923 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 06:43:16,989 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 06:43:17,068 INFO L208 MainTranslator]: Completed translation [2019-12-27 06:43:17,069 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:43:17 WrapperNode [2019-12-27 06:43:17,069 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 06:43:17,070 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 06:43:17,070 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 06:43:17,070 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 06:43:17,079 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:43:17" (1/1) ... [2019-12-27 06:43:17,103 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:43:17" (1/1) ... [2019-12-27 06:43:17,133 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 06:43:17,133 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 06:43:17,134 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 06:43:17,134 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 06:43:17,142 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:43:17" (1/1) ... [2019-12-27 06:43:17,142 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:43:17" (1/1) ... [2019-12-27 06:43:17,147 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:43:17" (1/1) ... [2019-12-27 06:43:17,148 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:43:17" (1/1) ... [2019-12-27 06:43:17,159 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:43:17" (1/1) ... [2019-12-27 06:43:17,164 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:43:17" (1/1) ... [2019-12-27 06:43:17,168 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:43:17" (1/1) ... [2019-12-27 06:43:17,173 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 06:43:17,173 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 06:43:17,174 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 06:43:17,174 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 06:43:17,175 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:43:17" (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-27 06:43:17,270 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 06:43:17,270 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 06:43:17,270 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 06:43:17,270 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 06:43:17,271 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 06:43:17,271 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 06:43:17,272 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 06:43:17,272 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 06:43:17,273 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 06:43:17,273 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 06:43:17,274 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 06:43:17,274 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 06:43:17,274 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 06:43:17,276 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 06:43:18,065 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 06:43:18,065 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 06:43:18,067 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 06:43:18 BoogieIcfgContainer [2019-12-27 06:43:18,067 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 06:43:18,068 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 06:43:18,068 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 06:43:18,072 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 06:43:18,072 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 06:43:16" (1/3) ... [2019-12-27 06:43:18,073 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66a4d4c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 06:43:18, skipping insertion in model container [2019-12-27 06:43:18,073 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:43:17" (2/3) ... [2019-12-27 06:43:18,074 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66a4d4c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 06:43:18, skipping insertion in model container [2019-12-27 06:43:18,074 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 06:43:18" (3/3) ... [2019-12-27 06:43:18,076 INFO L109 eAbstractionObserver]: Analyzing ICFG mix049_tso.oepc.i [2019-12-27 06:43:18,086 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 06:43:18,087 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 06:43:18,094 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 06:43:18,095 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 06:43:18,138 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:43:18,138 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:43:18,139 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:43:18,139 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:43:18,139 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:43:18,139 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:43:18,140 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:43:18,140 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:43:18,141 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:43:18,141 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:43:18,141 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:43:18,142 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:43:18,142 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:43:18,142 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:43:18,143 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:43:18,143 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:43:18,143 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:43:18,143 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:43:18,160 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:43:18,161 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:43:18,161 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:43:18,162 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:43:18,162 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:43:18,162 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:43:18,162 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:43:18,163 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:43:18,163 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:43:18,163 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:43:18,163 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:43:18,163 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:43:18,164 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:43:18,164 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:43:18,164 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:43:18,164 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:43:18,165 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:43:18,165 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:43:18,165 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:43:18,166 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:43:18,166 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:43:18,166 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:43:18,166 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:43:18,166 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:43:18,167 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:43:18,167 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:43:18,167 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:43:18,167 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:43:18,168 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:43:18,168 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:43:18,168 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:43:18,168 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:43:18,168 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:43:18,169 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:43:18,169 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:43:18,169 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:43:18,169 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:43:18,170 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:43:18,170 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:43:18,170 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:43:18,170 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:43:18,170 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:43:18,171 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:43:18,171 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:43:18,171 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:43:18,171 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:43:18,172 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:43:18,173 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:43:18,173 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:43:18,173 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:43:18,173 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:43:18,173 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:43:18,173 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:43:18,174 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:43:18,174 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:43:18,174 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:43:18,174 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:43:18,175 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:43:18,175 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:43:18,175 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:43:18,175 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:43:18,175 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:43:18,176 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:43:18,176 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:43:18,176 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:43:18,176 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:43:18,176 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:43:18,177 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:43:18,177 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:43:18,177 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:43:18,177 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:43:18,178 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:43:18,178 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:43:18,178 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:43:18,178 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:43:18,178 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:43:18,179 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:43:18,179 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:43:18,179 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:43:18,179 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:43:18,179 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:43:18,180 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:43:18,180 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:43:18,180 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:43:18,180 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:43:18,181 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:43:18,181 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:43:18,181 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:43:18,181 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:43:18,181 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:43:18,182 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:43:18,182 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:43:18,182 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:43:18,182 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:43:18,183 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:43:18,183 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:43:18,183 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:43:18,183 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:43:18,183 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:43:18,184 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:43:18,184 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:43:18,184 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:43:18,184 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:43:18,184 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:43:18,185 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:43:18,185 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:43:18,185 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:43:18,185 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:43:18,185 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:43:18,186 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:43:18,186 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:43:18,186 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:43:18,186 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:43:18,186 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:43:18,187 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:43:18,187 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:43:18,187 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:43:18,187 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:43:18,187 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:43:18,188 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:43:18,188 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:43:18,188 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:43:18,188 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:43:18,188 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:43:18,189 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:43:18,189 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:43:18,189 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:43:18,189 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:43:18,190 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:43:18,190 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:43:18,190 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:43:18,190 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:43:18,190 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:43:18,191 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:43:18,191 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:43:18,191 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:43:18,191 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:43:18,191 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:43:18,192 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:43:18,192 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:43:18,192 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:43:18,192 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:43:18,192 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:43:18,193 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:43:18,193 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:43:18,193 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:43:18,193 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:43:18,193 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:43:18,194 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:43:18,194 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:43:18,194 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:43:18,194 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:43:18,194 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:43:18,195 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:43:18,195 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:43:18,195 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:43:18,195 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:43:18,195 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:43:18,196 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:43:18,196 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:43:18,196 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:43:18,196 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:43:18,196 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:43:18,197 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:43:18,200 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:43:18,200 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:43:18,201 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:43:18,201 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:43:18,201 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:43:18,201 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:43:18,201 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:43:18,202 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:43:18,202 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:43:18,202 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:43:18,202 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:43:18,202 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:43:18,203 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:43:18,203 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:43:18,203 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:43:18,203 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:43:18,203 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:43:18,204 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:43:18,204 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:43:18,204 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:43:18,204 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:43:18,204 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:43:18,204 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:43:18,205 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:43:18,205 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:43:18,205 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:43:18,205 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:43:18,205 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:43:18,206 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:43:18,206 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:43:18,206 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:43:18,206 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:43:18,206 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:43:18,209 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:43:18,210 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:43:18,210 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:43:18,210 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:43:18,211 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:43:18,211 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:43:18,211 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:43:18,211 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:43:18,211 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:43:18,212 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:43:18,212 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:43:18,212 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:43:18,217 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:43:18,218 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:43:18,218 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:43:18,218 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:43:18,218 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:43:18,219 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:43:18,219 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:43:18,219 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:43:18,219 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:43:18,219 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:43:18,239 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 06:43:18,260 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 06:43:18,260 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 06:43:18,260 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 06:43:18,261 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 06:43:18,261 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 06:43:18,261 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 06:43:18,261 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 06:43:18,261 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 06:43:18,282 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 176 places, 213 transitions [2019-12-27 06:43:18,284 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 176 places, 213 transitions [2019-12-27 06:43:18,391 INFO L132 PetriNetUnfolder]: 47/210 cut-off events. [2019-12-27 06:43:18,392 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 06:43:18,409 INFO L76 FinitePrefix]: Finished finitePrefix Result has 220 conditions, 210 events. 47/210 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 427 event pairs. 0/161 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 06:43:18,437 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 176 places, 213 transitions [2019-12-27 06:43:18,491 INFO L132 PetriNetUnfolder]: 47/210 cut-off events. [2019-12-27 06:43:18,492 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 06:43:18,500 INFO L76 FinitePrefix]: Finished finitePrefix Result has 220 conditions, 210 events. 47/210 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 427 event pairs. 0/161 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 06:43:18,521 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-27 06:43:18,523 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 06:43:21,955 WARN L192 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 89 [2019-12-27 06:43:22,107 WARN L192 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-12-27 06:43:22,135 INFO L206 etLargeBlockEncoding]: Checked pairs total: 85326 [2019-12-27 06:43:22,135 INFO L214 etLargeBlockEncoding]: Total number of compositions: 112 [2019-12-27 06:43:22,139 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 96 places, 108 transitions [2019-12-27 06:43:45,490 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 129058 states. [2019-12-27 06:43:45,492 INFO L276 IsEmpty]: Start isEmpty. Operand 129058 states. [2019-12-27 06:43:45,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 06:43:45,497 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:43:45,498 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 06:43:45,498 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:43:45,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:43:45,505 INFO L82 PathProgramCache]: Analyzing trace with hash 910080, now seen corresponding path program 1 times [2019-12-27 06:43:45,513 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:43:45,514 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984697973] [2019-12-27 06:43:45,514 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:43:45,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:43:45,767 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-27 06:43:45,768 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984697973] [2019-12-27 06:43:45,769 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:43:45,769 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 06:43:45,770 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872640757] [2019-12-27 06:43:45,775 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:43:45,775 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:43:45,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:43:45,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:43:45,794 INFO L87 Difference]: Start difference. First operand 129058 states. Second operand 3 states. [2019-12-27 06:43:49,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:43:49,475 INFO L93 Difference]: Finished difference Result 120110 states and 517368 transitions. [2019-12-27 06:43:49,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:43:49,477 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 06:43:49,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:43:50,168 INFO L225 Difference]: With dead ends: 120110 [2019-12-27 06:43:50,168 INFO L226 Difference]: Without dead ends: 112648 [2019-12-27 06:43:50,170 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-27 06:43:57,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112648 states. [2019-12-27 06:43:59,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112648 to 112648. [2019-12-27 06:43:59,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112648 states. [2019-12-27 06:44:00,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112648 states to 112648 states and 484580 transitions. [2019-12-27 06:44:00,467 INFO L78 Accepts]: Start accepts. Automaton has 112648 states and 484580 transitions. Word has length 3 [2019-12-27 06:44:00,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:44:00,467 INFO L462 AbstractCegarLoop]: Abstraction has 112648 states and 484580 transitions. [2019-12-27 06:44:00,467 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:44:00,467 INFO L276 IsEmpty]: Start isEmpty. Operand 112648 states and 484580 transitions. [2019-12-27 06:44:00,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 06:44:00,471 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:44:00,471 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:44:00,472 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:44:00,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:44:00,472 INFO L82 PathProgramCache]: Analyzing trace with hash 459684969, now seen corresponding path program 1 times [2019-12-27 06:44:00,473 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:44:00,473 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779927356] [2019-12-27 06:44:00,473 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:44:00,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:44:00,593 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-27 06:44:00,593 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779927356] [2019-12-27 06:44:00,593 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:44:00,594 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:44:00,594 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183095127] [2019-12-27 06:44:00,595 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 06:44:00,596 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:44:00,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 06:44:00,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:44:00,596 INFO L87 Difference]: Start difference. First operand 112648 states and 484580 transitions. Second operand 4 states. [2019-12-27 06:44:06,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:44:06,332 INFO L93 Difference]: Finished difference Result 175220 states and 723657 transitions. [2019-12-27 06:44:06,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 06:44:06,332 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 06:44:06,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:44:07,020 INFO L225 Difference]: With dead ends: 175220 [2019-12-27 06:44:07,020 INFO L226 Difference]: Without dead ends: 175171 [2019-12-27 06:44:07,021 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-27 06:44:13,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175171 states. [2019-12-27 06:44:17,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175171 to 161661. [2019-12-27 06:44:17,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161661 states. [2019-12-27 06:44:17,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161661 states to 161661 states and 675776 transitions. [2019-12-27 06:44:17,994 INFO L78 Accepts]: Start accepts. Automaton has 161661 states and 675776 transitions. Word has length 11 [2019-12-27 06:44:17,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:44:17,994 INFO L462 AbstractCegarLoop]: Abstraction has 161661 states and 675776 transitions. [2019-12-27 06:44:17,994 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 06:44:17,995 INFO L276 IsEmpty]: Start isEmpty. Operand 161661 states and 675776 transitions. [2019-12-27 06:44:18,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 06:44:18,001 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:44:18,001 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:44:18,001 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:44:18,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:44:18,002 INFO L82 PathProgramCache]: Analyzing trace with hash 8923152, now seen corresponding path program 1 times [2019-12-27 06:44:18,002 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:44:18,002 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183596608] [2019-12-27 06:44:18,003 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:44:18,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:44:18,059 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-27 06:44:18,060 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183596608] [2019-12-27 06:44:18,060 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:44:18,060 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:44:18,060 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571317433] [2019-12-27 06:44:18,061 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:44:18,061 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:44:18,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:44:18,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:44:18,062 INFO L87 Difference]: Start difference. First operand 161661 states and 675776 transitions. Second operand 3 states. [2019-12-27 06:44:18,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:44:18,214 INFO L93 Difference]: Finished difference Result 34935 states and 114696 transitions. [2019-12-27 06:44:18,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:44:18,215 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 06:44:18,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:44:18,291 INFO L225 Difference]: With dead ends: 34935 [2019-12-27 06:44:18,291 INFO L226 Difference]: Without dead ends: 34935 [2019-12-27 06:44:18,291 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-27 06:44:18,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34935 states. [2019-12-27 06:44:24,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34935 to 34935. [2019-12-27 06:44:24,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34935 states. [2019-12-27 06:44:24,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34935 states to 34935 states and 114696 transitions. [2019-12-27 06:44:24,267 INFO L78 Accepts]: Start accepts. Automaton has 34935 states and 114696 transitions. Word has length 13 [2019-12-27 06:44:24,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:44:24,267 INFO L462 AbstractCegarLoop]: Abstraction has 34935 states and 114696 transitions. [2019-12-27 06:44:24,267 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:44:24,268 INFO L276 IsEmpty]: Start isEmpty. Operand 34935 states and 114696 transitions. [2019-12-27 06:44:24,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 06:44:24,271 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:44:24,272 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:44:24,272 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:44:24,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:44:24,272 INFO L82 PathProgramCache]: Analyzing trace with hash 846496093, now seen corresponding path program 1 times [2019-12-27 06:44:24,273 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:44:24,273 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044122277] [2019-12-27 06:44:24,273 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:44:24,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:44:24,341 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-27 06:44:24,341 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044122277] [2019-12-27 06:44:24,341 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:44:24,341 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:44:24,342 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824615500] [2019-12-27 06:44:24,342 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:44:24,342 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:44:24,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:44:24,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:44:24,343 INFO L87 Difference]: Start difference. First operand 34935 states and 114696 transitions. Second operand 3 states. [2019-12-27 06:44:24,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:44:24,571 INFO L93 Difference]: Finished difference Result 52469 states and 171833 transitions. [2019-12-27 06:44:24,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:44:24,572 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-27 06:44:24,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:44:24,663 INFO L225 Difference]: With dead ends: 52469 [2019-12-27 06:44:24,664 INFO L226 Difference]: Without dead ends: 52469 [2019-12-27 06:44:24,664 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-27 06:44:24,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52469 states. [2019-12-27 06:44:25,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52469 to 39684. [2019-12-27 06:44:25,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39684 states. [2019-12-27 06:44:25,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39684 states to 39684 states and 131828 transitions. [2019-12-27 06:44:25,477 INFO L78 Accepts]: Start accepts. Automaton has 39684 states and 131828 transitions. Word has length 16 [2019-12-27 06:44:25,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:44:25,478 INFO L462 AbstractCegarLoop]: Abstraction has 39684 states and 131828 transitions. [2019-12-27 06:44:25,479 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:44:25,479 INFO L276 IsEmpty]: Start isEmpty. Operand 39684 states and 131828 transitions. [2019-12-27 06:44:25,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 06:44:25,482 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:44:25,482 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:44:25,482 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:44:25,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:44:25,483 INFO L82 PathProgramCache]: Analyzing trace with hash 973495126, now seen corresponding path program 1 times [2019-12-27 06:44:25,483 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:44:25,483 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083206907] [2019-12-27 06:44:25,483 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:44:25,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:44:25,587 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-27 06:44:25,588 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083206907] [2019-12-27 06:44:25,588 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:44:25,588 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:44:25,589 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310130798] [2019-12-27 06:44:25,589 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 06:44:25,589 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:44:25,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 06:44:25,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:44:25,590 INFO L87 Difference]: Start difference. First operand 39684 states and 131828 transitions. Second operand 5 states. [2019-12-27 06:44:26,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:44:26,143 INFO L93 Difference]: Finished difference Result 54128 states and 176711 transitions. [2019-12-27 06:44:26,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 06:44:26,143 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-27 06:44:26,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:44:26,239 INFO L225 Difference]: With dead ends: 54128 [2019-12-27 06:44:26,239 INFO L226 Difference]: Without dead ends: 54128 [2019-12-27 06:44:26,240 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-27 06:44:26,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54128 states. [2019-12-27 06:44:27,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54128 to 45196. [2019-12-27 06:44:27,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45196 states. [2019-12-27 06:44:27,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45196 states to 45196 states and 149182 transitions. [2019-12-27 06:44:27,482 INFO L78 Accepts]: Start accepts. Automaton has 45196 states and 149182 transitions. Word has length 16 [2019-12-27 06:44:27,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:44:27,483 INFO L462 AbstractCegarLoop]: Abstraction has 45196 states and 149182 transitions. [2019-12-27 06:44:27,483 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 06:44:27,483 INFO L276 IsEmpty]: Start isEmpty. Operand 45196 states and 149182 transitions. [2019-12-27 06:44:27,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 06:44:27,496 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:44:27,496 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-27 06:44:27,497 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:44:27,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:44:27,497 INFO L82 PathProgramCache]: Analyzing trace with hash 1203621831, now seen corresponding path program 1 times [2019-12-27 06:44:27,497 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:44:27,498 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192858047] [2019-12-27 06:44:27,498 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:44:27,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:44:27,620 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-27 06:44:27,621 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192858047] [2019-12-27 06:44:27,621 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:44:27,621 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 06:44:27,621 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773134096] [2019-12-27 06:44:27,622 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 06:44:27,622 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:44:27,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 06:44:27,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 06:44:27,623 INFO L87 Difference]: Start difference. First operand 45196 states and 149182 transitions. Second operand 6 states. [2019-12-27 06:44:28,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:44:28,617 INFO L93 Difference]: Finished difference Result 67629 states and 216350 transitions. [2019-12-27 06:44:28,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 06:44:28,617 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-27 06:44:28,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:44:28,737 INFO L225 Difference]: With dead ends: 67629 [2019-12-27 06:44:28,737 INFO L226 Difference]: Without dead ends: 67622 [2019-12-27 06:44:28,738 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-27 06:44:29,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67622 states. [2019-12-27 06:44:29,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67622 to 44823. [2019-12-27 06:44:29,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44823 states. [2019-12-27 06:44:30,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44823 states to 44823 states and 147733 transitions. [2019-12-27 06:44:30,090 INFO L78 Accepts]: Start accepts. Automaton has 44823 states and 147733 transitions. Word has length 22 [2019-12-27 06:44:30,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:44:30,090 INFO L462 AbstractCegarLoop]: Abstraction has 44823 states and 147733 transitions. [2019-12-27 06:44:30,090 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 06:44:30,090 INFO L276 IsEmpty]: Start isEmpty. Operand 44823 states and 147733 transitions. [2019-12-27 06:44:30,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 06:44:30,108 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:44:30,108 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-27 06:44:30,108 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:44:30,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:44:30,109 INFO L82 PathProgramCache]: Analyzing trace with hash -573645910, now seen corresponding path program 1 times [2019-12-27 06:44:30,109 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:44:30,109 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415256824] [2019-12-27 06:44:30,109 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:44:30,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:44:30,208 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-27 06:44:30,208 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415256824] [2019-12-27 06:44:30,209 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:44:30,209 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:44:30,209 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848188113] [2019-12-27 06:44:30,209 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 06:44:30,210 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:44:30,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 06:44:30,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:44:30,211 INFO L87 Difference]: Start difference. First operand 44823 states and 147733 transitions. Second operand 4 states. [2019-12-27 06:44:30,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:44:30,312 INFO L93 Difference]: Finished difference Result 18428 states and 57604 transitions. [2019-12-27 06:44:30,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 06:44:30,313 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-27 06:44:30,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:44:30,354 INFO L225 Difference]: With dead ends: 18428 [2019-12-27 06:44:30,355 INFO L226 Difference]: Without dead ends: 18428 [2019-12-27 06:44:30,356 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-27 06:44:30,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18428 states. [2019-12-27 06:44:30,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18428 to 18100. [2019-12-27 06:44:30,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18100 states. [2019-12-27 06:44:30,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18100 states to 18100 states and 56668 transitions. [2019-12-27 06:44:30,649 INFO L78 Accepts]: Start accepts. Automaton has 18100 states and 56668 transitions. Word has length 25 [2019-12-27 06:44:30,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:44:30,649 INFO L462 AbstractCegarLoop]: Abstraction has 18100 states and 56668 transitions. [2019-12-27 06:44:30,650 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 06:44:30,650 INFO L276 IsEmpty]: Start isEmpty. Operand 18100 states and 56668 transitions. [2019-12-27 06:44:30,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 06:44:30,663 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:44:30,663 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:44:30,664 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:44:30,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:44:30,664 INFO L82 PathProgramCache]: Analyzing trace with hash -558988390, now seen corresponding path program 1 times [2019-12-27 06:44:30,664 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:44:30,664 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242386614] [2019-12-27 06:44:30,665 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:44:30,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:44:30,741 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-27 06:44:30,742 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242386614] [2019-12-27 06:44:30,742 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:44:30,742 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 06:44:30,742 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407150390] [2019-12-27 06:44:30,743 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 06:44:30,743 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:44:30,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 06:44:30,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 06:44:30,744 INFO L87 Difference]: Start difference. First operand 18100 states and 56668 transitions. Second operand 6 states. [2019-12-27 06:44:31,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:44:31,331 INFO L93 Difference]: Finished difference Result 25507 states and 76943 transitions. [2019-12-27 06:44:31,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 06:44:31,331 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-27 06:44:31,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:44:31,369 INFO L225 Difference]: With dead ends: 25507 [2019-12-27 06:44:31,369 INFO L226 Difference]: Without dead ends: 25507 [2019-12-27 06:44:31,370 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-27 06:44:31,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25507 states. [2019-12-27 06:44:31,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25507 to 20897. [2019-12-27 06:44:31,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20897 states. [2019-12-27 06:44:31,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20897 states to 20897 states and 64463 transitions. [2019-12-27 06:44:31,730 INFO L78 Accepts]: Start accepts. Automaton has 20897 states and 64463 transitions. Word has length 27 [2019-12-27 06:44:31,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:44:31,731 INFO L462 AbstractCegarLoop]: Abstraction has 20897 states and 64463 transitions. [2019-12-27 06:44:31,731 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 06:44:31,731 INFO L276 IsEmpty]: Start isEmpty. Operand 20897 states and 64463 transitions. [2019-12-27 06:44:31,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 06:44:31,753 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:44:31,754 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:44:31,754 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:44:31,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:44:31,754 INFO L82 PathProgramCache]: Analyzing trace with hash -856650103, now seen corresponding path program 1 times [2019-12-27 06:44:31,754 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:44:31,755 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590521380] [2019-12-27 06:44:31,755 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:44:31,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:44:32,010 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-27 06:44:32,010 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590521380] [2019-12-27 06:44:32,011 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:44:32,011 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 06:44:32,011 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501177846] [2019-12-27 06:44:32,011 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 06:44:32,012 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:44:32,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 06:44:32,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 06:44:32,013 INFO L87 Difference]: Start difference. First operand 20897 states and 64463 transitions. Second operand 7 states. [2019-12-27 06:44:33,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:44:33,314 INFO L93 Difference]: Finished difference Result 28486 states and 85230 transitions. [2019-12-27 06:44:33,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 06:44:33,314 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-27 06:44:33,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:44:33,370 INFO L225 Difference]: With dead ends: 28486 [2019-12-27 06:44:33,370 INFO L226 Difference]: Without dead ends: 28486 [2019-12-27 06:44:33,371 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2019-12-27 06:44:33,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28486 states. [2019-12-27 06:44:33,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28486 to 19834. [2019-12-27 06:44:33,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19834 states. [2019-12-27 06:44:33,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19834 states to 19834 states and 61281 transitions. [2019-12-27 06:44:33,768 INFO L78 Accepts]: Start accepts. Automaton has 19834 states and 61281 transitions. Word has length 33 [2019-12-27 06:44:33,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:44:33,769 INFO L462 AbstractCegarLoop]: Abstraction has 19834 states and 61281 transitions. [2019-12-27 06:44:33,769 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 06:44:33,769 INFO L276 IsEmpty]: Start isEmpty. Operand 19834 states and 61281 transitions. [2019-12-27 06:44:33,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 06:44:33,795 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:44:33,796 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-27 06:44:33,796 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:44:33,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:44:33,796 INFO L82 PathProgramCache]: Analyzing trace with hash 1785376658, now seen corresponding path program 1 times [2019-12-27 06:44:33,796 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:44:33,797 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315707652] [2019-12-27 06:44:33,797 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:44:33,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:44:33,908 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-27 06:44:33,909 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315707652] [2019-12-27 06:44:33,909 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:44:33,909 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 06:44:33,909 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821108241] [2019-12-27 06:44:33,910 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 06:44:33,910 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:44:33,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 06:44:33,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:44:33,910 INFO L87 Difference]: Start difference. First operand 19834 states and 61281 transitions. Second operand 5 states. [2019-12-27 06:44:34,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:44:34,520 INFO L93 Difference]: Finished difference Result 28283 states and 86522 transitions. [2019-12-27 06:44:34,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 06:44:34,521 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2019-12-27 06:44:34,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:44:34,577 INFO L225 Difference]: With dead ends: 28283 [2019-12-27 06:44:34,577 INFO L226 Difference]: Without dead ends: 28283 [2019-12-27 06:44:34,578 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 06:44:34,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28283 states. [2019-12-27 06:44:34,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28283 to 26386. [2019-12-27 06:44:34,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26386 states. [2019-12-27 06:44:35,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26386 states to 26386 states and 81240 transitions. [2019-12-27 06:44:35,022 INFO L78 Accepts]: Start accepts. Automaton has 26386 states and 81240 transitions. Word has length 39 [2019-12-27 06:44:35,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:44:35,022 INFO L462 AbstractCegarLoop]: Abstraction has 26386 states and 81240 transitions. [2019-12-27 06:44:35,023 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 06:44:35,023 INFO L276 IsEmpty]: Start isEmpty. Operand 26386 states and 81240 transitions. [2019-12-27 06:44:35,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 06:44:35,052 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:44:35,052 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-27 06:44:35,052 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:44:35,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:44:35,052 INFO L82 PathProgramCache]: Analyzing trace with hash -967157718, now seen corresponding path program 2 times [2019-12-27 06:44:35,052 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:44:35,053 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698373787] [2019-12-27 06:44:35,053 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:44:35,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:44:35,135 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-27 06:44:35,135 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698373787] [2019-12-27 06:44:35,135 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:44:35,136 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:44:35,136 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916479167] [2019-12-27 06:44:35,136 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:44:35,136 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:44:35,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:44:35,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:44:35,137 INFO L87 Difference]: Start difference. First operand 26386 states and 81240 transitions. Second operand 3 states. [2019-12-27 06:44:35,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:44:35,278 INFO L93 Difference]: Finished difference Result 26386 states and 81161 transitions. [2019-12-27 06:44:35,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:44:35,279 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-27 06:44:35,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:44:35,336 INFO L225 Difference]: With dead ends: 26386 [2019-12-27 06:44:35,337 INFO L226 Difference]: Without dead ends: 26386 [2019-12-27 06:44:35,337 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-27 06:44:35,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26386 states. [2019-12-27 06:44:35,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26386 to 22631. [2019-12-27 06:44:35,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22631 states. [2019-12-27 06:44:35,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22631 states to 22631 states and 70743 transitions. [2019-12-27 06:44:35,944 INFO L78 Accepts]: Start accepts. Automaton has 22631 states and 70743 transitions. Word has length 39 [2019-12-27 06:44:35,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:44:35,944 INFO L462 AbstractCegarLoop]: Abstraction has 22631 states and 70743 transitions. [2019-12-27 06:44:35,944 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:44:35,944 INFO L276 IsEmpty]: Start isEmpty. Operand 22631 states and 70743 transitions. [2019-12-27 06:44:35,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 06:44:35,967 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:44:35,967 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:44:35,967 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:44:35,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:44:35,968 INFO L82 PathProgramCache]: Analyzing trace with hash -1172451276, now seen corresponding path program 1 times [2019-12-27 06:44:35,968 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:44:35,968 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188254490] [2019-12-27 06:44:35,968 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:44:35,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:44:36,019 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-27 06:44:36,019 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188254490] [2019-12-27 06:44:36,019 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:44:36,020 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 06:44:36,020 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336100181] [2019-12-27 06:44:36,020 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 06:44:36,020 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:44:36,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 06:44:36,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:44:36,021 INFO L87 Difference]: Start difference. First operand 22631 states and 70743 transitions. Second operand 5 states. [2019-12-27 06:44:36,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:44:36,139 INFO L93 Difference]: Finished difference Result 21311 states and 67738 transitions. [2019-12-27 06:44:36,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 06:44:36,139 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-27 06:44:36,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:44:36,180 INFO L225 Difference]: With dead ends: 21311 [2019-12-27 06:44:36,181 INFO L226 Difference]: Without dead ends: 21311 [2019-12-27 06:44:36,181 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-27 06:44:36,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21311 states. [2019-12-27 06:44:36,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21311 to 21311. [2019-12-27 06:44:36,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21311 states. [2019-12-27 06:44:36,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21311 states to 21311 states and 67738 transitions. [2019-12-27 06:44:36,557 INFO L78 Accepts]: Start accepts. Automaton has 21311 states and 67738 transitions. Word has length 40 [2019-12-27 06:44:36,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:44:36,558 INFO L462 AbstractCegarLoop]: Abstraction has 21311 states and 67738 transitions. [2019-12-27 06:44:36,558 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 06:44:36,558 INFO L276 IsEmpty]: Start isEmpty. Operand 21311 states and 67738 transitions. [2019-12-27 06:44:36,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 06:44:36,589 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:44:36,589 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:44:36,589 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:44:36,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:44:36,590 INFO L82 PathProgramCache]: Analyzing trace with hash 236633210, now seen corresponding path program 1 times [2019-12-27 06:44:36,590 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:44:36,590 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558888895] [2019-12-27 06:44:36,590 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:44:36,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:44:36,690 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-27 06:44:36,691 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558888895] [2019-12-27 06:44:36,691 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:44:36,691 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 06:44:36,691 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008203920] [2019-12-27 06:44:36,692 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 06:44:36,692 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:44:36,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 06:44:36,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 06:44:36,693 INFO L87 Difference]: Start difference. First operand 21311 states and 67738 transitions. Second operand 7 states. [2019-12-27 06:44:37,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:44:37,317 INFO L93 Difference]: Finished difference Result 58693 states and 186497 transitions. [2019-12-27 06:44:37,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 06:44:37,318 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-27 06:44:37,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:44:37,409 INFO L225 Difference]: With dead ends: 58693 [2019-12-27 06:44:37,409 INFO L226 Difference]: Without dead ends: 45552 [2019-12-27 06:44:37,410 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2019-12-27 06:44:37,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45552 states. [2019-12-27 06:44:37,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45552 to 24967. [2019-12-27 06:44:37,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24967 states. [2019-12-27 06:44:38,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24967 states to 24967 states and 79925 transitions. [2019-12-27 06:44:38,005 INFO L78 Accepts]: Start accepts. Automaton has 24967 states and 79925 transitions. Word has length 65 [2019-12-27 06:44:38,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:44:38,006 INFO L462 AbstractCegarLoop]: Abstraction has 24967 states and 79925 transitions. [2019-12-27 06:44:38,006 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 06:44:38,006 INFO L276 IsEmpty]: Start isEmpty. Operand 24967 states and 79925 transitions. [2019-12-27 06:44:38,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 06:44:38,048 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:44:38,048 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:44:38,048 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:44:38,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:44:38,049 INFO L82 PathProgramCache]: Analyzing trace with hash 896785052, now seen corresponding path program 2 times [2019-12-27 06:44:38,049 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:44:38,049 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27628584] [2019-12-27 06:44:38,049 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:44:38,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:44:38,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:44:38,138 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27628584] [2019-12-27 06:44:38,138 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:44:38,138 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 06:44:38,139 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016855245] [2019-12-27 06:44:38,139 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 06:44:38,139 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:44:38,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 06:44:38,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 06:44:38,140 INFO L87 Difference]: Start difference. First operand 24967 states and 79925 transitions. Second operand 7 states. [2019-12-27 06:44:38,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:44:38,896 INFO L93 Difference]: Finished difference Result 66722 states and 210684 transitions. [2019-12-27 06:44:38,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 06:44:38,897 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-27 06:44:38,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:44:39,004 INFO L225 Difference]: With dead ends: 66722 [2019-12-27 06:44:39,004 INFO L226 Difference]: Without dead ends: 47701 [2019-12-27 06:44:39,006 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-27 06:44:39,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47701 states. [2019-12-27 06:44:39,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47701 to 29639. [2019-12-27 06:44:39,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29639 states. [2019-12-27 06:44:39,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29639 states to 29639 states and 94665 transitions. [2019-12-27 06:44:39,717 INFO L78 Accepts]: Start accepts. Automaton has 29639 states and 94665 transitions. Word has length 65 [2019-12-27 06:44:39,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:44:39,718 INFO L462 AbstractCegarLoop]: Abstraction has 29639 states and 94665 transitions. [2019-12-27 06:44:39,718 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 06:44:39,718 INFO L276 IsEmpty]: Start isEmpty. Operand 29639 states and 94665 transitions. [2019-12-27 06:44:39,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 06:44:39,754 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:44:39,754 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:44:39,754 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:44:39,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:44:39,755 INFO L82 PathProgramCache]: Analyzing trace with hash -1620990666, now seen corresponding path program 3 times [2019-12-27 06:44:39,755 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:44:39,755 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670059648] [2019-12-27 06:44:39,755 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:44:39,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:44:39,853 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-27 06:44:39,854 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670059648] [2019-12-27 06:44:39,854 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:44:39,854 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 06:44:39,854 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949939191] [2019-12-27 06:44:39,855 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 06:44:39,855 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:44:39,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 06:44:39,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 06:44:39,855 INFO L87 Difference]: Start difference. First operand 29639 states and 94665 transitions. Second operand 7 states. [2019-12-27 06:44:40,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:44:40,361 INFO L93 Difference]: Finished difference Result 58438 states and 184588 transitions. [2019-12-27 06:44:40,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 06:44:40,362 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-27 06:44:40,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:44:40,458 INFO L225 Difference]: With dead ends: 58438 [2019-12-27 06:44:40,458 INFO L226 Difference]: Without dead ends: 51671 [2019-12-27 06:44:40,459 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-27 06:44:40,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51671 states. [2019-12-27 06:44:41,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51671 to 29947. [2019-12-27 06:44:41,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29947 states. [2019-12-27 06:44:41,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29947 states to 29947 states and 95616 transitions. [2019-12-27 06:44:41,530 INFO L78 Accepts]: Start accepts. Automaton has 29947 states and 95616 transitions. Word has length 65 [2019-12-27 06:44:41,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:44:41,531 INFO L462 AbstractCegarLoop]: Abstraction has 29947 states and 95616 transitions. [2019-12-27 06:44:41,531 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 06:44:41,531 INFO L276 IsEmpty]: Start isEmpty. Operand 29947 states and 95616 transitions. [2019-12-27 06:44:41,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 06:44:41,563 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:44:41,563 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 06:44:41,563 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:44:41,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:44:41,564 INFO L82 PathProgramCache]: Analyzing trace with hash 691532486, now seen corresponding path program 4 times [2019-12-27 06:44:41,564 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:44:41,564 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336853088] [2019-12-27 06:44:41,564 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:44:41,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:44:41,661 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-27 06:44:41,661 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336853088] [2019-12-27 06:44:41,662 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:44:41,662 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:44:41,662 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258793594] [2019-12-27 06:44:41,662 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:44:41,663 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:44:41,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:44:41,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:44:41,663 INFO L87 Difference]: Start difference. First operand 29947 states and 95616 transitions. Second operand 3 states. [2019-12-27 06:44:41,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:44:41,895 INFO L93 Difference]: Finished difference Result 34953 states and 110763 transitions. [2019-12-27 06:44:41,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:44:41,896 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 06:44:41,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:44:41,967 INFO L225 Difference]: With dead ends: 34953 [2019-12-27 06:44:41,968 INFO L226 Difference]: Without dead ends: 34953 [2019-12-27 06:44:41,968 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:44:42,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34953 states. [2019-12-27 06:44:42,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34953 to 30783. [2019-12-27 06:44:42,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30783 states. [2019-12-27 06:44:42,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30783 states to 30783 states and 98542 transitions. [2019-12-27 06:44:42,588 INFO L78 Accepts]: Start accepts. Automaton has 30783 states and 98542 transitions. Word has length 65 [2019-12-27 06:44:42,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:44:42,589 INFO L462 AbstractCegarLoop]: Abstraction has 30783 states and 98542 transitions. [2019-12-27 06:44:42,589 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:44:42,589 INFO L276 IsEmpty]: Start isEmpty. Operand 30783 states and 98542 transitions. [2019-12-27 06:44:42,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 06:44:42,626 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:44:42,626 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:44:42,626 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:44:42,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:44:42,627 INFO L82 PathProgramCache]: Analyzing trace with hash 868435461, now seen corresponding path program 1 times [2019-12-27 06:44:42,627 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:44:42,627 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905528250] [2019-12-27 06:44:42,627 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:44:42,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:44:42,682 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-27 06:44:42,682 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905528250] [2019-12-27 06:44:42,682 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:44:42,683 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 06:44:42,683 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805610168] [2019-12-27 06:44:42,683 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 06:44:42,683 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:44:42,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 06:44:42,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:44:42,684 INFO L87 Difference]: Start difference. First operand 30783 states and 98542 transitions. Second operand 4 states. [2019-12-27 06:44:43,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:44:43,252 INFO L93 Difference]: Finished difference Result 47971 states and 153431 transitions. [2019-12-27 06:44:43,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 06:44:43,252 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-12-27 06:44:43,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:44:43,383 INFO L225 Difference]: With dead ends: 47971 [2019-12-27 06:44:43,383 INFO L226 Difference]: Without dead ends: 47971 [2019-12-27 06:44:43,384 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-27 06:44:43,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47971 states. [2019-12-27 06:44:44,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47971 to 34031. [2019-12-27 06:44:44,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34031 states. [2019-12-27 06:44:44,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34031 states to 34031 states and 110032 transitions. [2019-12-27 06:44:44,359 INFO L78 Accepts]: Start accepts. Automaton has 34031 states and 110032 transitions. Word has length 66 [2019-12-27 06:44:44,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:44:44,359 INFO L462 AbstractCegarLoop]: Abstraction has 34031 states and 110032 transitions. [2019-12-27 06:44:44,359 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 06:44:44,359 INFO L276 IsEmpty]: Start isEmpty. Operand 34031 states and 110032 transitions. [2019-12-27 06:44:44,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 06:44:44,398 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:44:44,398 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:44:44,398 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:44:44,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:44:44,399 INFO L82 PathProgramCache]: Analyzing trace with hash -909174781, now seen corresponding path program 2 times [2019-12-27 06:44:44,399 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:44:44,399 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110404582] [2019-12-27 06:44:44,399 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:44:44,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:44:44,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:44:44,442 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110404582] [2019-12-27 06:44:44,442 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:44:44,442 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:44:44,443 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93520951] [2019-12-27 06:44:44,443 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:44:44,443 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:44:44,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:44:44,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:44:44,444 INFO L87 Difference]: Start difference. First operand 34031 states and 110032 transitions. Second operand 3 states. [2019-12-27 06:44:44,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:44:44,931 INFO L93 Difference]: Finished difference Result 47990 states and 153962 transitions. [2019-12-27 06:44:44,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:44:44,932 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-27 06:44:44,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:44:45,002 INFO L225 Difference]: With dead ends: 47990 [2019-12-27 06:44:45,002 INFO L226 Difference]: Without dead ends: 47990 [2019-12-27 06:44:45,003 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-27 06:44:45,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47990 states. [2019-12-27 06:44:45,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47990 to 34147. [2019-12-27 06:44:45,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34147 states. [2019-12-27 06:44:45,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34147 states to 34147 states and 110505 transitions. [2019-12-27 06:44:45,650 INFO L78 Accepts]: Start accepts. Automaton has 34147 states and 110505 transitions. Word has length 66 [2019-12-27 06:44:45,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:44:45,650 INFO L462 AbstractCegarLoop]: Abstraction has 34147 states and 110505 transitions. [2019-12-27 06:44:45,650 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:44:45,650 INFO L276 IsEmpty]: Start isEmpty. Operand 34147 states and 110505 transitions. [2019-12-27 06:44:45,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 06:44:45,705 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:44:45,705 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:44:45,705 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:44:45,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:44:45,706 INFO L82 PathProgramCache]: Analyzing trace with hash -362141183, now seen corresponding path program 3 times [2019-12-27 06:44:45,706 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:44:45,706 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972246215] [2019-12-27 06:44:45,706 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:44:45,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:44:45,759 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-27 06:44:45,760 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972246215] [2019-12-27 06:44:45,760 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:44:45,760 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 06:44:45,760 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389798529] [2019-12-27 06:44:45,760 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 06:44:45,761 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:44:45,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 06:44:45,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:44:45,761 INFO L87 Difference]: Start difference. First operand 34147 states and 110505 transitions. Second operand 4 states. [2019-12-27 06:44:46,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:44:46,014 INFO L93 Difference]: Finished difference Result 40549 states and 129720 transitions. [2019-12-27 06:44:46,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 06:44:46,015 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-12-27 06:44:46,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:44:46,078 INFO L225 Difference]: With dead ends: 40549 [2019-12-27 06:44:46,078 INFO L226 Difference]: Without dead ends: 40549 [2019-12-27 06:44:46,078 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-27 06:44:46,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40549 states. [2019-12-27 06:44:46,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40549 to 34063. [2019-12-27 06:44:46,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34063 states. [2019-12-27 06:44:46,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34063 states to 34063 states and 110238 transitions. [2019-12-27 06:44:46,724 INFO L78 Accepts]: Start accepts. Automaton has 34063 states and 110238 transitions. Word has length 66 [2019-12-27 06:44:46,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:44:46,724 INFO L462 AbstractCegarLoop]: Abstraction has 34063 states and 110238 transitions. [2019-12-27 06:44:46,725 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 06:44:46,725 INFO L276 IsEmpty]: Start isEmpty. Operand 34063 states and 110238 transitions. [2019-12-27 06:44:46,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 06:44:46,766 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:44:46,766 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:44:46,766 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:44:46,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:44:46,767 INFO L82 PathProgramCache]: Analyzing trace with hash -909555473, now seen corresponding path program 4 times [2019-12-27 06:44:46,767 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:44:46,767 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833064443] [2019-12-27 06:44:46,767 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:44:46,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:44:46,849 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-27 06:44:46,849 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833064443] [2019-12-27 06:44:46,849 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:44:46,849 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 06:44:46,850 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276218622] [2019-12-27 06:44:46,850 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 06:44:46,850 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:44:46,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 06:44:46,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 06:44:46,851 INFO L87 Difference]: Start difference. First operand 34063 states and 110238 transitions. Second operand 7 states. [2019-12-27 06:44:47,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:44:47,662 INFO L93 Difference]: Finished difference Result 70631 states and 224909 transitions. [2019-12-27 06:44:47,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 06:44:47,662 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 66 [2019-12-27 06:44:47,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:44:47,763 INFO L225 Difference]: With dead ends: 70631 [2019-12-27 06:44:47,763 INFO L226 Difference]: Without dead ends: 65098 [2019-12-27 06:44:47,763 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-27 06:44:47,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65098 states. [2019-12-27 06:44:48,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65098 to 34127. [2019-12-27 06:44:48,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34127 states. [2019-12-27 06:44:48,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34127 states to 34127 states and 110456 transitions. [2019-12-27 06:44:48,544 INFO L78 Accepts]: Start accepts. Automaton has 34127 states and 110456 transitions. Word has length 66 [2019-12-27 06:44:48,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:44:48,544 INFO L462 AbstractCegarLoop]: Abstraction has 34127 states and 110456 transitions. [2019-12-27 06:44:48,544 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 06:44:48,544 INFO L276 IsEmpty]: Start isEmpty. Operand 34127 states and 110456 transitions. [2019-12-27 06:44:48,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 06:44:48,587 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:44:48,587 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:44:48,588 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:44:48,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:44:48,588 INFO L82 PathProgramCache]: Analyzing trace with hash 862222067, now seen corresponding path program 5 times [2019-12-27 06:44:48,588 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:44:48,588 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329289981] [2019-12-27 06:44:48,589 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:44:48,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:44:48,684 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-27 06:44:48,685 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329289981] [2019-12-27 06:44:48,685 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:44:48,685 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 06:44:48,685 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802364968] [2019-12-27 06:44:48,685 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 06:44:48,686 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:44:48,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 06:44:48,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 06:44:48,686 INFO L87 Difference]: Start difference. First operand 34127 states and 110456 transitions. Second operand 7 states. [2019-12-27 06:44:49,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:44:49,387 INFO L93 Difference]: Finished difference Result 53911 states and 174205 transitions. [2019-12-27 06:44:49,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 06:44:49,387 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 66 [2019-12-27 06:44:49,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:44:49,476 INFO L225 Difference]: With dead ends: 53911 [2019-12-27 06:44:49,476 INFO L226 Difference]: Without dead ends: 53911 [2019-12-27 06:44:49,477 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-12-27 06:44:49,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53911 states. [2019-12-27 06:44:50,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53911 to 35149. [2019-12-27 06:44:50,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35149 states. [2019-12-27 06:44:50,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35149 states to 35149 states and 113605 transitions. [2019-12-27 06:44:50,273 INFO L78 Accepts]: Start accepts. Automaton has 35149 states and 113605 transitions. Word has length 66 [2019-12-27 06:44:50,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:44:50,273 INFO L462 AbstractCegarLoop]: Abstraction has 35149 states and 113605 transitions. [2019-12-27 06:44:50,273 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 06:44:50,273 INFO L276 IsEmpty]: Start isEmpty. Operand 35149 states and 113605 transitions. [2019-12-27 06:44:50,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 06:44:50,315 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:44:50,315 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:44:50,316 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:44:50,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:44:50,316 INFO L82 PathProgramCache]: Analyzing trace with hash 605319499, now seen corresponding path program 6 times [2019-12-27 06:44:50,316 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:44:50,316 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836426333] [2019-12-27 06:44:50,317 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:44:50,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:44:50,387 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-27 06:44:50,388 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836426333] [2019-12-27 06:44:50,388 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:44:50,388 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:44:50,388 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921712715] [2019-12-27 06:44:50,388 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 06:44:50,389 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:44:50,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 06:44:50,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:44:50,389 INFO L87 Difference]: Start difference. First operand 35149 states and 113605 transitions. Second operand 4 states. [2019-12-27 06:44:50,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:44:50,832 INFO L93 Difference]: Finished difference Result 41357 states and 133048 transitions. [2019-12-27 06:44:50,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 06:44:50,832 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-12-27 06:44:50,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:44:50,889 INFO L225 Difference]: With dead ends: 41357 [2019-12-27 06:44:50,889 INFO L226 Difference]: Without dead ends: 41357 [2019-12-27 06:44:50,889 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:44:51,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41357 states. [2019-12-27 06:44:51,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41357 to 31976. [2019-12-27 06:44:51,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31976 states. [2019-12-27 06:44:51,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31976 states to 31976 states and 102860 transitions. [2019-12-27 06:44:51,485 INFO L78 Accepts]: Start accepts. Automaton has 31976 states and 102860 transitions. Word has length 66 [2019-12-27 06:44:51,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:44:51,485 INFO L462 AbstractCegarLoop]: Abstraction has 31976 states and 102860 transitions. [2019-12-27 06:44:51,485 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 06:44:51,486 INFO L276 IsEmpty]: Start isEmpty. Operand 31976 states and 102860 transitions. [2019-12-27 06:44:51,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 06:44:51,522 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:44:51,522 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:44:51,523 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:44:51,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:44:51,523 INFO L82 PathProgramCache]: Analyzing trace with hash 747197170, now seen corresponding path program 1 times [2019-12-27 06:44:51,523 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:44:51,523 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581642819] [2019-12-27 06:44:51,524 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:44:51,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:44:51,585 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-27 06:44:51,586 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581642819] [2019-12-27 06:44:51,586 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:44:51,586 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:44:51,586 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664325434] [2019-12-27 06:44:51,586 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:44:51,586 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:44:51,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:44:51,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:44:51,589 INFO L87 Difference]: Start difference. First operand 31976 states and 102860 transitions. Second operand 3 states. [2019-12-27 06:44:51,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:44:51,719 INFO L93 Difference]: Finished difference Result 26693 states and 84212 transitions. [2019-12-27 06:44:51,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:44:51,719 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-27 06:44:51,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:44:51,768 INFO L225 Difference]: With dead ends: 26693 [2019-12-27 06:44:51,768 INFO L226 Difference]: Without dead ends: 26693 [2019-12-27 06:44:51,769 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-27 06:44:51,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26693 states. [2019-12-27 06:44:52,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26693 to 24273. [2019-12-27 06:44:52,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24273 states. [2019-12-27 06:44:52,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24273 states to 24273 states and 76412 transitions. [2019-12-27 06:44:52,177 INFO L78 Accepts]: Start accepts. Automaton has 24273 states and 76412 transitions. Word has length 66 [2019-12-27 06:44:52,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:44:52,177 INFO L462 AbstractCegarLoop]: Abstraction has 24273 states and 76412 transitions. [2019-12-27 06:44:52,177 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:44:52,177 INFO L276 IsEmpty]: Start isEmpty. Operand 24273 states and 76412 transitions. [2019-12-27 06:44:52,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 06:44:52,205 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:44:52,205 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:44:52,205 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:44:52,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:44:52,205 INFO L82 PathProgramCache]: Analyzing trace with hash 863231349, now seen corresponding path program 1 times [2019-12-27 06:44:52,206 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:44:52,206 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198684218] [2019-12-27 06:44:52,206 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:44:52,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:44:52,361 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-27 06:44:52,361 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198684218] [2019-12-27 06:44:52,361 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:44:52,361 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 06:44:52,362 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663552952] [2019-12-27 06:44:52,362 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 06:44:52,362 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:44:52,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 06:44:52,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-12-27 06:44:52,363 INFO L87 Difference]: Start difference. First operand 24273 states and 76412 transitions. Second operand 10 states. [2019-12-27 06:44:53,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:44:53,713 INFO L93 Difference]: Finished difference Result 35523 states and 111659 transitions. [2019-12-27 06:44:53,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 06:44:53,713 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 67 [2019-12-27 06:44:53,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:44:53,756 INFO L225 Difference]: With dead ends: 35523 [2019-12-27 06:44:53,756 INFO L226 Difference]: Without dead ends: 28791 [2019-12-27 06:44:53,756 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2019-12-27 06:44:53,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28791 states. [2019-12-27 06:44:54,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28791 to 24621. [2019-12-27 06:44:54,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24621 states. [2019-12-27 06:44:54,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24621 states to 24621 states and 77383 transitions. [2019-12-27 06:44:54,173 INFO L78 Accepts]: Start accepts. Automaton has 24621 states and 77383 transitions. Word has length 67 [2019-12-27 06:44:54,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:44:54,173 INFO L462 AbstractCegarLoop]: Abstraction has 24621 states and 77383 transitions. [2019-12-27 06:44:54,173 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 06:44:54,173 INFO L276 IsEmpty]: Start isEmpty. Operand 24621 states and 77383 transitions. [2019-12-27 06:44:54,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 06:44:54,199 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:44:54,199 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:44:54,199 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:44:54,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:44:54,200 INFO L82 PathProgramCache]: Analyzing trace with hash -783490325, now seen corresponding path program 2 times [2019-12-27 06:44:54,200 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:44:54,200 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970250739] [2019-12-27 06:44:54,200 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:44:54,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:44:54,605 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-27 06:44:54,605 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970250739] [2019-12-27 06:44:54,605 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:44:54,606 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 06:44:54,606 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406123797] [2019-12-27 06:44:54,606 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 06:44:54,607 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:44:54,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 06:44:54,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-27 06:44:54,608 INFO L87 Difference]: Start difference. First operand 24621 states and 77383 transitions. Second operand 10 states. [2019-12-27 06:44:56,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:44:56,049 INFO L93 Difference]: Finished difference Result 36137 states and 112823 transitions. [2019-12-27 06:44:56,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 06:44:56,050 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 67 [2019-12-27 06:44:56,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:44:56,095 INFO L225 Difference]: With dead ends: 36137 [2019-12-27 06:44:56,095 INFO L226 Difference]: Without dead ends: 30919 [2019-12-27 06:44:56,096 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2019-12-27 06:44:56,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30919 states. [2019-12-27 06:44:56,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30919 to 25169. [2019-12-27 06:44:56,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25169 states. [2019-12-27 06:44:56,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25169 states to 25169 states and 78786 transitions. [2019-12-27 06:44:56,551 INFO L78 Accepts]: Start accepts. Automaton has 25169 states and 78786 transitions. Word has length 67 [2019-12-27 06:44:56,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:44:56,551 INFO L462 AbstractCegarLoop]: Abstraction has 25169 states and 78786 transitions. [2019-12-27 06:44:56,551 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 06:44:56,551 INFO L276 IsEmpty]: Start isEmpty. Operand 25169 states and 78786 transitions. [2019-12-27 06:44:56,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 06:44:56,580 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:44:56,580 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:44:56,580 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:44:56,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:44:56,581 INFO L82 PathProgramCache]: Analyzing trace with hash 17868619, now seen corresponding path program 3 times [2019-12-27 06:44:56,581 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:44:56,581 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905791108] [2019-12-27 06:44:56,581 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:44:56,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:44:56,781 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-27 06:44:56,781 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905791108] [2019-12-27 06:44:56,781 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:44:56,782 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 06:44:56,782 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296729513] [2019-12-27 06:44:56,783 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 06:44:56,783 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:44:56,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 06:44:56,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-27 06:44:56,784 INFO L87 Difference]: Start difference. First operand 25169 states and 78786 transitions. Second operand 11 states. [2019-12-27 06:44:58,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:44:58,271 INFO L93 Difference]: Finished difference Result 34459 states and 107407 transitions. [2019-12-27 06:44:58,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 06:44:58,272 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-27 06:44:58,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:44:58,320 INFO L225 Difference]: With dead ends: 34459 [2019-12-27 06:44:58,320 INFO L226 Difference]: Without dead ends: 30448 [2019-12-27 06:44:58,321 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=307, Unknown=0, NotChecked=0, Total=380 [2019-12-27 06:44:58,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30448 states. [2019-12-27 06:44:58,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30448 to 24805. [2019-12-27 06:44:58,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24805 states. [2019-12-27 06:44:58,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24805 states to 24805 states and 77645 transitions. [2019-12-27 06:44:58,778 INFO L78 Accepts]: Start accepts. Automaton has 24805 states and 77645 transitions. Word has length 67 [2019-12-27 06:44:58,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:44:58,779 INFO L462 AbstractCegarLoop]: Abstraction has 24805 states and 77645 transitions. [2019-12-27 06:44:58,779 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 06:44:58,779 INFO L276 IsEmpty]: Start isEmpty. Operand 24805 states and 77645 transitions. [2019-12-27 06:44:58,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 06:44:58,808 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:44:58,808 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:44:58,808 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:44:58,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:44:58,809 INFO L82 PathProgramCache]: Analyzing trace with hash 455548979, now seen corresponding path program 4 times [2019-12-27 06:44:58,809 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:44:58,809 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61582831] [2019-12-27 06:44:58,809 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:44:58,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:44:59,045 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-27 06:44:59,046 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61582831] [2019-12-27 06:44:59,046 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:44:59,046 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 06:44:59,046 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156726536] [2019-12-27 06:44:59,047 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 06:44:59,047 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:44:59,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 06:44:59,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-27 06:44:59,048 INFO L87 Difference]: Start difference. First operand 24805 states and 77645 transitions. Second operand 11 states. [2019-12-27 06:45:00,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:45:00,316 INFO L93 Difference]: Finished difference Result 50603 states and 158867 transitions. [2019-12-27 06:45:00,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-27 06:45:00,317 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-27 06:45:00,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:45:00,389 INFO L225 Difference]: With dead ends: 50603 [2019-12-27 06:45:00,389 INFO L226 Difference]: Without dead ends: 48055 [2019-12-27 06:45:00,389 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=190, Invalid=802, Unknown=0, NotChecked=0, Total=992 [2019-12-27 06:45:00,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48055 states. [2019-12-27 06:45:01,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48055 to 28332. [2019-12-27 06:45:01,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28332 states. [2019-12-27 06:45:01,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28332 states to 28332 states and 88818 transitions. [2019-12-27 06:45:01,166 INFO L78 Accepts]: Start accepts. Automaton has 28332 states and 88818 transitions. Word has length 67 [2019-12-27 06:45:01,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:45:01,166 INFO L462 AbstractCegarLoop]: Abstraction has 28332 states and 88818 transitions. [2019-12-27 06:45:01,166 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 06:45:01,166 INFO L276 IsEmpty]: Start isEmpty. Operand 28332 states and 88818 transitions. [2019-12-27 06:45:01,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 06:45:01,197 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:45:01,197 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:45:01,197 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:45:01,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:45:01,197 INFO L82 PathProgramCache]: Analyzing trace with hash -1142961965, now seen corresponding path program 5 times [2019-12-27 06:45:01,197 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:45:01,198 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956308981] [2019-12-27 06:45:01,198 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:45:01,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:45:01,366 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-27 06:45:01,367 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956308981] [2019-12-27 06:45:01,367 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:45:01,367 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 06:45:01,367 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068055985] [2019-12-27 06:45:01,368 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 06:45:01,368 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:45:01,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 06:45:01,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-27 06:45:01,368 INFO L87 Difference]: Start difference. First operand 28332 states and 88818 transitions. Second operand 11 states. [2019-12-27 06:45:02,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:45:02,769 INFO L93 Difference]: Finished difference Result 37041 states and 116133 transitions. [2019-12-27 06:45:02,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 06:45:02,770 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-27 06:45:02,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:45:02,821 INFO L225 Difference]: With dead ends: 37041 [2019-12-27 06:45:02,821 INFO L226 Difference]: Without dead ends: 34378 [2019-12-27 06:45:02,822 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=308, Unknown=0, NotChecked=0, Total=380 [2019-12-27 06:45:02,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34378 states. [2019-12-27 06:45:03,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34378 to 28694. [2019-12-27 06:45:03,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28694 states. [2019-12-27 06:45:03,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28694 states to 28694 states and 89867 transitions. [2019-12-27 06:45:03,324 INFO L78 Accepts]: Start accepts. Automaton has 28694 states and 89867 transitions. Word has length 67 [2019-12-27 06:45:03,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:45:03,324 INFO L462 AbstractCegarLoop]: Abstraction has 28694 states and 89867 transitions. [2019-12-27 06:45:03,324 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 06:45:03,324 INFO L276 IsEmpty]: Start isEmpty. Operand 28694 states and 89867 transitions. [2019-12-27 06:45:03,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 06:45:03,358 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:45:03,358 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:45:03,358 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:45:03,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:45:03,359 INFO L82 PathProgramCache]: Analyzing trace with hash 1218502995, now seen corresponding path program 6 times [2019-12-27 06:45:03,359 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:45:03,359 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887921896] [2019-12-27 06:45:03,359 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:45:03,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:45:03,514 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-27 06:45:03,514 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887921896] [2019-12-27 06:45:03,515 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:45:03,515 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 06:45:03,515 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009178915] [2019-12-27 06:45:03,515 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 06:45:03,515 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:45:03,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 06:45:03,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-27 06:45:03,516 INFO L87 Difference]: Start difference. First operand 28694 states and 89867 transitions. Second operand 12 states. [2019-12-27 06:45:04,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:45:04,995 INFO L93 Difference]: Finished difference Result 36496 states and 113993 transitions. [2019-12-27 06:45:04,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-27 06:45:04,995 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 67 [2019-12-27 06:45:04,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:45:05,047 INFO L225 Difference]: With dead ends: 36496 [2019-12-27 06:45:05,048 INFO L226 Difference]: Without dead ends: 35570 [2019-12-27 06:45:05,048 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=378, Unknown=0, NotChecked=0, Total=462 [2019-12-27 06:45:05,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35570 states. [2019-12-27 06:45:05,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35570 to 28602. [2019-12-27 06:45:05,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28602 states. [2019-12-27 06:45:05,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28602 states to 28602 states and 89561 transitions. [2019-12-27 06:45:05,779 INFO L78 Accepts]: Start accepts. Automaton has 28602 states and 89561 transitions. Word has length 67 [2019-12-27 06:45:05,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:45:05,779 INFO L462 AbstractCegarLoop]: Abstraction has 28602 states and 89561 transitions. [2019-12-27 06:45:05,779 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 06:45:05,779 INFO L276 IsEmpty]: Start isEmpty. Operand 28602 states and 89561 transitions. [2019-12-27 06:45:05,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 06:45:05,810 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:45:05,810 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:45:05,810 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:45:05,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:45:05,810 INFO L82 PathProgramCache]: Analyzing trace with hash 1272640249, now seen corresponding path program 7 times [2019-12-27 06:45:05,810 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:45:05,810 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817091340] [2019-12-27 06:45:05,811 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:45:05,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:45:06,441 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-27 06:45:06,442 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817091340] [2019-12-27 06:45:06,445 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:45:06,445 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-27 06:45:06,446 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513096723] [2019-12-27 06:45:06,446 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-27 06:45:06,446 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:45:06,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-27 06:45:06,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2019-12-27 06:45:06,447 INFO L87 Difference]: Start difference. First operand 28602 states and 89561 transitions. Second operand 17 states. [2019-12-27 06:45:08,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:45:08,402 INFO L93 Difference]: Finished difference Result 32196 states and 99672 transitions. [2019-12-27 06:45:08,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-27 06:45:08,407 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 67 [2019-12-27 06:45:08,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:45:08,453 INFO L225 Difference]: With dead ends: 32196 [2019-12-27 06:45:08,453 INFO L226 Difference]: Without dead ends: 32048 [2019-12-27 06:45:08,454 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=117, Invalid=695, Unknown=0, NotChecked=0, Total=812 [2019-12-27 06:45:08,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32048 states. [2019-12-27 06:45:08,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32048 to 28911. [2019-12-27 06:45:08,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28911 states. [2019-12-27 06:45:08,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28911 states to 28911 states and 90239 transitions. [2019-12-27 06:45:08,934 INFO L78 Accepts]: Start accepts. Automaton has 28911 states and 90239 transitions. Word has length 67 [2019-12-27 06:45:08,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:45:08,935 INFO L462 AbstractCegarLoop]: Abstraction has 28911 states and 90239 transitions. [2019-12-27 06:45:08,935 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-27 06:45:08,935 INFO L276 IsEmpty]: Start isEmpty. Operand 28911 states and 90239 transitions. [2019-12-27 06:45:08,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 06:45:08,968 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:45:08,969 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:45:08,969 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:45:08,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:45:08,969 INFO L82 PathProgramCache]: Analyzing trace with hash 1571821451, now seen corresponding path program 1 times [2019-12-27 06:45:08,969 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:45:08,969 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996751931] [2019-12-27 06:45:08,969 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:45:08,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:45:09,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:45:09,022 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996751931] [2019-12-27 06:45:09,022 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:45:09,022 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:45:09,022 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295360605] [2019-12-27 06:45:09,023 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:45:09,023 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:45:09,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:45:09,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:45:09,023 INFO L87 Difference]: Start difference. First operand 28911 states and 90239 transitions. Second operand 3 states. [2019-12-27 06:45:09,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:45:09,200 INFO L93 Difference]: Finished difference Result 31747 states and 93616 transitions. [2019-12-27 06:45:09,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:45:09,201 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-12-27 06:45:09,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:45:09,272 INFO L225 Difference]: With dead ends: 31747 [2019-12-27 06:45:09,272 INFO L226 Difference]: Without dead ends: 31747 [2019-12-27 06:45:09,273 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-27 06:45:09,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31747 states. [2019-12-27 06:45:09,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31747 to 24436. [2019-12-27 06:45:09,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24436 states. [2019-12-27 06:45:10,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24436 states to 24436 states and 72964 transitions. [2019-12-27 06:45:10,052 INFO L78 Accepts]: Start accepts. Automaton has 24436 states and 72964 transitions. Word has length 67 [2019-12-27 06:45:10,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:45:10,053 INFO L462 AbstractCegarLoop]: Abstraction has 24436 states and 72964 transitions. [2019-12-27 06:45:10,053 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:45:10,053 INFO L276 IsEmpty]: Start isEmpty. Operand 24436 states and 72964 transitions. [2019-12-27 06:45:10,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 06:45:10,091 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:45:10,091 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:45:10,091 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:45:10,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:45:10,091 INFO L82 PathProgramCache]: Analyzing trace with hash 459139499, now seen corresponding path program 8 times [2019-12-27 06:45:10,092 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:45:10,092 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936976580] [2019-12-27 06:45:10,092 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:45:10,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:45:10,594 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-27 06:45:10,595 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936976580] [2019-12-27 06:45:10,595 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:45:10,595 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-27 06:45:10,595 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760860076] [2019-12-27 06:45:10,595 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-27 06:45:10,595 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:45:10,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-27 06:45:10,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2019-12-27 06:45:10,596 INFO L87 Difference]: Start difference. First operand 24436 states and 72964 transitions. Second operand 17 states. [2019-12-27 06:45:12,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:45:12,753 INFO L93 Difference]: Finished difference Result 27001 states and 80090 transitions. [2019-12-27 06:45:12,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-27 06:45:12,754 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 67 [2019-12-27 06:45:12,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:45:12,789 INFO L225 Difference]: With dead ends: 27001 [2019-12-27 06:45:12,789 INFO L226 Difference]: Without dead ends: 26882 [2019-12-27 06:45:12,790 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=170, Invalid=952, Unknown=0, NotChecked=0, Total=1122 [2019-12-27 06:45:12,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26882 states. [2019-12-27 06:45:13,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26882 to 24880. [2019-12-27 06:45:13,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24880 states. [2019-12-27 06:45:13,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24880 states to 24880 states and 74185 transitions. [2019-12-27 06:45:13,176 INFO L78 Accepts]: Start accepts. Automaton has 24880 states and 74185 transitions. Word has length 67 [2019-12-27 06:45:13,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:45:13,176 INFO L462 AbstractCegarLoop]: Abstraction has 24880 states and 74185 transitions. [2019-12-27 06:45:13,177 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-27 06:45:13,177 INFO L276 IsEmpty]: Start isEmpty. Operand 24880 states and 74185 transitions. [2019-12-27 06:45:13,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 06:45:13,201 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:45:13,202 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:45:13,202 INFO L410 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:45:13,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:45:13,202 INFO L82 PathProgramCache]: Analyzing trace with hash 1399706911, now seen corresponding path program 9 times [2019-12-27 06:45:13,202 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:45:13,202 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048211047] [2019-12-27 06:45:13,202 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:45:13,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:45:13,382 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-27 06:45:13,382 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048211047] [2019-12-27 06:45:13,382 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:45:13,382 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 06:45:13,382 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012158244] [2019-12-27 06:45:13,383 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 06:45:13,383 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:45:13,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 06:45:13,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-27 06:45:13,383 INFO L87 Difference]: Start difference. First operand 24880 states and 74185 transitions. Second operand 11 states. [2019-12-27 06:45:14,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:45:14,463 INFO L93 Difference]: Finished difference Result 43306 states and 129162 transitions. [2019-12-27 06:45:14,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 06:45:14,464 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-27 06:45:14,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:45:14,511 INFO L225 Difference]: With dead ends: 43306 [2019-12-27 06:45:14,511 INFO L226 Difference]: Without dead ends: 35245 [2019-12-27 06:45:14,512 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=141, Invalid=509, Unknown=0, NotChecked=0, Total=650 [2019-12-27 06:45:14,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35245 states. [2019-12-27 06:45:14,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35245 to 19949. [2019-12-27 06:45:14,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19949 states. [2019-12-27 06:45:14,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19949 states to 19949 states and 59751 transitions. [2019-12-27 06:45:14,939 INFO L78 Accepts]: Start accepts. Automaton has 19949 states and 59751 transitions. Word has length 67 [2019-12-27 06:45:14,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:45:14,940 INFO L462 AbstractCegarLoop]: Abstraction has 19949 states and 59751 transitions. [2019-12-27 06:45:14,940 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 06:45:14,940 INFO L276 IsEmpty]: Start isEmpty. Operand 19949 states and 59751 transitions. [2019-12-27 06:45:14,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 06:45:14,960 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:45:14,960 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:45:14,960 INFO L410 AbstractCegarLoop]: === Iteration 34 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:45:14,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:45:14,961 INFO L82 PathProgramCache]: Analyzing trace with hash -1730024245, now seen corresponding path program 10 times [2019-12-27 06:45:14,961 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:45:14,961 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755760552] [2019-12-27 06:45:14,961 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:45:14,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:45:15,131 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-27 06:45:15,132 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755760552] [2019-12-27 06:45:15,135 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:45:15,135 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 06:45:15,135 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74089430] [2019-12-27 06:45:15,136 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 06:45:15,136 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:45:15,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 06:45:15,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-27 06:45:15,137 INFO L87 Difference]: Start difference. First operand 19949 states and 59751 transitions. Second operand 12 states. [2019-12-27 06:45:16,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:45:16,094 INFO L93 Difference]: Finished difference Result 35195 states and 105670 transitions. [2019-12-27 06:45:16,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 06:45:16,095 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 67 [2019-12-27 06:45:16,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:45:16,142 INFO L225 Difference]: With dead ends: 35195 [2019-12-27 06:45:16,142 INFO L226 Difference]: Without dead ends: 34952 [2019-12-27 06:45:16,142 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-27 06:45:16,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34952 states. [2019-12-27 06:45:16,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34952 to 19773. [2019-12-27 06:45:16,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19773 states. [2019-12-27 06:45:16,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19773 states to 19773 states and 59295 transitions. [2019-12-27 06:45:16,582 INFO L78 Accepts]: Start accepts. Automaton has 19773 states and 59295 transitions. Word has length 67 [2019-12-27 06:45:16,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:45:16,582 INFO L462 AbstractCegarLoop]: Abstraction has 19773 states and 59295 transitions. [2019-12-27 06:45:16,582 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 06:45:16,582 INFO L276 IsEmpty]: Start isEmpty. Operand 19773 states and 59295 transitions. [2019-12-27 06:45:16,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 06:45:16,606 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:45:16,606 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:45:16,606 INFO L410 AbstractCegarLoop]: === Iteration 35 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:45:16,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:45:16,606 INFO L82 PathProgramCache]: Analyzing trace with hash 1929562173, now seen corresponding path program 11 times [2019-12-27 06:45:16,606 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:45:16,606 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949348886] [2019-12-27 06:45:16,606 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:45:16,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 06:45:16,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 06:45:16,728 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 06:45:16,728 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 06:45:16,732 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [891] [891] ULTIMATE.startENTRY-->L822: Formula: (let ((.cse0 (store |v_#valid_61| 0 0))) (and (= v_~main$tmp_guard1~0_17 0) (= v_~main$tmp_guard0~0_10 0) (= 0 v_~z$r_buff1_thd0~0_24) (= v_~z$r_buff0_thd3~0_78 0) (= 0 v_~__unbuffered_p1_EAX~0_14) (= v_~z$w_buff0_used~0_113 0) (= v_~z$read_delayed_var~0.offset_6 0) (= 0 v_~__unbuffered_p0_EAX~0_15) (= |v_#NULL.offset_7| 0) (= 0 v_~z$w_buff0~0_27) (= (select .cse0 |v_ULTIMATE.start_main_~#t1315~0.base_21|) 0) (= 0 v_~z$r_buff1_thd2~0_17) (= 0 v_~z$flush_delayed~0_13) (= v_~z$r_buff0_thd2~0_20 0) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t1315~0.base_21| 4)) (= 0 v_~__unbuffered_cnt~0_21) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t1315~0.base_21|) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1315~0.base_21| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1315~0.base_21|) |v_ULTIMATE.start_main_~#t1315~0.offset_16| 0)) |v_#memory_int_17|) (< 0 |v_#StackHeapBarrier_17|) (= 0 v_~weak$$choice2~0_32) (= v_~x~0_10 0) (= 0 v_~z$r_buff1_thd1~0_17) (= v_~z$r_buff0_thd1~0_24 0) (= v_~z$read_delayed_var~0.base_6 0) (= 0 v_~__unbuffered_p2_EAX~0_16) (= 0 v_~z$w_buff1_used~0_72) (= 0 v_~weak$$choice0~0_7) (= v_~z$read_delayed~0_7 0) (= v_~z$mem_tmp~0_10 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t1315~0.base_21| 1) |v_#valid_59|) (= v_~z$r_buff0_thd0~0_18 0) (= 0 |v_#NULL.base_7|) (= v_~z~0_27 0) (= 0 v_~z$r_buff1_thd3~0_50) (= 0 v_~z$w_buff1~0_26) (= |v_ULTIMATE.start_main_~#t1315~0.offset_16| 0) (= 0 v_~y~0_9))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_61|, #memory_int=|v_#memory_int_18|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_~#t1317~0.base=|v_ULTIMATE.start_main_~#t1317~0.base_19|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_17, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_11|, #NULL.offset=|v_#NULL.offset_7|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_9|, ULTIMATE.start_main_~#t1317~0.offset=|v_ULTIMATE.start_main_~#t1317~0.offset_15|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_9|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_22|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_18, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_15, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_14, #length=|v_#length_21|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_16, ~z$mem_tmp~0=v_~z$mem_tmp~0_10, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_7|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_72, ~z$flush_delayed~0=v_~z$flush_delayed~0_13, ULTIMATE.start_main_~#t1315~0.offset=|v_ULTIMATE.start_main_~#t1315~0.offset_16|, ~weak$$choice0~0=v_~weak$$choice0~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_17, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_6, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_78, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_21, ULTIMATE.start_main_~#t1316~0.offset=|v_ULTIMATE.start_main_~#t1316~0.offset_13|, ~x~0=v_~x~0_10, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_26, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_11|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_6, ULTIMATE.start_main_~#t1316~0.base=|v_ULTIMATE.start_main_~#t1316~0.base_19|, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_9|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_24, ~y~0=v_~y~0_9, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_20, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_7|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_113, ~z$w_buff0~0=v_~z$w_buff0~0_27, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_8|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_50, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10, #NULL.base=|v_#NULL.base_7|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_17|, #valid=|v_#valid_59|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_~#t1315~0.base=|v_ULTIMATE.start_main_~#t1315~0.base_21|, ~z~0=v_~z~0_27, ~weak$$choice2~0=v_~weak$$choice2~0_32, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_24} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1317~0.base, ~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_~#t1317~0.offset, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ULTIMATE.start_main_#t~nondet45, ~z$w_buff1_used~0, ~z$flush_delayed~0, ULTIMATE.start_main_~#t1315~0.offset, ~weak$$choice0~0, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ULTIMATE.start_main_~#t1316~0.offset, ~x~0, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_~#t1316~0.base, ULTIMATE.start_main_#t~ite51, ~z$r_buff1_thd0~0, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet46, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_#t~nondet44, ~z$r_buff1_thd3~0, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_~#t1315~0.base, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 06:45:16,733 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [872] [872] L822-1-->L824: Formula: (and (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1316~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1316~0.base_11|) |v_ULTIMATE.start_main_~#t1316~0.offset_9| 1)) |v_#memory_int_13|) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t1316~0.base_11| 4) |v_#length_17|) (= |v_#valid_38| (store |v_#valid_39| |v_ULTIMATE.start_main_~#t1316~0.base_11| 1)) (= 0 |v_ULTIMATE.start_main_~#t1316~0.offset_9|) (= 0 (select |v_#valid_39| |v_ULTIMATE.start_main_~#t1316~0.base_11|)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1316~0.base_11|) (not (= 0 |v_ULTIMATE.start_main_~#t1316~0.base_11|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t1316~0.base=|v_ULTIMATE.start_main_~#t1316~0.base_11|, #StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_6|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_13|, #length=|v_#length_17|, ULTIMATE.start_main_~#t1316~0.offset=|v_ULTIMATE.start_main_~#t1316~0.offset_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1316~0.base, ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1316~0.offset] because there is no mapped edge [2019-12-27 06:45:16,734 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] L4-->L746: Formula: (and (= v_~z$r_buff0_thd1~0_16 1) (not (= 0 v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_8)) (= v_~z$r_buff0_thd2~0_15 v_~z$r_buff1_thd2~0_11) (= v_~z$r_buff0_thd1~0_17 v_~z$r_buff1_thd1~0_11) (= v_~z$r_buff0_thd3~0_52 v_~z$r_buff1_thd3~0_33) (= v_~__unbuffered_p0_EAX~0_4 v_~x~0_4) (= v_~z$r_buff0_thd0~0_15 v_~z$r_buff1_thd0~0_10)) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_15, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_52, P0Thread1of1ForFork1___VERIFIER_assert_~expression=v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_8, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_17, ~x~0=v_~x~0_4, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_15} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_4, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_15, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_33, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_10, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_11, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_11, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_52, P0Thread1of1ForFork1___VERIFIER_assert_~expression=v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_8, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_16, ~x~0=v_~x~0_4, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_15} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 06:45:16,736 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L766-2-->L766-4: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff1_used~0_In-1417533365 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd2~0_In-1417533365 256)))) (or (and (= ~z~0_In-1417533365 |P1Thread1of1ForFork2_#t~ite9_Out-1417533365|) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= ~z$w_buff1~0_In-1417533365 |P1Thread1of1ForFork2_#t~ite9_Out-1417533365|)))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1417533365, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1417533365, ~z$w_buff1~0=~z$w_buff1~0_In-1417533365, ~z~0=~z~0_In-1417533365} OutVars{P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out-1417533365|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1417533365, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1417533365, ~z$w_buff1~0=~z$w_buff1~0_In-1417533365, ~z~0=~z~0_In-1417533365} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9] because there is no mapped edge [2019-12-27 06:45:16,736 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L766-4-->L767: Formula: (= v_~z~0_16 |v_P1Thread1of1ForFork2_#t~ite9_8|) InVars {P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_8|} OutVars{P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_7|, P1Thread1of1ForFork2_#t~ite10=|v_P1Thread1of1ForFork2_#t~ite10_7|, ~z~0=v_~z~0_16} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite10, ~z~0] because there is no mapped edge [2019-12-27 06:45:16,736 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [869] [869] L824-1-->L826: Formula: (and (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1317~0.base_13| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1317~0.base_13|) |v_ULTIMATE.start_main_~#t1317~0.offset_11| 2)) |v_#memory_int_11|) (= |v_ULTIMATE.start_main_~#t1317~0.offset_11| 0) (= 0 (select |v_#valid_37| |v_ULTIMATE.start_main_~#t1317~0.base_13|)) (not (= |v_ULTIMATE.start_main_~#t1317~0.base_13| 0)) (= |v_#valid_36| (store |v_#valid_37| |v_ULTIMATE.start_main_~#t1317~0.base_13| 1)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t1317~0.base_13|) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t1317~0.base_13| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t1317~0.base=|v_ULTIMATE.start_main_~#t1317~0.base_13|, #valid=|v_#valid_36|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_5|, #memory_int=|v_#memory_int_11|, #length=|v_#length_15|, ULTIMATE.start_main_~#t1317~0.offset=|v_ULTIMATE.start_main_~#t1317~0.offset_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1317~0.base, #valid, ULTIMATE.start_main_#t~nondet45, #memory_int, #length, ULTIMATE.start_main_~#t1317~0.offset] because there is no mapped edge [2019-12-27 06:45:16,736 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L767-->L767-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd2~0_In-1114573364 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In-1114573364 256) 0))) (or (and (= |P1Thread1of1ForFork2_#t~ite11_Out-1114573364| ~z$w_buff0_used~0_In-1114573364) (or .cse0 .cse1)) (and (not .cse1) (= |P1Thread1of1ForFork2_#t~ite11_Out-1114573364| 0) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1114573364, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1114573364} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1114573364, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out-1114573364|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1114573364} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-27 06:45:16,737 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [823] [823] L768-->L768-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff0_thd2~0_In1640746897 256))) (.cse3 (= (mod ~z$w_buff0_used~0_In1640746897 256) 0)) (.cse1 (= (mod ~z$w_buff1_used~0_In1640746897 256) 0)) (.cse0 (= 0 (mod ~z$r_buff1_thd2~0_In1640746897 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork2_#t~ite12_Out1640746897| ~z$w_buff1_used~0_In1640746897) (or .cse2 .cse3)) (and (= |P1Thread1of1ForFork2_#t~ite12_Out1640746897| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1640746897, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1640746897, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1640746897, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1640746897} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1640746897, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1640746897, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1640746897, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out1640746897|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1640746897} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-27 06:45:16,741 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [842] [842] L769-->L769-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In352314653 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In352314653 256)))) (or (and (= 0 |P1Thread1of1ForFork2_#t~ite13_Out352314653|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~z$r_buff0_thd2~0_In352314653 |P1Thread1of1ForFork2_#t~ite13_Out352314653|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In352314653, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In352314653} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In352314653, P1Thread1of1ForFork2_#t~ite13=|P1Thread1of1ForFork2_#t~ite13_Out352314653|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In352314653} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite13] because there is no mapped edge [2019-12-27 06:45:16,742 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [873] [873] L790-->L790-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-24964262 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite26_In-24964262| |P2Thread1of1ForFork0_#t~ite26_Out-24964262|) (= ~z$w_buff0_used~0_In-24964262 |P2Thread1of1ForFork0_#t~ite27_Out-24964262|) (not .cse0)) (and (= ~z$w_buff0_used~0_In-24964262 |P2Thread1of1ForFork0_#t~ite26_Out-24964262|) .cse0 (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-24964262 256)))) (or (and .cse1 (= (mod ~z$w_buff1_used~0_In-24964262 256) 0)) (= 0 (mod ~z$w_buff0_used~0_In-24964262 256)) (and .cse1 (= (mod ~z$r_buff1_thd3~0_In-24964262 256) 0)))) (= |P2Thread1of1ForFork0_#t~ite27_Out-24964262| |P2Thread1of1ForFork0_#t~ite26_Out-24964262|)))) InVars {P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_In-24964262|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-24964262, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-24964262, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-24964262, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-24964262, ~weak$$choice2~0=~weak$$choice2~0_In-24964262} OutVars{P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_Out-24964262|, P2Thread1of1ForFork0_#t~ite27=|P2Thread1of1ForFork0_#t~ite27_Out-24964262|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-24964262, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-24964262, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-24964262, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-24964262, ~weak$$choice2~0=~weak$$choice2~0_In-24964262} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite26, P2Thread1of1ForFork0_#t~ite27] because there is no mapped edge [2019-12-27 06:45:16,744 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [810] [810] L792-->L793: Formula: (and (= v_~z$r_buff0_thd3~0_63 v_~z$r_buff0_thd3~0_62) (not (= 0 (mod v_~weak$$choice2~0_24 256)))) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_63, ~weak$$choice2~0=v_~weak$$choice2~0_24} OutVars{P2Thread1of1ForFork0_#t~ite33=|v_P2Thread1of1ForFork0_#t~ite33_9|, P2Thread1of1ForFork0_#t~ite32=|v_P2Thread1of1ForFork0_#t~ite32_9|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_62, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_8|, ~weak$$choice2~0=v_~weak$$choice2~0_24} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite33, P2Thread1of1ForFork0_#t~ite32, ~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-27 06:45:16,746 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L747-->L747-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In758210432 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd1~0_In758210432 256)))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork1_#t~ite5_Out758210432| ~z$w_buff0_used~0_In758210432)) (and (not .cse0) (= |P0Thread1of1ForFork1_#t~ite5_Out758210432| 0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In758210432, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In758210432} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out758210432|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In758210432, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In758210432} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-27 06:45:16,747 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [814] [814] L795-->L799: Formula: (and (not (= (mod v_~z$flush_delayed~0_8 256) 0)) (= 0 v_~z$flush_delayed~0_7) (= v_~z~0_22 v_~z$mem_tmp~0_5)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~z$flush_delayed~0=v_~z$flush_delayed~0_8} OutVars{P2Thread1of1ForFork0_#t~ite37=|v_P2Thread1of1ForFork0_#t~ite37_7|, ~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~z$flush_delayed~0=v_~z$flush_delayed~0_7, ~z~0=v_~z~0_22} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite37, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-27 06:45:16,747 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [827] [827] L799-2-->L799-5: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd3~0_In1017987220 256))) (.cse0 (= (mod ~z$w_buff1_used~0_In1017987220 256) 0)) (.cse2 (= |P2Thread1of1ForFork0_#t~ite39_Out1017987220| |P2Thread1of1ForFork0_#t~ite38_Out1017987220|))) (or (and (not .cse0) (not .cse1) (= ~z$w_buff1~0_In1017987220 |P2Thread1of1ForFork0_#t~ite38_Out1017987220|) .cse2) (and (= ~z~0_In1017987220 |P2Thread1of1ForFork0_#t~ite38_Out1017987220|) (or .cse1 .cse0) .cse2))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1017987220, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1017987220, ~z$w_buff1~0=~z$w_buff1~0_In1017987220, ~z~0=~z~0_In1017987220} OutVars{P2Thread1of1ForFork0_#t~ite39=|P2Thread1of1ForFork0_#t~ite39_Out1017987220|, P2Thread1of1ForFork0_#t~ite38=|P2Thread1of1ForFork0_#t~ite38_Out1017987220|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1017987220, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1017987220, ~z$w_buff1~0=~z$w_buff1~0_In1017987220, ~z~0=~z~0_In1017987220} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite39, P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-27 06:45:16,748 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [843] [843] L800-->L800-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In356232439 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd3~0_In356232439 256) 0))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite40_Out356232439| ~z$w_buff0_used~0_In356232439)) (and (not .cse1) (not .cse0) (= |P2Thread1of1ForFork0_#t~ite40_Out356232439| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In356232439, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In356232439} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In356232439, P2Thread1of1ForFork0_#t~ite40=|P2Thread1of1ForFork0_#t~ite40_Out356232439|, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In356232439} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite40] because there is no mapped edge [2019-12-27 06:45:16,749 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L801-->L801-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff0_thd3~0_In-204821147 256))) (.cse3 (= (mod ~z$w_buff0_used~0_In-204821147 256) 0)) (.cse1 (= (mod ~z$w_buff1_used~0_In-204821147 256) 0)) (.cse0 (= (mod ~z$r_buff1_thd3~0_In-204821147 256) 0))) (or (and (= ~z$w_buff1_used~0_In-204821147 |P2Thread1of1ForFork0_#t~ite41_Out-204821147|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= 0 |P2Thread1of1ForFork0_#t~ite41_Out-204821147|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-204821147, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-204821147, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-204821147, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-204821147} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-204821147, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-204821147, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-204821147, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-204821147, P2Thread1of1ForFork0_#t~ite41=|P2Thread1of1ForFork0_#t~ite41_Out-204821147|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite41] because there is no mapped edge [2019-12-27 06:45:16,749 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [824] [824] L802-->L802-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1738300734 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-1738300734 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite42_Out-1738300734| ~z$r_buff0_thd3~0_In-1738300734)) (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork0_#t~ite42_Out-1738300734| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1738300734, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1738300734} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1738300734, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1738300734, P2Thread1of1ForFork0_#t~ite42=|P2Thread1of1ForFork0_#t~ite42_Out-1738300734|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-27 06:45:16,750 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [846] [846] L803-->L803-2: Formula: (let ((.cse3 (= (mod ~z$r_buff1_thd3~0_In176752721 256) 0)) (.cse2 (= (mod ~z$w_buff1_used~0_In176752721 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In176752721 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In176752721 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork0_#t~ite43_Out176752721| 0)) (and (or .cse3 .cse2) (= |P2Thread1of1ForFork0_#t~ite43_Out176752721| ~z$r_buff1_thd3~0_In176752721) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In176752721, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In176752721, ~z$w_buff1_used~0=~z$w_buff1_used~0_In176752721, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In176752721} OutVars{P2Thread1of1ForFork0_#t~ite43=|P2Thread1of1ForFork0_#t~ite43_Out176752721|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In176752721, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In176752721, ~z$w_buff1_used~0=~z$w_buff1_used~0_In176752721, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In176752721} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite43] because there is no mapped edge [2019-12-27 06:45:16,750 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [858] [858] L803-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_13 1) v_~__unbuffered_cnt~0_12) (= |v_P2Thread1of1ForFork0_#res.base_5| 0) (= v_~z$r_buff1_thd3~0_44 |v_P2Thread1of1ForFork0_#t~ite43_8|)) InVars {P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_7|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_44, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite43, ~z$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-27 06:45:16,750 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [847] [847] L748-->L748-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1145677599 256))) (.cse0 (= (mod ~z$r_buff0_thd1~0_In-1145677599 256) 0)) (.cse2 (= (mod ~z$w_buff1_used~0_In-1145677599 256) 0)) (.cse3 (= (mod ~z$r_buff1_thd1~0_In-1145677599 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork1_#t~ite6_Out-1145677599| 0)) (and (or .cse1 .cse0) (= |P0Thread1of1ForFork1_#t~ite6_Out-1145677599| ~z$w_buff1_used~0_In-1145677599) (or .cse2 .cse3)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1145677599, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1145677599, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1145677599, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1145677599} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1145677599, P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out-1145677599|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1145677599, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1145677599, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1145677599} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-27 06:45:16,751 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [845] [845] L749-->L750: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In473971681 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd1~0_In473971681 256)))) (or (and (not .cse0) (= ~z$r_buff0_thd1~0_Out473971681 0) (not .cse1)) (and (= ~z$r_buff0_thd1~0_Out473971681 ~z$r_buff0_thd1~0_In473971681) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In473971681, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In473971681} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In473971681, P0Thread1of1ForFork1_#t~ite7=|P0Thread1of1ForFork1_#t~ite7_Out473971681|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out473971681} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 06:45:16,751 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L750-->L750-2: Formula: (let ((.cse2 (= (mod ~z$r_buff1_thd1~0_In1138249556 256) 0)) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In1138249556 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd1~0_In1138249556 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In1138249556 256)))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork1_#t~ite8_Out1138249556| ~z$r_buff1_thd1~0_In1138249556) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= |P0Thread1of1ForFork1_#t~ite8_Out1138249556| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1138249556, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1138249556, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1138249556, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1138249556} OutVars{P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out1138249556|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1138249556, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1138249556, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1138249556, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1138249556} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-27 06:45:16,751 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [865] [865] L750-2-->P0EXIT: Formula: (and (= v_~z$r_buff1_thd1~0_12 |v_P0Thread1of1ForFork1_#t~ite8_8|) (= v_~__unbuffered_cnt~0_14 (+ v_~__unbuffered_cnt~0_15 1)) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15} OutVars{P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_7|, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_12, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8, P0Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd1~0, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-27 06:45:16,752 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L770-->L770-2: Formula: (let ((.cse1 (= (mod ~z$r_buff1_thd2~0_In1355231797 256) 0)) (.cse0 (= (mod ~z$w_buff1_used~0_In1355231797 256) 0)) (.cse3 (= (mod ~z$r_buff0_thd2~0_In1355231797 256) 0)) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In1355231797 256)))) (or (and (= |P1Thread1of1ForFork2_#t~ite14_Out1355231797| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse3 .cse2) (= |P1Thread1of1ForFork2_#t~ite14_Out1355231797| ~z$r_buff1_thd2~0_In1355231797)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1355231797, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1355231797, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1355231797, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1355231797} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1355231797, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1355231797, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1355231797, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out1355231797|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1355231797} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-27 06:45:16,752 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [870] [870] L770-2-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork2_#t~ite14_8| v_~z$r_buff1_thd2~0_13) (= (+ v_~__unbuffered_cnt~0_17 1) v_~__unbuffered_cnt~0_16) (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_17, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_8|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_13, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_7|, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-27 06:45:16,752 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [799] [799] L826-1-->L832: Formula: (and (= 3 v_~__unbuffered_cnt~0_10) (= v_~main$tmp_guard0~0_5 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_4|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 06:45:16,753 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L832-2-->L832-5: Formula: (let ((.cse0 (= |ULTIMATE.start_main_#t~ite47_Out1518166634| |ULTIMATE.start_main_#t~ite48_Out1518166634|)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In1518166634 256))) (.cse2 (= 0 (mod ~z$r_buff1_thd0~0_In1518166634 256)))) (or (and .cse0 (= ~z$w_buff1~0_In1518166634 |ULTIMATE.start_main_#t~ite47_Out1518166634|) (not .cse1) (not .cse2)) (and .cse0 (or .cse1 .cse2) (= ~z~0_In1518166634 |ULTIMATE.start_main_#t~ite47_Out1518166634|)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1518166634, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1518166634, ~z$w_buff1~0=~z$w_buff1~0_In1518166634, ~z~0=~z~0_In1518166634} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1518166634, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out1518166634|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1518166634, ~z$w_buff1~0=~z$w_buff1~0_In1518166634, ULTIMATE.start_main_#t~ite48=|ULTIMATE.start_main_#t~ite48_Out1518166634|, ~z~0=~z~0_In1518166634} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-27 06:45:16,754 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [839] [839] L833-->L833-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In51158859 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In51158859 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite49_Out51158859| 0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite49_Out51158859| ~z$w_buff0_used~0_In51158859) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In51158859, ~z$w_buff0_used~0=~z$w_buff0_used~0_In51158859} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In51158859, ~z$w_buff0_used~0=~z$w_buff0_used~0_In51158859, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out51158859|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-27 06:45:16,754 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [830] [830] L834-->L834-2: Formula: (let ((.cse3 (= 0 (mod ~z$r_buff0_thd0~0_In-1858413906 256))) (.cse2 (= (mod ~z$w_buff0_used~0_In-1858413906 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In-1858413906 256))) (.cse0 (= (mod ~z$w_buff1_used~0_In-1858413906 256) 0))) (or (and (or .cse0 .cse1) (= ~z$w_buff1_used~0_In-1858413906 |ULTIMATE.start_main_#t~ite50_Out-1858413906|) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= 0 |ULTIMATE.start_main_#t~ite50_Out-1858413906|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1858413906, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1858413906, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1858413906, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1858413906} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out-1858413906|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1858413906, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1858413906, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1858413906, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1858413906} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-27 06:45:16,755 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] L835-->L835-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In269913421 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In269913421 256)))) (or (and (= ~z$r_buff0_thd0~0_In269913421 |ULTIMATE.start_main_#t~ite51_Out269913421|) (or .cse0 .cse1)) (and (= |ULTIMATE.start_main_#t~ite51_Out269913421| 0) (not .cse0) (not .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In269913421, ~z$w_buff0_used~0=~z$w_buff0_used~0_In269913421} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In269913421, ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out269913421|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In269913421} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-27 06:45:16,756 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L836-->L836-2: Formula: (let ((.cse3 (= 0 (mod ~z$w_buff0_used~0_In-967980388 256))) (.cse2 (= (mod ~z$r_buff0_thd0~0_In-967980388 256) 0)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In-967980388 256))) (.cse0 (= (mod ~z$r_buff1_thd0~0_In-967980388 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite52_Out-967980388| ~z$r_buff1_thd0~0_In-967980388) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= |ULTIMATE.start_main_#t~ite52_Out-967980388| 0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-967980388, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-967980388, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-967980388, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-967980388} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out-967980388|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-967980388, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-967980388, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-967980388, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-967980388} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-27 06:45:16,756 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [876] [876] L836-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= 0 v_~__unbuffered_p2_EAX~0_10) (= v_~main$tmp_guard1~0_10 0) (= v_~__unbuffered_p0_EAX~0_9 0) (= |v_ULTIMATE.start_main_#t~ite52_15| v_~z$r_buff1_thd0~0_17) (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|) (= 0 v_~__unbuffered_p1_EAX~0_8) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11| (mod v_~main$tmp_guard1~0_10 256))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_9, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_15|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_8, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_10} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_9, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_14|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_17, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_8, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_17, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_10, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_10, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 06:45:16,873 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 06:45:16 BasicIcfg [2019-12-27 06:45:16,873 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 06:45:16,875 INFO L168 Benchmark]: Toolchain (without parser) took 120656.97 ms. Allocated memory was 146.3 MB in the beginning and 3.8 GB in the end (delta: 3.6 GB). Free memory was 102.6 MB in the beginning and 1.0 GB in the end (delta: -900.4 MB). Peak memory consumption was 2.7 GB. Max. memory is 7.1 GB. [2019-12-27 06:45:16,875 INFO L168 Benchmark]: CDTParser took 0.47 ms. Allocated memory is still 146.3 MB. Free memory was 122.6 MB in the beginning and 122.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-27 06:45:16,876 INFO L168 Benchmark]: CACSL2BoogieTranslator took 850.33 ms. Allocated memory was 146.3 MB in the beginning and 203.4 MB in the end (delta: 57.1 MB). Free memory was 102.2 MB in the beginning and 157.1 MB in the end (delta: -54.9 MB). Peak memory consumption was 21.7 MB. Max. memory is 7.1 GB. [2019-12-27 06:45:16,876 INFO L168 Benchmark]: Boogie Procedure Inliner took 63.29 ms. Allocated memory is still 203.4 MB. Free memory was 156.4 MB in the beginning and 153.8 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 06:45:16,876 INFO L168 Benchmark]: Boogie Preprocessor took 39.65 ms. Allocated memory is still 203.4 MB. Free memory was 153.8 MB in the beginning and 151.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-27 06:45:16,877 INFO L168 Benchmark]: RCFGBuilder took 893.58 ms. Allocated memory is still 203.4 MB. Free memory was 151.9 MB in the beginning and 101.9 MB in the end (delta: 50.0 MB). Peak memory consumption was 50.0 MB. Max. memory is 7.1 GB. [2019-12-27 06:45:16,877 INFO L168 Benchmark]: TraceAbstraction took 118805.50 ms. Allocated memory was 203.4 MB in the beginning and 3.8 GB in the end (delta: 3.6 GB). Free memory was 101.2 MB in the beginning and 1.0 GB in the end (delta: -901.8 MB). Peak memory consumption was 2.7 GB. Max. memory is 7.1 GB. [2019-12-27 06:45:16,880 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.47 ms. Allocated memory is still 146.3 MB. Free memory was 122.6 MB in the beginning and 122.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 850.33 ms. Allocated memory was 146.3 MB in the beginning and 203.4 MB in the end (delta: 57.1 MB). Free memory was 102.2 MB in the beginning and 157.1 MB in the end (delta: -54.9 MB). Peak memory consumption was 21.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 63.29 ms. Allocated memory is still 203.4 MB. Free memory was 156.4 MB in the beginning and 153.8 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 39.65 ms. Allocated memory is still 203.4 MB. Free memory was 153.8 MB in the beginning and 151.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 893.58 ms. Allocated memory is still 203.4 MB. Free memory was 151.9 MB in the beginning and 101.9 MB in the end (delta: 50.0 MB). Peak memory consumption was 50.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 118805.50 ms. Allocated memory was 203.4 MB in the beginning and 3.8 GB in the end (delta: 3.6 GB). Free memory was 101.2 MB in the beginning and 1.0 GB in the end (delta: -901.8 MB). Peak memory consumption was 2.7 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.8s, 176 ProgramPointsBefore, 96 ProgramPointsAfterwards, 213 TransitionsBefore, 108 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 7 FixpointIterations, 33 TrivialSequentialCompositions, 47 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 32 ConcurrentYvCompositions, 29 ChoiceCompositions, 6738 VarBasedMoverChecksPositive, 208 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 85326 CheckedPairsTotal, 112 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L822] FCALL, FORK 0 pthread_create(&t1315, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L731] 1 z$w_buff1 = z$w_buff0 [L732] 1 z$w_buff0 = 1 [L733] 1 z$w_buff1_used = z$w_buff0_used [L734] 1 z$w_buff0_used = (_Bool)1 [L746] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L824] FCALL, FORK 0 pthread_create(&t1316, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L760] 2 x = 1 [L763] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L766] 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L767] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L826] FCALL, FORK 0 pthread_create(&t1317, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L780] 3 y = 1 [L783] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L784] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L785] 3 z$flush_delayed = weak$$choice2 [L786] 3 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L787] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L787] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L788] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0))=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L768] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L788] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L789] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2=0, z$w_buff1=0, z$w_buff1_used=0] [L789] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L790] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L791] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2=0, z$w_buff1=0, z$w_buff1_used=0] [L791] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L793] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2=0, z$w_buff1=0, z$w_buff1_used=0] [L793] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L794] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2=0, z$w_buff1=0, z$w_buff1_used=0] [L746] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L747] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L799] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2=0, z$w_buff1=0, z$w_buff1_used=0] [L799] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L800] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L801] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L802] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L748] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L769] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L832] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L832] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L833] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L834] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L835] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 167 locations, 2 error locations. Result: UNSAFE, OverallTime: 118.4s, OverallIterations: 35, TraceHistogramMax: 1, AutomataDifference: 38.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 8098 SDtfs, 10028 SDslu, 31737 SDs, 0 SdLazy, 16937 SolverSat, 337 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 13.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 420 GetRequests, 53 SyntacticMatches, 16 SemanticMatches, 351 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 987 ImplicationChecksByTransitivity, 4.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=161661occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 46.8s AutomataMinimizationTime, 34 MinimizatonAttempts, 328475 StatesRemovedByMinimization, 31 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 3.7s InterpolantComputationTime, 1810 NumberOfCodeBlocks, 1810 NumberOfCodeBlocksAsserted, 35 NumberOfCheckSat, 1709 ConstructedInterpolants, 0 QuantifiedInterpolants, 427519 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 34 InterpolantComputations, 34 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...