/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix042_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-26 22:35:44,143 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-26 22:35:44,147 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-26 22:35:44,165 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-26 22:35:44,166 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-26 22:35:44,168 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-26 22:35:44,170 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-26 22:35:44,180 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-26 22:35:44,183 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-26 22:35:44,186 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-26 22:35:44,188 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-26 22:35:44,190 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-26 22:35:44,190 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-26 22:35:44,192 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-26 22:35:44,195 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-26 22:35:44,197 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-26 22:35:44,198 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-26 22:35:44,198 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-26 22:35:44,200 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-26 22:35:44,205 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-26 22:35:44,210 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-26 22:35:44,215 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-26 22:35:44,217 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-26 22:35:44,217 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-26 22:35:44,219 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-26 22:35:44,220 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-26 22:35:44,220 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-26 22:35:44,221 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-26 22:35:44,221 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-26 22:35:44,222 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-26 22:35:44,222 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-26 22:35:44,223 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-26 22:35:44,224 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-26 22:35:44,224 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-26 22:35:44,225 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-26 22:35:44,225 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-26 22:35:44,226 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-26 22:35:44,226 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-26 22:35:44,226 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-26 22:35:44,227 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-26 22:35:44,228 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-26 22:35:44,229 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-26 22:35:44,242 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-26 22:35:44,243 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-26 22:35:44,244 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-26 22:35:44,244 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-26 22:35:44,244 INFO L138 SettingsManager]: * Use SBE=true [2019-12-26 22:35:44,244 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-26 22:35:44,245 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-26 22:35:44,245 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-26 22:35:44,245 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-26 22:35:44,245 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-26 22:35:44,245 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-26 22:35:44,246 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-26 22:35:44,246 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-26 22:35:44,246 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-26 22:35:44,246 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-26 22:35:44,246 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-26 22:35:44,246 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-26 22:35:44,247 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-26 22:35:44,247 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-26 22:35:44,247 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-26 22:35:44,247 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-26 22:35:44,247 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-26 22:35:44,248 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-26 22:35:44,248 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-26 22:35:44,248 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-26 22:35:44,248 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-26 22:35:44,248 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-26 22:35:44,249 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-26 22:35:44,249 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-26 22:35:44,249 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-26 22:35:44,528 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-26 22:35:44,544 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-26 22:35:44,548 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-26 22:35:44,550 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-26 22:35:44,550 INFO L275 PluginConnector]: CDTParser initialized [2019-12-26 22:35:44,551 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix042_rmo.oepc.i [2019-12-26 22:35:44,614 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b4bcde890/93c22ade550547b38249ece02c786acd/FLAG0c2d4bcba [2019-12-26 22:35:45,223 INFO L306 CDTParser]: Found 1 translation units. [2019-12-26 22:35:45,224 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix042_rmo.oepc.i [2019-12-26 22:35:45,249 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b4bcde890/93c22ade550547b38249ece02c786acd/FLAG0c2d4bcba [2019-12-26 22:35:45,494 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b4bcde890/93c22ade550547b38249ece02c786acd [2019-12-26 22:35:45,502 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-26 22:35:45,504 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-26 22:35:45,505 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-26 22:35:45,505 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-26 22:35:45,509 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-26 22:35:45,510 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 10:35:45" (1/1) ... [2019-12-26 22:35:45,513 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@85f7a91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:35:45, skipping insertion in model container [2019-12-26 22:35:45,513 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 10:35:45" (1/1) ... [2019-12-26 22:35:45,521 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-26 22:35:45,577 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-26 22:35:46,090 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 22:35:46,103 INFO L203 MainTranslator]: Completed pre-run [2019-12-26 22:35:46,215 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 22:35:46,309 INFO L208 MainTranslator]: Completed translation [2019-12-26 22:35:46,310 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:35:46 WrapperNode [2019-12-26 22:35:46,310 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-26 22:35:46,311 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-26 22:35:46,311 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-26 22:35:46,311 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-26 22:35:46,319 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:35:46" (1/1) ... [2019-12-26 22:35:46,341 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:35:46" (1/1) ... [2019-12-26 22:35:46,387 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-26 22:35:46,387 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-26 22:35:46,387 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-26 22:35:46,387 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-26 22:35:46,398 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:35:46" (1/1) ... [2019-12-26 22:35:46,398 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:35:46" (1/1) ... [2019-12-26 22:35:46,403 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:35:46" (1/1) ... [2019-12-26 22:35:46,404 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:35:46" (1/1) ... [2019-12-26 22:35:46,417 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:35:46" (1/1) ... [2019-12-26 22:35:46,427 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:35:46" (1/1) ... [2019-12-26 22:35:46,433 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:35:46" (1/1) ... [2019-12-26 22:35:46,440 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-26 22:35:46,447 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-26 22:35:46,448 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-26 22:35:46,448 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-26 22:35:46,449 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:35: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-26 22:35:46,512 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-26 22:35:46,513 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-26 22:35:46,513 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-26 22:35:46,513 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-26 22:35:46,513 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-26 22:35:46,513 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-26 22:35:46,514 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-26 22:35:46,514 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-26 22:35:46,514 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-26 22:35:46,514 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-26 22:35:46,514 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-26 22:35:46,515 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-26 22:35:46,515 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-26 22:35:46,517 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-26 22:35:47,311 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-26 22:35:47,311 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-26 22:35:47,313 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 10:35:47 BoogieIcfgContainer [2019-12-26 22:35:47,313 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-26 22:35:47,314 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-26 22:35:47,315 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-26 22:35:47,318 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-26 22:35:47,318 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.12 10:35:45" (1/3) ... [2019-12-26 22:35:47,319 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2762de2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 10:35:47, skipping insertion in model container [2019-12-26 22:35:47,319 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:35:46" (2/3) ... [2019-12-26 22:35:47,320 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2762de2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 10:35:47, skipping insertion in model container [2019-12-26 22:35:47,320 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 10:35:47" (3/3) ... [2019-12-26 22:35:47,322 INFO L109 eAbstractionObserver]: Analyzing ICFG mix042_rmo.oepc.i [2019-12-26 22:35:47,331 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-26 22:35:47,331 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-26 22:35:47,338 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-26 22:35:47,339 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-26 22:35:47,377 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:47,377 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:47,378 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:47,378 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:47,378 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:47,378 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:47,378 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:47,379 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:47,379 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:47,380 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:47,380 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:47,380 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:47,380 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:47,381 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:47,381 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:47,381 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:47,381 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:47,382 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:47,382 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:47,382 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:47,382 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:47,383 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:47,383 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:47,383 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:47,383 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:47,384 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:47,384 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:47,384 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:47,384 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:47,385 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:47,385 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:47,385 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:47,385 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:47,385 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:47,386 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:47,386 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:47,387 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:47,387 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:47,387 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:47,387 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:47,388 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:47,388 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:47,388 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:47,388 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:47,389 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:47,389 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:47,389 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:47,389 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:47,389 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:47,390 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:47,390 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:47,390 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:47,390 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:47,391 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:47,391 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:47,391 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:47,392 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:47,392 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:47,392 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:47,392 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:47,393 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:47,393 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:47,393 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:47,393 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:47,394 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:47,395 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:47,412 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:47,412 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:47,412 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:47,412 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:47,412 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:47,413 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:47,413 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:47,414 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:47,414 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:47,414 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:47,414 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:47,415 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:47,415 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:47,415 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:47,415 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:47,415 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:47,416 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:47,416 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:47,416 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:47,416 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:47,417 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:47,417 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:47,417 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:47,417 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:47,417 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:47,418 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:47,418 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:47,418 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:47,418 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:47,418 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:47,419 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:47,419 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:47,419 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:47,419 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:47,419 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:47,420 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:47,420 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:47,420 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:47,420 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:47,420 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:47,421 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:47,421 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:47,421 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:47,421 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:47,422 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:47,422 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:47,422 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:47,422 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:47,422 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:47,423 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:47,423 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:47,423 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:47,423 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:47,423 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:47,424 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:47,424 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:47,424 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:47,424 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:47,424 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:47,424 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:47,425 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:47,425 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:47,425 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:47,425 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:47,425 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:47,426 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:47,426 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:47,426 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:47,426 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:47,427 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:47,427 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:47,427 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:47,427 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:47,427 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:47,428 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:47,428 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:47,428 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:47,428 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:47,428 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:47,429 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:47,429 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:47,429 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:47,429 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:47,429 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:47,430 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:47,430 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:47,430 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:47,430 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:47,430 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:47,430 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:47,431 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:47,431 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:47,431 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:47,431 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:47,431 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:47,432 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:47,432 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:47,432 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:47,432 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:47,432 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:47,433 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:47,433 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:47,433 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:47,433 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:47,433 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:47,433 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:47,434 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:47,434 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:47,434 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:47,434 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:47,434 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:47,435 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:47,435 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:47,435 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:47,435 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:47,435 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:47,439 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:47,439 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:47,439 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:47,440 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:47,440 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:47,440 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:47,440 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:47,440 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:47,441 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:47,441 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:47,441 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:47,441 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:47,441 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:47,441 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:47,442 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:47,442 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:47,442 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:47,442 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:47,442 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:47,443 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:47,443 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:47,443 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:47,443 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:47,443 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:47,443 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:47,444 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:47,444 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:47,444 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:47,444 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:47,444 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:47,445 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:47,445 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:47,445 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:47,450 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:47,450 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:47,450 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:47,450 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:47,451 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:47,451 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:47,451 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:47,451 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:47,451 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:47,452 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:47,452 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:47,452 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:47,454 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:47,454 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:47,454 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:47,454 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:47,455 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:47,455 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:47,455 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:47,455 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:47,455 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:47,456 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:47,473 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-26 22:35:47,492 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-26 22:35:47,493 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-26 22:35:47,493 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-26 22:35:47,493 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-26 22:35:47,493 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-26 22:35:47,493 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-26 22:35:47,493 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-26 22:35:47,494 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-26 22:35:47,510 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 177 places, 214 transitions [2019-12-26 22:35:47,512 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 177 places, 214 transitions [2019-12-26 22:35:47,621 INFO L132 PetriNetUnfolder]: 47/211 cut-off events. [2019-12-26 22:35:47,621 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 22:35:47,639 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-26 22:35:47,664 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 177 places, 214 transitions [2019-12-26 22:35:47,720 INFO L132 PetriNetUnfolder]: 47/211 cut-off events. [2019-12-26 22:35:47,720 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 22:35:47,729 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-26 22:35:47,752 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-26 22:35:47,753 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-26 22:35:53,063 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-12-26 22:35:53,191 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-12-26 22:35:53,485 WARN L192 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 91 [2019-12-26 22:35:53,600 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-12-26 22:35:53,625 INFO L206 etLargeBlockEncoding]: Checked pairs total: 87212 [2019-12-26 22:35:53,626 INFO L214 etLargeBlockEncoding]: Total number of compositions: 116 [2019-12-26 22:35:53,629 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 92 places, 100 transitions [2019-12-26 22:36:07,476 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 102314 states. [2019-12-26 22:36:07,478 INFO L276 IsEmpty]: Start isEmpty. Operand 102314 states. [2019-12-26 22:36:07,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-26 22:36:07,484 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:36:07,484 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-26 22:36:07,485 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-26 22:36:07,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:36:07,491 INFO L82 PathProgramCache]: Analyzing trace with hash 919766, now seen corresponding path program 1 times [2019-12-26 22:36:07,499 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:36:07,499 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292206055] [2019-12-26 22:36:07,499 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:36:07,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:36:07,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:36:07,729 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292206055] [2019-12-26 22:36:07,729 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:36:07,730 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-26 22:36:07,730 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79583936] [2019-12-26 22:36:07,735 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:36:07,736 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:36:07,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:36:07,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:36:07,752 INFO L87 Difference]: Start difference. First operand 102314 states. Second operand 3 states. [2019-12-26 22:36:09,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:36:09,889 INFO L93 Difference]: Finished difference Result 101544 states and 430594 transitions. [2019-12-26 22:36:09,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:36:09,891 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-26 22:36:09,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:36:10,443 INFO L225 Difference]: With dead ends: 101544 [2019-12-26 22:36:10,444 INFO L226 Difference]: Without dead ends: 95304 [2019-12-26 22:36:10,445 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:36:17,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95304 states. [2019-12-26 22:36:20,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95304 to 95304. [2019-12-26 22:36:20,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95304 states. [2019-12-26 22:36:20,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95304 states to 95304 states and 403554 transitions. [2019-12-26 22:36:20,687 INFO L78 Accepts]: Start accepts. Automaton has 95304 states and 403554 transitions. Word has length 3 [2019-12-26 22:36:20,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:36:20,687 INFO L462 AbstractCegarLoop]: Abstraction has 95304 states and 403554 transitions. [2019-12-26 22:36:20,687 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:36:20,687 INFO L276 IsEmpty]: Start isEmpty. Operand 95304 states and 403554 transitions. [2019-12-26 22:36:20,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-26 22:36:20,692 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:36:20,692 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:36:20,692 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-26 22:36:20,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:36:20,693 INFO L82 PathProgramCache]: Analyzing trace with hash -1982627867, now seen corresponding path program 1 times [2019-12-26 22:36:20,693 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:36:20,693 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482210275] [2019-12-26 22:36:20,693 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:36:20,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:36:20,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:36:20,799 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482210275] [2019-12-26 22:36:20,800 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:36:20,800 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 22:36:20,800 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400921530] [2019-12-26 22:36:20,802 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 22:36:20,802 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:36:20,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 22:36:20,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 22:36:20,803 INFO L87 Difference]: Start difference. First operand 95304 states and 403554 transitions. Second operand 4 states. [2019-12-26 22:36:25,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:36:25,623 INFO L93 Difference]: Finished difference Result 152040 states and 617140 transitions. [2019-12-26 22:36:25,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 22:36:25,624 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-26 22:36:25,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:36:26,288 INFO L225 Difference]: With dead ends: 152040 [2019-12-26 22:36:26,289 INFO L226 Difference]: Without dead ends: 151991 [2019-12-26 22:36:26,290 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-26 22:36:31,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151991 states. [2019-12-26 22:36:34,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151991 to 137801. [2019-12-26 22:36:34,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137801 states. [2019-12-26 22:36:35,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137801 states to 137801 states and 566928 transitions. [2019-12-26 22:36:35,320 INFO L78 Accepts]: Start accepts. Automaton has 137801 states and 566928 transitions. Word has length 11 [2019-12-26 22:36:35,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:36:35,320 INFO L462 AbstractCegarLoop]: Abstraction has 137801 states and 566928 transitions. [2019-12-26 22:36:35,320 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 22:36:35,320 INFO L276 IsEmpty]: Start isEmpty. Operand 137801 states and 566928 transitions. [2019-12-26 22:36:35,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-26 22:36:35,326 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:36:35,326 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:36:35,326 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-26 22:36:35,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:36:35,327 INFO L82 PathProgramCache]: Analyzing trace with hash -1673757482, now seen corresponding path program 1 times [2019-12-26 22:36:35,327 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:36:35,327 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160170221] [2019-12-26 22:36:35,327 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:36:35,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:36:35,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:36:35,394 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160170221] [2019-12-26 22:36:35,395 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:36:35,395 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 22:36:35,395 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579572818] [2019-12-26 22:36:35,395 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:36:35,395 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:36:35,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:36:35,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:36:35,396 INFO L87 Difference]: Start difference. First operand 137801 states and 566928 transitions. Second operand 3 states. [2019-12-26 22:36:35,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:36:35,519 INFO L93 Difference]: Finished difference Result 30915 states and 99823 transitions. [2019-12-26 22:36:35,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:36:35,520 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-26 22:36:35,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:36:35,585 INFO L225 Difference]: With dead ends: 30915 [2019-12-26 22:36:35,585 INFO L226 Difference]: Without dead ends: 30915 [2019-12-26 22:36:35,586 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:36:35,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30915 states. [2019-12-26 22:36:40,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30915 to 30915. [2019-12-26 22:36:40,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30915 states. [2019-12-26 22:36:40,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30915 states to 30915 states and 99823 transitions. [2019-12-26 22:36:40,396 INFO L78 Accepts]: Start accepts. Automaton has 30915 states and 99823 transitions. Word has length 13 [2019-12-26 22:36:40,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:36:40,396 INFO L462 AbstractCegarLoop]: Abstraction has 30915 states and 99823 transitions. [2019-12-26 22:36:40,396 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:36:40,396 INFO L276 IsEmpty]: Start isEmpty. Operand 30915 states and 99823 transitions. [2019-12-26 22:36:40,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-26 22:36:40,399 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:36:40,399 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:36:40,399 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-26 22:36:40,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:36:40,399 INFO L82 PathProgramCache]: Analyzing trace with hash 841711145, now seen corresponding path program 1 times [2019-12-26 22:36:40,400 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:36:40,400 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948066127] [2019-12-26 22:36:40,400 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:36:40,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:36:40,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:36:40,519 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948066127] [2019-12-26 22:36:40,519 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:36:40,520 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 22:36:40,520 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539058478] [2019-12-26 22:36:40,520 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 22:36:40,520 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:36:40,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 22:36:40,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 22:36:40,521 INFO L87 Difference]: Start difference. First operand 30915 states and 99823 transitions. Second operand 4 states. [2019-12-26 22:36:40,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:36:40,862 INFO L93 Difference]: Finished difference Result 38538 states and 124019 transitions. [2019-12-26 22:36:40,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 22:36:40,863 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-26 22:36:40,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:36:40,930 INFO L225 Difference]: With dead ends: 38538 [2019-12-26 22:36:40,930 INFO L226 Difference]: Without dead ends: 38538 [2019-12-26 22:36:40,931 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-26 22:36:41,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38538 states. [2019-12-26 22:36:41,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38538 to 34473. [2019-12-26 22:36:41,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34473 states. [2019-12-26 22:36:41,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34473 states to 34473 states and 111272 transitions. [2019-12-26 22:36:41,813 INFO L78 Accepts]: Start accepts. Automaton has 34473 states and 111272 transitions. Word has length 16 [2019-12-26 22:36:41,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:36:41,814 INFO L462 AbstractCegarLoop]: Abstraction has 34473 states and 111272 transitions. [2019-12-26 22:36:41,814 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 22:36:41,814 INFO L276 IsEmpty]: Start isEmpty. Operand 34473 states and 111272 transitions. [2019-12-26 22:36:41,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-26 22:36:41,822 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:36:41,823 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-26 22:36:41,823 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-26 22:36:41,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:36:41,823 INFO L82 PathProgramCache]: Analyzing trace with hash 361242897, now seen corresponding path program 1 times [2019-12-26 22:36:41,823 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:36:41,824 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345978448] [2019-12-26 22:36:41,824 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:36:41,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:36:41,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:36:41,907 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345978448] [2019-12-26 22:36:41,908 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:36:41,909 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 22:36:41,909 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202050538] [2019-12-26 22:36:41,909 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 22:36:41,910 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:36:41,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 22:36:41,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 22:36:41,910 INFO L87 Difference]: Start difference. First operand 34473 states and 111272 transitions. Second operand 5 states. [2019-12-26 22:36:42,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:36:42,491 INFO L93 Difference]: Finished difference Result 44779 states and 142105 transitions. [2019-12-26 22:36:42,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-26 22:36:42,491 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-26 22:36:42,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:36:42,560 INFO L225 Difference]: With dead ends: 44779 [2019-12-26 22:36:42,560 INFO L226 Difference]: Without dead ends: 44772 [2019-12-26 22:36:42,560 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-26 22:36:42,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44772 states. [2019-12-26 22:36:43,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44772 to 34062. [2019-12-26 22:36:43,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34062 states. [2019-12-26 22:36:43,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34062 states to 34062 states and 109831 transitions. [2019-12-26 22:36:43,625 INFO L78 Accepts]: Start accepts. Automaton has 34062 states and 109831 transitions. Word has length 22 [2019-12-26 22:36:43,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:36:43,625 INFO L462 AbstractCegarLoop]: Abstraction has 34062 states and 109831 transitions. [2019-12-26 22:36:43,625 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 22:36:43,625 INFO L276 IsEmpty]: Start isEmpty. Operand 34062 states and 109831 transitions. [2019-12-26 22:36:43,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-26 22:36:43,637 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:36:43,637 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:36:43,637 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-26 22:36:43,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:36:43,637 INFO L82 PathProgramCache]: Analyzing trace with hash -2019660134, now seen corresponding path program 1 times [2019-12-26 22:36:43,638 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:36:43,638 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691569822] [2019-12-26 22:36:43,638 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:36:43,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:36:43,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:36:43,700 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691569822] [2019-12-26 22:36:43,700 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:36:43,701 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 22:36:43,701 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583254469] [2019-12-26 22:36:43,701 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 22:36:43,701 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:36:43,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 22:36:43,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-26 22:36:43,702 INFO L87 Difference]: Start difference. First operand 34062 states and 109831 transitions. Second operand 4 states. [2019-12-26 22:36:43,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:36:43,766 INFO L93 Difference]: Finished difference Result 13768 states and 41803 transitions. [2019-12-26 22:36:43,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 22:36:43,766 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-26 22:36:43,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:36:43,786 INFO L225 Difference]: With dead ends: 13768 [2019-12-26 22:36:43,786 INFO L226 Difference]: Without dead ends: 13768 [2019-12-26 22:36:43,786 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-26 22:36:43,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13768 states. [2019-12-26 22:36:43,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13768 to 13468. [2019-12-26 22:36:43,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13468 states. [2019-12-26 22:36:43,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13468 states to 13468 states and 40947 transitions. [2019-12-26 22:36:43,988 INFO L78 Accepts]: Start accepts. Automaton has 13468 states and 40947 transitions. Word has length 25 [2019-12-26 22:36:43,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:36:43,988 INFO L462 AbstractCegarLoop]: Abstraction has 13468 states and 40947 transitions. [2019-12-26 22:36:43,988 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 22:36:43,988 INFO L276 IsEmpty]: Start isEmpty. Operand 13468 states and 40947 transitions. [2019-12-26 22:36:43,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-26 22:36:43,997 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:36:43,998 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-26 22:36:43,998 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-26 22:36:43,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:36:43,998 INFO L82 PathProgramCache]: Analyzing trace with hash -1429942457, now seen corresponding path program 1 times [2019-12-26 22:36:43,999 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:36:43,999 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524659195] [2019-12-26 22:36:43,999 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:36:44,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:36:44,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:36:44,053 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524659195] [2019-12-26 22:36:44,053 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:36:44,053 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 22:36:44,054 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373830447] [2019-12-26 22:36:44,054 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:36:44,054 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:36:44,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:36:44,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:36:44,055 INFO L87 Difference]: Start difference. First operand 13468 states and 40947 transitions. Second operand 3 states. [2019-12-26 22:36:44,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:36:44,155 INFO L93 Difference]: Finished difference Result 19309 states and 57773 transitions. [2019-12-26 22:36:44,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:36:44,156 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-12-26 22:36:44,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:36:44,189 INFO L225 Difference]: With dead ends: 19309 [2019-12-26 22:36:44,189 INFO L226 Difference]: Without dead ends: 19309 [2019-12-26 22:36:44,189 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:36:44,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19309 states. [2019-12-26 22:36:44,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19309 to 14214. [2019-12-26 22:36:44,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14214 states. [2019-12-26 22:36:44,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14214 states to 14214 states and 43085 transitions. [2019-12-26 22:36:44,443 INFO L78 Accepts]: Start accepts. Automaton has 14214 states and 43085 transitions. Word has length 27 [2019-12-26 22:36:44,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:36:44,443 INFO L462 AbstractCegarLoop]: Abstraction has 14214 states and 43085 transitions. [2019-12-26 22:36:44,443 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:36:44,444 INFO L276 IsEmpty]: Start isEmpty. Operand 14214 states and 43085 transitions. [2019-12-26 22:36:44,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-26 22:36:44,453 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:36:44,453 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-26 22:36:44,453 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-26 22:36:44,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:36:44,453 INFO L82 PathProgramCache]: Analyzing trace with hash -535275942, now seen corresponding path program 1 times [2019-12-26 22:36:44,453 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:36:44,454 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298134480] [2019-12-26 22:36:44,454 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:36:44,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:36:44,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:36:44,508 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298134480] [2019-12-26 22:36:44,508 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:36:44,508 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 22:36:44,509 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390613097] [2019-12-26 22:36:44,509 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:36:44,509 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:36:44,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:36:44,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:36:44,510 INFO L87 Difference]: Start difference. First operand 14214 states and 43085 transitions. Second operand 3 states. [2019-12-26 22:36:44,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:36:44,595 INFO L93 Difference]: Finished difference Result 21037 states and 62324 transitions. [2019-12-26 22:36:44,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:36:44,595 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-12-26 22:36:44,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:36:44,622 INFO L225 Difference]: With dead ends: 21037 [2019-12-26 22:36:44,622 INFO L226 Difference]: Without dead ends: 21037 [2019-12-26 22:36:44,622 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:36:44,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21037 states. [2019-12-26 22:36:45,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21037 to 15942. [2019-12-26 22:36:45,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15942 states. [2019-12-26 22:36:45,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15942 states to 15942 states and 47636 transitions. [2019-12-26 22:36:45,126 INFO L78 Accepts]: Start accepts. Automaton has 15942 states and 47636 transitions. Word has length 27 [2019-12-26 22:36:45,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:36:45,126 INFO L462 AbstractCegarLoop]: Abstraction has 15942 states and 47636 transitions. [2019-12-26 22:36:45,126 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:36:45,126 INFO L276 IsEmpty]: Start isEmpty. Operand 15942 states and 47636 transitions. [2019-12-26 22:36:45,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-26 22:36:45,139 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:36:45,139 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-26 22:36:45,139 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-26 22:36:45,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:36:45,139 INFO L82 PathProgramCache]: Analyzing trace with hash 1457952739, now seen corresponding path program 1 times [2019-12-26 22:36:45,140 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:36:45,140 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272489838] [2019-12-26 22:36:45,140 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:36:45,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:36:45,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-26 22:36:45,237 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272489838] [2019-12-26 22:36:45,238 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:36:45,238 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 22:36:45,238 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031349410] [2019-12-26 22:36:45,238 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 22:36:45,239 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:36:45,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 22:36:45,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-26 22:36:45,240 INFO L87 Difference]: Start difference. First operand 15942 states and 47636 transitions. Second operand 6 states. [2019-12-26 22:36:45,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:36:45,816 INFO L93 Difference]: Finished difference Result 29609 states and 87623 transitions. [2019-12-26 22:36:45,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-26 22:36:45,817 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-26 22:36:45,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:36:45,856 INFO L225 Difference]: With dead ends: 29609 [2019-12-26 22:36:45,856 INFO L226 Difference]: Without dead ends: 29609 [2019-12-26 22:36:45,856 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-12-26 22:36:45,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29609 states. [2019-12-26 22:36:46,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29609 to 18458. [2019-12-26 22:36:46,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18458 states. [2019-12-26 22:36:46,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18458 states to 18458 states and 55021 transitions. [2019-12-26 22:36:46,201 INFO L78 Accepts]: Start accepts. Automaton has 18458 states and 55021 transitions. Word has length 27 [2019-12-26 22:36:46,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:36:46,202 INFO L462 AbstractCegarLoop]: Abstraction has 18458 states and 55021 transitions. [2019-12-26 22:36:46,202 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 22:36:46,202 INFO L276 IsEmpty]: Start isEmpty. Operand 18458 states and 55021 transitions. [2019-12-26 22:36:46,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-26 22:36:46,215 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:36:46,215 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-26 22:36:46,215 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-26 22:36:46,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:36:46,215 INFO L82 PathProgramCache]: Analyzing trace with hash 294567066, now seen corresponding path program 1 times [2019-12-26 22:36:46,216 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:36:46,216 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455119443] [2019-12-26 22:36:46,216 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:36:46,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:36:46,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:36:46,296 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455119443] [2019-12-26 22:36:46,297 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:36:46,297 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 22:36:46,297 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065039028] [2019-12-26 22:36:46,297 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 22:36:46,297 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:36:46,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 22:36:46,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-26 22:36:46,298 INFO L87 Difference]: Start difference. First operand 18458 states and 55021 transitions. Second operand 6 states. [2019-12-26 22:36:46,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:36:46,873 INFO L93 Difference]: Finished difference Result 28968 states and 85211 transitions. [2019-12-26 22:36:46,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-26 22:36:46,873 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2019-12-26 22:36:46,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:36:46,910 INFO L225 Difference]: With dead ends: 28968 [2019-12-26 22:36:46,910 INFO L226 Difference]: Without dead ends: 28968 [2019-12-26 22:36:46,911 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-12-26 22:36:46,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28968 states. [2019-12-26 22:36:47,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28968 to 18220. [2019-12-26 22:36:47,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18220 states. [2019-12-26 22:36:47,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18220 states to 18220 states and 54222 transitions. [2019-12-26 22:36:47,516 INFO L78 Accepts]: Start accepts. Automaton has 18220 states and 54222 transitions. Word has length 28 [2019-12-26 22:36:47,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:36:47,516 INFO L462 AbstractCegarLoop]: Abstraction has 18220 states and 54222 transitions. [2019-12-26 22:36:47,516 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 22:36:47,516 INFO L276 IsEmpty]: Start isEmpty. Operand 18220 states and 54222 transitions. [2019-12-26 22:36:47,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-26 22:36:47,535 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:36:47,535 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:36:47,535 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-26 22:36:47,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:36:47,535 INFO L82 PathProgramCache]: Analyzing trace with hash 1705939963, now seen corresponding path program 1 times [2019-12-26 22:36:47,536 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:36:47,536 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522936752] [2019-12-26 22:36:47,536 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:36:47,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:36:47,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:36:47,642 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522936752] [2019-12-26 22:36:47,643 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:36:47,643 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 22:36:47,643 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490477609] [2019-12-26 22:36:47,643 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 22:36:47,644 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:36:47,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 22:36:47,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-26 22:36:47,645 INFO L87 Difference]: Start difference. First operand 18220 states and 54222 transitions. Second operand 7 states. [2019-12-26 22:36:48,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:36:48,847 INFO L93 Difference]: Finished difference Result 38372 states and 112342 transitions. [2019-12-26 22:36:48,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-26 22:36:48,847 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-26 22:36:48,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:36:48,907 INFO L225 Difference]: With dead ends: 38372 [2019-12-26 22:36:48,907 INFO L226 Difference]: Without dead ends: 38372 [2019-12-26 22:36:48,907 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=253, Unknown=0, NotChecked=0, Total=342 [2019-12-26 22:36:49,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38372 states. [2019-12-26 22:36:49,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38372 to 20063. [2019-12-26 22:36:49,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20063 states. [2019-12-26 22:36:49,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20063 states to 20063 states and 59759 transitions. [2019-12-26 22:36:49,321 INFO L78 Accepts]: Start accepts. Automaton has 20063 states and 59759 transitions. Word has length 33 [2019-12-26 22:36:49,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:36:49,322 INFO L462 AbstractCegarLoop]: Abstraction has 20063 states and 59759 transitions. [2019-12-26 22:36:49,322 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 22:36:49,322 INFO L276 IsEmpty]: Start isEmpty. Operand 20063 states and 59759 transitions. [2019-12-26 22:36:49,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-26 22:36:49,340 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:36:49,341 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-26 22:36:49,341 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-26 22:36:49,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:36:49,341 INFO L82 PathProgramCache]: Analyzing trace with hash 1567643153, now seen corresponding path program 2 times [2019-12-26 22:36:49,341 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:36:49,342 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055263927] [2019-12-26 22:36:49,342 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:36:49,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:36:49,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:36:49,513 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055263927] [2019-12-26 22:36:49,513 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:36:49,514 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 22:36:49,514 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738347169] [2019-12-26 22:36:49,516 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-26 22:36:49,516 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:36:49,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-26 22:36:49,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-26 22:36:49,517 INFO L87 Difference]: Start difference. First operand 20063 states and 59759 transitions. Second operand 8 states. [2019-12-26 22:36:51,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:36:51,557 INFO L93 Difference]: Finished difference Result 45317 states and 131735 transitions. [2019-12-26 22:36:51,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-26 22:36:51,557 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 33 [2019-12-26 22:36:51,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:36:51,633 INFO L225 Difference]: With dead ends: 45317 [2019-12-26 22:36:51,634 INFO L226 Difference]: Without dead ends: 45317 [2019-12-26 22:36:51,634 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 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-26 22:36:51,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45317 states. [2019-12-26 22:36:52,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45317 to 19503. [2019-12-26 22:36:52,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19503 states. [2019-12-26 22:36:52,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19503 states to 19503 states and 58091 transitions. [2019-12-26 22:36:52,081 INFO L78 Accepts]: Start accepts. Automaton has 19503 states and 58091 transitions. Word has length 33 [2019-12-26 22:36:52,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:36:52,081 INFO L462 AbstractCegarLoop]: Abstraction has 19503 states and 58091 transitions. [2019-12-26 22:36:52,082 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-26 22:36:52,082 INFO L276 IsEmpty]: Start isEmpty. Operand 19503 states and 58091 transitions. [2019-12-26 22:36:52,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-26 22:36:52,098 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:36:52,099 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:36:52,099 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-26 22:36:52,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:36:52,099 INFO L82 PathProgramCache]: Analyzing trace with hash -607763582, now seen corresponding path program 1 times [2019-12-26 22:36:52,099 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:36:52,100 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368832554] [2019-12-26 22:36:52,100 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:36:52,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:36:52,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:36:52,219 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368832554] [2019-12-26 22:36:52,219 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:36:52,219 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 22:36:52,220 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118070176] [2019-12-26 22:36:52,220 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 22:36:52,220 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:36:52,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 22:36:52,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-26 22:36:52,221 INFO L87 Difference]: Start difference. First operand 19503 states and 58091 transitions. Second operand 7 states. [2019-12-26 22:36:53,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:36:53,518 INFO L93 Difference]: Finished difference Result 34977 states and 102254 transitions. [2019-12-26 22:36:53,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-26 22:36:53,518 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2019-12-26 22:36:53,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:36:53,570 INFO L225 Difference]: With dead ends: 34977 [2019-12-26 22:36:53,571 INFO L226 Difference]: Without dead ends: 34977 [2019-12-26 22:36:53,571 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=253, Unknown=0, NotChecked=0, Total=342 [2019-12-26 22:36:53,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34977 states. [2019-12-26 22:36:54,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34977 to 18371. [2019-12-26 22:36:54,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18371 states. [2019-12-26 22:36:54,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18371 states to 18371 states and 54788 transitions. [2019-12-26 22:36:54,258 INFO L78 Accepts]: Start accepts. Automaton has 18371 states and 54788 transitions. Word has length 34 [2019-12-26 22:36:54,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:36:54,258 INFO L462 AbstractCegarLoop]: Abstraction has 18371 states and 54788 transitions. [2019-12-26 22:36:54,259 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 22:36:54,259 INFO L276 IsEmpty]: Start isEmpty. Operand 18371 states and 54788 transitions. [2019-12-26 22:36:54,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-26 22:36:54,275 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:36:54,275 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-26 22:36:54,276 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-26 22:36:54,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:36:54,276 INFO L82 PathProgramCache]: Analyzing trace with hash 846412022, now seen corresponding path program 2 times [2019-12-26 22:36:54,276 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:36:54,276 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366868470] [2019-12-26 22:36:54,276 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:36:54,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:36:54,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:36:54,367 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366868470] [2019-12-26 22:36:54,367 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:36:54,367 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 22:36:54,367 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910839964] [2019-12-26 22:36:54,367 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 22:36:54,368 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:36:54,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 22:36:54,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-26 22:36:54,368 INFO L87 Difference]: Start difference. First operand 18371 states and 54788 transitions. Second operand 7 states. [2019-12-26 22:36:55,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:36:55,659 INFO L93 Difference]: Finished difference Result 43257 states and 125033 transitions. [2019-12-26 22:36:55,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-26 22:36:55,659 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2019-12-26 22:36:55,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:36:55,717 INFO L225 Difference]: With dead ends: 43257 [2019-12-26 22:36:55,717 INFO L226 Difference]: Without dead ends: 43257 [2019-12-26 22:36:55,718 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=225, Unknown=0, NotChecked=0, Total=306 [2019-12-26 22:36:55,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43257 states. [2019-12-26 22:36:56,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43257 to 17826. [2019-12-26 22:36:56,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17826 states. [2019-12-26 22:36:56,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17826 states to 17826 states and 53180 transitions. [2019-12-26 22:36:56,160 INFO L78 Accepts]: Start accepts. Automaton has 17826 states and 53180 transitions. Word has length 34 [2019-12-26 22:36:56,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:36:56,160 INFO L462 AbstractCegarLoop]: Abstraction has 17826 states and 53180 transitions. [2019-12-26 22:36:56,160 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 22:36:56,160 INFO L276 IsEmpty]: Start isEmpty. Operand 17826 states and 53180 transitions. [2019-12-26 22:36:56,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-26 22:36:56,175 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:36:56,175 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-26 22:36:56,175 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-26 22:36:56,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:36:56,175 INFO L82 PathProgramCache]: Analyzing trace with hash -211414604, now seen corresponding path program 3 times [2019-12-26 22:36:56,176 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:36:56,176 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529076389] [2019-12-26 22:36:56,176 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:36:56,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:36:56,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:36:56,281 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529076389] [2019-12-26 22:36:56,281 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:36:56,281 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 22:36:56,282 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165990577] [2019-12-26 22:36:56,282 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-26 22:36:56,282 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:36:56,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-26 22:36:56,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-26 22:36:56,283 INFO L87 Difference]: Start difference. First operand 17826 states and 53180 transitions. Second operand 8 states. [2019-12-26 22:36:57,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:36:57,782 INFO L93 Difference]: Finished difference Result 39307 states and 113638 transitions. [2019-12-26 22:36:57,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-26 22:36:57,783 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 34 [2019-12-26 22:36:57,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:36:57,851 INFO L225 Difference]: With dead ends: 39307 [2019-12-26 22:36:57,851 INFO L226 Difference]: Without dead ends: 39307 [2019-12-26 22:36:57,852 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=161, Invalid=489, Unknown=0, NotChecked=0, Total=650 [2019-12-26 22:36:57,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39307 states. [2019-12-26 22:36:58,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39307 to 16673. [2019-12-26 22:36:58,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16673 states. [2019-12-26 22:36:58,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16673 states to 16673 states and 49752 transitions. [2019-12-26 22:36:58,472 INFO L78 Accepts]: Start accepts. Automaton has 16673 states and 49752 transitions. Word has length 34 [2019-12-26 22:36:58,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:36:58,472 INFO L462 AbstractCegarLoop]: Abstraction has 16673 states and 49752 transitions. [2019-12-26 22:36:58,472 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-26 22:36:58,472 INFO L276 IsEmpty]: Start isEmpty. Operand 16673 states and 49752 transitions. [2019-12-26 22:36:58,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-26 22:36:58,494 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:36:58,494 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-26 22:36:58,495 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-26 22:36:58,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:36:58,495 INFO L82 PathProgramCache]: Analyzing trace with hash -273721601, now seen corresponding path program 1 times [2019-12-26 22:36:58,495 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:36:58,495 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064340412] [2019-12-26 22:36:58,496 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:36:58,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:36:58,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:36:58,550 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064340412] [2019-12-26 22:36:58,550 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:36:58,551 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-26 22:36:58,551 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050754992] [2019-12-26 22:36:58,551 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:36:58,551 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:36:58,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:36:58,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:36:58,552 INFO L87 Difference]: Start difference. First operand 16673 states and 49752 transitions. Second operand 3 states. [2019-12-26 22:36:58,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:36:58,613 INFO L93 Difference]: Finished difference Result 16672 states and 49750 transitions. [2019-12-26 22:36:58,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:36:58,614 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-26 22:36:58,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:36:58,642 INFO L225 Difference]: With dead ends: 16672 [2019-12-26 22:36:58,643 INFO L226 Difference]: Without dead ends: 16672 [2019-12-26 22:36:58,643 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:36:58,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16672 states. [2019-12-26 22:36:58,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16672 to 16672. [2019-12-26 22:36:58,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16672 states. [2019-12-26 22:36:58,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16672 states to 16672 states and 49750 transitions. [2019-12-26 22:36:58,886 INFO L78 Accepts]: Start accepts. Automaton has 16672 states and 49750 transitions. Word has length 39 [2019-12-26 22:36:58,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:36:58,886 INFO L462 AbstractCegarLoop]: Abstraction has 16672 states and 49750 transitions. [2019-12-26 22:36:58,886 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:36:58,886 INFO L276 IsEmpty]: Start isEmpty. Operand 16672 states and 49750 transitions. [2019-12-26 22:36:58,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-26 22:36:58,906 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:36:58,906 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-26 22:36:58,906 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-26 22:36:58,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:36:58,906 INFO L82 PathProgramCache]: Analyzing trace with hash -1365979560, now seen corresponding path program 1 times [2019-12-26 22:36:58,907 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:36:58,907 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619898915] [2019-12-26 22:36:58,907 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:36:58,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:36:58,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:36:58,980 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619898915] [2019-12-26 22:36:58,980 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:36:58,980 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 22:36:58,980 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623332773] [2019-12-26 22:36:58,980 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 22:36:58,981 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:36:58,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 22:36:58,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 22:36:58,981 INFO L87 Difference]: Start difference. First operand 16672 states and 49750 transitions. Second operand 5 states. [2019-12-26 22:36:59,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:36:59,602 INFO L93 Difference]: Finished difference Result 27362 states and 80459 transitions. [2019-12-26 22:36:59,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-26 22:36:59,603 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-26 22:36:59,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:36:59,658 INFO L225 Difference]: With dead ends: 27362 [2019-12-26 22:36:59,658 INFO L226 Difference]: Without dead ends: 27362 [2019-12-26 22:36:59,658 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 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-26 22:36:59,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27362 states. [2019-12-26 22:37:00,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27362 to 21734. [2019-12-26 22:37:00,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21734 states. [2019-12-26 22:37:00,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21734 states to 21734 states and 64728 transitions. [2019-12-26 22:37:00,090 INFO L78 Accepts]: Start accepts. Automaton has 21734 states and 64728 transitions. Word has length 40 [2019-12-26 22:37:00,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:37:00,091 INFO L462 AbstractCegarLoop]: Abstraction has 21734 states and 64728 transitions. [2019-12-26 22:37:00,091 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 22:37:00,091 INFO L276 IsEmpty]: Start isEmpty. Operand 21734 states and 64728 transitions. [2019-12-26 22:37:00,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-26 22:37:00,112 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:37:00,112 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-26 22:37:00,112 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-26 22:37:00,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:37:00,113 INFO L82 PathProgramCache]: Analyzing trace with hash -2145844780, now seen corresponding path program 2 times [2019-12-26 22:37:00,113 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:37:00,113 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630902645] [2019-12-26 22:37:00,113 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:37:00,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:37:00,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:37:00,169 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630902645] [2019-12-26 22:37:00,169 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:37:00,170 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 22:37:00,170 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272654848] [2019-12-26 22:37:00,170 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 22:37:00,170 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:37:00,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 22:37:00,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-26 22:37:00,171 INFO L87 Difference]: Start difference. First operand 21734 states and 64728 transitions. Second operand 5 states. [2019-12-26 22:37:00,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:37:00,497 INFO L93 Difference]: Finished difference Result 20430 states and 61764 transitions. [2019-12-26 22:37:00,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 22:37:00,497 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-26 22:37:00,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:37:00,535 INFO L225 Difference]: With dead ends: 20430 [2019-12-26 22:37:00,535 INFO L226 Difference]: Without dead ends: 20430 [2019-12-26 22:37:00,536 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-26 22:37:00,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20430 states. [2019-12-26 22:37:00,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20430 to 19562. [2019-12-26 22:37:00,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19562 states. [2019-12-26 22:37:00,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19562 states to 19562 states and 59424 transitions. [2019-12-26 22:37:00,872 INFO L78 Accepts]: Start accepts. Automaton has 19562 states and 59424 transitions. Word has length 40 [2019-12-26 22:37:00,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:37:00,873 INFO L462 AbstractCegarLoop]: Abstraction has 19562 states and 59424 transitions. [2019-12-26 22:37:00,873 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 22:37:00,873 INFO L276 IsEmpty]: Start isEmpty. Operand 19562 states and 59424 transitions. [2019-12-26 22:37:00,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-26 22:37:00,893 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:37:00,893 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-26 22:37:00,893 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-26 22:37:00,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:37:00,894 INFO L82 PathProgramCache]: Analyzing trace with hash -628796059, now seen corresponding path program 1 times [2019-12-26 22:37:00,894 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:37:00,894 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792559004] [2019-12-26 22:37:00,894 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:37:00,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:37:01,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:37:01,007 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792559004] [2019-12-26 22:37:01,007 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:37:01,007 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-26 22:37:01,007 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305345674] [2019-12-26 22:37:01,008 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-26 22:37:01,008 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:37:01,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-26 22:37:01,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-26 22:37:01,009 INFO L87 Difference]: Start difference. First operand 19562 states and 59424 transitions. Second operand 8 states. [2019-12-26 22:37:02,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:37:02,410 INFO L93 Difference]: Finished difference Result 91773 states and 275275 transitions. [2019-12-26 22:37:02,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-26 22:37:02,411 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 64 [2019-12-26 22:37:02,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:37:02,506 INFO L225 Difference]: With dead ends: 91773 [2019-12-26 22:37:02,506 INFO L226 Difference]: Without dead ends: 65597 [2019-12-26 22:37:02,507 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=145, Invalid=455, Unknown=0, NotChecked=0, Total=600 [2019-12-26 22:37:02,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65597 states. [2019-12-26 22:37:03,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65597 to 23373. [2019-12-26 22:37:03,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23373 states. [2019-12-26 22:37:03,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23373 states to 23373 states and 71220 transitions. [2019-12-26 22:37:03,616 INFO L78 Accepts]: Start accepts. Automaton has 23373 states and 71220 transitions. Word has length 64 [2019-12-26 22:37:03,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:37:03,616 INFO L462 AbstractCegarLoop]: Abstraction has 23373 states and 71220 transitions. [2019-12-26 22:37:03,616 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-26 22:37:03,616 INFO L276 IsEmpty]: Start isEmpty. Operand 23373 states and 71220 transitions. [2019-12-26 22:37:03,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-26 22:37:03,642 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:37:03,642 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:37:03,642 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-26 22:37:03,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:37:03,643 INFO L82 PathProgramCache]: Analyzing trace with hash 637274751, now seen corresponding path program 2 times [2019-12-26 22:37:03,643 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:37:03,643 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180247311] [2019-12-26 22:37:03,643 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:37:03,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:37:03,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:37:03,735 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180247311] [2019-12-26 22:37:03,735 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:37:03,735 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 22:37:03,736 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642585723] [2019-12-26 22:37:03,736 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 22:37:03,736 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:37:03,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 22:37:03,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-26 22:37:03,737 INFO L87 Difference]: Start difference. First operand 23373 states and 71220 transitions. Second operand 7 states. [2019-12-26 22:37:04,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:37:04,403 INFO L93 Difference]: Finished difference Result 62216 states and 186100 transitions. [2019-12-26 22:37:04,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-26 22:37:04,403 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-26 22:37:04,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:37:04,486 INFO L225 Difference]: With dead ends: 62216 [2019-12-26 22:37:04,486 INFO L226 Difference]: Without dead ends: 45804 [2019-12-26 22:37:04,486 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-26 22:37:04,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45804 states. [2019-12-26 22:37:05,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45804 to 27436. [2019-12-26 22:37:05,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27436 states. [2019-12-26 22:37:05,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27436 states to 27436 states and 83052 transitions. [2019-12-26 22:37:05,058 INFO L78 Accepts]: Start accepts. Automaton has 27436 states and 83052 transitions. Word has length 64 [2019-12-26 22:37:05,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:37:05,058 INFO L462 AbstractCegarLoop]: Abstraction has 27436 states and 83052 transitions. [2019-12-26 22:37:05,058 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 22:37:05,058 INFO L276 IsEmpty]: Start isEmpty. Operand 27436 states and 83052 transitions. [2019-12-26 22:37:05,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-26 22:37:05,087 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:37:05,087 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-26 22:37:05,087 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-26 22:37:05,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:37:05,088 INFO L82 PathProgramCache]: Analyzing trace with hash 914424357, now seen corresponding path program 3 times [2019-12-26 22:37:05,088 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:37:05,088 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412510050] [2019-12-26 22:37:05,088 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:37:05,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:37:05,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:37:05,220 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412510050] [2019-12-26 22:37:05,222 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:37:05,222 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-26 22:37:05,222 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577847171] [2019-12-26 22:37:05,223 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-26 22:37:05,223 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:37:05,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-26 22:37:05,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-26 22:37:05,223 INFO L87 Difference]: Start difference. First operand 27436 states and 83052 transitions. Second operand 9 states. [2019-12-26 22:37:07,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:37:07,060 INFO L93 Difference]: Finished difference Result 113274 states and 335950 transitions. [2019-12-26 22:37:07,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-26 22:37:07,060 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2019-12-26 22:37:07,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:37:07,205 INFO L225 Difference]: With dead ends: 113274 [2019-12-26 22:37:07,206 INFO L226 Difference]: Without dead ends: 108630 [2019-12-26 22:37:07,206 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=157, Invalid=493, Unknown=0, NotChecked=0, Total=650 [2019-12-26 22:37:07,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108630 states. [2019-12-26 22:37:08,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108630 to 27989. [2019-12-26 22:37:08,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27989 states. [2019-12-26 22:37:08,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27989 states to 27989 states and 84776 transitions. [2019-12-26 22:37:08,177 INFO L78 Accepts]: Start accepts. Automaton has 27989 states and 84776 transitions. Word has length 64 [2019-12-26 22:37:08,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:37:08,177 INFO L462 AbstractCegarLoop]: Abstraction has 27989 states and 84776 transitions. [2019-12-26 22:37:08,177 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-26 22:37:08,178 INFO L276 IsEmpty]: Start isEmpty. Operand 27989 states and 84776 transitions. [2019-12-26 22:37:08,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-26 22:37:08,207 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:37:08,207 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-26 22:37:08,208 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-26 22:37:08,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:37:08,208 INFO L82 PathProgramCache]: Analyzing trace with hash -972318627, now seen corresponding path program 4 times [2019-12-26 22:37:08,208 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:37:08,208 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002351171] [2019-12-26 22:37:08,209 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:37:08,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:37:08,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:37:08,311 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002351171] [2019-12-26 22:37:08,314 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:37:08,314 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-26 22:37:08,314 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605591391] [2019-12-26 22:37:08,315 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-26 22:37:08,315 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:37:08,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-26 22:37:08,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-26 22:37:08,318 INFO L87 Difference]: Start difference. First operand 27989 states and 84776 transitions. Second operand 9 states. [2019-12-26 22:37:09,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:37:09,763 INFO L93 Difference]: Finished difference Result 91424 states and 271569 transitions. [2019-12-26 22:37:09,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-26 22:37:09,764 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2019-12-26 22:37:09,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:37:09,885 INFO L225 Difference]: With dead ends: 91424 [2019-12-26 22:37:09,886 INFO L226 Difference]: Without dead ends: 87972 [2019-12-26 22:37:09,886 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-26 22:37:10,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87972 states. [2019-12-26 22:37:11,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87972 to 27789. [2019-12-26 22:37:11,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27789 states. [2019-12-26 22:37:11,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27789 states to 27789 states and 84305 transitions. [2019-12-26 22:37:11,094 INFO L78 Accepts]: Start accepts. Automaton has 27789 states and 84305 transitions. Word has length 64 [2019-12-26 22:37:11,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:37:11,095 INFO L462 AbstractCegarLoop]: Abstraction has 27789 states and 84305 transitions. [2019-12-26 22:37:11,095 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-26 22:37:11,095 INFO L276 IsEmpty]: Start isEmpty. Operand 27789 states and 84305 transitions. [2019-12-26 22:37:11,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-26 22:37:11,123 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:37:11,124 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-26 22:37:11,124 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-26 22:37:11,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:37:11,124 INFO L82 PathProgramCache]: Analyzing trace with hash 849472763, now seen corresponding path program 5 times [2019-12-26 22:37:11,124 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:37:11,125 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544604175] [2019-12-26 22:37:11,125 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:37:11,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:37:11,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:37:11,210 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544604175] [2019-12-26 22:37:11,210 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:37:11,210 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 22:37:11,210 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382655891] [2019-12-26 22:37:11,211 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 22:37:11,211 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:37:11,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 22:37:11,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-26 22:37:11,211 INFO L87 Difference]: Start difference. First operand 27789 states and 84305 transitions. Second operand 7 states. [2019-12-26 22:37:11,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:37:11,764 INFO L93 Difference]: Finished difference Result 58989 states and 175462 transitions. [2019-12-26 22:37:11,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-26 22:37:11,765 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-26 22:37:11,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:37:11,841 INFO L225 Difference]: With dead ends: 58989 [2019-12-26 22:37:11,841 INFO L226 Difference]: Without dead ends: 49515 [2019-12-26 22:37:11,841 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-26 22:37:11,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49515 states. [2019-12-26 22:37:12,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49515 to 28125. [2019-12-26 22:37:12,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28125 states. [2019-12-26 22:37:12,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28125 states to 28125 states and 85287 transitions. [2019-12-26 22:37:12,796 INFO L78 Accepts]: Start accepts. Automaton has 28125 states and 85287 transitions. Word has length 64 [2019-12-26 22:37:12,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:37:12,796 INFO L462 AbstractCegarLoop]: Abstraction has 28125 states and 85287 transitions. [2019-12-26 22:37:12,796 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 22:37:12,796 INFO L276 IsEmpty]: Start isEmpty. Operand 28125 states and 85287 transitions. [2019-12-26 22:37:12,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-26 22:37:12,826 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:37:12,826 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-26 22:37:12,827 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-26 22:37:12,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:37:12,827 INFO L82 PathProgramCache]: Analyzing trace with hash -520581691, now seen corresponding path program 6 times [2019-12-26 22:37:12,827 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:37:12,827 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533759624] [2019-12-26 22:37:12,827 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:37:12,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:37:12,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:37:12,932 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533759624] [2019-12-26 22:37:12,932 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:37:12,933 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-26 22:37:12,933 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664329048] [2019-12-26 22:37:12,934 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 22:37:12,935 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:37:12,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 22:37:12,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-26 22:37:12,935 INFO L87 Difference]: Start difference. First operand 28125 states and 85287 transitions. Second operand 7 states. [2019-12-26 22:37:14,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:37:14,565 INFO L93 Difference]: Finished difference Result 52488 states and 157602 transitions. [2019-12-26 22:37:14,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-26 22:37:14,566 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-26 22:37:14,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:37:14,642 INFO L225 Difference]: With dead ends: 52488 [2019-12-26 22:37:14,642 INFO L226 Difference]: Without dead ends: 52488 [2019-12-26 22:37:14,642 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=93, Invalid=249, Unknown=0, NotChecked=0, Total=342 [2019-12-26 22:37:14,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52488 states. [2019-12-26 22:37:15,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52488 to 28461. [2019-12-26 22:37:15,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28461 states. [2019-12-26 22:37:15,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28461 states to 28461 states and 86415 transitions. [2019-12-26 22:37:15,288 INFO L78 Accepts]: Start accepts. Automaton has 28461 states and 86415 transitions. Word has length 64 [2019-12-26 22:37:15,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:37:15,288 INFO L462 AbstractCegarLoop]: Abstraction has 28461 states and 86415 transitions. [2019-12-26 22:37:15,289 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 22:37:15,289 INFO L276 IsEmpty]: Start isEmpty. Operand 28461 states and 86415 transitions. [2019-12-26 22:37:15,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-26 22:37:15,320 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:37:15,320 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-26 22:37:15,321 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-26 22:37:15,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:37:15,321 INFO L82 PathProgramCache]: Analyzing trace with hash -1624619189, now seen corresponding path program 7 times [2019-12-26 22:37:15,321 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:37:15,321 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329007171] [2019-12-26 22:37:15,321 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:37:15,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:37:15,458 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:37:15,459 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329007171] [2019-12-26 22:37:15,459 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:37:15,459 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-26 22:37:15,459 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445556168] [2019-12-26 22:37:15,460 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-26 22:37:15,460 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:37:15,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-26 22:37:15,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-26 22:37:15,460 INFO L87 Difference]: Start difference. First operand 28461 states and 86415 transitions. Second operand 8 states. [2019-12-26 22:37:17,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:37:17,691 INFO L93 Difference]: Finished difference Result 56163 states and 169173 transitions. [2019-12-26 22:37:17,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-26 22:37:17,692 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 64 [2019-12-26 22:37:17,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:37:17,766 INFO L225 Difference]: With dead ends: 56163 [2019-12-26 22:37:17,766 INFO L226 Difference]: Without dead ends: 56163 [2019-12-26 22:37:17,766 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2019-12-26 22:37:17,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56163 states. [2019-12-26 22:37:18,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56163 to 28489. [2019-12-26 22:37:18,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28489 states. [2019-12-26 22:37:18,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28489 states to 28489 states and 86495 transitions. [2019-12-26 22:37:18,384 INFO L78 Accepts]: Start accepts. Automaton has 28489 states and 86495 transitions. Word has length 64 [2019-12-26 22:37:18,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:37:18,384 INFO L462 AbstractCegarLoop]: Abstraction has 28489 states and 86495 transitions. [2019-12-26 22:37:18,384 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-26 22:37:18,384 INFO L276 IsEmpty]: Start isEmpty. Operand 28489 states and 86495 transitions. [2019-12-26 22:37:18,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-26 22:37:18,413 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:37:18,413 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-26 22:37:18,413 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-26 22:37:18,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:37:18,413 INFO L82 PathProgramCache]: Analyzing trace with hash 2090754765, now seen corresponding path program 8 times [2019-12-26 22:37:18,414 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:37:18,414 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817750267] [2019-12-26 22:37:18,414 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:37:18,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:37:18,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:37:18,474 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817750267] [2019-12-26 22:37:18,474 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:37:18,474 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 22:37:18,474 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811107429] [2019-12-26 22:37:18,474 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:37:18,475 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:37:18,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:37:18,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:37:18,475 INFO L87 Difference]: Start difference. First operand 28489 states and 86495 transitions. Second operand 3 states. [2019-12-26 22:37:18,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:37:18,633 INFO L93 Difference]: Finished difference Result 32830 states and 99680 transitions. [2019-12-26 22:37:18,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:37:18,633 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-26 22:37:18,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:37:18,702 INFO L225 Difference]: With dead ends: 32830 [2019-12-26 22:37:18,702 INFO L226 Difference]: Without dead ends: 32830 [2019-12-26 22:37:18,702 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-26 22:37:18,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32830 states. [2019-12-26 22:37:19,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32830 to 28660. [2019-12-26 22:37:19,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28660 states. [2019-12-26 22:37:19,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28660 states to 28660 states and 87373 transitions. [2019-12-26 22:37:19,189 INFO L78 Accepts]: Start accepts. Automaton has 28660 states and 87373 transitions. Word has length 64 [2019-12-26 22:37:19,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:37:19,189 INFO L462 AbstractCegarLoop]: Abstraction has 28660 states and 87373 transitions. [2019-12-26 22:37:19,189 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:37:19,189 INFO L276 IsEmpty]: Start isEmpty. Operand 28660 states and 87373 transitions. [2019-12-26 22:37:19,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 22:37:19,221 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:37:19,221 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-26 22:37:19,222 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-26 22:37:19,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:37:19,222 INFO L82 PathProgramCache]: Analyzing trace with hash 984956460, now seen corresponding path program 1 times [2019-12-26 22:37:19,222 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:37:19,222 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554124677] [2019-12-26 22:37:19,222 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:37:19,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:37:19,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:37:19,265 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554124677] [2019-12-26 22:37:19,265 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:37:19,265 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 22:37:19,266 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000675182] [2019-12-26 22:37:19,266 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 22:37:19,266 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:37:19,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 22:37:19,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-26 22:37:19,266 INFO L87 Difference]: Start difference. First operand 28660 states and 87373 transitions. Second operand 4 states. [2019-12-26 22:37:19,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:37:19,487 INFO L93 Difference]: Finished difference Result 36066 states and 109337 transitions. [2019-12-26 22:37:19,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 22:37:19,487 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-12-26 22:37:19,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:37:19,536 INFO L225 Difference]: With dead ends: 36066 [2019-12-26 22:37:19,536 INFO L226 Difference]: Without dead ends: 36066 [2019-12-26 22:37:19,536 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-26 22:37:19,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36066 states. [2019-12-26 22:37:20,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36066 to 29485. [2019-12-26 22:37:20,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29485 states. [2019-12-26 22:37:20,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29485 states to 29485 states and 89840 transitions. [2019-12-26 22:37:20,285 INFO L78 Accepts]: Start accepts. Automaton has 29485 states and 89840 transitions. Word has length 65 [2019-12-26 22:37:20,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:37:20,286 INFO L462 AbstractCegarLoop]: Abstraction has 29485 states and 89840 transitions. [2019-12-26 22:37:20,286 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 22:37:20,286 INFO L276 IsEmpty]: Start isEmpty. Operand 29485 states and 89840 transitions. [2019-12-26 22:37:20,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 22:37:20,315 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:37:20,315 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:37:20,315 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-26 22:37:20,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:37:20,315 INFO L82 PathProgramCache]: Analyzing trace with hash -1689403746, now seen corresponding path program 1 times [2019-12-26 22:37:20,316 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:37:20,316 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760403453] [2019-12-26 22:37:20,316 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:37:20,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:37:20,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:37:20,422 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760403453] [2019-12-26 22:37:20,422 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:37:20,422 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-26 22:37:20,422 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202816561] [2019-12-26 22:37:20,423 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-26 22:37:20,423 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:37:20,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-26 22:37:20,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-26 22:37:20,424 INFO L87 Difference]: Start difference. First operand 29485 states and 89840 transitions. Second operand 8 states. [2019-12-26 22:37:21,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:37:21,377 INFO L93 Difference]: Finished difference Result 80928 states and 242282 transitions. [2019-12-26 22:37:21,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-26 22:37:21,377 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 65 [2019-12-26 22:37:21,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:37:21,485 INFO L225 Difference]: With dead ends: 80928 [2019-12-26 22:37:21,485 INFO L226 Difference]: Without dead ends: 74194 [2019-12-26 22:37:21,486 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-26 22:37:21,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74194 states. [2019-12-26 22:37:22,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74194 to 29951. [2019-12-26 22:37:22,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29951 states. [2019-12-26 22:37:22,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29951 states to 29951 states and 91468 transitions. [2019-12-26 22:37:22,316 INFO L78 Accepts]: Start accepts. Automaton has 29951 states and 91468 transitions. Word has length 65 [2019-12-26 22:37:22,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:37:22,317 INFO L462 AbstractCegarLoop]: Abstraction has 29951 states and 91468 transitions. [2019-12-26 22:37:22,317 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-26 22:37:22,317 INFO L276 IsEmpty]: Start isEmpty. Operand 29951 states and 91468 transitions. [2019-12-26 22:37:22,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 22:37:22,349 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:37:22,349 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-26 22:37:22,349 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-26 22:37:22,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:37:22,350 INFO L82 PathProgramCache]: Analyzing trace with hash -998961960, now seen corresponding path program 2 times [2019-12-26 22:37:22,350 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:37:22,350 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135527176] [2019-12-26 22:37:22,350 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:37:22,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:37:22,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:37:22,390 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135527176] [2019-12-26 22:37:22,390 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:37:22,390 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 22:37:22,391 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045830064] [2019-12-26 22:37:22,391 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 22:37:22,391 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:37:22,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 22:37:22,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 22:37:22,392 INFO L87 Difference]: Start difference. First operand 29951 states and 91468 transitions. Second operand 4 states. [2019-12-26 22:37:23,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:37:23,021 INFO L93 Difference]: Finished difference Result 45778 states and 140292 transitions. [2019-12-26 22:37:23,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 22:37:23,021 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-12-26 22:37:23,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:37:23,084 INFO L225 Difference]: With dead ends: 45778 [2019-12-26 22:37:23,084 INFO L226 Difference]: Without dead ends: 45778 [2019-12-26 22:37:23,084 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-26 22:37:23,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45778 states. [2019-12-26 22:37:23,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45778 to 31406. [2019-12-26 22:37:23,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31406 states. [2019-12-26 22:37:23,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31406 states to 31406 states and 96530 transitions. [2019-12-26 22:37:23,638 INFO L78 Accepts]: Start accepts. Automaton has 31406 states and 96530 transitions. Word has length 65 [2019-12-26 22:37:23,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:37:23,639 INFO L462 AbstractCegarLoop]: Abstraction has 31406 states and 96530 transitions. [2019-12-26 22:37:23,639 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 22:37:23,639 INFO L276 IsEmpty]: Start isEmpty. Operand 31406 states and 96530 transitions. [2019-12-26 22:37:23,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 22:37:23,677 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:37:23,677 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-26 22:37:23,678 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-26 22:37:23,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:37:23,678 INFO L82 PathProgramCache]: Analyzing trace with hash -476661734, now seen corresponding path program 2 times [2019-12-26 22:37:23,678 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:37:23,678 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49583037] [2019-12-26 22:37:23,678 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:37:23,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:37:23,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:37:23,789 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49583037] [2019-12-26 22:37:23,789 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:37:23,790 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-26 22:37:23,790 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822153379] [2019-12-26 22:37:23,790 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-26 22:37:23,790 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:37:23,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-26 22:37:23,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-26 22:37:23,791 INFO L87 Difference]: Start difference. First operand 31406 states and 96530 transitions. Second operand 9 states. [2019-12-26 22:37:25,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:37:25,419 INFO L93 Difference]: Finished difference Result 103839 states and 309510 transitions. [2019-12-26 22:37:25,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-26 22:37:25,420 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-26 22:37:25,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:37:25,555 INFO L225 Difference]: With dead ends: 103839 [2019-12-26 22:37:25,555 INFO L226 Difference]: Without dead ends: 93795 [2019-12-26 22:37:25,556 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=159, Invalid=491, Unknown=0, NotChecked=0, Total=650 [2019-12-26 22:37:25,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93795 states. [2019-12-26 22:37:26,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93795 to 31892. [2019-12-26 22:37:26,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31892 states. [2019-12-26 22:37:26,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31892 states to 31892 states and 97205 transitions. [2019-12-26 22:37:26,935 INFO L78 Accepts]: Start accepts. Automaton has 31892 states and 97205 transitions. Word has length 65 [2019-12-26 22:37:26,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:37:26,935 INFO L462 AbstractCegarLoop]: Abstraction has 31892 states and 97205 transitions. [2019-12-26 22:37:26,935 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-26 22:37:26,935 INFO L276 IsEmpty]: Start isEmpty. Operand 31892 states and 97205 transitions. [2019-12-26 22:37:26,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 22:37:26,970 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:37:26,970 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-26 22:37:26,970 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-26 22:37:26,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:37:26,971 INFO L82 PathProgramCache]: Analyzing trace with hash -123930860, now seen corresponding path program 3 times [2019-12-26 22:37:26,971 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:37:26,971 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684502446] [2019-12-26 22:37:26,971 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:37:26,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:37:27,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:37:27,096 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684502446] [2019-12-26 22:37:27,096 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:37:27,097 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-26 22:37:27,097 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237130793] [2019-12-26 22:37:27,097 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-26 22:37:27,097 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:37:27,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-26 22:37:27,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-26 22:37:27,098 INFO L87 Difference]: Start difference. First operand 31892 states and 97205 transitions. Second operand 9 states. [2019-12-26 22:37:28,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:37:28,342 INFO L93 Difference]: Finished difference Result 88943 states and 264945 transitions. [2019-12-26 22:37:28,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-26 22:37:28,343 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-26 22:37:28,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:37:28,470 INFO L225 Difference]: With dead ends: 88943 [2019-12-26 22:37:28,470 INFO L226 Difference]: Without dead ends: 84511 [2019-12-26 22:37:28,470 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=157, Invalid=493, Unknown=0, NotChecked=0, Total=650 [2019-12-26 22:37:28,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84511 states. [2019-12-26 22:37:29,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84511 to 30537. [2019-12-26 22:37:29,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30537 states. [2019-12-26 22:37:29,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30537 states to 30537 states and 93428 transitions. [2019-12-26 22:37:29,419 INFO L78 Accepts]: Start accepts. Automaton has 30537 states and 93428 transitions. Word has length 65 [2019-12-26 22:37:29,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:37:29,419 INFO L462 AbstractCegarLoop]: Abstraction has 30537 states and 93428 transitions. [2019-12-26 22:37:29,419 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-26 22:37:29,419 INFO L276 IsEmpty]: Start isEmpty. Operand 30537 states and 93428 transitions. [2019-12-26 22:37:29,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 22:37:29,453 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:37:29,453 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-26 22:37:29,453 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-26 22:37:29,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:37:29,453 INFO L82 PathProgramCache]: Analyzing trace with hash 535036274, now seen corresponding path program 4 times [2019-12-26 22:37:29,454 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:37:29,454 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371071321] [2019-12-26 22:37:29,454 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:37:29,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:37:29,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:37:29,565 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371071321] [2019-12-26 22:37:29,566 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:37:29,566 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-26 22:37:29,566 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618926602] [2019-12-26 22:37:29,566 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 22:37:29,566 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:37:29,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 22:37:29,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-26 22:37:29,567 INFO L87 Difference]: Start difference. First operand 30537 states and 93428 transitions. Second operand 7 states. [2019-12-26 22:37:31,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:37:31,234 INFO L93 Difference]: Finished difference Result 50821 states and 152143 transitions. [2019-12-26 22:37:31,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-26 22:37:31,235 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-26 22:37:31,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:37:31,307 INFO L225 Difference]: With dead ends: 50821 [2019-12-26 22:37:31,307 INFO L226 Difference]: Without dead ends: 50821 [2019-12-26 22:37:31,308 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=93, Invalid=249, Unknown=0, NotChecked=0, Total=342 [2019-12-26 22:37:31,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50821 states. [2019-12-26 22:37:31,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50821 to 31006. [2019-12-26 22:37:31,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31006 states. [2019-12-26 22:37:31,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31006 states to 31006 states and 94726 transitions. [2019-12-26 22:37:31,956 INFO L78 Accepts]: Start accepts. Automaton has 31006 states and 94726 transitions. Word has length 65 [2019-12-26 22:37:31,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:37:31,956 INFO L462 AbstractCegarLoop]: Abstraction has 31006 states and 94726 transitions. [2019-12-26 22:37:31,956 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 22:37:31,956 INFO L276 IsEmpty]: Start isEmpty. Operand 31006 states and 94726 transitions. [2019-12-26 22:37:31,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 22:37:31,991 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:37:31,992 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-26 22:37:31,992 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-26 22:37:31,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:37:31,992 INFO L82 PathProgramCache]: Analyzing trace with hash -1794298295, now seen corresponding path program 1 times [2019-12-26 22:37:31,992 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:37:31,992 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580166116] [2019-12-26 22:37:31,992 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:37:32,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:37:32,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:37:32,068 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580166116] [2019-12-26 22:37:32,068 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:37:32,068 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 22:37:32,068 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588397146] [2019-12-26 22:37:32,069 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 22:37:32,069 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:37:32,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 22:37:32,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 22:37:32,069 INFO L87 Difference]: Start difference. First operand 31006 states and 94726 transitions. Second operand 5 states. [2019-12-26 22:37:32,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:37:32,640 INFO L93 Difference]: Finished difference Result 41644 states and 125022 transitions. [2019-12-26 22:37:32,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-26 22:37:32,641 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-12-26 22:37:32,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:37:32,701 INFO L225 Difference]: With dead ends: 41644 [2019-12-26 22:37:32,701 INFO L226 Difference]: Without dead ends: 41400 [2019-12-26 22:37:32,701 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-26 22:37:32,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41400 states. [2019-12-26 22:37:33,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41400 to 37128. [2019-12-26 22:37:33,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37128 states. [2019-12-26 22:37:33,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37128 states to 37128 states and 112464 transitions. [2019-12-26 22:37:33,293 INFO L78 Accepts]: Start accepts. Automaton has 37128 states and 112464 transitions. Word has length 65 [2019-12-26 22:37:33,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:37:33,293 INFO L462 AbstractCegarLoop]: Abstraction has 37128 states and 112464 transitions. [2019-12-26 22:37:33,293 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 22:37:33,293 INFO L276 IsEmpty]: Start isEmpty. Operand 37128 states and 112464 transitions. [2019-12-26 22:37:33,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 22:37:33,333 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:37:33,334 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-26 22:37:33,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-26 22:37:33,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:37:33,334 INFO L82 PathProgramCache]: Analyzing trace with hash 1949977412, now seen corresponding path program 3 times [2019-12-26 22:37:33,334 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:37:33,334 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049130053] [2019-12-26 22:37:33,334 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:37:33,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:37:33,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:37:33,399 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049130053] [2019-12-26 22:37:33,399 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:37:33,399 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 22:37:33,400 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926905925] [2019-12-26 22:37:33,400 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 22:37:33,400 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:37:33,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 22:37:33,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 22:37:33,401 INFO L87 Difference]: Start difference. First operand 37128 states and 112464 transitions. Second operand 4 states. [2019-12-26 22:37:33,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:37:33,779 INFO L93 Difference]: Finished difference Result 36756 states and 111117 transitions. [2019-12-26 22:37:33,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 22:37:33,779 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-12-26 22:37:33,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:37:33,829 INFO L225 Difference]: With dead ends: 36756 [2019-12-26 22:37:33,830 INFO L226 Difference]: Without dead ends: 36756 [2019-12-26 22:37:33,830 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-26 22:37:33,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36756 states. [2019-12-26 22:37:34,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36756 to 33005. [2019-12-26 22:37:34,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33005 states. [2019-12-26 22:37:34,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33005 states to 33005 states and 99014 transitions. [2019-12-26 22:37:34,351 INFO L78 Accepts]: Start accepts. Automaton has 33005 states and 99014 transitions. Word has length 65 [2019-12-26 22:37:34,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:37:34,352 INFO L462 AbstractCegarLoop]: Abstraction has 33005 states and 99014 transitions. [2019-12-26 22:37:34,352 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 22:37:34,352 INFO L276 IsEmpty]: Start isEmpty. Operand 33005 states and 99014 transitions. [2019-12-26 22:37:34,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 22:37:34,388 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:37:34,388 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-26 22:37:34,388 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-26 22:37:34,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:37:34,389 INFO L82 PathProgramCache]: Analyzing trace with hash 1586394449, now seen corresponding path program 2 times [2019-12-26 22:37:34,389 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:37:34,389 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774762380] [2019-12-26 22:37:34,389 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:37:34,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:37:34,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:37:34,505 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774762380] [2019-12-26 22:37:34,505 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:37:34,505 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-26 22:37:34,506 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101281140] [2019-12-26 22:37:34,506 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-26 22:37:34,506 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:37:34,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-26 22:37:34,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-26 22:37:34,506 INFO L87 Difference]: Start difference. First operand 33005 states and 99014 transitions. Second operand 8 states. [2019-12-26 22:37:36,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:37:36,484 INFO L93 Difference]: Finished difference Result 61177 states and 181302 transitions. [2019-12-26 22:37:36,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-26 22:37:36,485 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 65 [2019-12-26 22:37:36,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:37:36,565 INFO L225 Difference]: With dead ends: 61177 [2019-12-26 22:37:36,565 INFO L226 Difference]: Without dead ends: 61177 [2019-12-26 22:37:36,565 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 22 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=140, Invalid=562, Unknown=0, NotChecked=0, Total=702 [2019-12-26 22:37:36,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61177 states. [2019-12-26 22:37:37,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61177 to 32322. [2019-12-26 22:37:37,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32322 states. [2019-12-26 22:37:37,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32322 states to 32322 states and 96920 transitions. [2019-12-26 22:37:37,271 INFO L78 Accepts]: Start accepts. Automaton has 32322 states and 96920 transitions. Word has length 65 [2019-12-26 22:37:37,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:37:37,271 INFO L462 AbstractCegarLoop]: Abstraction has 32322 states and 96920 transitions. [2019-12-26 22:37:37,271 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-26 22:37:37,272 INFO L276 IsEmpty]: Start isEmpty. Operand 32322 states and 96920 transitions. [2019-12-26 22:37:37,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 22:37:37,307 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:37:37,307 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-26 22:37:37,307 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-26 22:37:37,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:37:37,308 INFO L82 PathProgramCache]: Analyzing trace with hash -755298849, now seen corresponding path program 3 times [2019-12-26 22:37:37,308 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:37:37,308 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584553608] [2019-12-26 22:37:37,308 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:37:37,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:37:37,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:37:37,424 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584553608] [2019-12-26 22:37:37,424 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:37:37,424 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-26 22:37:37,424 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071705012] [2019-12-26 22:37:37,425 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-26 22:37:37,425 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:37:37,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-26 22:37:37,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-26 22:37:37,425 INFO L87 Difference]: Start difference. First operand 32322 states and 96920 transitions. Second operand 8 states. [2019-12-26 22:37:39,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:37:39,674 INFO L93 Difference]: Finished difference Result 61393 states and 181612 transitions. [2019-12-26 22:37:39,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-26 22:37:39,674 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 65 [2019-12-26 22:37:39,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:37:39,761 INFO L225 Difference]: With dead ends: 61393 [2019-12-26 22:37:39,761 INFO L226 Difference]: Without dead ends: 61141 [2019-12-26 22:37:39,761 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 16 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=144, Invalid=558, Unknown=0, NotChecked=0, Total=702 [2019-12-26 22:37:39,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61141 states. [2019-12-26 22:37:40,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61141 to 34978. [2019-12-26 22:37:40,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34978 states. [2019-12-26 22:37:40,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34978 states to 34978 states and 104631 transitions. [2019-12-26 22:37:40,533 INFO L78 Accepts]: Start accepts. Automaton has 34978 states and 104631 transitions. Word has length 65 [2019-12-26 22:37:40,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:37:40,533 INFO L462 AbstractCegarLoop]: Abstraction has 34978 states and 104631 transitions. [2019-12-26 22:37:40,533 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-26 22:37:40,533 INFO L276 IsEmpty]: Start isEmpty. Operand 34978 states and 104631 transitions. [2019-12-26 22:37:40,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 22:37:40,572 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:37:40,573 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-26 22:37:40,573 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-26 22:37:40,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:37:40,573 INFO L82 PathProgramCache]: Analyzing trace with hash 1171161157, now seen corresponding path program 4 times [2019-12-26 22:37:40,573 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:37:40,573 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337504892] [2019-12-26 22:37:40,573 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:37:40,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:37:40,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:37:40,796 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337504892] [2019-12-26 22:37:40,796 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:37:40,796 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-26 22:37:40,797 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923258647] [2019-12-26 22:37:40,797 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-26 22:37:40,797 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:37:40,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-26 22:37:40,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2019-12-26 22:37:40,798 INFO L87 Difference]: Start difference. First operand 34978 states and 104631 transitions. Second operand 13 states. [2019-12-26 22:37:44,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:37:44,638 INFO L93 Difference]: Finished difference Result 59579 states and 176531 transitions. [2019-12-26 22:37:44,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-12-26 22:37:44,639 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 65 [2019-12-26 22:37:44,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:37:44,729 INFO L225 Difference]: With dead ends: 59579 [2019-12-26 22:37:44,730 INFO L226 Difference]: Without dead ends: 59579 [2019-12-26 22:37:44,731 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 579 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=382, Invalid=1780, Unknown=0, NotChecked=0, Total=2162 [2019-12-26 22:37:45,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59579 states. [2019-12-26 22:37:45,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59579 to 36984. [2019-12-26 22:37:45,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36984 states. [2019-12-26 22:37:45,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36984 states to 36984 states and 110578 transitions. [2019-12-26 22:37:45,703 INFO L78 Accepts]: Start accepts. Automaton has 36984 states and 110578 transitions. Word has length 65 [2019-12-26 22:37:45,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:37:45,704 INFO L462 AbstractCegarLoop]: Abstraction has 36984 states and 110578 transitions. [2019-12-26 22:37:45,704 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-26 22:37:45,704 INFO L276 IsEmpty]: Start isEmpty. Operand 36984 states and 110578 transitions. [2019-12-26 22:37:45,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 22:37:45,741 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:37:45,741 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-26 22:37:45,741 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-26 22:37:45,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:37:45,742 INFO L82 PathProgramCache]: Analyzing trace with hash 1095461897, now seen corresponding path program 5 times [2019-12-26 22:37:45,742 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:37:45,742 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771519666] [2019-12-26 22:37:45,742 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:37:45,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:37:45,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:37:45,795 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771519666] [2019-12-26 22:37:45,795 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:37:45,795 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 22:37:45,795 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295631954] [2019-12-26 22:37:45,796 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:37:45,796 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:37:45,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:37:45,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:37:45,796 INFO L87 Difference]: Start difference. First operand 36984 states and 110578 transitions. Second operand 3 states. [2019-12-26 22:37:45,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:37:45,943 INFO L93 Difference]: Finished difference Result 36984 states and 110577 transitions. [2019-12-26 22:37:45,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:37:45,944 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-26 22:37:45,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:37:45,994 INFO L225 Difference]: With dead ends: 36984 [2019-12-26 22:37:45,994 INFO L226 Difference]: Without dead ends: 36984 [2019-12-26 22:37:45,995 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:37:46,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36984 states. [2019-12-26 22:37:46,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36984 to 25447. [2019-12-26 22:37:46,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25447 states. [2019-12-26 22:37:46,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25447 states to 25447 states and 78113 transitions. [2019-12-26 22:37:46,484 INFO L78 Accepts]: Start accepts. Automaton has 25447 states and 78113 transitions. Word has length 65 [2019-12-26 22:37:46,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:37:46,484 INFO L462 AbstractCegarLoop]: Abstraction has 25447 states and 78113 transitions. [2019-12-26 22:37:46,484 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:37:46,484 INFO L276 IsEmpty]: Start isEmpty. Operand 25447 states and 78113 transitions. [2019-12-26 22:37:46,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-26 22:37:46,512 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:37:46,512 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-26 22:37:46,512 INFO L410 AbstractCegarLoop]: === Iteration 39 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:37:46,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:37:46,512 INFO L82 PathProgramCache]: Analyzing trace with hash -1288264236, now seen corresponding path program 1 times [2019-12-26 22:37:46,512 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:37:46,512 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281125878] [2019-12-26 22:37:46,513 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:37:46,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:37:46,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:37:46,564 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281125878] [2019-12-26 22:37:46,564 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:37:46,564 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 22:37:46,565 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143346113] [2019-12-26 22:37:46,565 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:37:46,565 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:37:46,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:37:46,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:37:46,566 INFO L87 Difference]: Start difference. First operand 25447 states and 78113 transitions. Second operand 3 states. [2019-12-26 22:37:46,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:37:46,641 INFO L93 Difference]: Finished difference Result 20509 states and 61824 transitions. [2019-12-26 22:37:46,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:37:46,642 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-26 22:37:46,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:37:46,667 INFO L225 Difference]: With dead ends: 20509 [2019-12-26 22:37:46,668 INFO L226 Difference]: Without dead ends: 20509 [2019-12-26 22:37:46,668 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:37:46,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20509 states. [2019-12-26 22:37:46,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20509 to 18509. [2019-12-26 22:37:46,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18509 states. [2019-12-26 22:37:46,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18509 states to 18509 states and 55754 transitions. [2019-12-26 22:37:46,937 INFO L78 Accepts]: Start accepts. Automaton has 18509 states and 55754 transitions. Word has length 66 [2019-12-26 22:37:46,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:37:46,938 INFO L462 AbstractCegarLoop]: Abstraction has 18509 states and 55754 transitions. [2019-12-26 22:37:46,938 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:37:46,938 INFO L276 IsEmpty]: Start isEmpty. Operand 18509 states and 55754 transitions. [2019-12-26 22:37:46,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-26 22:37:46,954 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:37:46,955 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-26 22:37:46,955 INFO L410 AbstractCegarLoop]: === Iteration 40 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:37:46,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:37:46,955 INFO L82 PathProgramCache]: Analyzing trace with hash 1790496915, now seen corresponding path program 1 times [2019-12-26 22:37:46,955 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:37:46,955 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428303277] [2019-12-26 22:37:46,955 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:37:46,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 22:37:47,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 22:37:47,067 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-26 22:37:47,068 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-26 22:37:47,072 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [901] [901] ULTIMATE.startENTRY-->L830: Formula: (let ((.cse0 (store |v_#valid_93| 0 0))) (and (= v_~main$tmp_guard0~0_31 0) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t1117~0.base_55|) (= 0 v_~a$read_delayed_var~0.base_8) (= v_~a$r_buff1_thd3~0_279 0) (= v_~a$flush_delayed~0_36 0) (= 0 v_~a$r_buff1_thd2~0_156) (= v_~a$r_buff0_thd0~0_153 0) (= v_~a$mem_tmp~0_25 0) (= v_~a$r_buff0_thd3~0_364 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t1117~0.base_55| 1) |v_#valid_91|) (= v_~__unbuffered_p2_EBX~0_67 0) (= v_~y~0_75 0) (= (store |v_#length_26| |v_ULTIMATE.start_main_~#t1117~0.base_55| 4) |v_#length_25|) (= v_~a~0_169 0) (< 0 |v_#StackHeapBarrier_17|) (= v_~main$tmp_guard1~0_56 0) (= 0 v_~a$w_buff1~0_224) (= 0 v_~__unbuffered_cnt~0_98) (= 0 v_~a$w_buff0_used~0_781) (= 0 v_~a$r_buff1_thd1~0_124) (= 0 v_~a$r_buff0_thd2~0_146) (= 0 v_~weak$$choice0~0_21) (= |v_ULTIMATE.start_main_~#t1117~0.offset_34| 0) (= 0 |v_#NULL.base_4|) (= (select .cse0 |v_ULTIMATE.start_main_~#t1117~0.base_55|) 0) (= 0 v_~a$w_buff1_used~0_506) (= 0 v_~__unbuffered_p2_EAX~0_61) (= |v_#NULL.offset_4| 0) (= v_~a$w_buff0~0_325 0) (= 0 v_~__unbuffered_p0_EAX~0_116) (= v_~z~0_20 0) (= v_~a$read_delayed_var~0.offset_8 0) (= v_~x~0_91 0) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1117~0.base_55| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1117~0.base_55|) |v_ULTIMATE.start_main_~#t1117~0.offset_34| 0)) |v_#memory_int_21|) (= v_~weak$$choice2~0_114 0) (= v_~a$r_buff1_thd0~0_166 0) (= 0 v_~a$r_buff0_thd1~0_224) (= 0 v_~a$read_delayed~0_8))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_93|, #memory_int=|v_#memory_int_22|, #length=|v_#length_26|} OutVars{ULTIMATE.start_main_~#t1118~0.base=|v_ULTIMATE.start_main_~#t1118~0.base_41|, ULTIMATE.start_main_~#t1117~0.offset=|v_ULTIMATE.start_main_~#t1117~0.offset_34|, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_156, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_28|, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_60|, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_153, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_210|, ~a~0=v_~a~0_169, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_105|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_116, #length=|v_#length_25|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_61, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_67, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_9|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_279, ULTIMATE.start_main_~#t1117~0.base=|v_ULTIMATE.start_main_~#t1117~0.base_55|, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_781, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_224, ~weak$$choice0~0=v_~weak$$choice0~0_21, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ~a$read_delayed_var~0.offset=v_~a$read_delayed_var~0.offset_8, ~a$w_buff0~0=v_~a$w_buff0~0_325, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_166, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_98, ~x~0=v_~x~0_91, ~a$read_delayed~0=v_~a$read_delayed~0_8, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_146, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_56, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_32|, ~a$mem_tmp~0=v_~a$mem_tmp~0_25, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_44|, ULTIMATE.start_main_~#t1118~0.offset=|v_ULTIMATE.start_main_~#t1118~0.offset_19|, ~a$w_buff1~0=v_~a$w_buff1~0_224, ~y~0=v_~y~0_75, ULTIMATE.start_main_~#t1119~0.offset=|v_ULTIMATE.start_main_~#t1119~0.offset_20|, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_28|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_9|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_124, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_364, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_31, #NULL.base=|v_#NULL.base_4|, ~a$flush_delayed~0=v_~a$flush_delayed~0_36, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_37|, #valid=|v_#valid_91|, #memory_int=|v_#memory_int_21|, ~z~0=v_~z~0_20, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_506, ULTIMATE.start_main_~#t1119~0.base=|v_ULTIMATE.start_main_~#t1119~0.base_28|, ~weak$$choice2~0=v_~weak$$choice2~0_114, ~a$read_delayed_var~0.base=v_~a$read_delayed_var~0.base_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1118~0.base, ULTIMATE.start_main_~#t1117~0.offset, ~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, ~__unbuffered_p0_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~nondet45, ~a$r_buff1_thd3~0, ULTIMATE.start_main_~#t1117~0.base, ~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, ~a$read_delayed~0, ~a$r_buff0_thd2~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ~a$mem_tmp~0, ULTIMATE.start_main_#t~ite51, ULTIMATE.start_main_~#t1118~0.offset, ~a$w_buff1~0, ~y~0, ULTIMATE.start_main_~#t1119~0.offset, 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, ULTIMATE.start_main_~#t1119~0.base, ~weak$$choice2~0, ~a$read_delayed_var~0.base] because there is no mapped edge [2019-12-26 22:37:47,073 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [880] [880] L4-->L748: Formula: (and (= ~a$r_buff1_thd3~0_Out-2095434072 ~a$r_buff0_thd3~0_In-2095434072) (not (= P0Thread1of1ForFork1___VERIFIER_assert_~expression_In-2095434072 0)) (= ~a$r_buff0_thd1~0_Out-2095434072 1) (= ~a$r_buff1_thd2~0_Out-2095434072 ~a$r_buff0_thd2~0_In-2095434072) (= ~a$r_buff0_thd1~0_In-2095434072 ~a$r_buff1_thd1~0_Out-2095434072) (= ~x~0_In-2095434072 ~__unbuffered_p0_EAX~0_Out-2095434072) (= ~a$r_buff0_thd0~0_In-2095434072 ~a$r_buff1_thd0~0_Out-2095434072)) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-2095434072, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-2095434072, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In-2095434072, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-2095434072, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-2095434072, ~x~0=~x~0_In-2095434072} OutVars{~__unbuffered_p0_EAX~0=~__unbuffered_p0_EAX~0_Out-2095434072, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_Out-2095434072, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_Out-2095434072, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_Out-2095434072, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_Out-2095434072, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-2095434072, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-2095434072, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In-2095434072, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_Out-2095434072, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-2095434072, ~x~0=~x~0_In-2095434072} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, ~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] because there is no mapped edge [2019-12-26 22:37:47,073 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [859] [859] L830-1-->L832: Formula: (and (= |v_#memory_int_11| (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1118~0.base_9| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1118~0.base_9|) |v_ULTIMATE.start_main_~#t1118~0.offset_7| 1))) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t1118~0.base_9|) (not (= |v_ULTIMATE.start_main_~#t1118~0.base_9| 0)) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t1118~0.base_9| 4) |v_#length_15|) (= (store |v_#valid_35| |v_ULTIMATE.start_main_~#t1118~0.base_9| 1) |v_#valid_34|) (= 0 (select |v_#valid_35| |v_ULTIMATE.start_main_~#t1118~0.base_9|)) (= |v_ULTIMATE.start_main_~#t1118~0.offset_7| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t1118~0.base=|v_ULTIMATE.start_main_~#t1118~0.base_9|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t1118~0.offset=|v_ULTIMATE.start_main_~#t1118~0.offset_7|, 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_~#t1118~0.base, ULTIMATE.start_main_~#t1118~0.offset, ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, #length] because there is no mapped edge [2019-12-26 22:37:47,075 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [858] [858] L832-1-->L834: Formula: (and (= |v_ULTIMATE.start_main_~#t1119~0.offset_8| 0) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t1119~0.base_9| 4)) (= (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1119~0.base_9| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1119~0.base_9|) |v_ULTIMATE.start_main_~#t1119~0.offset_8| 2)) |v_#memory_int_9|) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t1119~0.base_9|) (not (= |v_ULTIMATE.start_main_~#t1119~0.base_9| 0)) (= 0 (select |v_#valid_33| |v_ULTIMATE.start_main_~#t1119~0.base_9|)) (= (store |v_#valid_33| |v_ULTIMATE.start_main_~#t1119~0.base_9| 1) |v_#valid_32|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_10|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_~#t1119~0.offset=|v_ULTIMATE.start_main_~#t1119~0.offset_8|, #valid=|v_#valid_32|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_4|, #memory_int=|v_#memory_int_9|, #length=|v_#length_13|, ULTIMATE.start_main_~#t1119~0.base=|v_ULTIMATE.start_main_~#t1119~0.base_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1119~0.offset, #valid, ULTIMATE.start_main_#t~nondet45, #memory_int, #length, ULTIMATE.start_main_~#t1119~0.base] because there is no mapped edge [2019-12-26 22:37:47,075 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [826] [826] L768-2-->L768-5: Formula: (let ((.cse1 (= (mod ~a$r_buff1_thd2~0_In1590220100 256) 0)) (.cse0 (= 0 (mod ~a$w_buff1_used~0_In1590220100 256))) (.cse2 (= |P1Thread1of1ForFork2_#t~ite9_Out1590220100| |P1Thread1of1ForFork2_#t~ite10_Out1590220100|))) (or (and (= |P1Thread1of1ForFork2_#t~ite9_Out1590220100| ~a~0_In1590220100) (or .cse0 .cse1) .cse2) (and (= ~a$w_buff1~0_In1590220100 |P1Thread1of1ForFork2_#t~ite9_Out1590220100|) (not .cse1) (not .cse0) .cse2))) InVars {~a~0=~a~0_In1590220100, ~a$w_buff1~0=~a$w_buff1~0_In1590220100, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In1590220100, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1590220100} OutVars{~a~0=~a~0_In1590220100, P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out1590220100|, ~a$w_buff1~0=~a$w_buff1~0_In1590220100, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In1590220100, P1Thread1of1ForFork2_#t~ite10=|P1Thread1of1ForFork2_#t~ite10_Out1590220100|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1590220100} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite10] because there is no mapped edge [2019-12-26 22:37:47,078 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L769-->L769-2: Formula: (let ((.cse1 (= (mod ~a$w_buff0_used~0_In77656374 256) 0)) (.cse0 (= 0 (mod ~a$r_buff0_thd2~0_In77656374 256)))) (or (and (= 0 |P1Thread1of1ForFork2_#t~ite11_Out77656374|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~a$w_buff0_used~0_In77656374 |P1Thread1of1ForFork2_#t~ite11_Out77656374|)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In77656374, ~a$w_buff0_used~0=~a$w_buff0_used~0_In77656374} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In77656374, ~a$w_buff0_used~0=~a$w_buff0_used~0_In77656374, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out77656374|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-26 22:37:47,079 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L770-->L770-2: Formula: (let ((.cse3 (= 0 (mod ~a$r_buff1_thd2~0_In917491113 256))) (.cse2 (= (mod ~a$w_buff1_used~0_In917491113 256) 0)) (.cse1 (= 0 (mod ~a$r_buff0_thd2~0_In917491113 256))) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In917491113 256)))) (or (and (= 0 |P1Thread1of1ForFork2_#t~ite12_Out917491113|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~a$w_buff1_used~0_In917491113 |P1Thread1of1ForFork2_#t~ite12_Out917491113|) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In917491113, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In917491113, ~a$w_buff0_used~0=~a$w_buff0_used~0_In917491113, ~a$w_buff1_used~0=~a$w_buff1_used~0_In917491113} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In917491113, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In917491113, ~a$w_buff0_used~0=~a$w_buff0_used~0_In917491113, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out917491113|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In917491113} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-26 22:37:47,079 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [877] [877] L796-->L796-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-1029118692 256) 0))) (or (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite20_In-1029118692| |P2Thread1of1ForFork0_#t~ite20_Out-1029118692|) (= |P2Thread1of1ForFork0_#t~ite21_Out-1029118692| ~a$w_buff0~0_In-1029118692)) (and .cse0 (let ((.cse1 (= (mod ~a$r_buff0_thd3~0_In-1029118692 256) 0))) (or (and (= 0 (mod ~a$w_buff1_used~0_In-1029118692 256)) .cse1) (= 0 (mod ~a$w_buff0_used~0_In-1029118692 256)) (and (= (mod ~a$r_buff1_thd3~0_In-1029118692 256) 0) .cse1))) (= |P2Thread1of1ForFork0_#t~ite21_Out-1029118692| |P2Thread1of1ForFork0_#t~ite20_Out-1029118692|) (= |P2Thread1of1ForFork0_#t~ite20_Out-1029118692| ~a$w_buff0~0_In-1029118692)))) InVars {~a$w_buff0~0=~a$w_buff0~0_In-1029118692, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1029118692, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1029118692, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1029118692, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1029118692, P2Thread1of1ForFork0_#t~ite20=|P2Thread1of1ForFork0_#t~ite20_In-1029118692|, ~weak$$choice2~0=~weak$$choice2~0_In-1029118692} OutVars{P2Thread1of1ForFork0_#t~ite21=|P2Thread1of1ForFork0_#t~ite21_Out-1029118692|, ~a$w_buff0~0=~a$w_buff0~0_In-1029118692, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1029118692, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1029118692, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1029118692, P2Thread1of1ForFork0_#t~ite20=|P2Thread1of1ForFork0_#t~ite20_Out-1029118692|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1029118692, ~weak$$choice2~0=~weak$$choice2~0_In-1029118692} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite21, P2Thread1of1ForFork0_#t~ite20] because there is no mapped edge [2019-12-26 22:37:47,081 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L771-->L771-2: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff0_thd2~0_In-727637169 256))) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In-727637169 256)))) (or (and (= 0 |P1Thread1of1ForFork2_#t~ite13_Out-727637169|) (not .cse0) (not .cse1)) (and (= ~a$r_buff0_thd2~0_In-727637169 |P1Thread1of1ForFork2_#t~ite13_Out-727637169|) (or .cse0 .cse1)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-727637169, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-727637169} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-727637169, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-727637169, P1Thread1of1ForFork2_#t~ite13=|P1Thread1of1ForFork2_#t~ite13_Out-727637169|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite13] because there is no mapped edge [2019-12-26 22:37:47,081 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [838] [838] L772-->L772-2: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff0_used~0_In208945643 256))) (.cse0 (= (mod ~a$r_buff0_thd2~0_In208945643 256) 0)) (.cse3 (= (mod ~a$w_buff1_used~0_In208945643 256) 0)) (.cse2 (= 0 (mod ~a$r_buff1_thd2~0_In208945643 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork2_#t~ite14_Out208945643| 0)) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork2_#t~ite14_Out208945643| ~a$r_buff1_thd2~0_In208945643) (or .cse3 .cse2)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In208945643, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In208945643, ~a$w_buff0_used~0=~a$w_buff0_used~0_In208945643, ~a$w_buff1_used~0=~a$w_buff1_used~0_In208945643} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In208945643, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In208945643, ~a$w_buff0_used~0=~a$w_buff0_used~0_In208945643, ~a$w_buff1_used~0=~a$w_buff1_used~0_In208945643, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out208945643|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-26 22:37:47,081 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [874] [874] L772-2-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork2_#t~ite14_50| v_~a$r_buff1_thd2~0_119) (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= (+ v_~__unbuffered_cnt~0_84 1) v_~__unbuffered_cnt~0_83) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_84, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_50|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_119, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_83, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_49|, 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-26 22:37:47,082 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [879] [879] L797-->L797-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In1450636835 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite23_Out1450636835| |P2Thread1of1ForFork0_#t~ite24_Out1450636835|) (let ((.cse0 (= (mod ~a$r_buff0_thd3~0_In1450636835 256) 0))) (or (and (= (mod ~a$w_buff1_used~0_In1450636835 256) 0) .cse0) (= (mod ~a$w_buff0_used~0_In1450636835 256) 0) (and (= (mod ~a$r_buff1_thd3~0_In1450636835 256) 0) .cse0))) (= |P2Thread1of1ForFork0_#t~ite23_Out1450636835| ~a$w_buff1~0_In1450636835) .cse1) (and (not .cse1) (= |P2Thread1of1ForFork0_#t~ite23_In1450636835| |P2Thread1of1ForFork0_#t~ite23_Out1450636835|) (= ~a$w_buff1~0_In1450636835 |P2Thread1of1ForFork0_#t~ite24_Out1450636835|)))) InVars {~a$w_buff1~0=~a$w_buff1~0_In1450636835, P2Thread1of1ForFork0_#t~ite23=|P2Thread1of1ForFork0_#t~ite23_In1450636835|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1450636835, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1450636835, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1450636835, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1450636835, ~weak$$choice2~0=~weak$$choice2~0_In1450636835} OutVars{~a$w_buff1~0=~a$w_buff1~0_In1450636835, P2Thread1of1ForFork0_#t~ite23=|P2Thread1of1ForFork0_#t~ite23_Out1450636835|, P2Thread1of1ForFork0_#t~ite24=|P2Thread1of1ForFork0_#t~ite24_Out1450636835|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1450636835, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1450636835, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1450636835, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1450636835, ~weak$$choice2~0=~weak$$choice2~0_In1450636835} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite23, P2Thread1of1ForFork0_#t~ite24] because there is no mapped edge [2019-12-26 22:37:47,083 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [878] [878] L798-->L798-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In560331282 256) 0))) (or (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite26_In560331282| |P2Thread1of1ForFork0_#t~ite26_Out560331282|) (= ~a$w_buff0_used~0_In560331282 |P2Thread1of1ForFork0_#t~ite27_Out560331282|)) (and (let ((.cse1 (= 0 (mod ~a$r_buff0_thd3~0_In560331282 256)))) (or (= (mod ~a$w_buff0_used~0_In560331282 256) 0) (and (= 0 (mod ~a$r_buff1_thd3~0_In560331282 256)) .cse1) (and (= 0 (mod ~a$w_buff1_used~0_In560331282 256)) .cse1))) (= |P2Thread1of1ForFork0_#t~ite27_Out560331282| |P2Thread1of1ForFork0_#t~ite26_Out560331282|) .cse0 (= ~a$w_buff0_used~0_In560331282 |P2Thread1of1ForFork0_#t~ite26_Out560331282|)))) InVars {P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_In560331282|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In560331282, ~a$w_buff0_used~0=~a$w_buff0_used~0_In560331282, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In560331282, ~a$w_buff1_used~0=~a$w_buff1_used~0_In560331282, ~weak$$choice2~0=~weak$$choice2~0_In560331282} OutVars{P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_Out560331282|, P2Thread1of1ForFork0_#t~ite27=|P2Thread1of1ForFork0_#t~ite27_Out560331282|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In560331282, ~a$w_buff0_used~0=~a$w_buff0_used~0_In560331282, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In560331282, ~a$w_buff1_used~0=~a$w_buff1_used~0_In560331282, ~weak$$choice2~0=~weak$$choice2~0_In560331282} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite26, P2Thread1of1ForFork0_#t~ite27] because there is no mapped edge [2019-12-26 22:37:47,085 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_71 v_~a$r_buff0_thd3~0_70)) InVars {~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_71, ~weak$$choice2~0=v_~weak$$choice2~0_16} OutVars{P2Thread1of1ForFork0_#t~ite33=|v_P2Thread1of1ForFork0_#t~ite33_9|, P2Thread1of1ForFork0_#t~ite32=|v_P2Thread1of1ForFork0_#t~ite32_11|, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_70, 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-26 22:37:47,087 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$flush_delayed~0_7 0) (= v_~a~0_39 v_~a$mem_tmp~0_5)) 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_39, ~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-26 22:37:47,088 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [820] [820] L807-2-->L807-4: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff1_thd3~0_In-1113866967 256))) (.cse1 (= (mod ~a$w_buff1_used~0_In-1113866967 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite38_Out-1113866967| ~a~0_In-1113866967) (or .cse0 .cse1)) (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite38_Out-1113866967| ~a$w_buff1~0_In-1113866967) (not .cse1)))) InVars {~a~0=~a~0_In-1113866967, ~a$w_buff1~0=~a$w_buff1~0_In-1113866967, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1113866967, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1113866967} OutVars{~a~0=~a~0_In-1113866967, P2Thread1of1ForFork0_#t~ite38=|P2Thread1of1ForFork0_#t~ite38_Out-1113866967|, ~a$w_buff1~0=~a$w_buff1~0_In-1113866967, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1113866967, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1113866967} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-26 22:37:47,088 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [768] [768] L807-4-->L808: Formula: (= v_~a~0_19 |v_P2Thread1of1ForFork0_#t~ite38_12|) InVars {P2Thread1of1ForFork0_#t~ite38=|v_P2Thread1of1ForFork0_#t~ite38_12|} OutVars{~a~0=v_~a~0_19, P2Thread1of1ForFork0_#t~ite39=|v_P2Thread1of1ForFork0_#t~ite39_7|, P2Thread1of1ForFork0_#t~ite38=|v_P2Thread1of1ForFork0_#t~ite38_11|} AuxVars[] AssignedVars[~a~0, P2Thread1of1ForFork0_#t~ite39, P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-26 22:37:47,088 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [824] [824] L808-->L808-2: Formula: (let ((.cse0 (= (mod ~a$r_buff0_thd3~0_In662161426 256) 0)) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In662161426 256)))) (or (and (= ~a$w_buff0_used~0_In662161426 |P2Thread1of1ForFork0_#t~ite40_Out662161426|) (or .cse0 .cse1)) (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite40_Out662161426| 0) (not .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In662161426, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In662161426} OutVars{P2Thread1of1ForFork0_#t~ite40=|P2Thread1of1ForFork0_#t~ite40_Out662161426|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In662161426, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In662161426} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite40] because there is no mapped edge [2019-12-26 22:37:47,088 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [830] [830] L749-->L749-2: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff0_used~0_In-1449270991 256))) (.cse0 (= 0 (mod ~a$r_buff0_thd1~0_In-1449270991 256)))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork1_#t~ite5_Out-1449270991| ~a$w_buff0_used~0_In-1449270991)) (and (not .cse1) (= |P0Thread1of1ForFork1_#t~ite5_Out-1449270991| 0) (not .cse0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-1449270991, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1449270991} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out-1449270991|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1449270991, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1449270991} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-26 22:37:47,089 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [829] [829] L750-->L750-2: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff0_used~0_In-518629399 256))) (.cse0 (= 0 (mod ~a$r_buff0_thd1~0_In-518629399 256))) (.cse3 (= (mod ~a$w_buff1_used~0_In-518629399 256) 0)) (.cse2 (= 0 (mod ~a$r_buff1_thd1~0_In-518629399 256)))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork1_#t~ite6_Out-518629399| ~a$w_buff1_used~0_In-518629399) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= |P0Thread1of1ForFork1_#t~ite6_Out-518629399| 0)))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-518629399, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-518629399, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-518629399, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-518629399} OutVars{P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out-518629399|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-518629399, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-518629399, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-518629399, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-518629399} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-26 22:37:47,089 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] L751-->L752: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff0_used~0_In874458350 256))) (.cse0 (= 0 (mod ~a$r_buff0_thd1~0_In874458350 256)))) (or (and (= ~a$r_buff0_thd1~0_Out874458350 ~a$r_buff0_thd1~0_In874458350) (or .cse0 .cse1)) (and (= 0 ~a$r_buff0_thd1~0_Out874458350) (not .cse1) (not .cse0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In874458350, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In874458350} OutVars{P0Thread1of1ForFork1_#t~ite7=|P0Thread1of1ForFork1_#t~ite7_Out874458350|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In874458350, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_Out874458350} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite7, ~a$r_buff0_thd1~0] because there is no mapped edge [2019-12-26 22:37:47,090 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [823] [823] L752-->L752-2: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff0_used~0_In1476891503 256))) (.cse1 (= 0 (mod ~a$r_buff0_thd1~0_In1476891503 256))) (.cse2 (= (mod ~a$w_buff1_used~0_In1476891503 256) 0)) (.cse3 (= 0 (mod ~a$r_buff1_thd1~0_In1476891503 256)))) (or (and (= |P0Thread1of1ForFork1_#t~ite8_Out1476891503| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P0Thread1of1ForFork1_#t~ite8_Out1476891503| ~a$r_buff1_thd1~0_In1476891503) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In1476891503, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1476891503, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1476891503, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1476891503} OutVars{P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out1476891503|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In1476891503, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1476891503, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1476891503, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1476891503} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-26 22:37:47,090 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [867] [867] L752-2-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= v_~a$r_buff1_thd1~0_67 |v_P0Thread1of1ForFork1_#t~ite8_28|) (= (+ v_~__unbuffered_cnt~0_48 1) v_~__unbuffered_cnt~0_47) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_48} OutVars{P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_27|, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_67, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_47} 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-26 22:37:47,091 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L809-->L809-2: Formula: (let ((.cse2 (= (mod ~a$r_buff0_thd3~0_In-2037189931 256) 0)) (.cse3 (= 0 (mod ~a$w_buff0_used~0_In-2037189931 256))) (.cse1 (= 0 (mod ~a$w_buff1_used~0_In-2037189931 256))) (.cse0 (= 0 (mod ~a$r_buff1_thd3~0_In-2037189931 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork0_#t~ite41_Out-2037189931|)) (and (or .cse2 .cse3) (= |P2Thread1of1ForFork0_#t~ite41_Out-2037189931| ~a$w_buff1_used~0_In-2037189931) (or .cse1 .cse0)))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-2037189931, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-2037189931, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-2037189931, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-2037189931} OutVars{~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-2037189931, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-2037189931, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-2037189931, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-2037189931, P2Thread1of1ForFork0_#t~ite41=|P2Thread1of1ForFork0_#t~ite41_Out-2037189931|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite41] because there is no mapped edge [2019-12-26 22:37:47,091 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L810-->L810-2: Formula: (let ((.cse0 (= (mod ~a$w_buff0_used~0_In-1943800216 256) 0)) (.cse1 (= 0 (mod ~a$r_buff0_thd3~0_In-1943800216 256)))) (or (and (not .cse0) (= 0 |P2Thread1of1ForFork0_#t~ite42_Out-1943800216|) (not .cse1)) (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite42_Out-1943800216| ~a$r_buff0_thd3~0_In-1943800216)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-1943800216, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1943800216} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In-1943800216, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1943800216, P2Thread1of1ForFork0_#t~ite42=|P2Thread1of1ForFork0_#t~ite42_Out-1943800216|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-26 22:37:47,092 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [844] [844] L811-->L811-2: Formula: (let ((.cse3 (= (mod ~a$r_buff1_thd3~0_In2013713030 256) 0)) (.cse2 (= 0 (mod ~a$w_buff1_used~0_In2013713030 256))) (.cse1 (= (mod ~a$r_buff0_thd3~0_In2013713030 256) 0)) (.cse0 (= (mod ~a$w_buff0_used~0_In2013713030 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork0_#t~ite43_Out2013713030| 0)) (and (= |P2Thread1of1ForFork0_#t~ite43_Out2013713030| ~a$r_buff1_thd3~0_In2013713030) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In2013713030, ~a$w_buff0_used~0=~a$w_buff0_used~0_In2013713030, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In2013713030, ~a$w_buff1_used~0=~a$w_buff1_used~0_In2013713030} OutVars{P2Thread1of1ForFork0_#t~ite43=|P2Thread1of1ForFork0_#t~ite43_Out2013713030|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In2013713030, ~a$w_buff0_used~0=~a$w_buff0_used~0_In2013713030, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In2013713030, ~a$w_buff1_used~0=~a$w_buff1_used~0_In2013713030} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite43] because there is no mapped edge [2019-12-26 22:37:47,092 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [850] [850] L811-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_38 1) v_~__unbuffered_cnt~0_37) (= |v_P2Thread1of1ForFork0_#res.base_5| 0) (= v_~a$r_buff1_thd3~0_120 |v_P2Thread1of1ForFork0_#t~ite43_30|)) InVars {P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_38} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_29|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_120, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_37, 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-26 22:37:47,092 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [806] [806] L834-1-->L840: Formula: (and (= 3 v_~__unbuffered_cnt~0_24) (= v_~main$tmp_guard0~0_8 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_24} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_24, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-26 22:37:47,093 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L840-2-->L840-5: Formula: (let ((.cse2 (= |ULTIMATE.start_main_#t~ite48_Out-1635829192| |ULTIMATE.start_main_#t~ite47_Out-1635829192|)) (.cse0 (= (mod ~a$r_buff1_thd0~0_In-1635829192 256) 0)) (.cse1 (= (mod ~a$w_buff1_used~0_In-1635829192 256) 0))) (or (and (or .cse0 .cse1) .cse2 (= ~a~0_In-1635829192 |ULTIMATE.start_main_#t~ite47_Out-1635829192|)) (and (= |ULTIMATE.start_main_#t~ite47_Out-1635829192| ~a$w_buff1~0_In-1635829192) .cse2 (not .cse0) (not .cse1)))) InVars {~a~0=~a~0_In-1635829192, ~a$w_buff1~0=~a$w_buff1~0_In-1635829192, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-1635829192, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1635829192} OutVars{~a~0=~a~0_In-1635829192, ~a$w_buff1~0=~a$w_buff1~0_In-1635829192, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out-1635829192|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-1635829192, ULTIMATE.start_main_#t~ite48=|ULTIMATE.start_main_#t~ite48_Out-1635829192|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1635829192} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-26 22:37:47,094 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L841-->L841-2: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff0_used~0_In-1872517423 256))) (.cse1 (= (mod ~a$r_buff0_thd0~0_In-1872517423 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite49_Out-1872517423| ~a$w_buff0_used~0_In-1872517423) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite49_Out-1872517423| 0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-1872517423, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1872517423} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In-1872517423, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out-1872517423|, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1872517423} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-26 22:37:47,094 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [835] [835] L842-->L842-2: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff1_thd0~0_In-1314785689 256))) (.cse0 (= (mod ~a$w_buff1_used~0_In-1314785689 256) 0)) (.cse2 (= 0 (mod ~a$w_buff0_used~0_In-1314785689 256))) (.cse3 (= (mod ~a$r_buff0_thd0~0_In-1314785689 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite50_Out-1314785689|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= ~a$w_buff1_used~0_In-1314785689 |ULTIMATE.start_main_#t~ite50_Out-1314785689|) (or .cse2 .cse3)))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-1314785689, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1314785689, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1314785689, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1314785689} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out-1314785689|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-1314785689, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1314785689, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1314785689, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1314785689} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-26 22:37:47,095 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [827] [827] L843-->L843-2: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff0_thd0~0_In1472120494 256))) (.cse1 (= (mod ~a$w_buff0_used~0_In1472120494 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite51_Out1472120494|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~a$r_buff0_thd0~0_In1472120494 |ULTIMATE.start_main_#t~ite51_Out1472120494|)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In1472120494, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1472120494} OutVars{ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out1472120494|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1472120494, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1472120494} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-26 22:37:47,096 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L844-->L844-2: Formula: (let ((.cse0 (= (mod ~a$w_buff1_used~0_In1031812550 256) 0)) (.cse1 (= (mod ~a$r_buff1_thd0~0_In1031812550 256) 0)) (.cse3 (= 0 (mod ~a$w_buff0_used~0_In1031812550 256))) (.cse2 (= 0 (mod ~a$r_buff0_thd0~0_In1031812550 256)))) (or (and (= |ULTIMATE.start_main_#t~ite52_Out1031812550| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse3 .cse2) (= |ULTIMATE.start_main_#t~ite52_Out1031812550| ~a$r_buff1_thd0~0_In1031812550)))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In1031812550, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1031812550, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1031812550, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1031812550} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out1031812550|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In1031812550, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1031812550, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1031812550, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1031812550} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-26 22:37:47,096 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [887] [887] L844-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_19 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|) (= (mod v_~main$tmp_guard1~0_19 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|) (= v_~a$r_buff1_thd0~0_109 |v_ULTIMATE.start_main_#t~ite52_38|) (= 0 v_~__unbuffered_p0_EAX~0_66) (= v_~main$tmp_guard1~0_19 0) (= v_~__unbuffered_p2_EBX~0_30 0) (= v_~y~0_31 2) (= 1 v_~__unbuffered_p2_EAX~0_23)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_66, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_38|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_30, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_23, ~y~0=v_~y~0_31} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_66, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_37|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_19, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_30, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_109, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_19, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_23, ~y~0=v_~y~0_31, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|} 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-26 22:37:47,213 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.12 10:37:47 BasicIcfg [2019-12-26 22:37:47,213 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-26 22:37:47,214 INFO L168 Benchmark]: Toolchain (without parser) took 121711.38 ms. Allocated memory was 137.4 MB in the beginning and 3.2 GB in the end (delta: 3.1 GB). Free memory was 99.1 MB in the beginning and 770.8 MB in the end (delta: -671.6 MB). Peak memory consumption was 2.4 GB. Max. memory is 7.1 GB. [2019-12-26 22:37:47,215 INFO L168 Benchmark]: CDTParser took 1.39 ms. Allocated memory is still 137.4 MB. Free memory was 119.3 MB in the beginning and 119.1 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2019-12-26 22:37:47,215 INFO L168 Benchmark]: CACSL2BoogieTranslator took 805.24 ms. Allocated memory was 137.4 MB in the beginning and 201.3 MB in the end (delta: 64.0 MB). Free memory was 98.9 MB in the beginning and 153.7 MB in the end (delta: -54.7 MB). Peak memory consumption was 25.0 MB. Max. memory is 7.1 GB. [2019-12-26 22:37:47,215 INFO L168 Benchmark]: Boogie Procedure Inliner took 76.34 ms. Allocated memory is still 201.3 MB. Free memory was 153.7 MB in the beginning and 150.8 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-26 22:37:47,216 INFO L168 Benchmark]: Boogie Preprocessor took 53.53 ms. Allocated memory is still 201.3 MB. Free memory was 150.8 MB in the beginning and 148.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-26 22:37:47,217 INFO L168 Benchmark]: RCFGBuilder took 865.77 ms. Allocated memory is still 201.3 MB. Free memory was 148.1 MB in the beginning and 98.0 MB in the end (delta: 50.2 MB). Peak memory consumption was 50.2 MB. Max. memory is 7.1 GB. [2019-12-26 22:37:47,217 INFO L168 Benchmark]: TraceAbstraction took 119898.61 ms. Allocated memory was 201.3 MB in the beginning and 3.2 GB in the end (delta: 3.0 GB). Free memory was 98.0 MB in the beginning and 770.8 MB in the end (delta: -672.8 MB). Peak memory consumption was 2.4 GB. Max. memory is 7.1 GB. [2019-12-26 22:37:47,219 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.39 ms. Allocated memory is still 137.4 MB. Free memory was 119.3 MB in the beginning and 119.1 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 805.24 ms. Allocated memory was 137.4 MB in the beginning and 201.3 MB in the end (delta: 64.0 MB). Free memory was 98.9 MB in the beginning and 153.7 MB in the end (delta: -54.7 MB). Peak memory consumption was 25.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 76.34 ms. Allocated memory is still 201.3 MB. Free memory was 153.7 MB in the beginning and 150.8 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 53.53 ms. Allocated memory is still 201.3 MB. Free memory was 150.8 MB in the beginning and 148.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 865.77 ms. Allocated memory is still 201.3 MB. Free memory was 148.1 MB in the beginning and 98.0 MB in the end (delta: 50.2 MB). Peak memory consumption was 50.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 119898.61 ms. Allocated memory was 201.3 MB in the beginning and 3.2 GB in the end (delta: 3.0 GB). Free memory was 98.0 MB in the beginning and 770.8 MB in the end (delta: -672.8 MB). Peak memory consumption was 2.4 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 6.1s, 177 ProgramPointsBefore, 92 ProgramPointsAfterwards, 214 TransitionsBefore, 100 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 8 FixpointIterations, 34 TrivialSequentialCompositions, 49 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 33 ConcurrentYvCompositions, 33 ChoiceCompositions, 7302 VarBasedMoverChecksPositive, 250 VarBasedMoverChecksNegative, 40 SemBasedMoverChecksPositive, 286 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.8s, 0 MoverChecksTotal, 87212 CheckedPairsTotal, 116 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(&t1117, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_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(&t1118, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L762] 2 x = 1 [L765] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, 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_p0_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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [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) [L834] FCALL, FORK 0 pthread_create(&t1119, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_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=1, y=1, z=0] [L782] 3 y = 2 [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_p0_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=1, y=2, 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_p0_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=1, y=2, z=1] [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) [L769] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [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)) [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_p0_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=1, y=2, z=1] [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 [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_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$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=1, y=2, 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)) [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_p0_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=1, y=2, 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_p0_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=1, y=2, 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_p0_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=1, y=2, 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_p0_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=1, y=2, 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: 119.5s, OverallIterations: 40, TraceHistogramMax: 1, AutomataDifference: 47.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 10082 SDtfs, 15130 SDslu, 28884 SDs, 0 SdLazy, 20264 SolverSat, 917 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 19.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 628 GetRequests, 139 SyntacticMatches, 26 SemanticMatches, 463 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2344 ImplicationChecksByTransitivity, 6.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=137801occurred 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: 47.5s AutomataMinimizationTime, 39 MinimizatonAttempts, 755382 StatesRemovedByMinimization, 36 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 1911 NumberOfCodeBlocks, 1911 NumberOfCodeBlocksAsserted, 40 NumberOfCheckSat, 1805 ConstructedInterpolants, 0 QuantifiedInterpolants, 350065 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 39 InterpolantComputations, 39 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...