/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/mix038_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 06:22:43,905 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 06:22:43,907 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 06:22:43,926 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 06:22:43,926 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 06:22:43,928 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 06:22:43,930 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 06:22:43,940 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 06:22:43,944 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 06:22:43,947 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 06:22:43,949 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 06:22:43,951 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 06:22:43,951 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 06:22:43,953 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 06:22:43,955 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 06:22:43,956 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 06:22:43,956 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 06:22:43,957 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 06:22:43,958 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 06:22:43,960 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 06:22:43,961 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 06:22:43,962 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 06:22:43,963 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 06:22:43,964 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 06:22:43,966 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 06:22:43,966 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 06:22:43,966 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 06:22:43,967 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 06:22:43,968 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 06:22:43,968 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 06:22:43,969 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 06:22:43,969 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 06:22:43,970 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 06:22:43,971 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 06:22:43,972 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 06:22:43,972 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 06:22:43,973 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 06:22:43,973 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 06:22:43,973 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 06:22:43,974 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 06:22:43,974 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 06:22:43,975 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf [2019-12-27 06:22:44,003 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 06:22:44,003 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 06:22:44,004 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 06:22:44,005 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 06:22:44,005 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 06:22:44,005 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 06:22:44,005 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 06:22:44,005 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 06:22:44,005 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 06:22:44,006 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 06:22:44,006 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 06:22:44,007 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 06:22:44,007 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 06:22:44,007 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 06:22:44,007 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 06:22:44,007 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 06:22:44,007 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 06:22:44,008 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 06:22:44,008 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 06:22:44,008 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 06:22:44,008 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 06:22:44,008 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 06:22:44,009 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 06:22:44,010 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 06:22:44,010 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 06:22:44,010 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 06:22:44,010 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 06:22:44,011 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 06:22:44,011 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 06:22:44,011 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 06:22:44,283 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 06:22:44,296 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 06:22:44,299 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 06:22:44,300 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 06:22:44,301 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 06:22:44,302 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix038_pso.oepc.i [2019-12-27 06:22:44,373 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/09d967ffb/e14ded49956146649da1dacbca908394/FLAG7781e0ba7 [2019-12-27 06:22:44,949 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 06:22:44,950 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix038_pso.oepc.i [2019-12-27 06:22:44,969 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/09d967ffb/e14ded49956146649da1dacbca908394/FLAG7781e0ba7 [2019-12-27 06:22:45,221 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/09d967ffb/e14ded49956146649da1dacbca908394 [2019-12-27 06:22:45,231 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 06:22:45,233 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 06:22:45,234 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 06:22:45,235 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 06:22:45,238 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 06:22:45,239 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 06:22:45" (1/1) ... [2019-12-27 06:22:45,242 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23a66491 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:22:45, skipping insertion in model container [2019-12-27 06:22:45,243 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 06:22:45" (1/1) ... [2019-12-27 06:22:45,250 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 06:22:45,318 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 06:22:45,912 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 06:22:45,925 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 06:22:46,037 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 06:22:46,113 INFO L208 MainTranslator]: Completed translation [2019-12-27 06:22:46,113 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:22:46 WrapperNode [2019-12-27 06:22:46,113 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 06:22:46,114 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 06:22:46,114 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 06:22:46,114 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 06:22:46,123 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:22:46" (1/1) ... [2019-12-27 06:22:46,150 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:22:46" (1/1) ... [2019-12-27 06:22:46,188 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 06:22:46,188 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 06:22:46,189 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 06:22:46,189 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 06:22:46,202 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:22:46" (1/1) ... [2019-12-27 06:22:46,202 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:22:46" (1/1) ... [2019-12-27 06:22:46,207 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:22:46" (1/1) ... [2019-12-27 06:22:46,207 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:22:46" (1/1) ... [2019-12-27 06:22:46,218 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:22:46" (1/1) ... [2019-12-27 06:22:46,223 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:22:46" (1/1) ... [2019-12-27 06:22:46,227 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:22:46" (1/1) ... [2019-12-27 06:22:46,232 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 06:22:46,232 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 06:22:46,232 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 06:22:46,232 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 06:22:46,233 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:22:46" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 06:22:46,304 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 06:22:46,305 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 06:22:46,305 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 06:22:46,305 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 06:22:46,306 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 06:22:46,306 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 06:22:46,306 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 06:22:46,307 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 06:22:46,308 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 06:22:46,308 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 06:22:46,309 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 06:22:46,309 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 06:22:46,309 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 06:22:46,311 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 06:22:47,117 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 06:22:47,118 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 06:22:47,119 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 06:22:47 BoogieIcfgContainer [2019-12-27 06:22:47,119 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 06:22:47,121 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 06:22:47,121 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 06:22:47,124 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 06:22:47,124 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 06:22:45" (1/3) ... [2019-12-27 06:22:47,125 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63d2350c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 06:22:47, skipping insertion in model container [2019-12-27 06:22:47,126 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:22:46" (2/3) ... [2019-12-27 06:22:47,126 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63d2350c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 06:22:47, skipping insertion in model container [2019-12-27 06:22:47,126 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 06:22:47" (3/3) ... [2019-12-27 06:22:47,128 INFO L109 eAbstractionObserver]: Analyzing ICFG mix038_pso.oepc.i [2019-12-27 06:22:47,139 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 06:22:47,139 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 06:22:47,147 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 06:22:47,148 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 06:22:47,190 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:22:47,191 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:22:47,191 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:22:47,191 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:22:47,192 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:22:47,192 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:22:47,192 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:22:47,193 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:22:47,193 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:22:47,193 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:22:47,194 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:22:47,194 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:22:47,194 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:22:47,195 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:22:47,195 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:22:47,195 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:22:47,195 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:22:47,196 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:22:47,196 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:22:47,196 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:22:47,196 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:22:47,197 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:22:47,197 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:22:47,197 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:22:47,198 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:22:47,213 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:22:47,214 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:22:47,214 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:22:47,215 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:22:47,215 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:22:47,218 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:22:47,218 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:22:47,218 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:22:47,219 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:22:47,221 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:22:47,221 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:22:47,222 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:22:47,223 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:22:47,223 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:22:47,224 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:22:47,225 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:22:47,225 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:22:47,225 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:22:47,225 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:22:47,225 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:22:47,226 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:22:47,226 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:22:47,226 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:22:47,226 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:22:47,226 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:22:47,227 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:22:47,227 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:22:47,227 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:22:47,227 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:22:47,227 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:22:47,228 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:22:47,228 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:22:47,228 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:22:47,228 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:22:47,228 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:22:47,229 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:22:47,229 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:22:47,230 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:22:47,230 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:22:47,236 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:22:47,237 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:22:47,237 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:22:47,237 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:22:47,237 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:22:47,238 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:22:47,238 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:22:47,238 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:22:47,239 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:22:47,239 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:22:47,239 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:22:47,240 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:22:47,240 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:22:47,240 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:22:47,240 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:22:47,240 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:22:47,241 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:22:47,242 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:22:47,242 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:22:47,242 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:22:47,242 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:22:47,243 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:22:47,243 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:22:47,244 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:22:47,244 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:22:47,244 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:22:47,244 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:22:47,245 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:22:47,245 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:22:47,245 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:22:47,245 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:22:47,245 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:22:47,246 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:22:47,246 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:22:47,246 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:22:47,246 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:22:47,246 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:22:47,247 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:22:47,251 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:22:47,252 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:22:47,252 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:22:47,252 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:22:47,259 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:22:47,259 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:22:47,260 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:22:47,260 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:22:47,260 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:22:47,260 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:22:47,261 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:22:47,261 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:22:47,261 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:22:47,261 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:22:47,261 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:22:47,262 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:22:47,262 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:22:47,262 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:22:47,262 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:22:47,262 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:22:47,262 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:22:47,263 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:22:47,263 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:22:47,263 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:22:47,263 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:22:47,263 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:22:47,264 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:22:47,264 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:22:47,264 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:22:47,264 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:22:47,264 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:22:47,265 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:22:47,265 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:22:47,265 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:22:47,265 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:22:47,265 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:22:47,265 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:22:47,266 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:22:47,266 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:22:47,266 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:22:47,266 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:22:47,266 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:22:47,267 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:22:47,267 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:22:47,267 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:22:47,267 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:22:47,267 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:22:47,267 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:22:47,268 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:22:47,268 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:22:47,268 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:22:47,268 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:22:47,268 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:22:47,269 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:22:47,269 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:22:47,269 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:22:47,269 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:22:47,269 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:22:47,270 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:22:47,270 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:22:47,270 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:22:47,270 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:22:47,270 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:22:47,270 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:22:47,271 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:22:47,271 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:22:47,271 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:22:47,271 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:22:47,271 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:22:47,272 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:22:47,272 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:22:47,272 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:22:47,272 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:22:47,272 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:22:47,272 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:22:47,273 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:22:47,273 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:22:47,273 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:22:47,273 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:22:47,273 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:22:47,277 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:22:47,277 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:22:47,278 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:22:47,278 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:22:47,278 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:22:47,278 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:22:47,278 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:22:47,279 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:22:47,279 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:22:47,279 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:22:47,279 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:22:47,279 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:22:47,280 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:22:47,280 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:22:47,280 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:22:47,280 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:22:47,280 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:22:47,281 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:22:47,281 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:22:47,281 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:22:47,281 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:22:47,281 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:22:47,281 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:22:47,282 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:22:47,282 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:22:47,282 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:22:47,282 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:22:47,282 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:22:47,282 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:22:47,283 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:22:47,283 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:22:47,283 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:22:47,283 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:22:47,287 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:22:47,287 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:22:47,287 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:22:47,287 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:22:47,288 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:22:47,288 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:22:47,288 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:22:47,288 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:22:47,288 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:22:47,289 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:22:47,289 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:22:47,289 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:22:47,291 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:22:47,291 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:22:47,291 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:22:47,292 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:22:47,292 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:22:47,292 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:22:47,292 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:22:47,292 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:22:47,293 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:22:47,293 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:22:47,307 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 06:22:47,329 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 06:22:47,329 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 06:22:47,329 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 06:22:47,329 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 06:22:47,329 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 06:22:47,330 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 06:22:47,330 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 06:22:47,330 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 06:22:47,346 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 177 places, 214 transitions [2019-12-27 06:22:47,347 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 177 places, 214 transitions [2019-12-27 06:22:47,477 INFO L132 PetriNetUnfolder]: 47/211 cut-off events. [2019-12-27 06:22:47,477 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 06:22:47,498 INFO L76 FinitePrefix]: Finished finitePrefix Result has 221 conditions, 211 events. 47/211 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 435 event pairs. 0/162 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 06:22:47,521 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 177 places, 214 transitions [2019-12-27 06:22:47,582 INFO L132 PetriNetUnfolder]: 47/211 cut-off events. [2019-12-27 06:22:47,582 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 06:22:47,590 INFO L76 FinitePrefix]: Finished finitePrefix Result has 221 conditions, 211 events. 47/211 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 435 event pairs. 0/162 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 06:22:47,614 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-27 06:22:47,615 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 06:22:51,295 WARN L192 SmtUtils]: Spent 303.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 91 [2019-12-27 06:22:51,423 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-12-27 06:22:51,441 INFO L206 etLargeBlockEncoding]: Checked pairs total: 80962 [2019-12-27 06:22:51,441 INFO L214 etLargeBlockEncoding]: Total number of compositions: 114 [2019-12-27 06:22:51,445 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 93 places, 102 transitions [2019-12-27 06:23:07,259 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 104862 states. [2019-12-27 06:23:07,261 INFO L276 IsEmpty]: Start isEmpty. Operand 104862 states. [2019-12-27 06:23:07,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 06:23:07,267 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:23:07,268 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 06:23:07,268 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:23:07,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:23:07,276 INFO L82 PathProgramCache]: Analyzing trace with hash 916881, now seen corresponding path program 1 times [2019-12-27 06:23:07,283 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:23:07,284 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267103244] [2019-12-27 06:23:07,284 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:23:07,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:23:07,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:23:07,480 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267103244] [2019-12-27 06:23:07,481 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:23:07,481 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 06:23:07,482 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532644397] [2019-12-27 06:23:07,486 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:23:07,486 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:23:07,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:23:07,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:23:07,498 INFO L87 Difference]: Start difference. First operand 104862 states. Second operand 3 states. [2019-12-27 06:23:11,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:23:11,002 INFO L93 Difference]: Finished difference Result 104092 states and 443334 transitions. [2019-12-27 06:23:11,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:23:11,004 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 06:23:11,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:23:11,512 INFO L225 Difference]: With dead ends: 104092 [2019-12-27 06:23:11,512 INFO L226 Difference]: Without dead ends: 97696 [2019-12-27 06:23:11,513 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:23:15,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97696 states. [2019-12-27 06:23:17,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97696 to 97696. [2019-12-27 06:23:17,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97696 states. [2019-12-27 06:23:20,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97696 states to 97696 states and 415501 transitions. [2019-12-27 06:23:20,890 INFO L78 Accepts]: Start accepts. Automaton has 97696 states and 415501 transitions. Word has length 3 [2019-12-27 06:23:20,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:23:20,891 INFO L462 AbstractCegarLoop]: Abstraction has 97696 states and 415501 transitions. [2019-12-27 06:23:20,891 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:23:20,891 INFO L276 IsEmpty]: Start isEmpty. Operand 97696 states and 415501 transitions. [2019-12-27 06:23:20,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 06:23:20,895 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:23:20,895 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:23:20,896 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:23:20,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:23:20,896 INFO L82 PathProgramCache]: Analyzing trace with hash -1566799458, now seen corresponding path program 1 times [2019-12-27 06:23:20,897 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:23:20,897 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645890508] [2019-12-27 06:23:20,897 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:23:20,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:23:21,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:23:21,015 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645890508] [2019-12-27 06:23:21,015 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:23:21,015 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:23:21,015 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309489285] [2019-12-27 06:23:21,017 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 06:23:21,017 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:23:21,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 06:23:21,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:23:21,017 INFO L87 Difference]: Start difference. First operand 97696 states and 415501 transitions. Second operand 4 states. [2019-12-27 06:23:26,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:23:26,074 INFO L93 Difference]: Finished difference Result 155904 states and 634680 transitions. [2019-12-27 06:23:26,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 06:23:26,075 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 06:23:26,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:23:26,674 INFO L225 Difference]: With dead ends: 155904 [2019-12-27 06:23:26,675 INFO L226 Difference]: Without dead ends: 155855 [2019-12-27 06:23:26,676 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:23:31,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155855 states. [2019-12-27 06:23:34,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155855 to 141665. [2019-12-27 06:23:34,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141665 states. [2019-12-27 06:23:35,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141665 states to 141665 states and 584468 transitions. [2019-12-27 06:23:35,241 INFO L78 Accepts]: Start accepts. Automaton has 141665 states and 584468 transitions. Word has length 11 [2019-12-27 06:23:35,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:23:35,241 INFO L462 AbstractCegarLoop]: Abstraction has 141665 states and 584468 transitions. [2019-12-27 06:23:35,241 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 06:23:35,241 INFO L276 IsEmpty]: Start isEmpty. Operand 141665 states and 584468 transitions. [2019-12-27 06:23:35,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 06:23:35,248 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:23:35,249 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:23:35,249 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:23:35,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:23:35,249 INFO L82 PathProgramCache]: Analyzing trace with hash 2120295885, now seen corresponding path program 1 times [2019-12-27 06:23:35,250 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:23:35,250 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125324675] [2019-12-27 06:23:35,250 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:23:35,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:23:35,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:23:35,317 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125324675] [2019-12-27 06:23:35,317 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:23:35,317 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:23:35,318 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137182645] [2019-12-27 06:23:35,318 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:23:35,318 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:23:35,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:23:35,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:23:35,319 INFO L87 Difference]: Start difference. First operand 141665 states and 584468 transitions. Second operand 3 states. [2019-12-27 06:23:35,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:23:35,444 INFO L93 Difference]: Finished difference Result 31684 states and 102658 transitions. [2019-12-27 06:23:35,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:23:35,444 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 06:23:35,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:23:35,516 INFO L225 Difference]: With dead ends: 31684 [2019-12-27 06:23:35,516 INFO L226 Difference]: Without dead ends: 31684 [2019-12-27 06:23:35,516 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:23:35,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31684 states. [2019-12-27 06:23:40,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31684 to 31684. [2019-12-27 06:23:40,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31684 states. [2019-12-27 06:23:40,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31684 states to 31684 states and 102658 transitions. [2019-12-27 06:23:40,537 INFO L78 Accepts]: Start accepts. Automaton has 31684 states and 102658 transitions. Word has length 13 [2019-12-27 06:23:40,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:23:40,538 INFO L462 AbstractCegarLoop]: Abstraction has 31684 states and 102658 transitions. [2019-12-27 06:23:40,538 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:23:40,538 INFO L276 IsEmpty]: Start isEmpty. Operand 31684 states and 102658 transitions. [2019-12-27 06:23:40,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 06:23:40,540 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:23:40,541 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:23:40,541 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:23:40,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:23:40,541 INFO L82 PathProgramCache]: Analyzing trace with hash -2058055416, now seen corresponding path program 1 times [2019-12-27 06:23:40,541 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:23:40,542 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745100714] [2019-12-27 06:23:40,542 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:23:40,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:23:40,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:23:40,626 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745100714] [2019-12-27 06:23:40,626 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:23:40,626 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:23:40,626 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236965431] [2019-12-27 06:23:40,627 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 06:23:40,627 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:23:40,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 06:23:40,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:23:40,627 INFO L87 Difference]: Start difference. First operand 31684 states and 102658 transitions. Second operand 4 states. [2019-12-27 06:23:41,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:23:41,024 INFO L93 Difference]: Finished difference Result 39269 states and 126736 transitions. [2019-12-27 06:23:41,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 06:23:41,025 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-27 06:23:41,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:23:41,091 INFO L225 Difference]: With dead ends: 39269 [2019-12-27 06:23:41,091 INFO L226 Difference]: Without dead ends: 39269 [2019-12-27 06:23:41,092 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:23:41,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39269 states. [2019-12-27 06:23:41,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39269 to 35204. [2019-12-27 06:23:41,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35204 states. [2019-12-27 06:23:41,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35204 states to 35204 states and 113989 transitions. [2019-12-27 06:23:41,801 INFO L78 Accepts]: Start accepts. Automaton has 35204 states and 113989 transitions. Word has length 16 [2019-12-27 06:23:41,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:23:41,803 INFO L462 AbstractCegarLoop]: Abstraction has 35204 states and 113989 transitions. [2019-12-27 06:23:41,803 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 06:23:41,803 INFO L276 IsEmpty]: Start isEmpty. Operand 35204 states and 113989 transitions. [2019-12-27 06:23:41,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 06:23:41,812 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:23:41,812 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:23:41,812 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:23:41,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:23:41,812 INFO L82 PathProgramCache]: Analyzing trace with hash -36065168, now seen corresponding path program 1 times [2019-12-27 06:23:41,813 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:23:41,813 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671991283] [2019-12-27 06:23:41,813 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:23:41,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:23:42,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:23:42,237 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671991283] [2019-12-27 06:23:42,238 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:23:42,238 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:23:42,238 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334412101] [2019-12-27 06:23:42,238 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 06:23:42,239 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:23:42,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 06:23:42,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:23:42,239 INFO L87 Difference]: Start difference. First operand 35204 states and 113989 transitions. Second operand 5 states. [2019-12-27 06:23:42,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:23:42,846 INFO L93 Difference]: Finished difference Result 45733 states and 145470 transitions. [2019-12-27 06:23:42,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 06:23:42,846 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-27 06:23:42,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:23:42,919 INFO L225 Difference]: With dead ends: 45733 [2019-12-27 06:23:42,919 INFO L226 Difference]: Without dead ends: 45726 [2019-12-27 06:23:42,919 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 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-27 06:23:43,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45726 states. [2019-12-27 06:23:43,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45726 to 34769. [2019-12-27 06:23:43,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34769 states. [2019-12-27 06:23:43,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34769 states to 34769 states and 112450 transitions. [2019-12-27 06:23:43,600 INFO L78 Accepts]: Start accepts. Automaton has 34769 states and 112450 transitions. Word has length 22 [2019-12-27 06:23:43,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:23:43,601 INFO L462 AbstractCegarLoop]: Abstraction has 34769 states and 112450 transitions. [2019-12-27 06:23:43,601 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 06:23:43,601 INFO L276 IsEmpty]: Start isEmpty. Operand 34769 states and 112450 transitions. [2019-12-27 06:23:43,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 06:23:43,613 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:23:43,613 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:23:43,613 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:23:43,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:23:43,614 INFO L82 PathProgramCache]: Analyzing trace with hash -74237997, now seen corresponding path program 1 times [2019-12-27 06:23:43,614 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:23:43,614 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823867697] [2019-12-27 06:23:43,614 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:23:43,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:23:43,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:23:43,677 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823867697] [2019-12-27 06:23:43,677 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:23:43,678 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:23:43,678 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390009612] [2019-12-27 06:23:43,678 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 06:23:43,679 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:23:43,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 06:23:43,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:23:43,679 INFO L87 Difference]: Start difference. First operand 34769 states and 112450 transitions. Second operand 4 states. [2019-12-27 06:23:43,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:23:43,755 INFO L93 Difference]: Finished difference Result 14037 states and 42756 transitions. [2019-12-27 06:23:43,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 06:23:43,756 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-27 06:23:43,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:23:43,782 INFO L225 Difference]: With dead ends: 14037 [2019-12-27 06:23:43,782 INFO L226 Difference]: Without dead ends: 14037 [2019-12-27 06:23:43,783 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:23:43,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14037 states. [2019-12-27 06:23:44,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14037 to 13737. [2019-12-27 06:23:44,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13737 states. [2019-12-27 06:23:44,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13737 states to 13737 states and 41900 transitions. [2019-12-27 06:23:44,292 INFO L78 Accepts]: Start accepts. Automaton has 13737 states and 41900 transitions. Word has length 25 [2019-12-27 06:23:44,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:23:44,292 INFO L462 AbstractCegarLoop]: Abstraction has 13737 states and 41900 transitions. [2019-12-27 06:23:44,292 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 06:23:44,292 INFO L276 IsEmpty]: Start isEmpty. Operand 13737 states and 41900 transitions. [2019-12-27 06:23:44,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 06:23:44,302 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:23:44,303 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:23:44,303 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:23:44,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:23:44,303 INFO L82 PathProgramCache]: Analyzing trace with hash -1416816819, now seen corresponding path program 1 times [2019-12-27 06:23:44,303 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:23:44,304 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396358370] [2019-12-27 06:23:44,304 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:23:44,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:23:44,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-27 06:23:44,367 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396358370] [2019-12-27 06:23:44,368 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:23:44,368 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:23:44,368 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520572594] [2019-12-27 06:23:44,369 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:23:44,369 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:23:44,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:23:44,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:23:44,369 INFO L87 Difference]: Start difference. First operand 13737 states and 41900 transitions. Second operand 3 states. [2019-12-27 06:23:44,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:23:44,473 INFO L93 Difference]: Finished difference Result 19578 states and 58726 transitions. [2019-12-27 06:23:44,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:23:44,473 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-12-27 06:23:44,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:23:44,500 INFO L225 Difference]: With dead ends: 19578 [2019-12-27 06:23:44,500 INFO L226 Difference]: Without dead ends: 19578 [2019-12-27 06:23:44,500 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:23:44,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19578 states. [2019-12-27 06:23:44,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19578 to 14483. [2019-12-27 06:23:44,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14483 states. [2019-12-27 06:23:44,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14483 states to 14483 states and 44038 transitions. [2019-12-27 06:23:44,755 INFO L78 Accepts]: Start accepts. Automaton has 14483 states and 44038 transitions. Word has length 27 [2019-12-27 06:23:44,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:23:44,756 INFO L462 AbstractCegarLoop]: Abstraction has 14483 states and 44038 transitions. [2019-12-27 06:23:44,756 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:23:44,756 INFO L276 IsEmpty]: Start isEmpty. Operand 14483 states and 44038 transitions. [2019-12-27 06:23:44,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 06:23:44,768 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:23:44,768 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:23:44,769 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:23:44,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:23:44,769 INFO L82 PathProgramCache]: Analyzing trace with hash -522150304, now seen corresponding path program 1 times [2019-12-27 06:23:44,769 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:23:44,769 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959565190] [2019-12-27 06:23:44,769 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:23:44,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:23:44,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:23:44,900 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959565190] [2019-12-27 06:23:44,900 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:23:44,900 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 06:23:44,900 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595378861] [2019-12-27 06:23:44,901 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 06:23:44,901 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:23:44,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 06:23:44,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 06:23:44,901 INFO L87 Difference]: Start difference. First operand 14483 states and 44038 transitions. Second operand 6 states. [2019-12-27 06:23:45,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:23:45,704 INFO L93 Difference]: Finished difference Result 37116 states and 111354 transitions. [2019-12-27 06:23:45,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 06:23:45,705 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-27 06:23:45,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:23:45,774 INFO L225 Difference]: With dead ends: 37116 [2019-12-27 06:23:45,775 INFO L226 Difference]: Without dead ends: 37116 [2019-12-27 06:23:45,776 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-27 06:23:45,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37116 states. [2019-12-27 06:23:46,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37116 to 20406. [2019-12-27 06:23:46,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20406 states. [2019-12-27 06:23:46,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20406 states to 20406 states and 62975 transitions. [2019-12-27 06:23:46,221 INFO L78 Accepts]: Start accepts. Automaton has 20406 states and 62975 transitions. Word has length 27 [2019-12-27 06:23:46,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:23:46,222 INFO L462 AbstractCegarLoop]: Abstraction has 20406 states and 62975 transitions. [2019-12-27 06:23:46,222 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 06:23:46,222 INFO L276 IsEmpty]: Start isEmpty. Operand 20406 states and 62975 transitions. [2019-12-27 06:23:46,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-27 06:23:46,239 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:23:46,239 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:23:46,239 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:23:46,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:23:46,239 INFO L82 PathProgramCache]: Analyzing trace with hash -624201971, now seen corresponding path program 1 times [2019-12-27 06:23:46,240 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:23:46,240 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989134619] [2019-12-27 06:23:46,240 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:23:46,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:23:46,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:23:46,347 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989134619] [2019-12-27 06:23:46,347 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:23:46,348 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 06:23:46,348 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440164640] [2019-12-27 06:23:46,348 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 06:23:46,348 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:23:46,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 06:23:46,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 06:23:46,350 INFO L87 Difference]: Start difference. First operand 20406 states and 62975 transitions. Second operand 6 states. [2019-12-27 06:23:47,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:23:47,317 INFO L93 Difference]: Finished difference Result 34406 states and 103090 transitions. [2019-12-27 06:23:47,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 06:23:47,318 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2019-12-27 06:23:47,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:23:47,364 INFO L225 Difference]: With dead ends: 34406 [2019-12-27 06:23:47,364 INFO L226 Difference]: Without dead ends: 34406 [2019-12-27 06:23:47,365 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-27 06:23:47,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34406 states. [2019-12-27 06:23:47,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34406 to 20168. [2019-12-27 06:23:47,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20168 states. [2019-12-27 06:23:47,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20168 states to 20168 states and 62360 transitions. [2019-12-27 06:23:47,765 INFO L78 Accepts]: Start accepts. Automaton has 20168 states and 62360 transitions. Word has length 28 [2019-12-27 06:23:47,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:23:47,765 INFO L462 AbstractCegarLoop]: Abstraction has 20168 states and 62360 transitions. [2019-12-27 06:23:47,765 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 06:23:47,765 INFO L276 IsEmpty]: Start isEmpty. Operand 20168 states and 62360 transitions. [2019-12-27 06:23:47,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 06:23:47,787 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:23:47,787 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:23:47,787 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:23:47,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:23:47,788 INFO L82 PathProgramCache]: Analyzing trace with hash -160608776, now seen corresponding path program 1 times [2019-12-27 06:23:47,788 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:23:47,788 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310082375] [2019-12-27 06:23:47,788 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:23:47,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:23:47,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:23:47,893 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310082375] [2019-12-27 06:23:47,893 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:23:47,893 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 06:23:47,893 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429425974] [2019-12-27 06:23:47,894 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 06:23:47,894 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:23:47,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 06:23:47,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 06:23:47,894 INFO L87 Difference]: Start difference. First operand 20168 states and 62360 transitions. Second operand 7 states. [2019-12-27 06:23:49,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:23:49,264 INFO L93 Difference]: Finished difference Result 46484 states and 138742 transitions. [2019-12-27 06:23:49,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-27 06:23:49,265 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-27 06:23:49,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:23:49,330 INFO L225 Difference]: With dead ends: 46484 [2019-12-27 06:23:49,330 INFO L226 Difference]: Without dead ends: 46484 [2019-12-27 06:23:49,331 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=117, Invalid=303, Unknown=0, NotChecked=0, Total=420 [2019-12-27 06:23:49,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46484 states. [2019-12-27 06:23:50,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46484 to 21453. [2019-12-27 06:23:50,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21453 states. [2019-12-27 06:23:50,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21453 states to 21453 states and 66323 transitions. [2019-12-27 06:23:50,126 INFO L78 Accepts]: Start accepts. Automaton has 21453 states and 66323 transitions. Word has length 33 [2019-12-27 06:23:50,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:23:50,126 INFO L462 AbstractCegarLoop]: Abstraction has 21453 states and 66323 transitions. [2019-12-27 06:23:50,126 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 06:23:50,127 INFO L276 IsEmpty]: Start isEmpty. Operand 21453 states and 66323 transitions. [2019-12-27 06:23:50,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 06:23:50,149 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:23:50,149 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:23:50,149 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:23:50,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:23:50,149 INFO L82 PathProgramCache]: Analyzing trace with hash 88321435, now seen corresponding path program 1 times [2019-12-27 06:23:50,150 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:23:50,150 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939537123] [2019-12-27 06:23:50,150 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:23:50,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:23:50,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:23:50,198 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939537123] [2019-12-27 06:23:50,198 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:23:50,199 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:23:50,199 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213691349] [2019-12-27 06:23:50,199 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:23:50,199 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:23:50,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:23:50,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:23:50,200 INFO L87 Difference]: Start difference. First operand 21453 states and 66323 transitions. Second operand 3 states. [2019-12-27 06:23:50,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:23:50,363 INFO L93 Difference]: Finished difference Result 28695 states and 85797 transitions. [2019-12-27 06:23:50,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:23:50,363 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-12-27 06:23:50,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:23:50,408 INFO L225 Difference]: With dead ends: 28695 [2019-12-27 06:23:50,409 INFO L226 Difference]: Without dead ends: 28695 [2019-12-27 06:23:50,409 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:23:50,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28695 states. [2019-12-27 06:23:50,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28695 to 20429. [2019-12-27 06:23:50,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20429 states. [2019-12-27 06:23:50,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20429 states to 20429 states and 61176 transitions. [2019-12-27 06:23:50,750 INFO L78 Accepts]: Start accepts. Automaton has 20429 states and 61176 transitions. Word has length 33 [2019-12-27 06:23:50,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:23:50,751 INFO L462 AbstractCegarLoop]: Abstraction has 20429 states and 61176 transitions. [2019-12-27 06:23:50,751 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:23:50,751 INFO L276 IsEmpty]: Start isEmpty. Operand 20429 states and 61176 transitions. [2019-12-27 06:23:50,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 06:23:50,768 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:23:50,768 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:23:50,768 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:23:50,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:23:50,769 INFO L82 PathProgramCache]: Analyzing trace with hash 838482894, now seen corresponding path program 2 times [2019-12-27 06:23:50,769 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:23:50,769 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583923836] [2019-12-27 06:23:50,769 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:23:50,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:23:50,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:23:50,882 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583923836] [2019-12-27 06:23:50,883 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:23:50,883 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 06:23:50,883 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743544144] [2019-12-27 06:23:50,883 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 06:23:50,883 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:23:50,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 06:23:50,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-27 06:23:50,884 INFO L87 Difference]: Start difference. First operand 20429 states and 61176 transitions. Second operand 8 states. [2019-12-27 06:23:52,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:23:52,698 INFO L93 Difference]: Finished difference Result 45938 states and 134554 transitions. [2019-12-27 06:23:52,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-27 06:23:52,699 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 33 [2019-12-27 06:23:52,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:23:52,759 INFO L225 Difference]: With dead ends: 45938 [2019-12-27 06:23:52,760 INFO L226 Difference]: Without dead ends: 45938 [2019-12-27 06:23:52,760 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=161, Invalid=489, Unknown=0, NotChecked=0, Total=650 [2019-12-27 06:23:52,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45938 states. [2019-12-27 06:23:53,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45938 to 19869. [2019-12-27 06:23:53,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19869 states. [2019-12-27 06:23:53,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19869 states to 19869 states and 59508 transitions. [2019-12-27 06:23:53,493 INFO L78 Accepts]: Start accepts. Automaton has 19869 states and 59508 transitions. Word has length 33 [2019-12-27 06:23:53,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:23:53,493 INFO L462 AbstractCegarLoop]: Abstraction has 19869 states and 59508 transitions. [2019-12-27 06:23:53,494 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 06:23:53,494 INFO L276 IsEmpty]: Start isEmpty. Operand 19869 states and 59508 transitions. [2019-12-27 06:23:53,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-27 06:23:53,510 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:23:53,510 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:23:53,510 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:23:53,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:23:53,511 INFO L82 PathProgramCache]: Analyzing trace with hash 1993650805, now seen corresponding path program 1 times [2019-12-27 06:23:53,511 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:23:53,511 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38425159] [2019-12-27 06:23:53,512 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:23:53,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:23:53,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:23:53,605 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38425159] [2019-12-27 06:23:53,606 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:23:53,606 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 06:23:53,606 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585332216] [2019-12-27 06:23:53,606 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 06:23:53,607 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:23:53,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 06:23:53,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 06:23:53,607 INFO L87 Difference]: Start difference. First operand 19869 states and 59508 transitions. Second operand 7 states. [2019-12-27 06:23:54,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:23:54,831 INFO L93 Difference]: Finished difference Result 35347 states and 103679 transitions. [2019-12-27 06:23:54,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 06:23:54,831 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2019-12-27 06:23:54,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:23:54,878 INFO L225 Difference]: With dead ends: 35347 [2019-12-27 06:23:54,878 INFO L226 Difference]: Without dead ends: 35347 [2019-12-27 06:23:54,878 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=253, Unknown=0, NotChecked=0, Total=342 [2019-12-27 06:23:54,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35347 states. [2019-12-27 06:23:55,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35347 to 18737. [2019-12-27 06:23:55,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18737 states. [2019-12-27 06:23:55,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18737 states to 18737 states and 56205 transitions. [2019-12-27 06:23:55,267 INFO L78 Accepts]: Start accepts. Automaton has 18737 states and 56205 transitions. Word has length 34 [2019-12-27 06:23:55,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:23:55,268 INFO L462 AbstractCegarLoop]: Abstraction has 18737 states and 56205 transitions. [2019-12-27 06:23:55,268 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 06:23:55,268 INFO L276 IsEmpty]: Start isEmpty. Operand 18737 states and 56205 transitions. [2019-12-27 06:23:55,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-27 06:23:55,284 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:23:55,284 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:23:55,284 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:23:55,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:23:55,284 INFO L82 PathProgramCache]: Analyzing trace with hash 1065822653, now seen corresponding path program 2 times [2019-12-27 06:23:55,284 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:23:55,285 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159513337] [2019-12-27 06:23:55,285 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:23:55,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:23:55,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:23:55,438 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159513337] [2019-12-27 06:23:55,439 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:23:55,439 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 06:23:55,439 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693316632] [2019-12-27 06:23:55,439 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 06:23:55,439 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:23:55,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 06:23:55,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-12-27 06:23:55,440 INFO L87 Difference]: Start difference. First operand 18737 states and 56205 transitions. Second operand 9 states. [2019-12-27 06:23:58,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:23:58,633 INFO L93 Difference]: Finished difference Result 53626 states and 154519 transitions. [2019-12-27 06:23:58,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-12-27 06:23:58,634 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 34 [2019-12-27 06:23:58,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:23:58,740 INFO L225 Difference]: With dead ends: 53626 [2019-12-27 06:23:58,741 INFO L226 Difference]: Without dead ends: 53626 [2019-12-27 06:23:58,742 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 381 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=315, Invalid=1091, Unknown=0, NotChecked=0, Total=1406 [2019-12-27 06:23:58,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53626 states. [2019-12-27 06:23:59,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53626 to 18148. [2019-12-27 06:23:59,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18148 states. [2019-12-27 06:23:59,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18148 states to 18148 states and 54578 transitions. [2019-12-27 06:23:59,303 INFO L78 Accepts]: Start accepts. Automaton has 18148 states and 54578 transitions. Word has length 34 [2019-12-27 06:23:59,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:23:59,304 INFO L462 AbstractCegarLoop]: Abstraction has 18148 states and 54578 transitions. [2019-12-27 06:23:59,304 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 06:23:59,304 INFO L276 IsEmpty]: Start isEmpty. Operand 18148 states and 54578 transitions. [2019-12-27 06:23:59,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-12-27 06:23:59,324 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:23:59,325 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] [2019-12-27 06:23:59,325 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:23:59,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:23:59,325 INFO L82 PathProgramCache]: Analyzing trace with hash -565888573, now seen corresponding path program 1 times [2019-12-27 06:23:59,325 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:23:59,326 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552963677] [2019-12-27 06:23:59,326 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:23:59,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:23:59,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:23:59,583 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552963677] [2019-12-27 06:23:59,583 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:23:59,584 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 06:23:59,584 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366948976] [2019-12-27 06:23:59,584 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 06:23:59,584 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:23:59,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 06:23:59,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-12-27 06:23:59,585 INFO L87 Difference]: Start difference. First operand 18148 states and 54578 transitions. Second operand 10 states. [2019-12-27 06:24:01,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:24:01,864 INFO L93 Difference]: Finished difference Result 46342 states and 134409 transitions. [2019-12-27 06:24:01,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-27 06:24:01,864 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 38 [2019-12-27 06:24:01,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:24:01,942 INFO L225 Difference]: With dead ends: 46342 [2019-12-27 06:24:01,942 INFO L226 Difference]: Without dead ends: 46342 [2019-12-27 06:24:01,943 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=176, Invalid=526, Unknown=0, NotChecked=0, Total=702 [2019-12-27 06:24:02,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46342 states. [2019-12-27 06:24:02,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46342 to 17085. [2019-12-27 06:24:02,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17085 states. [2019-12-27 06:24:02,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17085 states to 17085 states and 51410 transitions. [2019-12-27 06:24:02,637 INFO L78 Accepts]: Start accepts. Automaton has 17085 states and 51410 transitions. Word has length 38 [2019-12-27 06:24:02,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:24:02,637 INFO L462 AbstractCegarLoop]: Abstraction has 17085 states and 51410 transitions. [2019-12-27 06:24:02,637 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 06:24:02,637 INFO L276 IsEmpty]: Start isEmpty. Operand 17085 states and 51410 transitions. [2019-12-27 06:24:02,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 06:24:02,657 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:24:02,657 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:24:02,657 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:24:02,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:24:02,658 INFO L82 PathProgramCache]: Analyzing trace with hash -903409010, now seen corresponding path program 1 times [2019-12-27 06:24:02,658 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:24:02,658 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011077317] [2019-12-27 06:24:02,658 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:24:02,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:24:02,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:24:02,698 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011077317] [2019-12-27 06:24:02,698 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:24:02,698 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:24:02,699 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894649337] [2019-12-27 06:24:02,699 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:24:02,699 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:24:02,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:24:02,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:24:02,700 INFO L87 Difference]: Start difference. First operand 17085 states and 51410 transitions. Second operand 3 states. [2019-12-27 06:24:02,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:24:02,808 INFO L93 Difference]: Finished difference Result 28949 states and 87473 transitions. [2019-12-27 06:24:02,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:24:02,809 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-27 06:24:02,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:24:02,836 INFO L225 Difference]: With dead ends: 28949 [2019-12-27 06:24:02,836 INFO L226 Difference]: Without dead ends: 14634 [2019-12-27 06:24:02,837 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:24:02,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14634 states. [2019-12-27 06:24:03,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14634 to 14554. [2019-12-27 06:24:03,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14554 states. [2019-12-27 06:24:03,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14554 states to 14554 states and 43078 transitions. [2019-12-27 06:24:03,202 INFO L78 Accepts]: Start accepts. Automaton has 14554 states and 43078 transitions. Word has length 39 [2019-12-27 06:24:03,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:24:03,203 INFO L462 AbstractCegarLoop]: Abstraction has 14554 states and 43078 transitions. [2019-12-27 06:24:03,203 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:24:03,203 INFO L276 IsEmpty]: Start isEmpty. Operand 14554 states and 43078 transitions. [2019-12-27 06:24:03,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 06:24:03,224 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:24:03,225 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:24:03,225 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:24:03,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:24:03,225 INFO L82 PathProgramCache]: Analyzing trace with hash -2089566008, now seen corresponding path program 2 times [2019-12-27 06:24:03,226 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:24:03,227 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207096799] [2019-12-27 06:24:03,227 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:24:03,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:24:03,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:24:03,295 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207096799] [2019-12-27 06:24:03,296 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:24:03,296 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 06:24:03,296 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695893914] [2019-12-27 06:24:03,298 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:24:03,298 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:24:03,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:24:03,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:24:03,299 INFO L87 Difference]: Start difference. First operand 14554 states and 43078 transitions. Second operand 3 states. [2019-12-27 06:24:03,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:24:03,378 INFO L93 Difference]: Finished difference Result 14553 states and 43076 transitions. [2019-12-27 06:24:03,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:24:03,378 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-27 06:24:03,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:24:03,406 INFO L225 Difference]: With dead ends: 14553 [2019-12-27 06:24:03,406 INFO L226 Difference]: Without dead ends: 14553 [2019-12-27 06:24:03,407 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:24:03,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14553 states. [2019-12-27 06:24:03,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14553 to 14553. [2019-12-27 06:24:03,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14553 states. [2019-12-27 06:24:03,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14553 states to 14553 states and 43076 transitions. [2019-12-27 06:24:03,741 INFO L78 Accepts]: Start accepts. Automaton has 14553 states and 43076 transitions. Word has length 39 [2019-12-27 06:24:03,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:24:03,741 INFO L462 AbstractCegarLoop]: Abstraction has 14553 states and 43076 transitions. [2019-12-27 06:24:03,741 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:24:03,741 INFO L276 IsEmpty]: Start isEmpty. Operand 14553 states and 43076 transitions. [2019-12-27 06:24:03,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 06:24:03,759 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:24:03,759 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:24:03,760 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:24:03,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:24:03,760 INFO L82 PathProgramCache]: Analyzing trace with hash 860206803, now seen corresponding path program 1 times [2019-12-27 06:24:03,760 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:24:03,760 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4996094] [2019-12-27 06:24:03,761 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:24:03,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:24:03,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:24:03,821 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4996094] [2019-12-27 06:24:03,821 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:24:03,821 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:24:03,821 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226318086] [2019-12-27 06:24:03,825 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 06:24:03,825 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:24:03,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 06:24:03,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:24:03,826 INFO L87 Difference]: Start difference. First operand 14553 states and 43076 transitions. Second operand 4 states. [2019-12-27 06:24:03,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:24:03,926 INFO L93 Difference]: Finished difference Result 23146 states and 68889 transitions. [2019-12-27 06:24:03,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 06:24:03,927 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2019-12-27 06:24:03,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:24:03,944 INFO L225 Difference]: With dead ends: 23146 [2019-12-27 06:24:03,945 INFO L226 Difference]: Without dead ends: 9684 [2019-12-27 06:24:03,947 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:24:04,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9684 states. [2019-12-27 06:24:04,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9684 to 9682. [2019-12-27 06:24:04,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9682 states. [2019-12-27 06:24:04,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9682 states to 9682 states and 28430 transitions. [2019-12-27 06:24:04,172 INFO L78 Accepts]: Start accepts. Automaton has 9682 states and 28430 transitions. Word has length 40 [2019-12-27 06:24:04,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:24:04,173 INFO L462 AbstractCegarLoop]: Abstraction has 9682 states and 28430 transitions. [2019-12-27 06:24:04,173 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 06:24:04,173 INFO L276 IsEmpty]: Start isEmpty. Operand 9682 states and 28430 transitions. [2019-12-27 06:24:04,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 06:24:04,187 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:24:04,187 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:24:04,187 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:24:04,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:24:04,187 INFO L82 PathProgramCache]: Analyzing trace with hash 1423567527, now seen corresponding path program 2 times [2019-12-27 06:24:04,188 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:24:04,188 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911142187] [2019-12-27 06:24:04,188 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:24:04,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:24:04,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:24:04,260 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911142187] [2019-12-27 06:24:04,260 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:24:04,260 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 06:24:04,260 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311218556] [2019-12-27 06:24:04,261 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 06:24:04,261 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:24:04,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 06:24:04,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:24:04,261 INFO L87 Difference]: Start difference. First operand 9682 states and 28430 transitions. Second operand 5 states. [2019-12-27 06:24:04,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:24:04,852 INFO L93 Difference]: Finished difference Result 17373 states and 49704 transitions. [2019-12-27 06:24:04,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 06:24:04,853 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-27 06:24:04,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:24:04,877 INFO L225 Difference]: With dead ends: 17373 [2019-12-27 06:24:04,877 INFO L226 Difference]: Without dead ends: 17373 [2019-12-27 06:24:04,877 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 06:24:04,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17373 states. [2019-12-27 06:24:05,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17373 to 15630. [2019-12-27 06:24:05,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15630 states. [2019-12-27 06:24:05,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15630 states to 15630 states and 45374 transitions. [2019-12-27 06:24:05,126 INFO L78 Accepts]: Start accepts. Automaton has 15630 states and 45374 transitions. Word has length 40 [2019-12-27 06:24:05,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:24:05,127 INFO L462 AbstractCegarLoop]: Abstraction has 15630 states and 45374 transitions. [2019-12-27 06:24:05,127 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 06:24:05,127 INFO L276 IsEmpty]: Start isEmpty. Operand 15630 states and 45374 transitions. [2019-12-27 06:24:05,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 06:24:05,142 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:24:05,142 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:24:05,142 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:24:05,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:24:05,143 INFO L82 PathProgramCache]: Analyzing trace with hash -1539619421, now seen corresponding path program 3 times [2019-12-27 06:24:05,143 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:24:05,143 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847044252] [2019-12-27 06:24:05,143 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:24:05,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:24:05,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:24:05,421 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847044252] [2019-12-27 06:24:05,421 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:24:05,421 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 06:24:05,421 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433987570] [2019-12-27 06:24:05,422 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 06:24:05,422 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:24:05,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 06:24:05,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:24:05,422 INFO L87 Difference]: Start difference. First operand 15630 states and 45374 transitions. Second operand 5 states. [2019-12-27 06:24:05,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:24:05,499 INFO L93 Difference]: Finished difference Result 14549 states and 42905 transitions. [2019-12-27 06:24:05,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 06:24:05,499 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-27 06:24:05,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:24:05,522 INFO L225 Difference]: With dead ends: 14549 [2019-12-27 06:24:05,522 INFO L226 Difference]: Without dead ends: 12170 [2019-12-27 06:24:05,523 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:24:05,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12170 states. [2019-12-27 06:24:05,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12170 to 11596. [2019-12-27 06:24:05,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11596 states. [2019-12-27 06:24:05,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11596 states to 11596 states and 36063 transitions. [2019-12-27 06:24:05,774 INFO L78 Accepts]: Start accepts. Automaton has 11596 states and 36063 transitions. Word has length 40 [2019-12-27 06:24:05,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:24:05,774 INFO L462 AbstractCegarLoop]: Abstraction has 11596 states and 36063 transitions. [2019-12-27 06:24:05,774 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 06:24:05,775 INFO L276 IsEmpty]: Start isEmpty. Operand 11596 states and 36063 transitions. [2019-12-27 06:24:05,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 06:24:05,789 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:24:05,789 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:24:05,789 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:24:05,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:24:05,789 INFO L82 PathProgramCache]: Analyzing trace with hash -739440714, now seen corresponding path program 1 times [2019-12-27 06:24:05,789 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:24:05,790 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739362378] [2019-12-27 06:24:05,790 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:24:05,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:24:05,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:24:05,890 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739362378] [2019-12-27 06:24:05,890 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:24:05,891 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 06:24:05,891 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416841392] [2019-12-27 06:24:05,891 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 06:24:05,891 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:24:05,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 06:24:05,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-27 06:24:05,892 INFO L87 Difference]: Start difference. First operand 11596 states and 36063 transitions. Second operand 8 states. [2019-12-27 06:24:06,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:24:06,710 INFO L93 Difference]: Finished difference Result 32945 states and 100223 transitions. [2019-12-27 06:24:06,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 06:24:06,711 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 64 [2019-12-27 06:24:06,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:24:06,742 INFO L225 Difference]: With dead ends: 32945 [2019-12-27 06:24:06,742 INFO L226 Difference]: Without dead ends: 23571 [2019-12-27 06:24:06,743 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=110, Invalid=352, Unknown=0, NotChecked=0, Total=462 [2019-12-27 06:24:06,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23571 states. [2019-12-27 06:24:06,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23571 to 13293. [2019-12-27 06:24:06,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13293 states. [2019-12-27 06:24:07,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13293 states to 13293 states and 41169 transitions. [2019-12-27 06:24:07,019 INFO L78 Accepts]: Start accepts. Automaton has 13293 states and 41169 transitions. Word has length 64 [2019-12-27 06:24:07,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:24:07,019 INFO L462 AbstractCegarLoop]: Abstraction has 13293 states and 41169 transitions. [2019-12-27 06:24:07,019 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 06:24:07,019 INFO L276 IsEmpty]: Start isEmpty. Operand 13293 states and 41169 transitions. [2019-12-27 06:24:07,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 06:24:07,033 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:24:07,033 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:24:07,034 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:24:07,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:24:07,034 INFO L82 PathProgramCache]: Analyzing trace with hash -2017353844, now seen corresponding path program 2 times [2019-12-27 06:24:07,034 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:24:07,034 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980941895] [2019-12-27 06:24:07,035 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:24:07,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:24:07,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:24:07,117 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980941895] [2019-12-27 06:24:07,117 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:24:07,118 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 06:24:07,118 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281722855] [2019-12-27 06:24:07,118 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 06:24:07,118 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:24:07,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 06:24:07,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 06:24:07,119 INFO L87 Difference]: Start difference. First operand 13293 states and 41169 transitions. Second operand 7 states. [2019-12-27 06:24:07,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:24:07,508 INFO L93 Difference]: Finished difference Result 24451 states and 74207 transitions. [2019-12-27 06:24:07,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 06:24:07,508 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-27 06:24:07,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:24:07,548 INFO L225 Difference]: With dead ends: 24451 [2019-12-27 06:24:07,548 INFO L226 Difference]: Without dead ends: 17164 [2019-12-27 06:24:07,549 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-27 06:24:07,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17164 states. [2019-12-27 06:24:07,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17164 to 15061. [2019-12-27 06:24:07,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15061 states. [2019-12-27 06:24:07,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15061 states to 15061 states and 46209 transitions. [2019-12-27 06:24:07,903 INFO L78 Accepts]: Start accepts. Automaton has 15061 states and 46209 transitions. Word has length 64 [2019-12-27 06:24:07,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:24:07,903 INFO L462 AbstractCegarLoop]: Abstraction has 15061 states and 46209 transitions. [2019-12-27 06:24:07,903 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 06:24:07,903 INFO L276 IsEmpty]: Start isEmpty. Operand 15061 states and 46209 transitions. [2019-12-27 06:24:07,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 06:24:07,919 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:24:07,919 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:24:07,919 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:24:07,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:24:07,919 INFO L82 PathProgramCache]: Analyzing trace with hash 1729634848, now seen corresponding path program 3 times [2019-12-27 06:24:07,920 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:24:07,920 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648343891] [2019-12-27 06:24:07,920 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:24:07,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:24:08,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:24:08,062 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648343891] [2019-12-27 06:24:08,062 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:24:08,062 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 06:24:08,062 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690060312] [2019-12-27 06:24:08,063 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 06:24:08,063 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:24:08,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 06:24:08,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 06:24:08,064 INFO L87 Difference]: Start difference. First operand 15061 states and 46209 transitions. Second operand 9 states. [2019-12-27 06:24:09,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:24:09,104 INFO L93 Difference]: Finished difference Result 48515 states and 146959 transitions. [2019-12-27 06:24:09,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-27 06:24:09,106 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2019-12-27 06:24:09,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:24:09,415 INFO L225 Difference]: With dead ends: 48515 [2019-12-27 06:24:09,415 INFO L226 Difference]: Without dead ends: 44943 [2019-12-27 06:24:09,416 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=157, Invalid=493, Unknown=0, NotChecked=0, Total=650 [2019-12-27 06:24:09,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44943 states. [2019-12-27 06:24:09,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44943 to 15502. [2019-12-27 06:24:09,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15502 states. [2019-12-27 06:24:09,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15502 states to 15502 states and 47655 transitions. [2019-12-27 06:24:09,829 INFO L78 Accepts]: Start accepts. Automaton has 15502 states and 47655 transitions. Word has length 64 [2019-12-27 06:24:09,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:24:09,829 INFO L462 AbstractCegarLoop]: Abstraction has 15502 states and 47655 transitions. [2019-12-27 06:24:09,829 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 06:24:09,830 INFO L276 IsEmpty]: Start isEmpty. Operand 15502 states and 47655 transitions. [2019-12-27 06:24:09,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 06:24:09,846 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:24:09,846 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:24:09,847 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:24:09,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:24:09,847 INFO L82 PathProgramCache]: Analyzing trace with hash 1593875220, now seen corresponding path program 4 times [2019-12-27 06:24:09,847 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:24:09,847 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193071692] [2019-12-27 06:24:09,848 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:24:09,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:24:09,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:24:09,965 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193071692] [2019-12-27 06:24:09,965 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:24:09,965 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 06:24:09,966 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462014562] [2019-12-27 06:24:09,968 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 06:24:09,968 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:24:09,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 06:24:09,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 06:24:09,969 INFO L87 Difference]: Start difference. First operand 15502 states and 47655 transitions. Second operand 9 states. [2019-12-27 06:24:11,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:24:11,106 INFO L93 Difference]: Finished difference Result 36657 states and 110919 transitions. [2019-12-27 06:24:11,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-27 06:24:11,106 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2019-12-27 06:24:11,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:24:11,151 INFO L225 Difference]: With dead ends: 36657 [2019-12-27 06:24:11,152 INFO L226 Difference]: Without dead ends: 33893 [2019-12-27 06:24:11,152 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=166, Invalid=536, Unknown=0, NotChecked=0, Total=702 [2019-12-27 06:24:11,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33893 states. [2019-12-27 06:24:11,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33893 to 15329. [2019-12-27 06:24:11,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15329 states. [2019-12-27 06:24:11,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15329 states to 15329 states and 47228 transitions. [2019-12-27 06:24:11,523 INFO L78 Accepts]: Start accepts. Automaton has 15329 states and 47228 transitions. Word has length 64 [2019-12-27 06:24:11,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:24:11,523 INFO L462 AbstractCegarLoop]: Abstraction has 15329 states and 47228 transitions. [2019-12-27 06:24:11,523 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 06:24:11,523 INFO L276 IsEmpty]: Start isEmpty. Operand 15329 states and 47228 transitions. [2019-12-27 06:24:11,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 06:24:11,541 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:24:11,541 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:24:11,541 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:24:11,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:24:11,542 INFO L82 PathProgramCache]: Analyzing trace with hash 1686766406, now seen corresponding path program 5 times [2019-12-27 06:24:11,542 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:24:11,542 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328888810] [2019-12-27 06:24:11,542 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:24:11,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:24:11,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:24:11,606 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328888810] [2019-12-27 06:24:11,607 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:24:11,607 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 06:24:11,607 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316981046] [2019-12-27 06:24:11,607 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 06:24:11,608 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:24:11,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 06:24:11,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 06:24:11,608 INFO L87 Difference]: Start difference. First operand 15329 states and 47228 transitions. Second operand 7 states. [2019-12-27 06:24:11,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:24:11,892 INFO L93 Difference]: Finished difference Result 27077 states and 82041 transitions. [2019-12-27 06:24:11,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 06:24:11,893 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-27 06:24:11,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:24:11,922 INFO L225 Difference]: With dead ends: 27077 [2019-12-27 06:24:11,922 INFO L226 Difference]: Without dead ends: 19995 [2019-12-27 06:24:11,923 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-27 06:24:11,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19995 states. [2019-12-27 06:24:12,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19995 to 15617. [2019-12-27 06:24:12,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15617 states. [2019-12-27 06:24:12,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15617 states to 15617 states and 48080 transitions. [2019-12-27 06:24:12,184 INFO L78 Accepts]: Start accepts. Automaton has 15617 states and 48080 transitions. Word has length 64 [2019-12-27 06:24:12,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:24:12,184 INFO L462 AbstractCegarLoop]: Abstraction has 15617 states and 48080 transitions. [2019-12-27 06:24:12,184 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 06:24:12,185 INFO L276 IsEmpty]: Start isEmpty. Operand 15617 states and 48080 transitions. [2019-12-27 06:24:12,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 06:24:12,201 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:24:12,201 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:24:12,201 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:24:12,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:24:12,201 INFO L82 PathProgramCache]: Analyzing trace with hash -2083011794, now seen corresponding path program 6 times [2019-12-27 06:24:12,202 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:24:12,202 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047407781] [2019-12-27 06:24:12,202 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:24:12,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:24:12,559 WARN L192 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 9 [2019-12-27 06:24:12,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:24:12,576 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047407781] [2019-12-27 06:24:12,576 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:24:12,576 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 06:24:12,577 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486928213] [2019-12-27 06:24:12,577 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 06:24:12,577 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:24:12,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 06:24:12,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 06:24:12,578 INFO L87 Difference]: Start difference. First operand 15617 states and 48080 transitions. Second operand 7 states. [2019-12-27 06:24:14,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:24:14,009 INFO L93 Difference]: Finished difference Result 27465 states and 84063 transitions. [2019-12-27 06:24:14,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 06:24:14,010 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-27 06:24:14,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:24:14,048 INFO L225 Difference]: With dead ends: 27465 [2019-12-27 06:24:14,048 INFO L226 Difference]: Without dead ends: 27465 [2019-12-27 06:24:14,048 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2019-12-27 06:24:14,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27465 states. [2019-12-27 06:24:14,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27465 to 15841. [2019-12-27 06:24:14,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15841 states. [2019-12-27 06:24:14,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15841 states to 15841 states and 48930 transitions. [2019-12-27 06:24:14,384 INFO L78 Accepts]: Start accepts. Automaton has 15841 states and 48930 transitions. Word has length 64 [2019-12-27 06:24:14,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:24:14,385 INFO L462 AbstractCegarLoop]: Abstraction has 15841 states and 48930 transitions. [2019-12-27 06:24:14,385 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 06:24:14,385 INFO L276 IsEmpty]: Start isEmpty. Operand 15841 states and 48930 transitions. [2019-12-27 06:24:14,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 06:24:14,401 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:24:14,401 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:24:14,402 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:24:14,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:24:14,402 INFO L82 PathProgramCache]: Analyzing trace with hash 2033773150, now seen corresponding path program 7 times [2019-12-27 06:24:14,402 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:24:14,402 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430358039] [2019-12-27 06:24:14,402 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:24:14,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:24:14,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:24:14,573 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430358039] [2019-12-27 06:24:14,573 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:24:14,574 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 06:24:14,574 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477488046] [2019-12-27 06:24:14,574 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 06:24:14,574 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:24:14,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 06:24:14,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-27 06:24:14,575 INFO L87 Difference]: Start difference. First operand 15841 states and 48930 transitions. Second operand 8 states. [2019-12-27 06:24:16,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:24:16,262 INFO L93 Difference]: Finished difference Result 30434 states and 93500 transitions. [2019-12-27 06:24:16,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 06:24:16,262 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 64 [2019-12-27 06:24:16,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:24:16,303 INFO L225 Difference]: With dead ends: 30434 [2019-12-27 06:24:16,303 INFO L226 Difference]: Without dead ends: 30434 [2019-12-27 06:24:16,305 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=93, Invalid=249, Unknown=0, NotChecked=0, Total=342 [2019-12-27 06:24:16,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30434 states. [2019-12-27 06:24:16,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30434 to 15841. [2019-12-27 06:24:16,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15841 states. [2019-12-27 06:24:16,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15841 states to 15841 states and 48930 transitions. [2019-12-27 06:24:16,676 INFO L78 Accepts]: Start accepts. Automaton has 15841 states and 48930 transitions. Word has length 64 [2019-12-27 06:24:16,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:24:16,676 INFO L462 AbstractCegarLoop]: Abstraction has 15841 states and 48930 transitions. [2019-12-27 06:24:16,676 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 06:24:16,676 INFO L276 IsEmpty]: Start isEmpty. Operand 15841 states and 48930 transitions. [2019-12-27 06:24:16,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 06:24:16,695 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:24:16,695 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:24:16,695 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:24:16,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:24:16,696 INFO L82 PathProgramCache]: Analyzing trace with hash -1056383140, now seen corresponding path program 8 times [2019-12-27 06:24:16,696 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:24:16,696 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100763974] [2019-12-27 06:24:16,696 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:24:16,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:24:16,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:24:16,759 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100763974] [2019-12-27 06:24:16,759 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:24:16,759 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:24:16,759 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061396955] [2019-12-27 06:24:16,760 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:24:16,760 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:24:16,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:24:16,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:24:16,760 INFO L87 Difference]: Start difference. First operand 15841 states and 48930 transitions. Second operand 3 states. [2019-12-27 06:24:16,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:24:16,876 INFO L93 Difference]: Finished difference Result 18111 states and 55868 transitions. [2019-12-27 06:24:16,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:24:16,876 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-27 06:24:16,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:24:16,902 INFO L225 Difference]: With dead ends: 18111 [2019-12-27 06:24:16,902 INFO L226 Difference]: Without dead ends: 18111 [2019-12-27 06:24:16,902 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:24:16,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18111 states. [2019-12-27 06:24:17,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18111 to 15629. [2019-12-27 06:24:17,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15629 states. [2019-12-27 06:24:17,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15629 states to 15629 states and 48434 transitions. [2019-12-27 06:24:17,360 INFO L78 Accepts]: Start accepts. Automaton has 15629 states and 48434 transitions. Word has length 64 [2019-12-27 06:24:17,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:24:17,361 INFO L462 AbstractCegarLoop]: Abstraction has 15629 states and 48434 transitions. [2019-12-27 06:24:17,361 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:24:17,361 INFO L276 IsEmpty]: Start isEmpty. Operand 15629 states and 48434 transitions. [2019-12-27 06:24:17,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 06:24:17,377 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:24:17,377 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:24:17,377 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:24:17,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:24:17,377 INFO L82 PathProgramCache]: Analyzing trace with hash -2130207003, now seen corresponding path program 1 times [2019-12-27 06:24:17,377 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:24:17,377 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979919310] [2019-12-27 06:24:17,378 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:24:17,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:24:17,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:24:17,432 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979919310] [2019-12-27 06:24:17,432 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:24:17,432 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 06:24:17,432 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612116827] [2019-12-27 06:24:17,433 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 06:24:17,433 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:24:17,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 06:24:17,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:24:17,433 INFO L87 Difference]: Start difference. First operand 15629 states and 48434 transitions. Second operand 4 states. [2019-12-27 06:24:17,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:24:17,614 INFO L93 Difference]: Finished difference Result 19788 states and 60931 transitions. [2019-12-27 06:24:17,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 06:24:17,615 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-12-27 06:24:17,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:24:17,643 INFO L225 Difference]: With dead ends: 19788 [2019-12-27 06:24:17,643 INFO L226 Difference]: Without dead ends: 19788 [2019-12-27 06:24:17,644 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:24:17,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19788 states. [2019-12-27 06:24:17,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19788 to 16155. [2019-12-27 06:24:17,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16155 states. [2019-12-27 06:24:17,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16155 states to 16155 states and 50081 transitions. [2019-12-27 06:24:17,916 INFO L78 Accepts]: Start accepts. Automaton has 16155 states and 50081 transitions. Word has length 65 [2019-12-27 06:24:17,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:24:17,916 INFO L462 AbstractCegarLoop]: Abstraction has 16155 states and 50081 transitions. [2019-12-27 06:24:17,916 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 06:24:17,916 INFO L276 IsEmpty]: Start isEmpty. Operand 16155 states and 50081 transitions. [2019-12-27 06:24:17,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 06:24:17,932 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:24:17,932 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:24:17,933 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:24:17,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:24:17,933 INFO L82 PathProgramCache]: Analyzing trace with hash 1667274217, now seen corresponding path program 2 times [2019-12-27 06:24:17,933 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:24:17,933 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716407901] [2019-12-27 06:24:17,933 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:24:17,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:24:17,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:24:17,979 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716407901] [2019-12-27 06:24:17,979 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:24:17,979 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 06:24:17,979 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194304936] [2019-12-27 06:24:17,979 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 06:24:17,980 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:24:17,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 06:24:17,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:24:17,980 INFO L87 Difference]: Start difference. First operand 16155 states and 50081 transitions. Second operand 4 states. [2019-12-27 06:24:18,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:24:18,251 INFO L93 Difference]: Finished difference Result 26296 states and 81367 transitions. [2019-12-27 06:24:18,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 06:24:18,251 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-12-27 06:24:18,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:24:18,291 INFO L225 Difference]: With dead ends: 26296 [2019-12-27 06:24:18,291 INFO L226 Difference]: Without dead ends: 26296 [2019-12-27 06:24:18,291 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:24:18,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26296 states. [2019-12-27 06:24:18,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26296 to 17196. [2019-12-27 06:24:18,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17196 states. [2019-12-27 06:24:18,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17196 states to 17196 states and 53644 transitions. [2019-12-27 06:24:18,631 INFO L78 Accepts]: Start accepts. Automaton has 17196 states and 53644 transitions. Word has length 65 [2019-12-27 06:24:18,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:24:18,632 INFO L462 AbstractCegarLoop]: Abstraction has 17196 states and 53644 transitions. [2019-12-27 06:24:18,632 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 06:24:18,632 INFO L276 IsEmpty]: Start isEmpty. Operand 17196 states and 53644 transitions. [2019-12-27 06:24:18,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 06:24:18,649 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:24:18,650 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:24:18,650 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:24:18,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:24:18,650 INFO L82 PathProgramCache]: Analyzing trace with hash -1707397215, now seen corresponding path program 3 times [2019-12-27 06:24:18,650 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:24:18,650 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122923495] [2019-12-27 06:24:18,650 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:24:18,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:24:18,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:24:18,749 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122923495] [2019-12-27 06:24:18,750 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:24:18,750 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 06:24:18,750 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078531299] [2019-12-27 06:24:18,750 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 06:24:18,750 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:24:18,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 06:24:18,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-27 06:24:18,751 INFO L87 Difference]: Start difference. First operand 17196 states and 53644 transitions. Second operand 8 states. [2019-12-27 06:24:19,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:24:19,475 INFO L93 Difference]: Finished difference Result 34918 states and 106885 transitions. [2019-12-27 06:24:19,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-27 06:24:19,475 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 65 [2019-12-27 06:24:19,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:24:19,517 INFO L225 Difference]: With dead ends: 34918 [2019-12-27 06:24:19,517 INFO L226 Difference]: Without dead ends: 29270 [2019-12-27 06:24:19,518 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=94, Invalid=286, Unknown=0, NotChecked=0, Total=380 [2019-12-27 06:24:19,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29270 states. [2019-12-27 06:24:19,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29270 to 17324. [2019-12-27 06:24:19,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17324 states. [2019-12-27 06:24:19,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17324 states to 17324 states and 53997 transitions. [2019-12-27 06:24:19,868 INFO L78 Accepts]: Start accepts. Automaton has 17324 states and 53997 transitions. Word has length 65 [2019-12-27 06:24:19,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:24:19,868 INFO L462 AbstractCegarLoop]: Abstraction has 17324 states and 53997 transitions. [2019-12-27 06:24:19,868 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 06:24:19,868 INFO L276 IsEmpty]: Start isEmpty. Operand 17324 states and 53997 transitions. [2019-12-27 06:24:19,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 06:24:19,886 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:24:19,886 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:24:19,887 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:24:19,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:24:19,887 INFO L82 PathProgramCache]: Analyzing trace with hash -405473777, now seen corresponding path program 4 times [2019-12-27 06:24:19,887 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:24:19,887 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339026808] [2019-12-27 06:24:19,887 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:24:19,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:24:19,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:24:19,992 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339026808] [2019-12-27 06:24:19,993 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:24:19,993 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 06:24:19,993 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21444609] [2019-12-27 06:24:19,993 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 06:24:19,993 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:24:20,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 06:24:20,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 06:24:20,195 INFO L87 Difference]: Start difference. First operand 17324 states and 53997 transitions. Second operand 9 states. [2019-12-27 06:24:21,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:24:21,347 INFO L93 Difference]: Finished difference Result 44301 states and 134374 transitions. [2019-12-27 06:24:21,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-27 06:24:21,347 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-27 06:24:21,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:24:21,397 INFO L225 Difference]: With dead ends: 44301 [2019-12-27 06:24:21,397 INFO L226 Difference]: Without dead ends: 36417 [2019-12-27 06:24:21,397 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=141, Invalid=459, Unknown=0, NotChecked=0, Total=600 [2019-12-27 06:24:21,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36417 states. [2019-12-27 06:24:21,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36417 to 17750. [2019-12-27 06:24:21,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17750 states. [2019-12-27 06:24:21,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17750 states to 17750 states and 54571 transitions. [2019-12-27 06:24:21,809 INFO L78 Accepts]: Start accepts. Automaton has 17750 states and 54571 transitions. Word has length 65 [2019-12-27 06:24:21,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:24:21,810 INFO L462 AbstractCegarLoop]: Abstraction has 17750 states and 54571 transitions. [2019-12-27 06:24:21,810 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 06:24:21,810 INFO L276 IsEmpty]: Start isEmpty. Operand 17750 states and 54571 transitions. [2019-12-27 06:24:21,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 06:24:21,830 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:24:21,830 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:24:21,830 INFO L410 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:24:21,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:24:21,830 INFO L82 PathProgramCache]: Analyzing trace with hash 1990560429, now seen corresponding path program 5 times [2019-12-27 06:24:21,830 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:24:21,831 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800092413] [2019-12-27 06:24:21,831 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:24:21,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:24:21,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:24:21,944 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800092413] [2019-12-27 06:24:21,944 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:24:21,944 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 06:24:21,945 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730110622] [2019-12-27 06:24:21,945 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 06:24:21,945 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:24:21,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 06:24:21,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 06:24:21,946 INFO L87 Difference]: Start difference. First operand 17750 states and 54571 transitions. Second operand 9 states. [2019-12-27 06:24:22,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:24:22,874 INFO L93 Difference]: Finished difference Result 35275 states and 106215 transitions. [2019-12-27 06:24:22,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 06:24:22,879 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-27 06:24:22,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:24:22,923 INFO L225 Difference]: With dead ends: 35275 [2019-12-27 06:24:22,924 INFO L226 Difference]: Without dead ends: 31682 [2019-12-27 06:24:22,924 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=129, Invalid=423, Unknown=0, NotChecked=0, Total=552 [2019-12-27 06:24:23,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31682 states. [2019-12-27 06:24:23,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31682 to 16887. [2019-12-27 06:24:23,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16887 states. [2019-12-27 06:24:23,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16887 states to 16887 states and 52277 transitions. [2019-12-27 06:24:23,312 INFO L78 Accepts]: Start accepts. Automaton has 16887 states and 52277 transitions. Word has length 65 [2019-12-27 06:24:23,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:24:23,312 INFO L462 AbstractCegarLoop]: Abstraction has 16887 states and 52277 transitions. [2019-12-27 06:24:23,312 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 06:24:23,312 INFO L276 IsEmpty]: Start isEmpty. Operand 16887 states and 52277 transitions. [2019-12-27 06:24:23,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 06:24:23,333 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:24:23,333 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:24:23,334 INFO L410 AbstractCegarLoop]: === Iteration 34 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:24:23,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:24:23,334 INFO L82 PathProgramCache]: Analyzing trace with hash -775345544, now seen corresponding path program 1 times [2019-12-27 06:24:23,334 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:24:23,334 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838498879] [2019-12-27 06:24:23,334 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:24:23,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:24:23,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:24:23,411 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838498879] [2019-12-27 06:24:23,411 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:24:23,411 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 06:24:23,411 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339136238] [2019-12-27 06:24:23,412 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 06:24:23,412 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:24:23,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 06:24:23,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:24:23,412 INFO L87 Difference]: Start difference. First operand 16887 states and 52277 transitions. Second operand 5 states. [2019-12-27 06:24:24,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:24:24,075 INFO L93 Difference]: Finished difference Result 24977 states and 75199 transitions. [2019-12-27 06:24:24,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 06:24:24,076 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-12-27 06:24:24,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:24:24,109 INFO L225 Difference]: With dead ends: 24977 [2019-12-27 06:24:24,109 INFO L226 Difference]: Without dead ends: 24757 [2019-12-27 06:24:24,109 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 06:24:24,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24757 states. [2019-12-27 06:24:24,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24757 to 20607. [2019-12-27 06:24:24,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20607 states. [2019-12-27 06:24:24,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20607 states to 20607 states and 63077 transitions. [2019-12-27 06:24:24,668 INFO L78 Accepts]: Start accepts. Automaton has 20607 states and 63077 transitions. Word has length 65 [2019-12-27 06:24:24,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:24:24,669 INFO L462 AbstractCegarLoop]: Abstraction has 20607 states and 63077 transitions. [2019-12-27 06:24:24,669 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 06:24:24,669 INFO L276 IsEmpty]: Start isEmpty. Operand 20607 states and 63077 transitions. [2019-12-27 06:24:24,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 06:24:24,690 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:24:24,691 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:24:24,691 INFO L410 AbstractCegarLoop]: === Iteration 35 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:24:24,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:24:24,691 INFO L82 PathProgramCache]: Analyzing trace with hash -1459276134, now seen corresponding path program 2 times [2019-12-27 06:24:24,691 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:24:24,692 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100606762] [2019-12-27 06:24:24,692 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:24:24,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:24:24,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:24:24,738 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100606762] [2019-12-27 06:24:24,738 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:24:24,738 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:24:24,738 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598073085] [2019-12-27 06:24:24,739 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:24:24,739 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:24:24,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:24:24,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:24:24,739 INFO L87 Difference]: Start difference. First operand 20607 states and 63077 transitions. Second operand 3 states. [2019-12-27 06:24:24,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:24:24,828 INFO L93 Difference]: Finished difference Result 20607 states and 63076 transitions. [2019-12-27 06:24:24,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:24:24,829 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 06:24:24,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:24:24,871 INFO L225 Difference]: With dead ends: 20607 [2019-12-27 06:24:24,872 INFO L226 Difference]: Without dead ends: 20607 [2019-12-27 06:24:24,872 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:24:25,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20607 states. [2019-12-27 06:24:25,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20607 to 18812. [2019-12-27 06:24:25,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18812 states. [2019-12-27 06:24:25,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18812 states to 18812 states and 58059 transitions. [2019-12-27 06:24:25,472 INFO L78 Accepts]: Start accepts. Automaton has 18812 states and 58059 transitions. Word has length 65 [2019-12-27 06:24:25,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:24:25,473 INFO L462 AbstractCegarLoop]: Abstraction has 18812 states and 58059 transitions. [2019-12-27 06:24:25,473 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:24:25,473 INFO L276 IsEmpty]: Start isEmpty. Operand 18812 states and 58059 transitions. [2019-12-27 06:24:25,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 06:24:25,501 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:24:25,501 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:24:25,501 INFO L410 AbstractCegarLoop]: === Iteration 36 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:24:25,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:24:25,502 INFO L82 PathProgramCache]: Analyzing trace with hash -1487759867, now seen corresponding path program 1 times [2019-12-27 06:24:25,502 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:24:25,502 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710350019] [2019-12-27 06:24:25,502 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:24:25,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:24:25,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:24:25,605 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710350019] [2019-12-27 06:24:25,605 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:24:25,606 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 06:24:25,606 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422584555] [2019-12-27 06:24:25,606 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 06:24:25,606 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:24:25,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 06:24:25,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-27 06:24:25,607 INFO L87 Difference]: Start difference. First operand 18812 states and 58059 transitions. Second operand 8 states. [2019-12-27 06:24:27,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:24:27,358 INFO L93 Difference]: Finished difference Result 33938 states and 102651 transitions. [2019-12-27 06:24:27,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-27 06:24:27,358 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 66 [2019-12-27 06:24:27,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:24:27,404 INFO L225 Difference]: With dead ends: 33938 [2019-12-27 06:24:27,404 INFO L226 Difference]: Without dead ends: 33938 [2019-12-27 06:24:27,405 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=96, Invalid=324, Unknown=0, NotChecked=0, Total=420 [2019-12-27 06:24:27,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33938 states. [2019-12-27 06:24:27,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33938 to 18819. [2019-12-27 06:24:27,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18819 states. [2019-12-27 06:24:27,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18819 states to 18819 states and 58079 transitions. [2019-12-27 06:24:27,799 INFO L78 Accepts]: Start accepts. Automaton has 18819 states and 58079 transitions. Word has length 66 [2019-12-27 06:24:27,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:24:27,799 INFO L462 AbstractCegarLoop]: Abstraction has 18819 states and 58079 transitions. [2019-12-27 06:24:27,799 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 06:24:27,799 INFO L276 IsEmpty]: Start isEmpty. Operand 18819 states and 58079 transitions. [2019-12-27 06:24:27,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 06:24:27,819 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:24:27,819 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:24:27,819 INFO L410 AbstractCegarLoop]: === Iteration 37 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:24:27,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:24:27,819 INFO L82 PathProgramCache]: Analyzing trace with hash -1214771677, now seen corresponding path program 2 times [2019-12-27 06:24:27,820 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:24:27,820 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838947658] [2019-12-27 06:24:27,820 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:24:27,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:24:27,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:24:27,868 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838947658] [2019-12-27 06:24:27,868 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:24:27,868 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:24:27,868 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387506746] [2019-12-27 06:24:27,868 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:24:27,869 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:24:27,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:24:27,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:24:27,869 INFO L87 Difference]: Start difference. First operand 18819 states and 58079 transitions. Second operand 3 states. [2019-12-27 06:24:27,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:24:27,946 INFO L93 Difference]: Finished difference Result 13413 states and 40936 transitions. [2019-12-27 06:24:27,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:24:27,946 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-27 06:24:27,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:24:27,976 INFO L225 Difference]: With dead ends: 13413 [2019-12-27 06:24:27,976 INFO L226 Difference]: Without dead ends: 13413 [2019-12-27 06:24:27,976 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:24:28,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13413 states. [2019-12-27 06:24:28,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13413 to 13144. [2019-12-27 06:24:28,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13144 states. [2019-12-27 06:24:28,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13144 states to 13144 states and 40179 transitions. [2019-12-27 06:24:28,313 INFO L78 Accepts]: Start accepts. Automaton has 13144 states and 40179 transitions. Word has length 66 [2019-12-27 06:24:28,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:24:28,313 INFO L462 AbstractCegarLoop]: Abstraction has 13144 states and 40179 transitions. [2019-12-27 06:24:28,313 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:24:28,313 INFO L276 IsEmpty]: Start isEmpty. Operand 13144 states and 40179 transitions. [2019-12-27 06:24:28,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 06:24:28,331 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:24:28,331 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:24:28,331 INFO L410 AbstractCegarLoop]: === Iteration 38 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:24:28,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:24:28,332 INFO L82 PathProgramCache]: Analyzing trace with hash -611821270, now seen corresponding path program 1 times [2019-12-27 06:24:28,332 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:24:28,332 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970221478] [2019-12-27 06:24:28,332 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:24:28,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 06:24:28,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 06:24:28,522 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 06:24:28,523 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 06:24:28,529 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [898] [898] ULTIMATE.startENTRY-->L830: Formula: (let ((.cse0 (store |v_#valid_65| 0 0))) (and (= v_~main$tmp_guard1~0_17 0) (= v_~main$tmp_guard0~0_10 0) (= 0 v_~a$mem_tmp~0_9) (= 0 v_~__unbuffered_p1_EAX~0_14) (= v_~a~0_26 0) (= v_~a$r_buff0_thd0~0_20 0) (= 0 v_~a$read_delayed_var~0.base_7) (= 0 v_~__unbuffered_cnt~0_20) (= |v_#valid_63| (store .cse0 |v_ULTIMATE.start_main_~#t1007~0.base_23| 1)) (= v_~a$r_buff0_thd2~0_19 0) (= |v_#NULL.offset_6| 0) (= 0 v_~a$read_delayed~0_7) (= v_~a$read_delayed_var~0.offset_7 0) (= 0 v_~a$r_buff1_thd1~0_19) (= 0 v_~z~0_6) (< 0 |v_#StackHeapBarrier_19|) (= 0 v_~a$r_buff1_thd3~0_52) (= 0 v_~y~0_7) (= v_~a$r_buff0_thd3~0_77 0) (= v_~a$flush_delayed~0_12 0) (= 0 v_~a$r_buff1_thd0~0_26) (< |v_#StackHeapBarrier_19| |v_ULTIMATE.start_main_~#t1007~0.base_23|) (= 0 v_~a$w_buff0~0_23) (= 0 v_~a$w_buff0_used~0_113) (= 0 |v_#NULL.base_6|) (= 0 v_~weak$$choice2~0_33) (= 0 v_~weak$$choice0~0_7) (= v_~a$r_buff0_thd1~0_28 0) (= v_~__unbuffered_p2_EBX~0_15 0) (= (store |v_#length_26| |v_ULTIMATE.start_main_~#t1007~0.base_23| 4) |v_#length_25|) (= |v_ULTIMATE.start_main_~#t1007~0.offset_18| 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1007~0.base_23|)) (= 0 v_~__unbuffered_p2_EAX~0_14) (= 0 v_~a$r_buff1_thd2~0_21) (= 0 v_~a$w_buff1~0_25) (= v_~x~0_19 0) (= 0 v_~a$w_buff1_used~0_76) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1007~0.base_23| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1007~0.base_23|) |v_ULTIMATE.start_main_~#t1007~0.offset_18| 0)) |v_#memory_int_21|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_19|, #valid=|v_#valid_65|, #memory_int=|v_#memory_int_22|, #length=|v_#length_26|} OutVars{~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_21, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_12|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_10|, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_20, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_10|, ~a~0=v_~a~0_26, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_23|, ULTIMATE.start_main_~#t1008~0.offset=|v_ULTIMATE.start_main_~#t1008~0.offset_15|, ULTIMATE.start_main_~#t1008~0.base=|v_ULTIMATE.start_main_~#t1008~0.base_21|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_14, #length=|v_#length_25|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_14, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_15, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_9|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_52, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_113, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_28, ~weak$$choice0~0=v_~weak$$choice0~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_19|, ~a$read_delayed_var~0.offset=v_~a$read_delayed_var~0.offset_7, ~a$w_buff0~0=v_~a$w_buff0~0_23, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_26, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_20, ~x~0=v_~x~0_19, ULTIMATE.start_main_~#t1007~0.offset=|v_ULTIMATE.start_main_~#t1007~0.offset_18|, ~a$read_delayed~0=v_~a$read_delayed~0_7, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_19, ULTIMATE.start_main_~#t1009~0.base=|v_ULTIMATE.start_main_~#t1009~0.base_20|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_12|, ~a$mem_tmp~0=v_~a$mem_tmp~0_9, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_10|, ~a$w_buff1~0=v_~a$w_buff1~0_25, ~y~0=v_~y~0_7, ULTIMATE.start_main_~#t1009~0.offset=|v_ULTIMATE.start_main_~#t1009~0.offset_16|, ULTIMATE.start_main_~#t1007~0.base=|v_ULTIMATE.start_main_~#t1007~0.base_23|, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_8|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_9|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_19, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_77, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10, #NULL.base=|v_#NULL.base_6|, ~a$flush_delayed~0=v_~a$flush_delayed~0_12, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_17|, #valid=|v_#valid_63|, #memory_int=|v_#memory_int_21|, ~z~0=v_~z~0_6, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_76, ~weak$$choice2~0=v_~weak$$choice2~0_33, ~a$read_delayed_var~0.base=v_~a$read_delayed_var~0.base_7} AuxVars[] AssignedVars[~a$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite49, ~a$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite50, ~a~0, ULTIMATE.start_main_#t~ite52, ULTIMATE.start_main_~#t1008~0.offset, ULTIMATE.start_main_~#t1008~0.base, ~__unbuffered_p1_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~nondet45, ~a$r_buff1_thd3~0, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, ~weak$$choice0~0, ~a$read_delayed_var~0.offset, ~a$w_buff0~0, ~a$r_buff1_thd0~0, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_~#t1007~0.offset, ~a$read_delayed~0, ~a$r_buff0_thd2~0, ULTIMATE.start_main_~#t1009~0.base, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ~a$mem_tmp~0, ULTIMATE.start_main_#t~ite51, ~a$w_buff1~0, ~y~0, ULTIMATE.start_main_~#t1009~0.offset, ULTIMATE.start_main_~#t1007~0.base, ULTIMATE.start_main_#t~nondet46, ULTIMATE.start_main_#t~nondet44, ~a$r_buff1_thd1~0, ~a$r_buff0_thd3~0, ~main$tmp_guard0~0, #NULL.base, ~a$flush_delayed~0, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~a$w_buff1_used~0, ~weak$$choice2~0, ~a$read_delayed_var~0.base] because there is no mapped edge [2019-12-27 06:24:28,531 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [857] [857] L830-1-->L832: Formula: (and (= |v_#valid_34| (store |v_#valid_35| |v_ULTIMATE.start_main_~#t1008~0.base_9| 1)) (= |v_ULTIMATE.start_main_~#t1008~0.offset_7| 0) (not (= 0 |v_ULTIMATE.start_main_~#t1008~0.base_9|)) (= (select |v_#valid_35| |v_ULTIMATE.start_main_~#t1008~0.base_9|) 0) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t1008~0.base_9| 4)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t1008~0.base_9|) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1008~0.base_9| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1008~0.base_9|) |v_ULTIMATE.start_main_~#t1008~0.offset_7| 1)) |v_#memory_int_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t1008~0.offset=|v_ULTIMATE.start_main_~#t1008~0.offset_7|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t1008~0.base=|v_ULTIMATE.start_main_~#t1008~0.base_9|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_4|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_11|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1008~0.offset, ULTIMATE.start_main_~#t1008~0.base, ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, #length] because there is no mapped edge [2019-12-27 06:24:28,532 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [856] [856] L832-1-->L834: Formula: (and (= |v_#valid_32| (store |v_#valid_33| |v_ULTIMATE.start_main_~#t1009~0.base_9| 1)) (= |v_ULTIMATE.start_main_~#t1009~0.offset_8| 0) (not (= 0 |v_ULTIMATE.start_main_~#t1009~0.base_9|)) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t1009~0.base_9| 4)) (= 0 (select |v_#valid_33| |v_ULTIMATE.start_main_~#t1009~0.base_9|)) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t1009~0.base_9|) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1009~0.base_9| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1009~0.base_9|) |v_ULTIMATE.start_main_~#t1009~0.offset_8| 2)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_10|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_~#t1009~0.offset=|v_ULTIMATE.start_main_~#t1009~0.offset_8|, #StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_32|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_4|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~#t1009~0.base=|v_ULTIMATE.start_main_~#t1009~0.base_9|, #length=|v_#length_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1009~0.offset, #valid, ULTIMATE.start_main_#t~nondet45, #memory_int, ULTIMATE.start_main_~#t1009~0.base, #length] because there is no mapped edge [2019-12-27 06:24:28,535 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [878] [878] L4-->L748: Formula: (and (= ~a$r_buff0_thd1~0_Out1191408607 1) (= ~a$r_buff0_thd1~0_In1191408607 ~a$r_buff1_thd1~0_Out1191408607) (= ~a$r_buff1_thd3~0_Out1191408607 ~a$r_buff0_thd3~0_In1191408607) (not (= 0 P0Thread1of1ForFork1___VERIFIER_assert_~expression_In1191408607)) (= ~x~0_Out1191408607 1) (= ~a$r_buff0_thd2~0_In1191408607 ~a$r_buff1_thd2~0_Out1191408607) (= ~a$r_buff1_thd0~0_Out1191408607 ~a$r_buff0_thd0~0_In1191408607)) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1191408607, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1191408607, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In1191408607, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1191408607, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1191408607} OutVars{~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_Out1191408607, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_Out1191408607, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_Out1191408607, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_Out1191408607, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1191408607, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1191408607, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In1191408607, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_Out1191408607, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1191408607, ~x~0=~x~0_Out1191408607} AuxVars[] AssignedVars[~a$r_buff1_thd1~0, ~a$r_buff1_thd3~0, ~a$r_buff1_thd2~0, ~a$r_buff1_thd0~0, ~a$r_buff0_thd1~0, ~x~0] because there is no mapped edge [2019-12-27 06:24:28,539 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [826] [826] L768-2-->L768-5: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff1_thd2~0_In1666000405 256))) (.cse1 (= (mod ~a$w_buff1_used~0_In1666000405 256) 0)) (.cse2 (= |P1Thread1of1ForFork2_#t~ite9_Out1666000405| |P1Thread1of1ForFork2_#t~ite10_Out1666000405|))) (or (and (not .cse0) (not .cse1) .cse2 (= |P1Thread1of1ForFork2_#t~ite9_Out1666000405| ~a$w_buff1~0_In1666000405)) (and (= |P1Thread1of1ForFork2_#t~ite9_Out1666000405| ~a~0_In1666000405) (or .cse0 .cse1) .cse2))) InVars {~a~0=~a~0_In1666000405, ~a$w_buff1~0=~a$w_buff1~0_In1666000405, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In1666000405, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1666000405} OutVars{~a~0=~a~0_In1666000405, P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out1666000405|, ~a$w_buff1~0=~a$w_buff1~0_In1666000405, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In1666000405, P1Thread1of1ForFork2_#t~ite10=|P1Thread1of1ForFork2_#t~ite10_Out1666000405|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1666000405} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite10] because there is no mapped edge [2019-12-27 06:24:28,541 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [876] [876] L796-->L796-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-570792798 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite21_Out-570792798| ~a$w_buff0~0_In-570792798) (= |P2Thread1of1ForFork0_#t~ite20_In-570792798| |P2Thread1of1ForFork0_#t~ite20_Out-570792798|) (not .cse0)) (and (= |P2Thread1of1ForFork0_#t~ite20_Out-570792798| ~a$w_buff0~0_In-570792798) (= |P2Thread1of1ForFork0_#t~ite20_Out-570792798| |P2Thread1of1ForFork0_#t~ite21_Out-570792798|) (let ((.cse1 (= 0 (mod ~a$r_buff0_thd3~0_In-570792798 256)))) (or (and (= (mod ~a$w_buff1_used~0_In-570792798 256) 0) .cse1) (and (= (mod ~a$r_buff1_thd3~0_In-570792798 256) 0) .cse1) (= 0 (mod ~a$w_buff0_used~0_In-570792798 256)))) .cse0))) InVars {~a$w_buff0~0=~a$w_buff0~0_In-570792798, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-570792798, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-570792798, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-570792798, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-570792798, P2Thread1of1ForFork0_#t~ite20=|P2Thread1of1ForFork0_#t~ite20_In-570792798|, ~weak$$choice2~0=~weak$$choice2~0_In-570792798} OutVars{P2Thread1of1ForFork0_#t~ite21=|P2Thread1of1ForFork0_#t~ite21_Out-570792798|, ~a$w_buff0~0=~a$w_buff0~0_In-570792798, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-570792798, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-570792798, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-570792798, P2Thread1of1ForFork0_#t~ite20=|P2Thread1of1ForFork0_#t~ite20_Out-570792798|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-570792798, ~weak$$choice2~0=~weak$$choice2~0_In-570792798} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite21, P2Thread1of1ForFork0_#t~ite20] because there is no mapped edge [2019-12-27 06:24:28,542 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L769-->L769-2: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff0_thd2~0_In-468036127 256))) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In-468036127 256)))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork2_#t~ite11_Out-468036127| 0)) (and (= |P1Thread1of1ForFork2_#t~ite11_Out-468036127| ~a$w_buff0_used~0_In-468036127) (or .cse1 .cse0)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-468036127, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-468036127} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-468036127, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-468036127, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out-468036127|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-27 06:24:28,542 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L770-->L770-2: Formula: (let ((.cse0 (= (mod ~a$r_buff0_thd2~0_In1173053655 256) 0)) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In1173053655 256))) (.cse2 (= (mod ~a$w_buff1_used~0_In1173053655 256) 0)) (.cse3 (= 0 (mod ~a$r_buff1_thd2~0_In1173053655 256)))) (or (and (or .cse0 .cse1) (= ~a$w_buff1_used~0_In1173053655 |P1Thread1of1ForFork2_#t~ite12_Out1173053655|) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork2_#t~ite12_Out1173053655|)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In1173053655, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1173053655, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1173053655, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1173053655} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In1173053655, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1173053655, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1173053655, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out1173053655|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1173053655} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-27 06:24:28,543 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [877] [877] L797-->L797-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In594790375 256)))) (or (and (= ~a$w_buff1~0_In594790375 |P2Thread1of1ForFork0_#t~ite23_Out594790375|) (= |P2Thread1of1ForFork0_#t~ite24_Out594790375| |P2Thread1of1ForFork0_#t~ite23_Out594790375|) .cse0 (let ((.cse1 (= 0 (mod ~a$r_buff0_thd3~0_In594790375 256)))) (or (= 0 (mod ~a$w_buff0_used~0_In594790375 256)) (and (= (mod ~a$r_buff1_thd3~0_In594790375 256) 0) .cse1) (and .cse1 (= (mod ~a$w_buff1_used~0_In594790375 256) 0))))) (and (not .cse0) (= ~a$w_buff1~0_In594790375 |P2Thread1of1ForFork0_#t~ite24_Out594790375|) (= |P2Thread1of1ForFork0_#t~ite23_In594790375| |P2Thread1of1ForFork0_#t~ite23_Out594790375|)))) InVars {~a$w_buff1~0=~a$w_buff1~0_In594790375, P2Thread1of1ForFork0_#t~ite23=|P2Thread1of1ForFork0_#t~ite23_In594790375|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In594790375, ~a$w_buff0_used~0=~a$w_buff0_used~0_In594790375, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In594790375, ~a$w_buff1_used~0=~a$w_buff1_used~0_In594790375, ~weak$$choice2~0=~weak$$choice2~0_In594790375} OutVars{~a$w_buff1~0=~a$w_buff1~0_In594790375, P2Thread1of1ForFork0_#t~ite23=|P2Thread1of1ForFork0_#t~ite23_Out594790375|, P2Thread1of1ForFork0_#t~ite24=|P2Thread1of1ForFork0_#t~ite24_Out594790375|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In594790375, ~a$w_buff0_used~0=~a$w_buff0_used~0_In594790375, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In594790375, ~a$w_buff1_used~0=~a$w_buff1_used~0_In594790375, ~weak$$choice2~0=~weak$$choice2~0_In594790375} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite23, P2Thread1of1ForFork0_#t~ite24] because there is no mapped edge [2019-12-27 06:24:28,543 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [875] [875] L798-->L798-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In2056712127 256)))) (or (and .cse0 (= |P2Thread1of1ForFork0_#t~ite26_Out2056712127| ~a$w_buff0_used~0_In2056712127) (= |P2Thread1of1ForFork0_#t~ite26_Out2056712127| |P2Thread1of1ForFork0_#t~ite27_Out2056712127|) (let ((.cse1 (= 0 (mod ~a$r_buff0_thd3~0_In2056712127 256)))) (or (and .cse1 (= (mod ~a$w_buff1_used~0_In2056712127 256) 0)) (= 0 (mod ~a$w_buff0_used~0_In2056712127 256)) (and (= 0 (mod ~a$r_buff1_thd3~0_In2056712127 256)) .cse1)))) (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite26_In2056712127| |P2Thread1of1ForFork0_#t~ite26_Out2056712127|) (= |P2Thread1of1ForFork0_#t~ite27_Out2056712127| ~a$w_buff0_used~0_In2056712127)))) InVars {P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_In2056712127|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In2056712127, ~a$w_buff0_used~0=~a$w_buff0_used~0_In2056712127, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In2056712127, ~a$w_buff1_used~0=~a$w_buff1_used~0_In2056712127, ~weak$$choice2~0=~weak$$choice2~0_In2056712127} OutVars{P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_Out2056712127|, P2Thread1of1ForFork0_#t~ite27=|P2Thread1of1ForFork0_#t~ite27_Out2056712127|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In2056712127, ~a$w_buff0_used~0=~a$w_buff0_used~0_In2056712127, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In2056712127, ~a$w_buff1_used~0=~a$w_buff1_used~0_In2056712127, ~weak$$choice2~0=~weak$$choice2~0_In2056712127} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite26, P2Thread1of1ForFork0_#t~ite27] because there is no mapped edge [2019-12-27 06:24:28,546 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L771-->L771-2: Formula: (let ((.cse0 (= (mod ~a$w_buff0_used~0_In341260393 256) 0)) (.cse1 (= (mod ~a$r_buff0_thd2~0_In341260393 256) 0))) (or (and (= |P1Thread1of1ForFork2_#t~ite13_Out341260393| 0) (not .cse0) (not .cse1)) (and (= |P1Thread1of1ForFork2_#t~ite13_Out341260393| ~a$r_buff0_thd2~0_In341260393) (or .cse0 .cse1)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In341260393, ~a$w_buff0_used~0=~a$w_buff0_used~0_In341260393} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In341260393, ~a$w_buff0_used~0=~a$w_buff0_used~0_In341260393, P1Thread1of1ForFork2_#t~ite13=|P1Thread1of1ForFork2_#t~ite13_Out341260393|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite13] because there is no mapped edge [2019-12-27 06:24:28,547 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [838] [838] L772-->L772-2: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff0_thd2~0_In464628505 256))) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In464628505 256))) (.cse2 (= (mod ~a$w_buff1_used~0_In464628505 256) 0)) (.cse3 (= 0 (mod ~a$r_buff1_thd2~0_In464628505 256)))) (or (and (= |P1Thread1of1ForFork2_#t~ite14_Out464628505| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P1Thread1of1ForFork2_#t~ite14_Out464628505| ~a$r_buff1_thd2~0_In464628505) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In464628505, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In464628505, ~a$w_buff0_used~0=~a$w_buff0_used~0_In464628505, ~a$w_buff1_used~0=~a$w_buff1_used~0_In464628505} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In464628505, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In464628505, ~a$w_buff0_used~0=~a$w_buff0_used~0_In464628505, ~a$w_buff1_used~0=~a$w_buff1_used~0_In464628505, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out464628505|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-27 06:24:28,547 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [872] [872] L772-2-->P1EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_16 1) v_~__unbuffered_cnt~0_15) (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= |v_P1Thread1of1ForFork2_#t~ite14_8| v_~a$r_buff1_thd2~0_17) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_8|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_17, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_7|, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~a$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-27 06:24:28,548 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L800-->L801: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_16 256))) (= v_~a$r_buff0_thd3~0_51 v_~a$r_buff0_thd3~0_50)) InVars {~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_51, ~weak$$choice2~0=v_~weak$$choice2~0_16} OutVars{P2Thread1of1ForFork0_#t~ite33=|v_P2Thread1of1ForFork0_#t~ite33_9|, P2Thread1of1ForFork0_#t~ite32=|v_P2Thread1of1ForFork0_#t~ite32_9|, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_50, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_8|, ~weak$$choice2~0=v_~weak$$choice2~0_16} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite33, P2Thread1of1ForFork0_#t~ite32, ~a$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-27 06:24:28,551 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [790] [790] L803-->L807: Formula: (and (not (= 0 (mod v_~a$flush_delayed~0_8 256))) (= v_~a~0_19 v_~a$mem_tmp~0_5) (= v_~a$flush_delayed~0_7 0)) InVars {~a$mem_tmp~0=v_~a$mem_tmp~0_5, ~a$flush_delayed~0=v_~a$flush_delayed~0_8} OutVars{P2Thread1of1ForFork0_#t~ite37=|v_P2Thread1of1ForFork0_#t~ite37_7|, ~a~0=v_~a~0_19, ~a$mem_tmp~0=v_~a$mem_tmp~0_5, ~a$flush_delayed~0=v_~a$flush_delayed~0_7} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite37, ~a~0, ~a$flush_delayed~0] because there is no mapped edge [2019-12-27 06:24:28,552 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [820] [820] L807-2-->L807-4: Formula: (let ((.cse0 (= (mod ~a$r_buff1_thd3~0_In-714552394 256) 0)) (.cse1 (= 0 (mod ~a$w_buff1_used~0_In-714552394 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite38_Out-714552394| ~a~0_In-714552394) (or .cse0 .cse1)) (and (not .cse0) (= ~a$w_buff1~0_In-714552394 |P2Thread1of1ForFork0_#t~ite38_Out-714552394|) (not .cse1)))) InVars {~a~0=~a~0_In-714552394, ~a$w_buff1~0=~a$w_buff1~0_In-714552394, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-714552394, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-714552394} OutVars{~a~0=~a~0_In-714552394, P2Thread1of1ForFork0_#t~ite38=|P2Thread1of1ForFork0_#t~ite38_Out-714552394|, ~a$w_buff1~0=~a$w_buff1~0_In-714552394, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-714552394, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-714552394} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-27 06:24:28,552 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [768] [768] L807-4-->L808: Formula: (= v_~a~0_16 |v_P2Thread1of1ForFork0_#t~ite38_8|) InVars {P2Thread1of1ForFork0_#t~ite38=|v_P2Thread1of1ForFork0_#t~ite38_8|} OutVars{~a~0=v_~a~0_16, P2Thread1of1ForFork0_#t~ite39=|v_P2Thread1of1ForFork0_#t~ite39_7|, P2Thread1of1ForFork0_#t~ite38=|v_P2Thread1of1ForFork0_#t~ite38_7|} AuxVars[] AssignedVars[~a~0, P2Thread1of1ForFork0_#t~ite39, P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-27 06:24:28,553 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [824] [824] L808-->L808-2: Formula: (let ((.cse0 (= (mod ~a$r_buff0_thd3~0_In-96010548 256) 0)) (.cse1 (= (mod ~a$w_buff0_used~0_In-96010548 256) 0))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork0_#t~ite40_Out-96010548| 0)) (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite40_Out-96010548| ~a$w_buff0_used~0_In-96010548)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-96010548, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-96010548} OutVars{P2Thread1of1ForFork0_#t~ite40=|P2Thread1of1ForFork0_#t~ite40_Out-96010548|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-96010548, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-96010548} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite40] because there is no mapped edge [2019-12-27 06:24:28,553 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [830] [830] L749-->L749-2: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff0_used~0_In1279364989 256))) (.cse0 (= 0 (mod ~a$r_buff0_thd1~0_In1279364989 256)))) (or (and (= 0 |P0Thread1of1ForFork1_#t~ite5_Out1279364989|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~a$w_buff0_used~0_In1279364989 |P0Thread1of1ForFork1_#t~ite5_Out1279364989|)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In1279364989, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1279364989} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out1279364989|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1279364989, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1279364989} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-27 06:24:28,554 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [829] [829] L750-->L750-2: Formula: (let ((.cse2 (= 0 (mod ~a$w_buff0_used~0_In536216889 256))) (.cse3 (= 0 (mod ~a$r_buff0_thd1~0_In536216889 256))) (.cse0 (= (mod ~a$w_buff1_used~0_In536216889 256) 0)) (.cse1 (= 0 (mod ~a$r_buff1_thd1~0_In536216889 256)))) (or (and (= |P0Thread1of1ForFork1_#t~ite6_Out536216889| ~a$w_buff1_used~0_In536216889) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= 0 |P0Thread1of1ForFork1_#t~ite6_Out536216889|)))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In536216889, ~a$w_buff0_used~0=~a$w_buff0_used~0_In536216889, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In536216889, ~a$w_buff1_used~0=~a$w_buff1_used~0_In536216889} OutVars{P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out536216889|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In536216889, ~a$w_buff0_used~0=~a$w_buff0_used~0_In536216889, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In536216889, ~a$w_buff1_used~0=~a$w_buff1_used~0_In536216889} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-27 06:24:28,555 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] L751-->L752: Formula: (let ((.cse0 (= (mod ~a$r_buff0_thd1~0_In-1577363244 256) 0)) (.cse1 (= (mod ~a$w_buff0_used~0_In-1577363244 256) 0))) (or (and (= ~a$r_buff0_thd1~0_In-1577363244 ~a$r_buff0_thd1~0_Out-1577363244) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= 0 ~a$r_buff0_thd1~0_Out-1577363244)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-1577363244, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1577363244} OutVars{P0Thread1of1ForFork1_#t~ite7=|P0Thread1of1ForFork1_#t~ite7_Out-1577363244|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1577363244, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_Out-1577363244} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite7, ~a$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 06:24:28,555 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [823] [823] L752-->L752-2: Formula: (let ((.cse1 (= (mod ~a$r_buff1_thd1~0_In-1940297336 256) 0)) (.cse0 (= (mod ~a$w_buff1_used~0_In-1940297336 256) 0)) (.cse2 (= 0 (mod ~a$w_buff0_used~0_In-1940297336 256))) (.cse3 (= 0 (mod ~a$r_buff0_thd1~0_In-1940297336 256)))) (or (and (= 0 |P0Thread1of1ForFork1_#t~ite8_Out-1940297336|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse2 .cse3) (= |P0Thread1of1ForFork1_#t~ite8_Out-1940297336| ~a$r_buff1_thd1~0_In-1940297336)))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-1940297336, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1940297336, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1940297336, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1940297336} OutVars{P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out-1940297336|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-1940297336, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1940297336, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1940297336, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1940297336} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-27 06:24:28,556 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [865] [865] L752-2-->P0EXIT: Formula: (and (= v_~a$r_buff1_thd1~0_15 |v_P0Thread1of1ForFork1_#t~ite8_8|) (= v_~__unbuffered_cnt~0_13 (+ v_~__unbuffered_cnt~0_14 1)) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_7|, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_15, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8, P0Thread1of1ForFork1_#res.offset, ~a$r_buff1_thd1~0, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-27 06:24:28,557 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L809-->L809-2: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff1_used~0_In1449389404 256))) (.cse0 (= 0 (mod ~a$r_buff1_thd3~0_In1449389404 256))) (.cse3 (= 0 (mod ~a$r_buff0_thd3~0_In1449389404 256))) (.cse2 (= (mod ~a$w_buff0_used~0_In1449389404 256) 0))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite41_Out1449389404| ~a$w_buff1_used~0_In1449389404) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= |P2Thread1of1ForFork0_#t~ite41_Out1449389404| 0)))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1449389404, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1449389404, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1449389404, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1449389404} OutVars{~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1449389404, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1449389404, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1449389404, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1449389404, P2Thread1of1ForFork0_#t~ite41=|P2Thread1of1ForFork0_#t~ite41_Out1449389404|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite41] because there is no mapped edge [2019-12-27 06:24:28,558 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L810-->L810-2: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff0_used~0_In1486372339 256))) (.cse0 (= (mod ~a$r_buff0_thd3~0_In1486372339 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite42_Out1486372339| 0) (not .cse0) (not .cse1)) (and (= |P2Thread1of1ForFork0_#t~ite42_Out1486372339| ~a$r_buff0_thd3~0_In1486372339) (or .cse1 .cse0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In1486372339, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1486372339} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In1486372339, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1486372339, P2Thread1of1ForFork0_#t~ite42=|P2Thread1of1ForFork0_#t~ite42_Out1486372339|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-27 06:24:28,560 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [844] [844] L811-->L811-2: Formula: (let ((.cse0 (= (mod ~a$r_buff1_thd3~0_In-21250993 256) 0)) (.cse1 (= 0 (mod ~a$w_buff1_used~0_In-21250993 256))) (.cse2 (= 0 (mod ~a$r_buff0_thd3~0_In-21250993 256))) (.cse3 (= 0 (mod ~a$w_buff0_used~0_In-21250993 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~a$r_buff1_thd3~0_In-21250993 |P2Thread1of1ForFork0_#t~ite43_Out-21250993|)) (and (= 0 |P2Thread1of1ForFork0_#t~ite43_Out-21250993|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-21250993, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-21250993, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-21250993, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-21250993} OutVars{P2Thread1of1ForFork0_#t~ite43=|P2Thread1of1ForFork0_#t~ite43_Out-21250993|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-21250993, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-21250993, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-21250993, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-21250993} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite43] because there is no mapped edge [2019-12-27 06:24:28,560 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [848] [848] L811-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= v_~a$r_buff1_thd3~0_43 |v_P2Thread1of1ForFork0_#t~ite43_8|) (= (+ v_~__unbuffered_cnt~0_12 1) v_~__unbuffered_cnt~0_11) (= |v_P2Thread1of1ForFork0_#res.base_5| 0)) InVars {P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_7|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_43, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite43, ~a$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-27 06:24:28,560 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [806] [806] L834-1-->L840: Formula: (and (= 3 v_~__unbuffered_cnt~0_10) (= v_~main$tmp_guard0~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 06:24:28,561 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L840-2-->L840-5: Formula: (let ((.cse0 (= (mod ~a$w_buff1_used~0_In-130154570 256) 0)) (.cse2 (= (mod ~a$r_buff1_thd0~0_In-130154570 256) 0)) (.cse1 (= |ULTIMATE.start_main_#t~ite47_Out-130154570| |ULTIMATE.start_main_#t~ite48_Out-130154570|))) (or (and (not .cse0) .cse1 (not .cse2) (= ~a$w_buff1~0_In-130154570 |ULTIMATE.start_main_#t~ite47_Out-130154570|)) (and (or .cse0 .cse2) .cse1 (= ~a~0_In-130154570 |ULTIMATE.start_main_#t~ite47_Out-130154570|)))) InVars {~a~0=~a~0_In-130154570, ~a$w_buff1~0=~a$w_buff1~0_In-130154570, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-130154570, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-130154570} OutVars{~a~0=~a~0_In-130154570, ~a$w_buff1~0=~a$w_buff1~0_In-130154570, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out-130154570|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-130154570, ULTIMATE.start_main_#t~ite48=|ULTIMATE.start_main_#t~ite48_Out-130154570|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-130154570} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-27 06:24:28,562 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L841-->L841-2: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff0_thd0~0_In672314214 256))) (.cse0 (= (mod ~a$w_buff0_used~0_In672314214 256) 0))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite49_Out672314214| 0)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite49_Out672314214| ~a$w_buff0_used~0_In672314214)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In672314214, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In672314214} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In672314214, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out672314214|, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In672314214} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-27 06:24:28,564 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [835] [835] L842-->L842-2: Formula: (let ((.cse0 (= (mod ~a$r_buff0_thd0~0_In-1288565658 256) 0)) (.cse1 (= (mod ~a$w_buff0_used~0_In-1288565658 256) 0)) (.cse3 (= 0 (mod ~a$r_buff1_thd0~0_In-1288565658 256))) (.cse2 (= (mod ~a$w_buff1_used~0_In-1288565658 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite50_Out-1288565658|)) (and (or .cse0 .cse1) (= ~a$w_buff1_used~0_In-1288565658 |ULTIMATE.start_main_#t~ite50_Out-1288565658|) (or .cse3 .cse2)))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-1288565658, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1288565658, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1288565658, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1288565658} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out-1288565658|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-1288565658, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1288565658, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1288565658, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1288565658} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-27 06:24:28,565 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [827] [827] L843-->L843-2: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff0_thd0~0_In-292827937 256))) (.cse1 (= (mod ~a$w_buff0_used~0_In-292827937 256) 0))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite51_Out-292827937|) (not .cse1)) (and (= ~a$r_buff0_thd0~0_In-292827937 |ULTIMATE.start_main_#t~ite51_Out-292827937|) (or .cse0 .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-292827937, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-292827937} OutVars{ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out-292827937|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-292827937, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-292827937} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-27 06:24:28,566 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L844-->L844-2: Formula: (let ((.cse1 (= (mod ~a$w_buff1_used~0_In-1140118602 256) 0)) (.cse0 (= 0 (mod ~a$r_buff1_thd0~0_In-1140118602 256))) (.cse3 (= (mod ~a$r_buff0_thd0~0_In-1140118602 256) 0)) (.cse2 (= (mod ~a$w_buff0_used~0_In-1140118602 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite52_Out-1140118602|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |ULTIMATE.start_main_#t~ite52_Out-1140118602| ~a$r_buff1_thd0~0_In-1140118602) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-1140118602, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1140118602, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1140118602, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1140118602} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out-1140118602|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-1140118602, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1140118602, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1140118602, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1140118602} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-27 06:24:28,567 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [883] [883] L844-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~__unbuffered_p2_EAX~0_8 1) (= v_~main$tmp_guard1~0_10 0) (= v_~__unbuffered_p2_EBX~0_9 0) (= v_~x~0_13 2) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 0) (= |v_ULTIMATE.start_main_#t~ite52_12| v_~a$r_buff1_thd0~0_20) (= 0 v_~__unbuffered_p1_EAX~0_7) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|)) InVars {ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_12|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_9, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_7, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_8, ~x~0=v_~x~0_13} OutVars{ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_11|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_15, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_9, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_7, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_20, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_10, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_8, ~x~0=v_~x~0_13, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~a$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 06:24:28,707 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 06:24:28 BasicIcfg [2019-12-27 06:24:28,707 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 06:24:28,709 INFO L168 Benchmark]: Toolchain (without parser) took 103476.20 ms. Allocated memory was 138.9 MB in the beginning and 3.0 GB in the end (delta: 2.9 GB). Free memory was 100.6 MB in the beginning and 687.3 MB in the end (delta: -586.7 MB). Peak memory consumption was 2.3 GB. Max. memory is 7.1 GB. [2019-12-27 06:24:28,709 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 138.9 MB. Free memory was 120.8 MB in the beginning and 120.6 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2019-12-27 06:24:28,709 INFO L168 Benchmark]: CACSL2BoogieTranslator took 879.26 ms. Allocated memory was 138.9 MB in the beginning and 202.9 MB in the end (delta: 64.0 MB). Free memory was 100.2 MB in the beginning and 156.1 MB in the end (delta: -55.9 MB). Peak memory consumption was 24.5 MB. Max. memory is 7.1 GB. [2019-12-27 06:24:28,710 INFO L168 Benchmark]: Boogie Procedure Inliner took 74.17 ms. Allocated memory is still 202.9 MB. Free memory was 156.1 MB in the beginning and 153.5 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 06:24:28,710 INFO L168 Benchmark]: Boogie Preprocessor took 43.26 ms. Allocated memory is still 202.9 MB. Free memory was 153.5 MB in the beginning and 151.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 06:24:28,710 INFO L168 Benchmark]: RCFGBuilder took 887.53 ms. Allocated memory is still 202.9 MB. Free memory was 151.0 MB in the beginning and 100.9 MB in the end (delta: 50.1 MB). Peak memory consumption was 50.1 MB. Max. memory is 7.1 GB. [2019-12-27 06:24:28,711 INFO L168 Benchmark]: TraceAbstraction took 101586.65 ms. Allocated memory was 202.9 MB in the beginning and 3.0 GB in the end (delta: 2.8 GB). Free memory was 100.2 MB in the beginning and 687.3 MB in the end (delta: -587.1 MB). Peak memory consumption was 2.2 GB. Max. memory is 7.1 GB. [2019-12-27 06:24:28,714 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.21 ms. Allocated memory is still 138.9 MB. Free memory was 120.8 MB in the beginning and 120.6 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 879.26 ms. Allocated memory was 138.9 MB in the beginning and 202.9 MB in the end (delta: 64.0 MB). Free memory was 100.2 MB in the beginning and 156.1 MB in the end (delta: -55.9 MB). Peak memory consumption was 24.5 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 74.17 ms. Allocated memory is still 202.9 MB. Free memory was 156.1 MB in the beginning and 153.5 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 43.26 ms. Allocated memory is still 202.9 MB. Free memory was 153.5 MB in the beginning and 151.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 887.53 ms. Allocated memory is still 202.9 MB. Free memory was 151.0 MB in the beginning and 100.9 MB in the end (delta: 50.1 MB). Peak memory consumption was 50.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 101586.65 ms. Allocated memory was 202.9 MB in the beginning and 3.0 GB in the end (delta: 2.8 GB). Free memory was 100.2 MB in the beginning and 687.3 MB in the end (delta: -587.1 MB). Peak memory consumption was 2.2 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.0s, 177 ProgramPointsBefore, 93 ProgramPointsAfterwards, 214 TransitionsBefore, 102 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 7 FixpointIterations, 34 TrivialSequentialCompositions, 48 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 32 ConcurrentYvCompositions, 32 ChoiceCompositions, 7189 VarBasedMoverChecksPositive, 222 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 80962 CheckedPairsTotal, 114 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L830] FCALL, FORK 0 pthread_create(&t1007, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L733] 1 a$w_buff1 = a$w_buff0 [L734] 1 a$w_buff0 = 1 [L735] 1 a$w_buff1_used = a$w_buff0_used [L736] 1 a$w_buff0_used = (_Bool)1 [L832] FCALL, FORK 0 pthread_create(&t1008, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L834] FCALL, FORK 0 pthread_create(&t1009, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L762] 2 x = 2 [L765] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L768] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L782] 3 y = 1 [L785] 3 z = 1 [L788] 3 __unbuffered_p2_EAX = z [L791] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L792] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L793] 3 a$flush_delayed = weak$$choice2 [L794] 3 a$mem_tmp = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=2, y=1, z=1] [L795] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) VAL [!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=2, y=1, z=1] [L768] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L795] 3 a = !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L796] 3 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L769] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L797] 3 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L798] 3 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L799] EXPR 3 weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, z=1] [L799] 3 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L770] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L771] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L748] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=2, y=1, z=1] [L801] EXPR 3 weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, z=1] [L801] 3 a$r_buff1_thd3 = weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L802] 3 __unbuffered_p2_EBX = a VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=2, y=1, z=1] [L748] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L807] 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=2, y=1, z=1] [L749] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L750] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L808] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L809] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L810] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L840] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=2, y=1, z=1] [L840] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L841] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L842] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L843] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 168 locations, 2 error locations. Result: UNSAFE, OverallTime: 101.1s, OverallIterations: 38, TraceHistogramMax: 1, AutomataDifference: 38.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 8453 SDtfs, 13107 SDslu, 22145 SDs, 0 SdLazy, 15332 SolverSat, 800 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 15.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 492 GetRequests, 83 SyntacticMatches, 23 SemanticMatches, 386 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1691 ImplicationChecksByTransitivity, 5.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=141665occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 37.3s AutomataMinimizationTime, 37 MinimizatonAttempts, 381602 StatesRemovedByMinimization, 34 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 3.2s InterpolantComputationTime, 1741 NumberOfCodeBlocks, 1741 NumberOfCodeBlocksAsserted, 38 NumberOfCheckSat, 1637 ConstructedInterpolants, 0 QuantifiedInterpolants, 285437 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 37 InterpolantComputations, 37 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! [MP z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Abandoning pump threads because process wont die! Received shutdown request...