/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/safe005_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 22:24:05,944 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 22:24:05,947 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 22:24:05,959 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 22:24:05,959 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 22:24:05,960 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 22:24:05,962 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 22:24:05,964 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 22:24:05,965 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 22:24:05,966 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 22:24:05,967 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 22:24:05,968 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 22:24:05,969 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 22:24:05,970 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 22:24:05,971 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 22:24:05,972 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 22:24:05,973 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 22:24:05,973 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 22:24:05,975 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 22:24:05,977 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 22:24:05,978 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 22:24:05,979 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 22:24:05,981 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 22:24:05,981 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 22:24:05,984 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 22:24:05,984 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 22:24:05,984 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 22:24:05,985 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 22:24:05,985 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 22:24:05,986 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 22:24:05,986 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 22:24:05,987 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 22:24:05,988 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 22:24:05,989 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 22:24:05,990 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 22:24:05,990 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 22:24:05,991 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 22:24:05,991 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 22:24:05,991 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 22:24:05,992 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 22:24:05,993 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 22:24:05,994 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf [2019-12-18 22:24:06,008 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 22:24:06,008 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 22:24:06,009 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 22:24:06,010 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 22:24:06,010 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 22:24:06,010 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 22:24:06,010 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 22:24:06,011 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 22:24:06,011 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 22:24:06,011 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 22:24:06,011 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 22:24:06,011 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 22:24:06,012 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 22:24:06,012 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 22:24:06,012 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 22:24:06,012 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 22:24:06,012 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 22:24:06,013 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 22:24:06,013 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 22:24:06,013 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 22:24:06,013 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 22:24:06,013 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 22:24:06,014 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 22:24:06,014 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 22:24:06,014 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 22:24:06,014 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 22:24:06,015 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 22:24:06,015 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-18 22:24:06,015 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 22:24:06,015 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 22:24:06,287 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 22:24:06,306 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 22:24:06,310 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 22:24:06,312 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 22:24:06,312 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 22:24:06,314 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe005_power.opt.i [2019-12-18 22:24:06,395 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/567676a79/c0ee89349944418aa896f32e07e68020/FLAG997a72a30 [2019-12-18 22:24:06,969 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 22:24:06,969 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe005_power.opt.i [2019-12-18 22:24:06,987 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/567676a79/c0ee89349944418aa896f32e07e68020/FLAG997a72a30 [2019-12-18 22:24:07,200 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/567676a79/c0ee89349944418aa896f32e07e68020 [2019-12-18 22:24:07,211 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 22:24:07,213 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 22:24:07,214 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 22:24:07,214 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 22:24:07,220 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 22:24:07,221 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 10:24:07" (1/1) ... [2019-12-18 22:24:07,224 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1df12d0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:24:07, skipping insertion in model container [2019-12-18 22:24:07,224 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 10:24:07" (1/1) ... [2019-12-18 22:24:07,233 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 22:24:07,280 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 22:24:07,785 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 22:24:07,798 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 22:24:07,861 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 22:24:07,937 INFO L208 MainTranslator]: Completed translation [2019-12-18 22:24:07,938 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:24:07 WrapperNode [2019-12-18 22:24:07,938 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 22:24:07,939 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 22:24:07,939 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 22:24:07,939 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 22:24:07,948 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:24:07" (1/1) ... [2019-12-18 22:24:07,969 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:24:07" (1/1) ... [2019-12-18 22:24:08,008 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 22:24:08,009 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 22:24:08,009 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 22:24:08,009 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 22:24:08,019 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:24:07" (1/1) ... [2019-12-18 22:24:08,019 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:24:07" (1/1) ... [2019-12-18 22:24:08,024 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:24:07" (1/1) ... [2019-12-18 22:24:08,024 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:24:07" (1/1) ... [2019-12-18 22:24:08,034 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:24:07" (1/1) ... [2019-12-18 22:24:08,038 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:24:07" (1/1) ... [2019-12-18 22:24:08,042 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:24:07" (1/1) ... [2019-12-18 22:24:08,046 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 22:24:08,047 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 22:24:08,047 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 22:24:08,047 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 22:24:08,048 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:24:07" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 22:24:08,116 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 22:24:08,116 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 22:24:08,116 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 22:24:08,116 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 22:24:08,117 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 22:24:08,117 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 22:24:08,117 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 22:24:08,117 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 22:24:08,117 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 22:24:08,118 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 22:24:08,118 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 22:24:08,118 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 22:24:08,118 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 22:24:08,120 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 22:24:08,818 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 22:24:08,819 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 22:24:08,820 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 10:24:08 BoogieIcfgContainer [2019-12-18 22:24:08,820 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 22:24:08,822 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 22:24:08,822 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 22:24:08,825 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 22:24:08,826 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 10:24:07" (1/3) ... [2019-12-18 22:24:08,826 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60996cee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 10:24:08, skipping insertion in model container [2019-12-18 22:24:08,827 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:24:07" (2/3) ... [2019-12-18 22:24:08,827 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60996cee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 10:24:08, skipping insertion in model container [2019-12-18 22:24:08,827 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 10:24:08" (3/3) ... [2019-12-18 22:24:08,829 INFO L109 eAbstractionObserver]: Analyzing ICFG safe005_power.opt.i [2019-12-18 22:24:08,840 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 22:24:08,841 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 22:24:08,849 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 22:24:08,850 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 22:24:08,891 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:08,892 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:08,892 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:08,893 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:08,893 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:08,893 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:08,893 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:08,893 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:08,894 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:08,894 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:08,895 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:08,895 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:08,895 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:08,896 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:08,896 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:08,896 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:08,896 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:08,897 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:08,897 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:08,897 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:08,897 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:08,898 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:08,898 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:08,899 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:08,899 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:08,899 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:08,900 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:08,900 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:08,900 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:08,900 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:08,900 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:08,901 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:08,901 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:08,901 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:08,902 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:08,902 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:08,902 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:08,902 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:08,903 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:08,903 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:08,903 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:08,904 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:08,904 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:08,904 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:08,904 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:08,905 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:08,905 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:08,905 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:08,905 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:08,906 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:08,906 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:08,906 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:08,906 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:08,907 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:08,907 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:08,907 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:08,907 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:08,908 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:08,908 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:08,908 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:08,908 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:08,909 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:08,909 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:08,909 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:08,909 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:08,909 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:08,910 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:08,910 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:08,910 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:08,910 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:08,911 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:08,911 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:08,911 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:08,911 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:08,912 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:08,912 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:08,912 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:08,912 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:08,913 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:08,913 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:08,913 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:08,913 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:08,914 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:08,914 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:08,914 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:08,914 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:08,915 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:08,915 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:08,915 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:08,915 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:08,915 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:08,916 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:08,916 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:08,916 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:08,917 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:08,917 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:08,934 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:08,934 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:08,934 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:08,934 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:08,935 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:08,935 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:08,935 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:08,936 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:08,936 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:08,936 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:08,936 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:08,937 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:08,937 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:08,937 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:08,937 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:08,937 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:08,938 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:08,938 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:08,938 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:08,938 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:08,938 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:08,939 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:08,939 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:08,939 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:08,939 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:08,939 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:08,940 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:08,940 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:08,940 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:08,940 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:08,940 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:08,941 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:08,941 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:08,941 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:08,941 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:08,941 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:08,942 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:08,942 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:08,942 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:08,942 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:08,942 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:08,943 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:08,943 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:08,943 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:08,943 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:08,943 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:08,944 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:08,944 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:08,944 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:08,944 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:08,944 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:08,945 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:08,945 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:08,945 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:08,945 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:08,945 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:08,946 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:08,946 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:08,946 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:08,946 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:08,946 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:08,947 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:08,950 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:08,950 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:08,951 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:08,951 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:08,951 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:08,951 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:08,951 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:08,952 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:08,952 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:08,952 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:08,952 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:08,952 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:08,955 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:08,955 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:08,956 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:08,956 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:08,956 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:08,956 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:08,956 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:08,957 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:08,957 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:08,957 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:08,959 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:08,959 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:08,960 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:08,960 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:08,960 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:08,960 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:08,960 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:08,961 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:08,961 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:08,961 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:08,961 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:08,961 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:08,962 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:08,962 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:08,962 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:08,962 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:08,962 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:08,962 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:08,963 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:08,963 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:08,963 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:08,963 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:08,963 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:08,963 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:08,964 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:08,964 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:08,964 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:24:08,980 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 22:24:09,001 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 22:24:09,002 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 22:24:09,002 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 22:24:09,002 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 22:24:09,002 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 22:24:09,002 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 22:24:09,002 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 22:24:09,002 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 22:24:09,019 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 163 places, 194 transitions [2019-12-18 22:24:09,021 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 163 places, 194 transitions [2019-12-18 22:24:09,104 INFO L126 PetriNetUnfolder]: 41/191 cut-off events. [2019-12-18 22:24:09,104 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 22:24:09,124 INFO L76 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 191 events. 41/191 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 452 event pairs. 9/157 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-18 22:24:09,159 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 163 places, 194 transitions [2019-12-18 22:24:09,201 INFO L126 PetriNetUnfolder]: 41/191 cut-off events. [2019-12-18 22:24:09,202 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 22:24:09,211 INFO L76 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 191 events. 41/191 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 452 event pairs. 9/157 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-18 22:24:09,236 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 16696 [2019-12-18 22:24:09,238 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-18 22:24:12,749 WARN L192 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2019-12-18 22:24:12,908 WARN L192 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-12-18 22:24:12,982 INFO L206 etLargeBlockEncoding]: Checked pairs total: 69182 [2019-12-18 22:24:12,982 INFO L214 etLargeBlockEncoding]: Total number of compositions: 111 [2019-12-18 22:24:12,986 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 84 places, 92 transitions [2019-12-18 22:24:27,140 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 92280 states. [2019-12-18 22:24:27,142 INFO L276 IsEmpty]: Start isEmpty. Operand 92280 states. [2019-12-18 22:24:27,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-18 22:24:27,148 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:24:27,149 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-18 22:24:27,150 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:24:27,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:24:27,155 INFO L82 PathProgramCache]: Analyzing trace with hash 794638691, now seen corresponding path program 1 times [2019-12-18 22:24:27,162 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:24:27,162 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767528751] [2019-12-18 22:24:27,162 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:24:27,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:24:27,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:24:27,470 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767528751] [2019-12-18 22:24:27,470 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:24:27,471 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 22:24:27,471 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997195247] [2019-12-18 22:24:27,477 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 22:24:27,478 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:24:27,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 22:24:27,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:24:27,495 INFO L87 Difference]: Start difference. First operand 92280 states. Second operand 3 states. [2019-12-18 22:24:28,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:24:28,486 INFO L93 Difference]: Finished difference Result 90395 states and 387830 transitions. [2019-12-18 22:24:28,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 22:24:28,488 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-18 22:24:28,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:24:29,055 INFO L225 Difference]: With dead ends: 90395 [2019-12-18 22:24:29,055 INFO L226 Difference]: Without dead ends: 85117 [2019-12-18 22:24:29,056 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:24:34,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85117 states. [2019-12-18 22:24:38,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85117 to 85117. [2019-12-18 22:24:38,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85117 states. [2019-12-18 22:24:39,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85117 states to 85117 states and 364674 transitions. [2019-12-18 22:24:39,465 INFO L78 Accepts]: Start accepts. Automaton has 85117 states and 364674 transitions. Word has length 5 [2019-12-18 22:24:39,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:24:39,465 INFO L462 AbstractCegarLoop]: Abstraction has 85117 states and 364674 transitions. [2019-12-18 22:24:39,466 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 22:24:39,466 INFO L276 IsEmpty]: Start isEmpty. Operand 85117 states and 364674 transitions. [2019-12-18 22:24:39,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 22:24:39,474 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:24:39,474 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:24:39,474 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:24:39,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:24:39,475 INFO L82 PathProgramCache]: Analyzing trace with hash 2064286334, now seen corresponding path program 1 times [2019-12-18 22:24:39,475 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:24:39,475 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098490024] [2019-12-18 22:24:39,475 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:24:39,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:24:39,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-18 22:24:39,595 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098490024] [2019-12-18 22:24:39,595 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:24:39,596 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 22:24:39,596 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439897542] [2019-12-18 22:24:39,598 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 22:24:39,598 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:24:39,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 22:24:39,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 22:24:39,599 INFO L87 Difference]: Start difference. First operand 85117 states and 364674 transitions. Second operand 4 states. [2019-12-18 22:24:44,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:24:44,184 INFO L93 Difference]: Finished difference Result 130038 states and 533020 transitions. [2019-12-18 22:24:44,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 22:24:44,185 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-18 22:24:44,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:24:44,683 INFO L225 Difference]: With dead ends: 130038 [2019-12-18 22:24:44,683 INFO L226 Difference]: Without dead ends: 129940 [2019-12-18 22:24:44,684 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 22:24:48,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129940 states. [2019-12-18 22:24:51,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129940 to 116665. [2019-12-18 22:24:51,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116665 states. [2019-12-18 22:24:57,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116665 states to 116665 states and 485676 transitions. [2019-12-18 22:24:57,063 INFO L78 Accepts]: Start accepts. Automaton has 116665 states and 485676 transitions. Word has length 13 [2019-12-18 22:24:57,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:24:57,065 INFO L462 AbstractCegarLoop]: Abstraction has 116665 states and 485676 transitions. [2019-12-18 22:24:57,065 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 22:24:57,065 INFO L276 IsEmpty]: Start isEmpty. Operand 116665 states and 485676 transitions. [2019-12-18 22:24:57,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 22:24:57,069 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:24:57,069 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:24:57,069 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:24:57,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:24:57,070 INFO L82 PathProgramCache]: Analyzing trace with hash -1769810709, now seen corresponding path program 1 times [2019-12-18 22:24:57,070 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:24:57,070 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728696384] [2019-12-18 22:24:57,071 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:24:57,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:24:57,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:24:57,186 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728696384] [2019-12-18 22:24:57,186 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:24:57,186 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 22:24:57,187 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317620675] [2019-12-18 22:24:57,187 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 22:24:57,187 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:24:57,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 22:24:57,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 22:24:57,188 INFO L87 Difference]: Start difference. First operand 116665 states and 485676 transitions. Second operand 4 states. [2019-12-18 22:24:58,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:24:58,286 INFO L93 Difference]: Finished difference Result 161841 states and 657746 transitions. [2019-12-18 22:24:58,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 22:24:58,286 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-18 22:24:58,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:25:00,457 INFO L225 Difference]: With dead ends: 161841 [2019-12-18 22:25:00,458 INFO L226 Difference]: Without dead ends: 161729 [2019-12-18 22:25:00,458 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 22:25:09,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161729 states. [2019-12-18 22:25:11,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161729 to 135524. [2019-12-18 22:25:11,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135524 states. [2019-12-18 22:25:11,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135524 states to 135524 states and 561455 transitions. [2019-12-18 22:25:11,835 INFO L78 Accepts]: Start accepts. Automaton has 135524 states and 561455 transitions. Word has length 13 [2019-12-18 22:25:11,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:25:11,836 INFO L462 AbstractCegarLoop]: Abstraction has 135524 states and 561455 transitions. [2019-12-18 22:25:11,836 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 22:25:11,836 INFO L276 IsEmpty]: Start isEmpty. Operand 135524 states and 561455 transitions. [2019-12-18 22:25:11,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 22:25:11,840 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:25:11,841 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:25:11,841 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:25:11,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:25:11,841 INFO L82 PathProgramCache]: Analyzing trace with hash 37773354, now seen corresponding path program 1 times [2019-12-18 22:25:11,841 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:25:11,842 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125533709] [2019-12-18 22:25:11,842 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:25:11,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:25:11,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:25:11,901 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125533709] [2019-12-18 22:25:11,902 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:25:11,902 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 22:25:11,902 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953936479] [2019-12-18 22:25:11,903 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 22:25:11,903 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:25:11,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 22:25:11,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:25:11,903 INFO L87 Difference]: Start difference. First operand 135524 states and 561455 transitions. Second operand 3 states. [2019-12-18 22:25:13,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:25:13,883 INFO L93 Difference]: Finished difference Result 181948 states and 742402 transitions. [2019-12-18 22:25:13,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 22:25:13,884 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-12-18 22:25:13,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:25:14,438 INFO L225 Difference]: With dead ends: 181948 [2019-12-18 22:25:14,439 INFO L226 Difference]: Without dead ends: 181948 [2019-12-18 22:25:14,439 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:25:24,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181948 states. [2019-12-18 22:25:27,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181948 to 149024. [2019-12-18 22:25:27,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149024 states. [2019-12-18 22:25:28,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149024 states to 149024 states and 615188 transitions. [2019-12-18 22:25:28,264 INFO L78 Accepts]: Start accepts. Automaton has 149024 states and 615188 transitions. Word has length 14 [2019-12-18 22:25:28,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:25:28,264 INFO L462 AbstractCegarLoop]: Abstraction has 149024 states and 615188 transitions. [2019-12-18 22:25:28,264 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 22:25:28,264 INFO L276 IsEmpty]: Start isEmpty. Operand 149024 states and 615188 transitions. [2019-12-18 22:25:28,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 22:25:28,268 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:25:28,269 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:25:28,269 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:25:28,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:25:28,269 INFO L82 PathProgramCache]: Analyzing trace with hash 37638690, now seen corresponding path program 1 times [2019-12-18 22:25:28,270 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:25:28,270 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982183110] [2019-12-18 22:25:28,270 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:25:28,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:25:28,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:25:28,367 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982183110] [2019-12-18 22:25:28,367 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:25:28,367 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 22:25:28,368 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979724287] [2019-12-18 22:25:28,368 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 22:25:28,368 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:25:28,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 22:25:28,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 22:25:28,369 INFO L87 Difference]: Start difference. First operand 149024 states and 615188 transitions. Second operand 4 states. [2019-12-18 22:25:30,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:25:30,506 INFO L93 Difference]: Finished difference Result 176806 states and 719392 transitions. [2019-12-18 22:25:30,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 22:25:30,507 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-18 22:25:30,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:25:31,039 INFO L225 Difference]: With dead ends: 176806 [2019-12-18 22:25:31,040 INFO L226 Difference]: Without dead ends: 176726 [2019-12-18 22:25:31,040 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 22:25:41,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176726 states. [2019-12-18 22:25:43,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176726 to 154481. [2019-12-18 22:25:43,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154481 states. [2019-12-18 22:25:45,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154481 states to 154481 states and 636822 transitions. [2019-12-18 22:25:45,314 INFO L78 Accepts]: Start accepts. Automaton has 154481 states and 636822 transitions. Word has length 14 [2019-12-18 22:25:45,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:25:45,314 INFO L462 AbstractCegarLoop]: Abstraction has 154481 states and 636822 transitions. [2019-12-18 22:25:45,314 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 22:25:45,314 INFO L276 IsEmpty]: Start isEmpty. Operand 154481 states and 636822 transitions. [2019-12-18 22:25:45,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 22:25:45,317 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:25:45,317 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:25:45,317 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:25:45,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:25:45,318 INFO L82 PathProgramCache]: Analyzing trace with hash 197780815, now seen corresponding path program 1 times [2019-12-18 22:25:45,318 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:25:45,318 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175219707] [2019-12-18 22:25:45,318 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:25:45,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:25:45,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:25:45,390 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175219707] [2019-12-18 22:25:45,390 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:25:45,390 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 22:25:45,390 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218381591] [2019-12-18 22:25:45,391 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 22:25:45,391 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:25:45,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 22:25:45,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 22:25:45,391 INFO L87 Difference]: Start difference. First operand 154481 states and 636822 transitions. Second operand 4 states. [2019-12-18 22:25:46,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:25:46,476 INFO L93 Difference]: Finished difference Result 181899 states and 742115 transitions. [2019-12-18 22:25:46,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 22:25:46,477 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-18 22:25:46,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:25:53,170 INFO L225 Difference]: With dead ends: 181899 [2019-12-18 22:25:53,171 INFO L226 Difference]: Without dead ends: 181811 [2019-12-18 22:25:53,171 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 22:25:57,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181811 states. [2019-12-18 22:26:00,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181811 to 156231. [2019-12-18 22:26:00,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156231 states. [2019-12-18 22:26:00,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156231 states to 156231 states and 644534 transitions. [2019-12-18 22:26:00,946 INFO L78 Accepts]: Start accepts. Automaton has 156231 states and 644534 transitions. Word has length 14 [2019-12-18 22:26:00,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:26:00,947 INFO L462 AbstractCegarLoop]: Abstraction has 156231 states and 644534 transitions. [2019-12-18 22:26:00,947 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 22:26:00,947 INFO L276 IsEmpty]: Start isEmpty. Operand 156231 states and 644534 transitions. [2019-12-18 22:26:00,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-18 22:26:00,964 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:26:00,964 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:26:00,965 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:26:00,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:26:00,965 INFO L82 PathProgramCache]: Analyzing trace with hash -538416332, now seen corresponding path program 1 times [2019-12-18 22:26:00,965 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:26:00,966 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657485394] [2019-12-18 22:26:00,966 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:26:00,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:26:01,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:26:01,014 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657485394] [2019-12-18 22:26:01,014 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:26:01,014 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 22:26:01,015 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273201783] [2019-12-18 22:26:01,015 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 22:26:01,015 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:26:01,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 22:26:01,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:26:01,016 INFO L87 Difference]: Start difference. First operand 156231 states and 644534 transitions. Second operand 3 states. [2019-12-18 22:26:02,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:26:02,874 INFO L93 Difference]: Finished difference Result 155313 states and 640741 transitions. [2019-12-18 22:26:02,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 22:26:02,875 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-18 22:26:02,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:26:03,344 INFO L225 Difference]: With dead ends: 155313 [2019-12-18 22:26:03,344 INFO L226 Difference]: Without dead ends: 155313 [2019-12-18 22:26:03,345 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:26:13,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155313 states. [2019-12-18 22:26:15,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155313 to 155313. [2019-12-18 22:26:15,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155313 states. [2019-12-18 22:26:17,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155313 states to 155313 states and 640741 transitions. [2019-12-18 22:26:17,151 INFO L78 Accepts]: Start accepts. Automaton has 155313 states and 640741 transitions. Word has length 18 [2019-12-18 22:26:17,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:26:17,152 INFO L462 AbstractCegarLoop]: Abstraction has 155313 states and 640741 transitions. [2019-12-18 22:26:17,152 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 22:26:17,152 INFO L276 IsEmpty]: Start isEmpty. Operand 155313 states and 640741 transitions. [2019-12-18 22:26:17,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-18 22:26:17,177 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:26:17,177 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:26:17,177 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:26:17,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:26:17,178 INFO L82 PathProgramCache]: Analyzing trace with hash -919407984, now seen corresponding path program 1 times [2019-12-18 22:26:17,178 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:26:17,178 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451733266] [2019-12-18 22:26:17,178 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:26:17,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:26:17,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:26:17,226 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451733266] [2019-12-18 22:26:17,226 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:26:17,226 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 22:26:17,226 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312566918] [2019-12-18 22:26:17,227 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 22:26:17,227 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:26:17,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 22:26:17,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 22:26:17,228 INFO L87 Difference]: Start difference. First operand 155313 states and 640741 transitions. Second operand 4 states. [2019-12-18 22:26:25,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:26:25,001 INFO L93 Difference]: Finished difference Result 286953 states and 1185326 transitions. [2019-12-18 22:26:25,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 22:26:25,001 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-12-18 22:26:25,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:26:25,544 INFO L225 Difference]: With dead ends: 286953 [2019-12-18 22:26:25,544 INFO L226 Difference]: Without dead ends: 164501 [2019-12-18 22:26:25,544 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 22:26:30,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164501 states. [2019-12-18 22:26:32,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164501 to 163553. [2019-12-18 22:26:32,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163553 states. [2019-12-18 22:26:34,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163553 states to 163553 states and 668264 transitions. [2019-12-18 22:26:34,298 INFO L78 Accepts]: Start accepts. Automaton has 163553 states and 668264 transitions. Word has length 19 [2019-12-18 22:26:34,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:26:34,298 INFO L462 AbstractCegarLoop]: Abstraction has 163553 states and 668264 transitions. [2019-12-18 22:26:34,298 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 22:26:34,298 INFO L276 IsEmpty]: Start isEmpty. Operand 163553 states and 668264 transitions. [2019-12-18 22:26:34,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-18 22:26:34,318 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:26:34,318 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:26:34,318 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:26:34,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:26:34,318 INFO L82 PathProgramCache]: Analyzing trace with hash -112975457, now seen corresponding path program 1 times [2019-12-18 22:26:34,319 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:26:34,319 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047569052] [2019-12-18 22:26:34,319 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:26:34,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:26:34,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:26:34,402 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047569052] [2019-12-18 22:26:34,402 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:26:34,403 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 22:26:34,403 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946480960] [2019-12-18 22:26:34,403 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 22:26:34,403 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:26:34,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 22:26:34,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 22:26:34,405 INFO L87 Difference]: Start difference. First operand 163553 states and 668264 transitions. Second operand 4 states. [2019-12-18 22:26:34,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:26:34,616 INFO L93 Difference]: Finished difference Result 47936 states and 164340 transitions. [2019-12-18 22:26:34,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 22:26:34,617 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-12-18 22:26:34,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:26:34,688 INFO L225 Difference]: With dead ends: 47936 [2019-12-18 22:26:34,689 INFO L226 Difference]: Without dead ends: 37198 [2019-12-18 22:26:34,689 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 22:26:34,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37198 states. [2019-12-18 22:26:35,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37198 to 36765. [2019-12-18 22:26:35,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36765 states. [2019-12-18 22:26:35,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36765 states to 36765 states and 121273 transitions. [2019-12-18 22:26:35,357 INFO L78 Accepts]: Start accepts. Automaton has 36765 states and 121273 transitions. Word has length 19 [2019-12-18 22:26:35,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:26:35,357 INFO L462 AbstractCegarLoop]: Abstraction has 36765 states and 121273 transitions. [2019-12-18 22:26:35,357 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 22:26:35,357 INFO L276 IsEmpty]: Start isEmpty. Operand 36765 states and 121273 transitions. [2019-12-18 22:26:35,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 22:26:35,364 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:26:35,364 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:26:35,364 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:26:35,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:26:35,364 INFO L82 PathProgramCache]: Analyzing trace with hash -299881963, now seen corresponding path program 1 times [2019-12-18 22:26:35,365 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:26:35,365 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997638209] [2019-12-18 22:26:35,365 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:26:35,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:26:35,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:26:35,454 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997638209] [2019-12-18 22:26:35,455 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:26:35,455 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 22:26:35,455 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144833197] [2019-12-18 22:26:35,455 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 22:26:35,456 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:26:35,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 22:26:35,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 22:26:35,456 INFO L87 Difference]: Start difference. First operand 36765 states and 121273 transitions. Second operand 5 states. [2019-12-18 22:26:38,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:26:38,224 INFO L93 Difference]: Finished difference Result 49671 states and 160913 transitions. [2019-12-18 22:26:38,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 22:26:38,225 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-18 22:26:38,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:26:38,317 INFO L225 Difference]: With dead ends: 49671 [2019-12-18 22:26:38,317 INFO L226 Difference]: Without dead ends: 49369 [2019-12-18 22:26:38,317 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-18 22:26:38,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49369 states. [2019-12-18 22:26:39,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49369 to 37450. [2019-12-18 22:26:39,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37450 states. [2019-12-18 22:26:39,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37450 states to 37450 states and 123479 transitions. [2019-12-18 22:26:39,092 INFO L78 Accepts]: Start accepts. Automaton has 37450 states and 123479 transitions. Word has length 22 [2019-12-18 22:26:39,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:26:39,092 INFO L462 AbstractCegarLoop]: Abstraction has 37450 states and 123479 transitions. [2019-12-18 22:26:39,092 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 22:26:39,093 INFO L276 IsEmpty]: Start isEmpty. Operand 37450 states and 123479 transitions. [2019-12-18 22:26:39,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 22:26:39,101 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:26:39,102 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:26:39,102 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:26:39,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:26:39,102 INFO L82 PathProgramCache]: Analyzing trace with hash -863346088, now seen corresponding path program 1 times [2019-12-18 22:26:39,102 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:26:39,102 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899644663] [2019-12-18 22:26:39,103 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:26:39,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:26:39,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:26:39,171 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899644663] [2019-12-18 22:26:39,171 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:26:39,171 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 22:26:39,171 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721609883] [2019-12-18 22:26:39,172 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 22:26:39,172 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:26:39,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 22:26:39,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 22:26:39,173 INFO L87 Difference]: Start difference. First operand 37450 states and 123479 transitions. Second operand 5 states. [2019-12-18 22:26:39,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:26:39,749 INFO L93 Difference]: Finished difference Result 49503 states and 160288 transitions. [2019-12-18 22:26:39,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 22:26:39,749 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-18 22:26:39,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:26:39,833 INFO L225 Difference]: With dead ends: 49503 [2019-12-18 22:26:39,833 INFO L226 Difference]: Without dead ends: 49103 [2019-12-18 22:26:39,834 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-18 22:26:40,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49103 states. [2019-12-18 22:26:40,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49103 to 34856. [2019-12-18 22:26:40,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34856 states. [2019-12-18 22:26:40,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34856 states to 34856 states and 114857 transitions. [2019-12-18 22:26:40,895 INFO L78 Accepts]: Start accepts. Automaton has 34856 states and 114857 transitions. Word has length 22 [2019-12-18 22:26:40,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:26:40,895 INFO L462 AbstractCegarLoop]: Abstraction has 34856 states and 114857 transitions. [2019-12-18 22:26:40,895 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 22:26:40,896 INFO L276 IsEmpty]: Start isEmpty. Operand 34856 states and 114857 transitions. [2019-12-18 22:26:40,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 22:26:40,907 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:26:40,907 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:26:40,907 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:26:40,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:26:40,907 INFO L82 PathProgramCache]: Analyzing trace with hash -2029037298, now seen corresponding path program 1 times [2019-12-18 22:26:40,908 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:26:40,908 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739738094] [2019-12-18 22:26:40,908 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:26:40,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:26:41,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:26:41,086 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739738094] [2019-12-18 22:26:41,087 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:26:41,087 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 22:26:41,087 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678661849] [2019-12-18 22:26:41,088 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 22:26:41,088 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:26:41,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 22:26:41,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-18 22:26:41,088 INFO L87 Difference]: Start difference. First operand 34856 states and 114857 transitions. Second operand 7 states. [2019-12-18 22:26:41,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:26:41,689 INFO L93 Difference]: Finished difference Result 47602 states and 153640 transitions. [2019-12-18 22:26:41,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-18 22:26:41,689 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2019-12-18 22:26:41,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:26:41,764 INFO L225 Difference]: With dead ends: 47602 [2019-12-18 22:26:41,764 INFO L226 Difference]: Without dead ends: 47182 [2019-12-18 22:26:41,764 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-18 22:26:41,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47182 states. [2019-12-18 22:26:42,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47182 to 38234. [2019-12-18 22:26:42,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38234 states. [2019-12-18 22:26:42,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38234 states to 38234 states and 125445 transitions. [2019-12-18 22:26:42,794 INFO L78 Accepts]: Start accepts. Automaton has 38234 states and 125445 transitions. Word has length 25 [2019-12-18 22:26:42,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:26:42,794 INFO L462 AbstractCegarLoop]: Abstraction has 38234 states and 125445 transitions. [2019-12-18 22:26:42,794 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 22:26:42,794 INFO L276 IsEmpty]: Start isEmpty. Operand 38234 states and 125445 transitions. [2019-12-18 22:26:42,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-18 22:26:42,812 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:26:42,813 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:26:42,813 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:26:42,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:26:42,813 INFO L82 PathProgramCache]: Analyzing trace with hash -2090157818, now seen corresponding path program 1 times [2019-12-18 22:26:42,813 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:26:42,814 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611398765] [2019-12-18 22:26:42,814 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:26:42,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:26:42,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:26:42,900 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611398765] [2019-12-18 22:26:42,901 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:26:42,901 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 22:26:42,901 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371012566] [2019-12-18 22:26:42,901 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 22:26:42,901 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:26:42,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 22:26:42,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 22:26:42,902 INFO L87 Difference]: Start difference. First operand 38234 states and 125445 transitions. Second operand 5 states. [2019-12-18 22:26:43,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:26:43,424 INFO L93 Difference]: Finished difference Result 48700 states and 158159 transitions. [2019-12-18 22:26:43,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 22:26:43,425 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-18 22:26:43,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:26:43,513 INFO L225 Difference]: With dead ends: 48700 [2019-12-18 22:26:43,513 INFO L226 Difference]: Without dead ends: 48326 [2019-12-18 22:26:43,513 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 22:26:43,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48326 states. [2019-12-18 22:26:44,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48326 to 40013. [2019-12-18 22:26:44,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40013 states. [2019-12-18 22:26:44,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40013 states to 40013 states and 131257 transitions. [2019-12-18 22:26:44,236 INFO L78 Accepts]: Start accepts. Automaton has 40013 states and 131257 transitions. Word has length 28 [2019-12-18 22:26:44,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:26:44,236 INFO L462 AbstractCegarLoop]: Abstraction has 40013 states and 131257 transitions. [2019-12-18 22:26:44,236 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 22:26:44,237 INFO L276 IsEmpty]: Start isEmpty. Operand 40013 states and 131257 transitions. [2019-12-18 22:26:44,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-18 22:26:44,256 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:26:44,256 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:26:44,256 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:26:44,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:26:44,257 INFO L82 PathProgramCache]: Analyzing trace with hash -893146615, now seen corresponding path program 1 times [2019-12-18 22:26:44,257 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:26:44,257 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844816252] [2019-12-18 22:26:44,257 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:26:44,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:26:44,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:26:44,291 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844816252] [2019-12-18 22:26:44,291 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:26:44,292 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 22:26:44,292 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809382648] [2019-12-18 22:26:44,292 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 22:26:44,292 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:26:44,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 22:26:44,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:26:44,293 INFO L87 Difference]: Start difference. First operand 40013 states and 131257 transitions. Second operand 3 states. [2019-12-18 22:26:44,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:26:44,702 INFO L93 Difference]: Finished difference Result 52067 states and 169326 transitions. [2019-12-18 22:26:44,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 22:26:44,703 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-12-18 22:26:44,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:26:44,790 INFO L225 Difference]: With dead ends: 52067 [2019-12-18 22:26:44,790 INFO L226 Difference]: Without dead ends: 52067 [2019-12-18 22:26:44,790 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:26:45,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52067 states. [2019-12-18 22:26:45,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52067 to 41845. [2019-12-18 22:26:45,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41845 states. [2019-12-18 22:26:45,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41845 states to 41845 states and 134913 transitions. [2019-12-18 22:26:45,552 INFO L78 Accepts]: Start accepts. Automaton has 41845 states and 134913 transitions. Word has length 28 [2019-12-18 22:26:45,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:26:45,552 INFO L462 AbstractCegarLoop]: Abstraction has 41845 states and 134913 transitions. [2019-12-18 22:26:45,552 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 22:26:45,552 INFO L276 IsEmpty]: Start isEmpty. Operand 41845 states and 134913 transitions. [2019-12-18 22:26:45,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-18 22:26:45,571 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:26:45,571 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:26:45,571 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:26:45,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:26:45,572 INFO L82 PathProgramCache]: Analyzing trace with hash 1145073619, now seen corresponding path program 1 times [2019-12-18 22:26:45,572 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:26:45,572 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671056557] [2019-12-18 22:26:45,572 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:26:45,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:26:45,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:26:45,641 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671056557] [2019-12-18 22:26:45,641 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:26:45,641 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 22:26:45,642 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331400477] [2019-12-18 22:26:45,642 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 22:26:45,642 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:26:45,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 22:26:45,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 22:26:45,643 INFO L87 Difference]: Start difference. First operand 41845 states and 134913 transitions. Second operand 5 states. [2019-12-18 22:26:45,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:26:45,770 INFO L93 Difference]: Finished difference Result 18540 states and 55506 transitions. [2019-12-18 22:26:45,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 22:26:45,770 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2019-12-18 22:26:45,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:26:45,800 INFO L225 Difference]: With dead ends: 18540 [2019-12-18 22:26:45,800 INFO L226 Difference]: Without dead ends: 15811 [2019-12-18 22:26:45,803 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 22:26:45,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15811 states. [2019-12-18 22:26:45,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15811 to 15155. [2019-12-18 22:26:45,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15155 states. [2019-12-18 22:26:46,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15155 states to 15155 states and 45019 transitions. [2019-12-18 22:26:46,024 INFO L78 Accepts]: Start accepts. Automaton has 15155 states and 45019 transitions. Word has length 29 [2019-12-18 22:26:46,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:26:46,024 INFO L462 AbstractCegarLoop]: Abstraction has 15155 states and 45019 transitions. [2019-12-18 22:26:46,024 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 22:26:46,024 INFO L276 IsEmpty]: Start isEmpty. Operand 15155 states and 45019 transitions. [2019-12-18 22:26:46,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-18 22:26:46,040 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:26:46,041 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:26:46,041 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:26:46,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:26:46,041 INFO L82 PathProgramCache]: Analyzing trace with hash 1336056649, now seen corresponding path program 1 times [2019-12-18 22:26:46,041 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:26:46,041 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408438657] [2019-12-18 22:26:46,041 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:26:46,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:26:46,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:26:46,095 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408438657] [2019-12-18 22:26:46,096 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:26:46,096 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 22:26:46,096 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297949792] [2019-12-18 22:26:46,096 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 22:26:46,096 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:26:46,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 22:26:46,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:26:46,097 INFO L87 Difference]: Start difference. First operand 15155 states and 45019 transitions. Second operand 3 states. [2019-12-18 22:26:46,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:26:46,251 INFO L93 Difference]: Finished difference Result 22100 states and 66786 transitions. [2019-12-18 22:26:46,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 22:26:46,252 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-18 22:26:46,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:26:46,271 INFO L225 Difference]: With dead ends: 22100 [2019-12-18 22:26:46,271 INFO L226 Difference]: Without dead ends: 9395 [2019-12-18 22:26:46,272 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:26:46,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9395 states. [2019-12-18 22:26:46,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9395 to 9298. [2019-12-18 22:26:46,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9298 states. [2019-12-18 22:26:46,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9298 states to 9298 states and 27243 transitions. [2019-12-18 22:26:46,462 INFO L78 Accepts]: Start accepts. Automaton has 9298 states and 27243 transitions. Word has length 39 [2019-12-18 22:26:46,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:26:46,462 INFO L462 AbstractCegarLoop]: Abstraction has 9298 states and 27243 transitions. [2019-12-18 22:26:46,462 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 22:26:46,463 INFO L276 IsEmpty]: Start isEmpty. Operand 9298 states and 27243 transitions. [2019-12-18 22:26:46,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 22:26:46,472 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:26:46,472 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:26:46,472 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:26:46,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:26:46,472 INFO L82 PathProgramCache]: Analyzing trace with hash -210063419, now seen corresponding path program 1 times [2019-12-18 22:26:46,473 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:26:46,473 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518327726] [2019-12-18 22:26:46,473 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:26:46,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:26:46,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:26:46,577 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518327726] [2019-12-18 22:26:46,578 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:26:46,578 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 22:26:46,578 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988771243] [2019-12-18 22:26:46,578 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 22:26:46,579 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:26:46,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 22:26:46,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 22:26:46,579 INFO L87 Difference]: Start difference. First operand 9298 states and 27243 transitions. Second operand 6 states. [2019-12-18 22:26:46,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:26:46,936 INFO L93 Difference]: Finished difference Result 9722 states and 28149 transitions. [2019-12-18 22:26:46,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 22:26:46,937 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2019-12-18 22:26:46,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:26:46,953 INFO L225 Difference]: With dead ends: 9722 [2019-12-18 22:26:46,953 INFO L226 Difference]: Without dead ends: 9555 [2019-12-18 22:26:46,954 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2019-12-18 22:26:46,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9555 states. [2019-12-18 22:26:47,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9555 to 9267. [2019-12-18 22:26:47,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9267 states. [2019-12-18 22:26:47,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9267 states to 9267 states and 27196 transitions. [2019-12-18 22:26:47,087 INFO L78 Accepts]: Start accepts. Automaton has 9267 states and 27196 transitions. Word has length 40 [2019-12-18 22:26:47,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:26:47,088 INFO L462 AbstractCegarLoop]: Abstraction has 9267 states and 27196 transitions. [2019-12-18 22:26:47,088 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 22:26:47,088 INFO L276 IsEmpty]: Start isEmpty. Operand 9267 states and 27196 transitions. [2019-12-18 22:26:47,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 22:26:47,099 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:26:47,099 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:26:47,099 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:26:47,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:26:47,100 INFO L82 PathProgramCache]: Analyzing trace with hash 1917096257, now seen corresponding path program 1 times [2019-12-18 22:26:47,100 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:26:47,100 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856957298] [2019-12-18 22:26:47,100 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:26:47,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:26:47,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:26:47,166 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856957298] [2019-12-18 22:26:47,166 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:26:47,166 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 22:26:47,166 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853237645] [2019-12-18 22:26:47,166 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 22:26:47,167 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:26:47,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 22:26:47,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:26:47,167 INFO L87 Difference]: Start difference. First operand 9267 states and 27196 transitions. Second operand 3 states. [2019-12-18 22:26:47,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:26:47,220 INFO L93 Difference]: Finished difference Result 8801 states and 25321 transitions. [2019-12-18 22:26:47,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 22:26:47,221 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-12-18 22:26:47,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:26:47,235 INFO L225 Difference]: With dead ends: 8801 [2019-12-18 22:26:47,235 INFO L226 Difference]: Without dead ends: 8801 [2019-12-18 22:26:47,237 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:26:47,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8801 states. [2019-12-18 22:26:47,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8801 to 8801. [2019-12-18 22:26:47,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8801 states. [2019-12-18 22:26:47,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8801 states to 8801 states and 25321 transitions. [2019-12-18 22:26:47,367 INFO L78 Accepts]: Start accepts. Automaton has 8801 states and 25321 transitions. Word has length 40 [2019-12-18 22:26:47,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:26:47,368 INFO L462 AbstractCegarLoop]: Abstraction has 8801 states and 25321 transitions. [2019-12-18 22:26:47,368 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 22:26:47,368 INFO L276 IsEmpty]: Start isEmpty. Operand 8801 states and 25321 transitions. [2019-12-18 22:26:47,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-18 22:26:47,378 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:26:47,379 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:26:47,379 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:26:47,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:26:47,379 INFO L82 PathProgramCache]: Analyzing trace with hash 1341792848, now seen corresponding path program 1 times [2019-12-18 22:26:47,379 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:26:47,380 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734179400] [2019-12-18 22:26:47,380 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:26:47,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:26:47,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:26:47,481 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734179400] [2019-12-18 22:26:47,481 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:26:47,481 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 22:26:47,481 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592474239] [2019-12-18 22:26:47,482 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 22:26:47,482 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:26:47,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 22:26:47,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 22:26:47,482 INFO L87 Difference]: Start difference. First operand 8801 states and 25321 transitions. Second operand 6 states. [2019-12-18 22:26:47,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:26:47,867 INFO L93 Difference]: Finished difference Result 9044 states and 25829 transitions. [2019-12-18 22:26:47,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 22:26:47,867 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2019-12-18 22:26:47,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:26:47,879 INFO L225 Difference]: With dead ends: 9044 [2019-12-18 22:26:47,879 INFO L226 Difference]: Without dead ends: 8792 [2019-12-18 22:26:47,879 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2019-12-18 22:26:47,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8792 states. [2019-12-18 22:26:47,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8792 to 8190. [2019-12-18 22:26:47,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8190 states. [2019-12-18 22:26:48,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8190 states to 8190 states and 23998 transitions. [2019-12-18 22:26:48,005 INFO L78 Accepts]: Start accepts. Automaton has 8190 states and 23998 transitions. Word has length 41 [2019-12-18 22:26:48,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:26:48,005 INFO L462 AbstractCegarLoop]: Abstraction has 8190 states and 23998 transitions. [2019-12-18 22:26:48,005 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 22:26:48,005 INFO L276 IsEmpty]: Start isEmpty. Operand 8190 states and 23998 transitions. [2019-12-18 22:26:48,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-18 22:26:48,013 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:26:48,013 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:26:48,013 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:26:48,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:26:48,014 INFO L82 PathProgramCache]: Analyzing trace with hash -1227192015, now seen corresponding path program 1 times [2019-12-18 22:26:48,014 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:26:48,014 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125543861] [2019-12-18 22:26:48,014 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:26:48,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:26:48,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:26:48,073 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125543861] [2019-12-18 22:26:48,073 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:26:48,073 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 22:26:48,073 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282936352] [2019-12-18 22:26:48,073 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 22:26:48,074 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:26:48,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 22:26:48,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:26:48,074 INFO L87 Difference]: Start difference. First operand 8190 states and 23998 transitions. Second operand 3 states. [2019-12-18 22:26:48,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:26:48,112 INFO L93 Difference]: Finished difference Result 8109 states and 23724 transitions. [2019-12-18 22:26:48,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 22:26:48,113 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2019-12-18 22:26:48,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:26:48,125 INFO L225 Difference]: With dead ends: 8109 [2019-12-18 22:26:48,126 INFO L226 Difference]: Without dead ends: 8109 [2019-12-18 22:26:48,126 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:26:48,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8109 states. [2019-12-18 22:26:48,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8109 to 8109. [2019-12-18 22:26:48,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8109 states. [2019-12-18 22:26:48,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8109 states to 8109 states and 23724 transitions. [2019-12-18 22:26:48,285 INFO L78 Accepts]: Start accepts. Automaton has 8109 states and 23724 transitions. Word has length 41 [2019-12-18 22:26:48,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:26:48,285 INFO L462 AbstractCegarLoop]: Abstraction has 8109 states and 23724 transitions. [2019-12-18 22:26:48,285 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 22:26:48,285 INFO L276 IsEmpty]: Start isEmpty. Operand 8109 states and 23724 transitions. [2019-12-18 22:26:48,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-18 22:26:48,293 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:26:48,293 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] [2019-12-18 22:26:48,293 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:26:48,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:26:48,293 INFO L82 PathProgramCache]: Analyzing trace with hash -1573172907, now seen corresponding path program 1 times [2019-12-18 22:26:48,293 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:26:48,294 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115331352] [2019-12-18 22:26:48,294 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:26:48,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:26:48,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:26:48,371 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115331352] [2019-12-18 22:26:48,371 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:26:48,371 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 22:26:48,372 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025079004] [2019-12-18 22:26:48,372 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 22:26:48,372 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:26:48,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 22:26:48,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-18 22:26:48,373 INFO L87 Difference]: Start difference. First operand 8109 states and 23724 transitions. Second operand 6 states. [2019-12-18 22:26:48,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:26:48,473 INFO L93 Difference]: Finished difference Result 7199 states and 21547 transitions. [2019-12-18 22:26:48,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 22:26:48,474 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 42 [2019-12-18 22:26:48,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:26:48,487 INFO L225 Difference]: With dead ends: 7199 [2019-12-18 22:26:48,487 INFO L226 Difference]: Without dead ends: 5809 [2019-12-18 22:26:48,488 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-18 22:26:48,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5809 states. [2019-12-18 22:26:48,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5809 to 5809. [2019-12-18 22:26:48,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5809 states. [2019-12-18 22:26:48,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5809 states to 5809 states and 18310 transitions. [2019-12-18 22:26:48,671 INFO L78 Accepts]: Start accepts. Automaton has 5809 states and 18310 transitions. Word has length 42 [2019-12-18 22:26:48,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:26:48,672 INFO L462 AbstractCegarLoop]: Abstraction has 5809 states and 18310 transitions. [2019-12-18 22:26:48,672 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 22:26:48,672 INFO L276 IsEmpty]: Start isEmpty. Operand 5809 states and 18310 transitions. [2019-12-18 22:26:48,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 22:26:48,682 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:26:48,682 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:26:48,683 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:26:48,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:26:48,683 INFO L82 PathProgramCache]: Analyzing trace with hash 612223072, now seen corresponding path program 1 times [2019-12-18 22:26:48,683 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:26:48,684 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932608010] [2019-12-18 22:26:48,684 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:26:48,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:26:48,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:26:48,811 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932608010] [2019-12-18 22:26:48,811 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:26:48,811 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 22:26:48,811 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502776701] [2019-12-18 22:26:48,812 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 22:26:48,812 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:26:48,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 22:26:48,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-18 22:26:48,812 INFO L87 Difference]: Start difference. First operand 5809 states and 18310 transitions. Second operand 9 states. [2019-12-18 22:26:49,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:26:49,714 INFO L93 Difference]: Finished difference Result 11843 states and 36547 transitions. [2019-12-18 22:26:49,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-18 22:26:49,714 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 56 [2019-12-18 22:26:49,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:26:49,728 INFO L225 Difference]: With dead ends: 11843 [2019-12-18 22:26:49,728 INFO L226 Difference]: Without dead ends: 8447 [2019-12-18 22:26:49,729 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=105, Invalid=401, Unknown=0, NotChecked=0, Total=506 [2019-12-18 22:26:49,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8447 states. [2019-12-18 22:26:49,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8447 to 7921. [2019-12-18 22:26:49,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7921 states. [2019-12-18 22:26:49,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7921 states to 7921 states and 24475 transitions. [2019-12-18 22:26:49,848 INFO L78 Accepts]: Start accepts. Automaton has 7921 states and 24475 transitions. Word has length 56 [2019-12-18 22:26:49,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:26:49,848 INFO L462 AbstractCegarLoop]: Abstraction has 7921 states and 24475 transitions. [2019-12-18 22:26:49,848 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 22:26:49,849 INFO L276 IsEmpty]: Start isEmpty. Operand 7921 states and 24475 transitions. [2019-12-18 22:26:49,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 22:26:49,856 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:26:49,857 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:26:49,857 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:26:49,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:26:49,857 INFO L82 PathProgramCache]: Analyzing trace with hash -1401618532, now seen corresponding path program 2 times [2019-12-18 22:26:49,857 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:26:49,858 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287793386] [2019-12-18 22:26:49,858 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:26:49,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:26:50,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:26:50,286 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287793386] [2019-12-18 22:26:50,286 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:26:50,286 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-18 22:26:50,286 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297243657] [2019-12-18 22:26:50,287 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-18 22:26:50,287 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:26:50,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-18 22:26:50,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2019-12-18 22:26:50,287 INFO L87 Difference]: Start difference. First operand 7921 states and 24475 transitions. Second operand 14 states. [2019-12-18 22:26:52,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:26:52,879 INFO L93 Difference]: Finished difference Result 13483 states and 39771 transitions. [2019-12-18 22:26:52,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-12-18 22:26:52,879 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 56 [2019-12-18 22:26:52,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:26:52,901 INFO L225 Difference]: With dead ends: 13483 [2019-12-18 22:26:52,902 INFO L226 Difference]: Without dead ends: 11843 [2019-12-18 22:26:52,903 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 271 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=220, Invalid=1040, Unknown=0, NotChecked=0, Total=1260 [2019-12-18 22:26:52,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11843 states. [2019-12-18 22:26:53,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11843 to 9466. [2019-12-18 22:26:53,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9466 states. [2019-12-18 22:26:53,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9466 states to 9466 states and 28537 transitions. [2019-12-18 22:26:53,207 INFO L78 Accepts]: Start accepts. Automaton has 9466 states and 28537 transitions. Word has length 56 [2019-12-18 22:26:53,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:26:53,207 INFO L462 AbstractCegarLoop]: Abstraction has 9466 states and 28537 transitions. [2019-12-18 22:26:53,208 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-18 22:26:53,208 INFO L276 IsEmpty]: Start isEmpty. Operand 9466 states and 28537 transitions. [2019-12-18 22:26:53,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 22:26:53,226 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:26:53,226 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:26:53,226 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:26:53,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:26:53,227 INFO L82 PathProgramCache]: Analyzing trace with hash 1296178072, now seen corresponding path program 3 times [2019-12-18 22:26:53,227 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:26:53,227 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103555698] [2019-12-18 22:26:53,227 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:26:53,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:26:54,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:26:54,126 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103555698] [2019-12-18 22:26:54,126 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:26:54,127 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-18 22:26:54,127 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081296478] [2019-12-18 22:26:54,128 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-18 22:26:54,130 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:26:54,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-18 22:26:54,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2019-12-18 22:26:54,130 INFO L87 Difference]: Start difference. First operand 9466 states and 28537 transitions. Second operand 17 states. [2019-12-18 22:26:57,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:26:57,145 INFO L93 Difference]: Finished difference Result 12292 states and 36328 transitions. [2019-12-18 22:26:57,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-12-18 22:26:57,145 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 56 [2019-12-18 22:26:57,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:26:57,162 INFO L225 Difference]: With dead ends: 12292 [2019-12-18 22:26:57,162 INFO L226 Difference]: Without dead ends: 11906 [2019-12-18 22:26:57,163 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 12 SyntacticMatches, 3 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=173, Invalid=883, Unknown=0, NotChecked=0, Total=1056 [2019-12-18 22:26:57,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11906 states. [2019-12-18 22:26:57,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11906 to 9532. [2019-12-18 22:26:57,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9532 states. [2019-12-18 22:26:57,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9532 states to 9532 states and 28702 transitions. [2019-12-18 22:26:57,314 INFO L78 Accepts]: Start accepts. Automaton has 9532 states and 28702 transitions. Word has length 56 [2019-12-18 22:26:57,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:26:57,314 INFO L462 AbstractCegarLoop]: Abstraction has 9532 states and 28702 transitions. [2019-12-18 22:26:57,314 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-18 22:26:57,314 INFO L276 IsEmpty]: Start isEmpty. Operand 9532 states and 28702 transitions. [2019-12-18 22:26:57,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 22:26:57,324 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:26:57,324 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:26:57,324 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:26:57,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:26:57,325 INFO L82 PathProgramCache]: Analyzing trace with hash 1170550000, now seen corresponding path program 4 times [2019-12-18 22:26:57,325 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:26:57,325 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550449272] [2019-12-18 22:26:57,325 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:26:57,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:26:57,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:26:57,915 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550449272] [2019-12-18 22:26:57,915 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:26:57,916 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-18 22:26:57,916 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840942708] [2019-12-18 22:26:57,917 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-18 22:26:57,917 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:26:57,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-18 22:26:57,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2019-12-18 22:26:57,917 INFO L87 Difference]: Start difference. First operand 9532 states and 28702 transitions. Second operand 17 states. [2019-12-18 22:27:01,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:27:01,538 INFO L93 Difference]: Finished difference Result 13231 states and 38899 transitions. [2019-12-18 22:27:01,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-12-18 22:27:01,539 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 56 [2019-12-18 22:27:01,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:27:01,556 INFO L225 Difference]: With dead ends: 13231 [2019-12-18 22:27:01,556 INFO L226 Difference]: Without dead ends: 12281 [2019-12-18 22:27:01,557 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 543 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=358, Invalid=1804, Unknown=0, NotChecked=0, Total=2162 [2019-12-18 22:27:01,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12281 states. [2019-12-18 22:27:01,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12281 to 9418. [2019-12-18 22:27:01,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9418 states. [2019-12-18 22:27:01,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9418 states to 9418 states and 28433 transitions. [2019-12-18 22:27:01,717 INFO L78 Accepts]: Start accepts. Automaton has 9418 states and 28433 transitions. Word has length 56 [2019-12-18 22:27:01,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:27:01,717 INFO L462 AbstractCegarLoop]: Abstraction has 9418 states and 28433 transitions. [2019-12-18 22:27:01,717 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-18 22:27:01,717 INFO L276 IsEmpty]: Start isEmpty. Operand 9418 states and 28433 transitions. [2019-12-18 22:27:01,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 22:27:01,811 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:27:01,811 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:27:01,811 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:27:01,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:27:01,811 INFO L82 PathProgramCache]: Analyzing trace with hash -365356066, now seen corresponding path program 5 times [2019-12-18 22:27:01,811 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:27:01,811 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618508119] [2019-12-18 22:27:01,812 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:27:01,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:27:02,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:27:02,094 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618508119] [2019-12-18 22:27:02,095 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:27:02,095 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 22:27:02,095 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687874614] [2019-12-18 22:27:02,095 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-18 22:27:02,095 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:27:02,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-18 22:27:02,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2019-12-18 22:27:02,096 INFO L87 Difference]: Start difference. First operand 9418 states and 28433 transitions. Second operand 13 states. [2019-12-18 22:27:03,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:27:03,875 INFO L93 Difference]: Finished difference Result 12932 states and 38218 transitions. [2019-12-18 22:27:03,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-18 22:27:03,875 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 56 [2019-12-18 22:27:03,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:27:03,890 INFO L225 Difference]: With dead ends: 12932 [2019-12-18 22:27:03,891 INFO L226 Difference]: Without dead ends: 10658 [2019-12-18 22:27:03,891 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=154, Invalid=776, Unknown=0, NotChecked=0, Total=930 [2019-12-18 22:27:03,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10658 states. [2019-12-18 22:27:04,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10658 to 9683. [2019-12-18 22:27:04,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9683 states. [2019-12-18 22:27:04,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9683 states to 9683 states and 29055 transitions. [2019-12-18 22:27:04,040 INFO L78 Accepts]: Start accepts. Automaton has 9683 states and 29055 transitions. Word has length 56 [2019-12-18 22:27:04,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:27:04,040 INFO L462 AbstractCegarLoop]: Abstraction has 9683 states and 29055 transitions. [2019-12-18 22:27:04,040 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-18 22:27:04,040 INFO L276 IsEmpty]: Start isEmpty. Operand 9683 states and 29055 transitions. [2019-12-18 22:27:04,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 22:27:04,050 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:27:04,051 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:27:04,051 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:27:04,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:27:04,051 INFO L82 PathProgramCache]: Analyzing trace with hash -1018856696, now seen corresponding path program 6 times [2019-12-18 22:27:04,051 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:27:04,052 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274053724] [2019-12-18 22:27:04,052 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:27:04,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:27:04,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:27:04,312 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274053724] [2019-12-18 22:27:04,312 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:27:04,312 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-18 22:27:04,312 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728261904] [2019-12-18 22:27:04,312 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-18 22:27:04,313 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:27:04,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-18 22:27:04,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2019-12-18 22:27:04,313 INFO L87 Difference]: Start difference. First operand 9683 states and 29055 transitions. Second operand 14 states. [2019-12-18 22:27:06,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:27:06,372 INFO L93 Difference]: Finished difference Result 13159 states and 38696 transitions. [2019-12-18 22:27:06,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-12-18 22:27:06,373 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 56 [2019-12-18 22:27:06,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:27:06,388 INFO L225 Difference]: With dead ends: 13159 [2019-12-18 22:27:06,388 INFO L226 Difference]: Without dead ends: 10169 [2019-12-18 22:27:06,388 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 288 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=223, Invalid=1183, Unknown=0, NotChecked=0, Total=1406 [2019-12-18 22:27:06,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10169 states. [2019-12-18 22:27:06,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10169 to 8756. [2019-12-18 22:27:06,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8756 states. [2019-12-18 22:27:06,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8756 states to 8756 states and 26447 transitions. [2019-12-18 22:27:06,526 INFO L78 Accepts]: Start accepts. Automaton has 8756 states and 26447 transitions. Word has length 56 [2019-12-18 22:27:06,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:27:06,526 INFO L462 AbstractCegarLoop]: Abstraction has 8756 states and 26447 transitions. [2019-12-18 22:27:06,526 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-18 22:27:06,526 INFO L276 IsEmpty]: Start isEmpty. Operand 8756 states and 26447 transitions. [2019-12-18 22:27:06,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 22:27:06,535 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:27:06,535 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:27:06,535 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:27:06,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:27:06,536 INFO L82 PathProgramCache]: Analyzing trace with hash -1115612318, now seen corresponding path program 7 times [2019-12-18 22:27:06,536 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:27:06,536 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179967148] [2019-12-18 22:27:06,536 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:27:06,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:27:07,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:27:07,042 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179967148] [2019-12-18 22:27:07,042 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:27:07,042 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 22:27:07,043 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707171921] [2019-12-18 22:27:07,043 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 22:27:07,043 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:27:07,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 22:27:07,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2019-12-18 22:27:07,044 INFO L87 Difference]: Start difference. First operand 8756 states and 26447 transitions. Second operand 16 states. [2019-12-18 22:27:09,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:27:09,790 INFO L93 Difference]: Finished difference Result 12692 states and 37165 transitions. [2019-12-18 22:27:09,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-12-18 22:27:09,791 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 56 [2019-12-18 22:27:09,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:27:09,807 INFO L225 Difference]: With dead ends: 12692 [2019-12-18 22:27:09,808 INFO L226 Difference]: Without dead ends: 12008 [2019-12-18 22:27:09,808 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 407 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=313, Invalid=1327, Unknown=0, NotChecked=0, Total=1640 [2019-12-18 22:27:09,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12008 states. [2019-12-18 22:27:09,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12008 to 8700. [2019-12-18 22:27:09,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8700 states. [2019-12-18 22:27:09,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8700 states to 8700 states and 26305 transitions. [2019-12-18 22:27:09,953 INFO L78 Accepts]: Start accepts. Automaton has 8700 states and 26305 transitions. Word has length 56 [2019-12-18 22:27:09,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:27:09,953 INFO L462 AbstractCegarLoop]: Abstraction has 8700 states and 26305 transitions. [2019-12-18 22:27:09,953 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 22:27:09,953 INFO L276 IsEmpty]: Start isEmpty. Operand 8700 states and 26305 transitions. [2019-12-18 22:27:09,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 22:27:09,962 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:27:09,962 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:27:09,962 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:27:09,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:27:09,963 INFO L82 PathProgramCache]: Analyzing trace with hash 2002078782, now seen corresponding path program 8 times [2019-12-18 22:27:09,963 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:27:09,963 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269816846] [2019-12-18 22:27:09,963 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:27:09,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 22:27:10,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 22:27:10,101 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 22:27:10,101 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 22:27:10,105 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [807] [807] ULTIMATE.startENTRY-->L818: Formula: (let ((.cse0 (store |v_#valid_60| 0 0))) (and (= 0 v_~x$read_delayed_var~0.base_6) (= 0 v_~x$w_buff1~0_24) (= 0 v_~x$read_delayed_var~0.offset_6) (= 0 v_~x$r_buff0_thd1~0_73) (= 0 v_~x$r_buff0_thd2~0_26) (= 0 v_~__unbuffered_cnt~0_20) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t1900~0.base_22| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t1900~0.base_22|) |v_ULTIMATE.start_main_~#t1900~0.offset_18| 0)) |v_#memory_int_23|) (= v_~main$tmp_guard0~0_9 0) (= 0 v_~x$r_buff0_thd0~0_22) (= v_~__unbuffered_p2_EBX~0_14 0) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t1900~0.base_22|) (= v_~x$r_buff1_thd2~0_18 0) (= v_~x$flush_delayed~0_13 0) (= |v_#valid_58| (store .cse0 |v_ULTIMATE.start_main_~#t1900~0.base_22| 1)) (= 0 v_~__unbuffered_p0_EAX~0_14) (< 0 |v_#StackHeapBarrier_17|) (= 0 |v_ULTIMATE.start_main_~#t1900~0.offset_18|) (= v_~x~0_23 0) (= v_~x$w_buff1_used~0_67 0) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t1900~0.base_22| 4)) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1900~0.base_22|)) (= v_~y~0_16 0) (= 0 v_~x$read_delayed~0_6) (= v_~x$r_buff1_thd1~0_41 0) (= 0 v_~weak$$choice2~0_33) (= 0 v_~x$w_buff0_used~0_113) (= v_~x$mem_tmp~0_10 0) (= v_~x$r_buff1_thd0~0_20 0) (= 0 v_~x$r_buff0_thd3~0_20) (= |v_#NULL.offset_5| 0) (= v_~main$tmp_guard1~0_15 0) (= 0 v_~__unbuffered_p2_EAX~0_14) (= 0 v_~weak$$choice0~0_6) (= 0 v_~x$w_buff0~0_30) (= 0 |v_#NULL.base_5|) (= v_~x$r_buff1_thd3~0_16 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_60|, #memory_int=|v_#memory_int_24|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_~#t1901~0.offset=|v_ULTIMATE.start_main_~#t1901~0.offset_18|, ~x$w_buff0~0=v_~x$w_buff0~0_30, ~x$flush_delayed~0=v_~x$flush_delayed~0_13, #NULL.offset=|v_#NULL.offset_5|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_41, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_20, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_10|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_10|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_14, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_14, ULTIMATE.start_main_~#t1900~0.base=|v_ULTIMATE.start_main_~#t1900~0.base_22|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_22, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_14, ~x$w_buff1~0=v_~x$w_buff1~0_24, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_67, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_18, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_6, ~weak$$choice0~0=v_~weak$$choice0~0_6, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ULTIMATE.start_main_~#t1900~0.offset=|v_ULTIMATE.start_main_~#t1900~0.offset_18|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_20, ~x~0=v_~x~0_23, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_73, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_20|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_16, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_15, ~x$mem_tmp~0=v_~x$mem_tmp~0_10, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_13|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_10|, ULTIMATE.start_main_~#t1902~0.offset=|v_ULTIMATE.start_main_~#t1902~0.offset_14|, ~y~0=v_~y~0_16, ULTIMATE.start_main_~#t1901~0.base=|v_ULTIMATE.start_main_~#t1901~0.base_23|, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_7|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_9, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_20, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_26, #NULL.base=|v_#NULL.base_5|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_113, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_12|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_18|, #valid=|v_#valid_58|, ULTIMATE.start_main_~#t1902~0.base=|v_ULTIMATE.start_main_~#t1902~0.base_19|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_8|, ~weak$$choice2~0=v_~weak$$choice2~0_33, ~x$read_delayed~0=v_~x$read_delayed~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1901~0.offset, ~x$w_buff0~0, ~x$r_buff0_thd1~0, ~x$flush_delayed~0, #NULL.offset, ULTIMATE.start_main_#t~ite46, ~x$r_buff1_thd3~0, ~x$r_buff1_thd1~0, ~main$tmp_guard1~0, ~x$r_buff0_thd3~0, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~__unbuffered_p0_EAX~0, ULTIMATE.start_main_~#t1902~0.offset, #length, ~__unbuffered_p2_EAX~0, ~y~0, ULTIMATE.start_main_~#t1901~0.base, ULTIMATE.start_main_~#t1900~0.base, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~nondet40, ~__unbuffered_p2_EBX~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ~x$read_delayed_var~0.base, #NULL.base, ~x$w_buff0_used~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_~#t1900~0.offset, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~#t1902~0.base, ULTIMATE.start_main_#t~nondet38, #memory_int, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~weak$$choice2~0, ~x~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-18 22:27:10,106 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [777] [777] L818-1-->L820: Formula: (and (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t1901~0.base_10| 4)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t1901~0.base_10|) (= 0 (select |v_#valid_32| |v_ULTIMATE.start_main_~#t1901~0.base_10|)) (not (= |v_ULTIMATE.start_main_~#t1901~0.base_10| 0)) (= |v_ULTIMATE.start_main_~#t1901~0.offset_9| 0) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1901~0.base_10| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1901~0.base_10|) |v_ULTIMATE.start_main_~#t1901~0.offset_9| 1)) |v_#memory_int_15|) (= (store |v_#valid_32| |v_ULTIMATE.start_main_~#t1901~0.base_10| 1) |v_#valid_31|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t1901~0.offset=|v_ULTIMATE.start_main_~#t1901~0.offset_9|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_4|, #length=|v_#length_15|, ULTIMATE.start_main_~#t1901~0.base=|v_ULTIMATE.start_main_~#t1901~0.base_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1901~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t1901~0.base] because there is no mapped edge [2019-12-18 22:27:10,107 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [672] [672] P1ENTRY-->L5-3: Formula: (and (= 1 v_~x$w_buff0~0_14) (= 1 v_~x$w_buff0_used~0_68) (= v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_6 |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_4|) (= v_P1Thread1of1ForFork0_~arg.base_4 |v_P1Thread1of1ForFork0_#in~arg.base_4|) (= v_~x$w_buff0~0_15 v_~x$w_buff1~0_12) (= v_P1Thread1of1ForFork0_~arg.offset_4 |v_P1Thread1of1ForFork0_#in~arg.offset_4|) (= 0 (mod v_~x$w_buff1_used~0_40 256)) (= v_~x$w_buff1_used~0_40 v_~x$w_buff0_used~0_69) (= 1 |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_4|)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_15, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_4|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_4|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_69} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_14, P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_6, P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_4, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_4, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_4|, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_4|, ~x$w_buff1~0=v_~x$w_buff1~0_12, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_4|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_40, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_68} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression, P1Thread1of1ForFork0_~arg.offset, P1Thread1of1ForFork0_~arg.base, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$w_buff0_used~0] because there is no mapped edge [2019-12-18 22:27:10,107 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [771] [771] L820-1-->L822: Formula: (and (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1902~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1902~0.base_11|) |v_ULTIMATE.start_main_~#t1902~0.offset_10| 2)) |v_#memory_int_13|) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t1902~0.base_11| 4)) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t1902~0.base_11|) (= 0 |v_ULTIMATE.start_main_~#t1902~0.offset_10|) (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t1902~0.base_11|)) (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t1902~0.base_11| 1)) (not (= 0 |v_ULTIMATE.start_main_~#t1902~0.base_11|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_14|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_~#t1902~0.offset=|v_ULTIMATE.start_main_~#t1902~0.offset_10|, ULTIMATE.start_main_~#t1902~0.base=|v_ULTIMATE.start_main_~#t1902~0.base_11|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_13|, #length=|v_#length_13|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1902~0.offset, ULTIMATE.start_main_~#t1902~0.base, #valid, #memory_int, #length, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-18 22:27:10,110 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] L795-2-->L795-4: Formula: (let ((.cse0 (= (mod ~x$w_buff1_used~0_In81682410 256) 0)) (.cse1 (= (mod ~x$r_buff1_thd3~0_In81682410 256) 0))) (or (and (or .cse0 .cse1) (= ~x~0_In81682410 |P2Thread1of1ForFork1_#t~ite32_Out81682410|)) (and (not .cse0) (= |P2Thread1of1ForFork1_#t~ite32_Out81682410| ~x$w_buff1~0_In81682410) (not .cse1)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In81682410, ~x$w_buff1_used~0=~x$w_buff1_used~0_In81682410, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In81682410, ~x~0=~x~0_In81682410} OutVars{P2Thread1of1ForFork1_#t~ite32=|P2Thread1of1ForFork1_#t~ite32_Out81682410|, ~x$w_buff1~0=~x$w_buff1~0_In81682410, ~x$w_buff1_used~0=~x$w_buff1_used~0_In81682410, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In81682410, ~x~0=~x~0_In81682410} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-18 22:27:10,110 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [677] [677] L795-4-->L796: Formula: (= v_~x~0_14 |v_P2Thread1of1ForFork1_#t~ite32_8|) InVars {P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_8|} OutVars{P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_7|, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_7|, ~x~0=v_~x~0_14} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite33, ~x~0] because there is no mapped edge [2019-12-18 22:27:10,111 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] L796-->L796-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In-1514620036 256))) (.cse0 (= (mod ~x$r_buff0_thd3~0_In-1514620036 256) 0))) (or (and (= |P2Thread1of1ForFork1_#t~ite34_Out-1514620036| 0) (not .cse0) (not .cse1)) (and (= ~x$w_buff0_used~0_In-1514620036 |P2Thread1of1ForFork1_#t~ite34_Out-1514620036|) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1514620036, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1514620036} OutVars{P2Thread1of1ForFork1_#t~ite34=|P2Thread1of1ForFork1_#t~ite34_Out-1514620036|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1514620036, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1514620036} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-18 22:27:10,112 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [786] [786] L740-->L740-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-2077306933 256) 0))) (or (and .cse0 (= ~x$w_buff0~0_In-2077306933 |P0Thread1of1ForFork2_#t~ite8_Out-2077306933|) (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In-2077306933 256)))) (or (= (mod ~x$w_buff0_used~0_In-2077306933 256) 0) (and .cse1 (= (mod ~x$w_buff1_used~0_In-2077306933 256) 0)) (and (= 0 (mod ~x$r_buff1_thd1~0_In-2077306933 256)) .cse1))) (= |P0Thread1of1ForFork2_#t~ite8_Out-2077306933| |P0Thread1of1ForFork2_#t~ite9_Out-2077306933|)) (and (= ~x$w_buff0~0_In-2077306933 |P0Thread1of1ForFork2_#t~ite9_Out-2077306933|) (= |P0Thread1of1ForFork2_#t~ite8_In-2077306933| |P0Thread1of1ForFork2_#t~ite8_Out-2077306933|) (not .cse0)))) InVars {~x$w_buff0~0=~x$w_buff0~0_In-2077306933, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-2077306933, P0Thread1of1ForFork2_#t~ite8=|P0Thread1of1ForFork2_#t~ite8_In-2077306933|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2077306933, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-2077306933, ~weak$$choice2~0=~weak$$choice2~0_In-2077306933, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2077306933} OutVars{~x$w_buff0~0=~x$w_buff0~0_In-2077306933, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-2077306933, P0Thread1of1ForFork2_#t~ite8=|P0Thread1of1ForFork2_#t~ite8_Out-2077306933|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2077306933, P0Thread1of1ForFork2_#t~ite9=|P0Thread1of1ForFork2_#t~ite9_Out-2077306933|, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-2077306933, ~weak$$choice2~0=~weak$$choice2~0_In-2077306933, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2077306933} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite8, P0Thread1of1ForFork2_#t~ite9] because there is no mapped edge [2019-12-18 22:27:10,114 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L776-->L776-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd2~0_In-1598213331 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In-1598213331 256) 0))) (or (and (= |P1Thread1of1ForFork0_#t~ite28_Out-1598213331| 0) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork0_#t~ite28_Out-1598213331| ~x$w_buff0_used~0_In-1598213331)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1598213331, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1598213331} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1598213331, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out-1598213331|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1598213331} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-18 22:27:10,114 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [739] [739] L777-->L777-2: Formula: (let ((.cse3 (= (mod ~x$r_buff1_thd2~0_In-1609608356 256) 0)) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In-1609608356 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1609608356 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In-1609608356 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork0_#t~ite29_Out-1609608356| 0)) (and (= |P1Thread1of1ForFork0_#t~ite29_Out-1609608356| ~x$w_buff1_used~0_In-1609608356) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1609608356, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1609608356, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1609608356, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1609608356} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-1609608356, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1609608356, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1609608356, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out-1609608356|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1609608356} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-18 22:27:10,115 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L778-->L779: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In-2042066348 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-2042066348 256)))) (or (and (not .cse0) (= ~x$r_buff0_thd2~0_Out-2042066348 0) (not .cse1)) (and (or .cse0 .cse1) (= ~x$r_buff0_thd2~0_Out-2042066348 ~x$r_buff0_thd2~0_In-2042066348)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-2042066348, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2042066348} OutVars{P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out-2042066348|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out-2042066348, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2042066348} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-18 22:27:10,115 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L779-->L779-2: Formula: (let ((.cse3 (= 0 (mod ~x$r_buff1_thd2~0_In2119853960 256))) (.cse2 (= (mod ~x$w_buff1_used~0_In2119853960 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In2119853960 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In2119853960 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork0_#t~ite31_Out2119853960| ~x$r_buff1_thd2~0_In2119853960)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= |P1Thread1of1ForFork0_#t~ite31_Out2119853960| 0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In2119853960, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In2119853960, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In2119853960, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2119853960} OutVars{P1Thread1of1ForFork0_#t~ite31=|P1Thread1of1ForFork0_#t~ite31_Out2119853960|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2119853960, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In2119853960, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In2119853960, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2119853960} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-18 22:27:10,115 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L779-2-->P1EXIT: Formula: (and (= v_~__unbuffered_cnt~0_14 (+ v_~__unbuffered_cnt~0_15 1)) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|) (= v_~x$r_buff1_thd2~0_14 |v_P1Thread1of1ForFork0_#t~ite31_8|)) InVars {P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15} OutVars{P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_7|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_14, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_5|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-18 22:27:10,116 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [759] [759] L797-->L797-2: Formula: (let ((.cse2 (= (mod ~x$r_buff0_thd3~0_In-239346628 256) 0)) (.cse3 (= (mod ~x$w_buff0_used~0_In-239346628 256) 0)) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In-239346628 256))) (.cse1 (= 0 (mod ~x$r_buff1_thd3~0_In-239346628 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork1_#t~ite35_Out-239346628| ~x$w_buff1_used~0_In-239346628) (or .cse2 .cse3)) (and (= |P2Thread1of1ForFork1_#t~ite35_Out-239346628| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-239346628, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-239346628, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-239346628, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-239346628} OutVars{P2Thread1of1ForFork1_#t~ite35=|P2Thread1of1ForFork1_#t~ite35_Out-239346628|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-239346628, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-239346628, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-239346628, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-239346628} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-18 22:27:10,117 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] L798-->L798-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd3~0_In345989521 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In345989521 256) 0))) (or (and (= ~x$r_buff0_thd3~0_In345989521 |P2Thread1of1ForFork1_#t~ite36_Out345989521|) (or .cse0 .cse1)) (and (not .cse1) (= 0 |P2Thread1of1ForFork1_#t~ite36_Out345989521|) (not .cse0)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In345989521, ~x$w_buff0_used~0=~x$w_buff0_used~0_In345989521} OutVars{P2Thread1of1ForFork1_#t~ite36=|P2Thread1of1ForFork1_#t~ite36_Out345989521|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In345989521, ~x$w_buff0_used~0=~x$w_buff0_used~0_In345989521} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-18 22:27:10,118 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [788] [788] L743-->L743-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-2081532213 256)))) (or (and .cse0 (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In-2081532213 256)))) (or (= 0 (mod ~x$w_buff0_used~0_In-2081532213 256)) (and .cse1 (= 0 (mod ~x$w_buff1_used~0_In-2081532213 256))) (and .cse1 (= (mod ~x$r_buff1_thd1~0_In-2081532213 256) 0)))) (= |P0Thread1of1ForFork2_#t~ite18_Out-2081532213| |P0Thread1of1ForFork2_#t~ite17_Out-2081532213|) (= |P0Thread1of1ForFork2_#t~ite17_Out-2081532213| ~x$w_buff1_used~0_In-2081532213)) (and (= |P0Thread1of1ForFork2_#t~ite18_Out-2081532213| ~x$w_buff1_used~0_In-2081532213) (= |P0Thread1of1ForFork2_#t~ite17_In-2081532213| |P0Thread1of1ForFork2_#t~ite17_Out-2081532213|) (not .cse0)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-2081532213, P0Thread1of1ForFork2_#t~ite17=|P0Thread1of1ForFork2_#t~ite17_In-2081532213|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2081532213, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-2081532213, ~weak$$choice2~0=~weak$$choice2~0_In-2081532213, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2081532213} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-2081532213, P0Thread1of1ForFork2_#t~ite18=|P0Thread1of1ForFork2_#t~ite18_Out-2081532213|, P0Thread1of1ForFork2_#t~ite17=|P0Thread1of1ForFork2_#t~ite17_Out-2081532213|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2081532213, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-2081532213, ~weak$$choice2~0=~weak$$choice2~0_In-2081532213, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2081532213} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite18, P0Thread1of1ForFork2_#t~ite17] because there is no mapped edge [2019-12-18 22:27:10,119 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [730] [730] L744-->L745: Formula: (and (= v_~x$r_buff0_thd1~0_56 v_~x$r_buff0_thd1~0_55) (not (= (mod v_~weak$$choice2~0_23 256) 0))) InVars {~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_56, ~weak$$choice2~0=v_~weak$$choice2~0_23} OutVars{P0Thread1of1ForFork2_#t~ite20=|v_P0Thread1of1ForFork2_#t~ite20_10|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_55, P0Thread1of1ForFork2_#t~ite19=|v_P0Thread1of1ForFork2_#t~ite19_9|, ~weak$$choice2~0=v_~weak$$choice2~0_23, P0Thread1of1ForFork2_#t~ite21=|v_P0Thread1of1ForFork2_#t~ite21_8|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite20, ~x$r_buff0_thd1~0, P0Thread1of1ForFork2_#t~ite19, P0Thread1of1ForFork2_#t~ite21] because there is no mapped edge [2019-12-18 22:27:10,119 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [797] [797] L745-->L745-8: Formula: (let ((.cse3 (= 0 (mod ~x$w_buff0_used~0_In1998545085 256))) (.cse4 (= |P0Thread1of1ForFork2_#t~ite24_Out1998545085| |P0Thread1of1ForFork2_#t~ite23_Out1998545085|)) (.cse5 (= 0 (mod ~weak$$choice2~0_In1998545085 256))) (.cse2 (= 0 (mod ~x$r_buff1_thd1~0_In1998545085 256))) (.cse1 (= (mod ~x$w_buff1_used~0_In1998545085 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd1~0_In1998545085 256) 0))) (or (and (or (and (or (and .cse0 .cse1) (and .cse0 .cse2) .cse3) .cse4 .cse5 (= ~x$r_buff1_thd1~0_In1998545085 |P0Thread1of1ForFork2_#t~ite23_Out1998545085|)) (and (not .cse5) (= |P0Thread1of1ForFork2_#t~ite24_Out1998545085| ~x$r_buff1_thd1~0_In1998545085) (= |P0Thread1of1ForFork2_#t~ite23_Out1998545085| |P0Thread1of1ForFork2_#t~ite23_In1998545085|))) (= |P0Thread1of1ForFork2_#t~ite22_In1998545085| |P0Thread1of1ForFork2_#t~ite22_Out1998545085|)) (let ((.cse6 (not .cse0))) (and (not .cse3) (= |P0Thread1of1ForFork2_#t~ite22_Out1998545085| |P0Thread1of1ForFork2_#t~ite23_Out1998545085|) .cse4 .cse5 (or (not .cse2) .cse6) (or (not .cse1) .cse6) (= |P0Thread1of1ForFork2_#t~ite22_Out1998545085| 0))))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1998545085, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1998545085, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1998545085, ~weak$$choice2~0=~weak$$choice2~0_In1998545085, P0Thread1of1ForFork2_#t~ite23=|P0Thread1of1ForFork2_#t~ite23_In1998545085|, P0Thread1of1ForFork2_#t~ite22=|P0Thread1of1ForFork2_#t~ite22_In1998545085|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1998545085} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1998545085, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1998545085, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1998545085, P0Thread1of1ForFork2_#t~ite24=|P0Thread1of1ForFork2_#t~ite24_Out1998545085|, ~weak$$choice2~0=~weak$$choice2~0_In1998545085, P0Thread1of1ForFork2_#t~ite23=|P0Thread1of1ForFork2_#t~ite23_Out1998545085|, P0Thread1of1ForFork2_#t~ite22=|P0Thread1of1ForFork2_#t~ite22_Out1998545085|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1998545085} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite24, P0Thread1of1ForFork2_#t~ite23, P0Thread1of1ForFork2_#t~ite22] because there is no mapped edge [2019-12-18 22:27:10,120 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L799-->L799-2: Formula: (let ((.cse3 (= (mod ~x$r_buff0_thd3~0_In-684286236 256) 0)) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In-684286236 256))) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In-684286236 256))) (.cse0 (= 0 (mod ~x$r_buff1_thd3~0_In-684286236 256)))) (or (and (= |P2Thread1of1ForFork1_#t~ite37_Out-684286236| ~x$r_buff1_thd3~0_In-684286236) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P2Thread1of1ForFork1_#t~ite37_Out-684286236| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-684286236, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-684286236, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-684286236, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-684286236} OutVars{P2Thread1of1ForFork1_#t~ite37=|P2Thread1of1ForFork1_#t~ite37_Out-684286236|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-684286236, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-684286236, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-684286236, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-684286236} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-18 22:27:10,120 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [763] [763] L799-2-->P2EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_13 1) v_~__unbuffered_cnt~0_12) (= 0 |v_P2Thread1of1ForFork1_#res.offset_5|) (= 0 |v_P2Thread1of1ForFork1_#res.base_5|) (= v_~x$r_buff1_thd3~0_12 |v_P2Thread1of1ForFork1_#t~ite37_8|)) InVars {P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} OutVars{P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_7|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_5|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_12, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37, P2Thread1of1ForFork1_#res.base, ~x$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-18 22:27:10,120 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L747-->L755: Formula: (and (= 0 v_~x$flush_delayed~0_6) (= v_~x$mem_tmp~0_4 v_~x~0_16) (= v_~__unbuffered_cnt~0_9 (+ v_~__unbuffered_cnt~0_10 1)) (not (= 0 (mod v_~x$flush_delayed~0_7 256)))) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_7, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10, ~x$mem_tmp~0=v_~x$mem_tmp~0_4} OutVars{P0Thread1of1ForFork2_#t~ite25=|v_P0Thread1of1ForFork2_#t~ite25_7|, ~x$flush_delayed~0=v_~x$flush_delayed~0_6, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9, ~x$mem_tmp~0=v_~x$mem_tmp~0_4, ~x~0=v_~x~0_16} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite25, ~x$flush_delayed~0, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-12-18 22:27:10,121 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [698] [698] L826-->L828-2: Formula: (and (or (= (mod v_~x$r_buff0_thd0~0_15 256) 0) (= 0 (mod v_~x$w_buff0_used~0_86 256))) (not (= 0 (mod v_~main$tmp_guard0~0_5 256)))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_15, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_86} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_15, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_86} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-18 22:27:10,121 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L828-2-->L828-4: Formula: (let ((.cse1 (= (mod ~x$r_buff1_thd0~0_In-225969521 256) 0)) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In-225969521 256)))) (or (and (not .cse0) (= ~x$w_buff1~0_In-225969521 |ULTIMATE.start_main_#t~ite41_Out-225969521|) (not .cse1)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite41_Out-225969521| ~x~0_In-225969521)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-225969521, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-225969521, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-225969521, ~x~0=~x~0_In-225969521} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out-225969521|, ~x$w_buff1~0=~x$w_buff1~0_In-225969521, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-225969521, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-225969521, ~x~0=~x~0_In-225969521} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41] because there is no mapped edge [2019-12-18 22:27:10,121 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [688] [688] L828-4-->L829: Formula: (= v_~x~0_15 |v_ULTIMATE.start_main_#t~ite41_7|) InVars {ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_7|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_6|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_6|, ~x~0=v_~x~0_15} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite42, ~x~0] because there is no mapped edge [2019-12-18 22:27:10,122 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [744] [744] L829-->L829-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1717417336 256))) (.cse1 (= (mod ~x$r_buff0_thd0~0_In-1717417336 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite43_Out-1717417336|)) (and (= ~x$w_buff0_used~0_In-1717417336 |ULTIMATE.start_main_#t~ite43_Out-1717417336|) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1717417336, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1717417336} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1717417336, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-1717417336|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1717417336} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-18 22:27:10,122 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] L830-->L830-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff1_used~0_In403604697 256))) (.cse1 (= (mod ~x$r_buff1_thd0~0_In403604697 256) 0)) (.cse3 (= (mod ~x$w_buff0_used~0_In403604697 256) 0)) (.cse2 (= 0 (mod ~x$r_buff0_thd0~0_In403604697 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite44_Out403604697| ~x$w_buff1_used~0_In403604697) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite44_Out403604697| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In403604697, ~x$w_buff1_used~0=~x$w_buff1_used~0_In403604697, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In403604697, ~x$w_buff0_used~0=~x$w_buff0_used~0_In403604697} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In403604697, ~x$w_buff1_used~0=~x$w_buff1_used~0_In403604697, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In403604697, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out403604697|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In403604697} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-18 22:27:10,123 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L831-->L831-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In1012609847 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd0~0_In1012609847 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite45_Out1012609847|) (not .cse0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite45_Out1012609847| ~x$r_buff0_thd0~0_In1012609847) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1012609847, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1012609847} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1012609847, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out1012609847|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1012609847} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-18 22:27:10,124 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [741] [741] L832-->L832-2: Formula: (let ((.cse3 (= 0 (mod ~x$r_buff0_thd0~0_In1988701180 256))) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In1988701180 256))) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In1988701180 256))) (.cse1 (= 0 (mod ~x$r_buff1_thd0~0_In1988701180 256)))) (or (and (or .cse0 .cse1) (= ~x$r_buff1_thd0~0_In1988701180 |ULTIMATE.start_main_#t~ite46_Out1988701180|) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= |ULTIMATE.start_main_#t~ite46_Out1988701180| 0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1988701180, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1988701180, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1988701180, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1988701180} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1988701180, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out1988701180|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1988701180, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1988701180, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1988701180} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-18 22:27:10,124 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [799] [799] L832-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~__unbuffered_p2_EAX~0_8 1) (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6| (mod v_~main$tmp_guard1~0_10 256)) (= v_~__unbuffered_p0_EAX~0_8 0) (= v_~main$tmp_guard1~0_10 0) (= v_~y~0_11 2) (= v_~x$r_buff1_thd0~0_15 |v_ULTIMATE.start_main_#t~ite46_12|) (= v_~__unbuffered_p2_EBX~0_8 1)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_8, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_8, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_12|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_8, ~y~0=v_~y~0_11} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_8, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_13, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_8, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_11|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_10, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_8, ~y~0=v_~y~0_11, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_15, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 22:27:10,225 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 10:27:10 BasicIcfg [2019-12-18 22:27:10,226 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 22:27:10,227 INFO L168 Benchmark]: Toolchain (without parser) took 183015.30 ms. Allocated memory was 137.9 MB in the beginning and 3.4 GB in the end (delta: 3.2 GB). Free memory was 101.1 MB in the beginning and 2.5 GB in the end (delta: -2.4 GB). Peak memory consumption was 850.9 MB. Max. memory is 7.1 GB. [2019-12-18 22:27:10,228 INFO L168 Benchmark]: CDTParser took 0.59 ms. Allocated memory is still 137.9 MB. Free memory was 121.1 MB in the beginning and 120.9 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2019-12-18 22:27:10,229 INFO L168 Benchmark]: CACSL2BoogieTranslator took 724.61 ms. Allocated memory was 137.9 MB in the beginning and 201.9 MB in the end (delta: 64.0 MB). Free memory was 100.8 MB in the beginning and 153.7 MB in the end (delta: -52.8 MB). Peak memory consumption was 24.5 MB. Max. memory is 7.1 GB. [2019-12-18 22:27:10,229 INFO L168 Benchmark]: Boogie Procedure Inliner took 69.74 ms. Allocated memory is still 201.9 MB. Free memory was 153.7 MB in the beginning and 150.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-18 22:27:10,230 INFO L168 Benchmark]: Boogie Preprocessor took 37.89 ms. Allocated memory is still 201.9 MB. Free memory was 150.9 MB in the beginning and 148.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-12-18 22:27:10,230 INFO L168 Benchmark]: RCFGBuilder took 773.75 ms. Allocated memory is still 201.9 MB. Free memory was 148.9 MB in the beginning and 102.0 MB in the end (delta: 46.9 MB). Peak memory consumption was 46.9 MB. Max. memory is 7.1 GB. [2019-12-18 22:27:10,231 INFO L168 Benchmark]: TraceAbstraction took 181403.93 ms. Allocated memory was 201.9 MB in the beginning and 3.4 GB in the end (delta: 3.2 GB). Free memory was 101.3 MB in the beginning and 2.5 GB in the end (delta: -2.4 GB). Peak memory consumption was 787.2 MB. Max. memory is 7.1 GB. [2019-12-18 22:27:10,234 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.59 ms. Allocated memory is still 137.9 MB. Free memory was 121.1 MB in the beginning and 120.9 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 724.61 ms. Allocated memory was 137.9 MB in the beginning and 201.9 MB in the end (delta: 64.0 MB). Free memory was 100.8 MB in the beginning and 153.7 MB in the end (delta: -52.8 MB). Peak memory consumption was 24.5 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 69.74 ms. Allocated memory is still 201.9 MB. Free memory was 153.7 MB in the beginning and 150.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 37.89 ms. Allocated memory is still 201.9 MB. Free memory was 150.9 MB in the beginning and 148.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 773.75 ms. Allocated memory is still 201.9 MB. Free memory was 148.9 MB in the beginning and 102.0 MB in the end (delta: 46.9 MB). Peak memory consumption was 46.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 181403.93 ms. Allocated memory was 201.9 MB in the beginning and 3.4 GB in the end (delta: 3.2 GB). Free memory was 101.3 MB in the beginning and 2.5 GB in the end (delta: -2.4 GB). Peak memory consumption was 787.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.9s, 163 ProgramPointsBefore, 84 ProgramPointsAfterwards, 194 TransitionsBefore, 92 TransitionsAfterwards, 16696 CoEnabledTransitionPairs, 7 FixpointIterations, 32 TrivialSequentialCompositions, 44 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 35 ConcurrentYvCompositions, 27 ChoiceCompositions, 6606 VarBasedMoverChecksPositive, 211 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 69182 CheckedPairsTotal, 111 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L818] FCALL, FORK 0 pthread_create(&t1900, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L820] FCALL, FORK 0 pthread_create(&t1901, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L822] FCALL, FORK 0 pthread_create(&t1902, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L765] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L766] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L767] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L768] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L769] 2 x$r_buff0_thd2 = (_Bool)1 [L772] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L775] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L789] 3 __unbuffered_p2_EAX = y [L792] 3 __unbuffered_p2_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L795] 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L775] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L730] 1 y = 2 [L735] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L736] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L737] 1 x$flush_delayed = weak$$choice2 [L738] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L739] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L739] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L740] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L741] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L741] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L776] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L777] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L796] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L797] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L798] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L742] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L742] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L743] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L745] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L746] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L824] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L829] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L830] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L831] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 154 locations, 2 error locations. Result: UNSAFE, OverallTime: 181.1s, OverallIterations: 29, TraceHistogramMax: 1, AutomataDifference: 57.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 4393 SDtfs, 6258 SDslu, 15228 SDs, 0 SdLazy, 16477 SolverSat, 379 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 13.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 381 GetRequests, 36 SyntacticMatches, 29 SemanticMatches, 316 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1940 ImplicationChecksByTransitivity, 6.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=163553occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 99.8s AutomataMinimizationTime, 28 MinimizatonAttempts, 190738 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.2s InterpolantComputationTime, 974 NumberOfCodeBlocks, 974 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 890 ConstructedInterpolants, 0 QuantifiedInterpolants, 258223 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 28 InterpolantComputations, 28 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...