/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe023_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-1d1d2b5 [2020-10-21 23:07:23,937 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-21 23:07:23,941 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-21 23:07:23,972 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-21 23:07:23,973 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-21 23:07:23,974 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-21 23:07:23,975 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-21 23:07:23,977 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-21 23:07:23,979 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-21 23:07:23,980 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-21 23:07:23,981 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-21 23:07:23,982 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-21 23:07:23,983 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-21 23:07:23,984 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-21 23:07:23,985 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-21 23:07:23,987 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-21 23:07:23,987 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-21 23:07:23,989 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-21 23:07:23,991 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-21 23:07:23,993 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-21 23:07:23,995 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-21 23:07:23,996 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-21 23:07:23,998 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-21 23:07:23,999 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-21 23:07:24,002 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-21 23:07:24,002 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-21 23:07:24,003 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-21 23:07:24,004 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-21 23:07:24,004 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-21 23:07:24,005 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-21 23:07:24,005 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-21 23:07:24,006 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-21 23:07:24,007 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-21 23:07:24,008 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-21 23:07:24,009 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-21 23:07:24,010 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-21 23:07:24,011 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-21 23:07:24,011 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-21 23:07:24,011 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-21 23:07:24,012 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-21 23:07:24,013 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-21 23:07:24,014 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA.epf [2020-10-21 23:07:24,046 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-21 23:07:24,046 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-21 23:07:24,048 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-21 23:07:24,048 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-21 23:07:24,048 INFO L138 SettingsManager]: * Use SBE=true [2020-10-21 23:07:24,048 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-21 23:07:24,049 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-21 23:07:24,049 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-21 23:07:24,049 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-21 23:07:24,049 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-21 23:07:24,049 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-21 23:07:24,050 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-21 23:07:24,050 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-21 23:07:24,050 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-21 23:07:24,050 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-21 23:07:24,050 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-21 23:07:24,050 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-21 23:07:24,051 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-21 23:07:24,051 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-21 23:07:24,051 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-21 23:07:24,051 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-21 23:07:24,051 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-21 23:07:24,052 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-21 23:07:24,052 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2020-10-21 23:07:24,052 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-21 23:07:24,052 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-21 23:07:24,053 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-21 23:07:24,053 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2020-10-21 23:07:24,053 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-21 23:07:24,374 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-21 23:07:24,390 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-21 23:07:24,394 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-21 23:07:24,396 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-21 23:07:24,397 INFO L275 PluginConnector]: CDTParser initialized [2020-10-21 23:07:24,398 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe023_power.opt.i [2020-10-21 23:07:24,485 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a26e65ea2/c4fd7cd2138f4ee2841bea86d7ca7273/FLAG0edec04de [2020-10-21 23:07:25,091 INFO L306 CDTParser]: Found 1 translation units. [2020-10-21 23:07:25,092 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe023_power.opt.i [2020-10-21 23:07:25,108 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a26e65ea2/c4fd7cd2138f4ee2841bea86d7ca7273/FLAG0edec04de [2020-10-21 23:07:25,364 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a26e65ea2/c4fd7cd2138f4ee2841bea86d7ca7273 [2020-10-21 23:07:25,374 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-21 23:07:25,381 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-21 23:07:25,383 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-21 23:07:25,383 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-21 23:07:25,386 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-21 23:07:25,387 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.10 11:07:25" (1/1) ... [2020-10-21 23:07:25,391 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58031a34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:07:25, skipping insertion in model container [2020-10-21 23:07:25,391 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.10 11:07:25" (1/1) ... [2020-10-21 23:07:25,399 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-21 23:07:25,465 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-21 23:07:26,145 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-21 23:07:26,158 INFO L203 MainTranslator]: Completed pre-run [2020-10-21 23:07:26,231 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-21 23:07:26,317 INFO L208 MainTranslator]: Completed translation [2020-10-21 23:07:26,317 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:07:26 WrapperNode [2020-10-21 23:07:26,318 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-21 23:07:26,319 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-21 23:07:26,319 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-21 23:07:26,319 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-21 23:07:26,326 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:07:26" (1/1) ... [2020-10-21 23:07:26,355 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:07:26" (1/1) ... [2020-10-21 23:07:26,390 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-21 23:07:26,390 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-21 23:07:26,391 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-21 23:07:26,391 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-21 23:07:26,401 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:07:26" (1/1) ... [2020-10-21 23:07:26,401 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:07:26" (1/1) ... [2020-10-21 23:07:26,408 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:07:26" (1/1) ... [2020-10-21 23:07:26,408 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:07:26" (1/1) ... [2020-10-21 23:07:26,425 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:07:26" (1/1) ... [2020-10-21 23:07:26,432 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:07:26" (1/1) ... [2020-10-21 23:07:26,438 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:07:26" (1/1) ... [2020-10-21 23:07:26,446 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-21 23:07:26,447 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-21 23:07:26,448 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-21 23:07:26,448 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-21 23:07:26,449 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:07:26" (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 [2020-10-21 23:07:26,529 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-21 23:07:26,529 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-21 23:07:26,529 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-21 23:07:26,530 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-21 23:07:26,530 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-21 23:07:26,530 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-21 23:07:26,530 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-21 23:07:26,530 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-21 23:07:26,531 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-21 23:07:26,531 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-21 23:07:26,531 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-21 23:07:26,531 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-21 23:07:26,532 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-21 23:07:26,532 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-21 23:07:26,534 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-21 23:07:30,381 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-21 23:07:30,381 INFO L298 CfgBuilder]: Removed 14 assume(true) statements. [2020-10-21 23:07:30,384 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.10 11:07:30 BoogieIcfgContainer [2020-10-21 23:07:30,384 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-21 23:07:30,388 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-21 23:07:30,388 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-21 23:07:30,391 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-21 23:07:30,392 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.10 11:07:25" (1/3) ... [2020-10-21 23:07:30,394 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ab514c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.10 11:07:30, skipping insertion in model container [2020-10-21 23:07:30,395 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:07:26" (2/3) ... [2020-10-21 23:07:30,395 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ab514c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.10 11:07:30, skipping insertion in model container [2020-10-21 23:07:30,395 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.10 11:07:30" (3/3) ... [2020-10-21 23:07:30,397 INFO L111 eAbstractionObserver]: Analyzing ICFG safe023_power.opt.i [2020-10-21 23:07:30,409 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-21 23:07:30,409 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-21 23:07:30,419 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-21 23:07:30,420 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-21 23:07:30,464 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:30,465 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:30,465 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:30,465 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:30,465 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:30,466 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:30,466 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:30,466 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:30,466 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:30,466 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:30,467 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:30,467 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:30,467 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:30,467 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:30,468 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:30,468 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:30,468 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:30,468 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:30,468 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:30,468 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:30,469 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:30,469 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:30,469 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:30,469 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:30,470 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:30,470 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:30,470 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:30,470 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:30,471 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:30,471 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:30,471 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:30,471 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:30,471 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:30,471 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:30,472 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:30,472 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:30,472 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:30,473 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:30,474 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:30,474 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:30,475 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:30,475 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:30,475 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:30,476 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:30,476 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:30,476 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:30,476 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:30,476 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:30,477 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:30,478 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:30,479 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:30,479 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:30,479 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:30,479 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:30,479 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:30,479 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:30,480 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:30,480 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:30,480 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:30,481 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:30,481 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:30,481 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:30,481 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:30,481 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:30,481 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:30,482 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:30,482 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:30,482 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:30,483 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:30,483 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:30,483 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:30,483 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:30,483 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:30,484 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:30,484 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:30,484 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:30,484 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:30,484 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:30,484 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:30,485 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:30,485 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:30,485 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:30,485 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:30,486 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:30,486 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:30,487 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:30,487 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:30,487 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:30,487 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:30,488 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:30,488 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:30,488 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:30,488 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:30,488 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:30,488 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:30,489 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:30,489 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:30,489 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:30,489 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:30,489 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:30,489 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:30,490 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:30,493 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:30,493 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:30,493 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:30,494 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:30,500 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:30,501 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:30,501 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:30,501 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:30,501 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:30,502 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:30,502 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:30,502 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:30,502 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:30,502 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:30,502 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:30,503 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:30,503 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:30,503 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:30,504 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:30,504 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:30,504 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:30,505 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:30,506 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:30,506 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite71| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:30,506 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite70| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:30,506 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite74| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:30,506 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite73| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:30,506 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite72| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:30,507 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:30,507 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:30,512 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:30,513 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:30,513 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:30,513 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:30,513 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:30,513 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:30,514 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:30,514 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:30,514 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:30,514 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:30,514 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:30,514 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:30,515 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:30,515 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:30,515 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:30,515 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:30,515 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:30,515 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:30,516 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:30,516 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:30,516 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite74| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:30,516 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:30,517 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite73| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:30,517 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite72| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:30,517 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:30,517 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite70| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:30,517 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite71| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:30,517 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:30,518 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:30,518 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:30,518 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:30,518 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:30,518 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:30,520 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:30,521 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:30,521 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:30,521 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:30,522 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:30,522 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:30,522 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:30,522 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:30,522 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:30,522 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:30,523 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:30,523 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:30,523 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:30,523 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:30,523 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:30,523 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:30,524 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:30,524 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:30,526 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:30,526 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:30,526 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:30,526 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:30,526 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:30,526 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:30,526 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:30,527 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:30,527 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:30,527 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:30,527 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:30,527 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:30,527 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:30,527 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:30,527 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:30,528 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:30,528 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:30,528 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:30,528 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:30,528 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:30,528 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:30,534 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:30,535 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:30,535 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:30,535 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:30,535 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:30,536 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:30,536 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:30,536 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:30,536 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:30,536 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:30,536 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:30,537 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:30,537 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:30,537 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:07:30,539 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-10-21 23:07:30,553 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-10-21 23:07:30,575 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-21 23:07:30,575 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-21 23:07:30,575 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-21 23:07:30,575 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-21 23:07:30,576 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-21 23:07:30,576 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-21 23:07:30,576 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-21 23:07:30,576 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-21 23:07:30,598 INFO L137 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2020-10-21 23:07:30,603 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 110 places, 103 transitions, 221 flow [2020-10-21 23:07:30,606 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 110 places, 103 transitions, 221 flow [2020-10-21 23:07:30,608 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 110 places, 103 transitions, 221 flow [2020-10-21 23:07:30,680 INFO L129 PetriNetUnfolder]: 3/100 cut-off events. [2020-10-21 23:07:30,681 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-21 23:07:30,694 INFO L80 FinitePrefix]: Finished finitePrefix Result has 110 conditions, 100 events. 3/100 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 83 event pairs, 0 based on Foata normal form. 0/95 useless extension candidates. Maximal degree in co-relation 66. Up to 2 conditions per place. [2020-10-21 23:07:30,702 INFO L116 LiptonReduction]: Number of co-enabled transitions 1970 [2020-10-21 23:07:31,948 WARN L193 SmtUtils]: Spent 1.18 s on a formula simplification. DAG size of input: 228 DAG size of output: 188 [2020-10-21 23:07:31,990 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 2, 1] term [2020-10-21 23:07:31,990 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 23:07:31,993 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-21 23:07:31,994 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 23:07:33,134 WARN L193 SmtUtils]: Spent 1.12 s on a formula simplification. DAG size of input: 145 DAG size of output: 124 [2020-10-21 23:07:33,570 WARN L193 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-10-21 23:07:35,534 WARN L193 SmtUtils]: Spent 350.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2020-10-21 23:07:35,900 WARN L193 SmtUtils]: Spent 363.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2020-10-21 23:07:36,748 WARN L193 SmtUtils]: Spent 625.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 110 [2020-10-21 23:07:37,037 WARN L193 SmtUtils]: Spent 285.00 ms on a formula simplification that was a NOOP. DAG size: 107 [2020-10-21 23:07:38,336 WARN L193 SmtUtils]: Spent 1.29 s on a formula simplification. DAG size of input: 141 DAG size of output: 132 [2020-10-21 23:07:38,728 WARN L193 SmtUtils]: Spent 388.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2020-10-21 23:07:39,337 WARN L193 SmtUtils]: Spent 411.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 114 [2020-10-21 23:07:39,554 WARN L193 SmtUtils]: Spent 214.00 ms on a formula simplification that was a NOOP. DAG size: 110 [2020-10-21 23:07:39,601 INFO L131 LiptonReduction]: Checked pairs total: 5977 [2020-10-21 23:07:39,601 INFO L133 LiptonReduction]: Total number of compositions: 93 [2020-10-21 23:07:39,614 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 37 places, 27 transitions, 69 flow [2020-10-21 23:07:39,737 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 986 states. [2020-10-21 23:07:39,740 INFO L276 IsEmpty]: Start isEmpty. Operand 986 states. [2020-10-21 23:07:39,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-10-21 23:07:39,749 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:07:39,750 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-10-21 23:07:39,750 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:07:39,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:07:39,756 INFO L82 PathProgramCache]: Analyzing trace with hash 1759824079, now seen corresponding path program 1 times [2020-10-21 23:07:39,767 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:07:39,767 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985712536] [2020-10-21 23:07:39,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:07:39,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:07:40,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 23:07:40,010 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985712536] [2020-10-21 23:07:40,011 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:07:40,011 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-21 23:07:40,012 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715320479] [2020-10-21 23:07:40,015 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-21 23:07:40,015 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:07:40,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-21 23:07:40,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-21 23:07:40,028 INFO L87 Difference]: Start difference. First operand 986 states. Second operand 3 states. [2020-10-21 23:07:40,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:07:40,189 INFO L93 Difference]: Finished difference Result 824 states and 2607 transitions. [2020-10-21 23:07:40,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-21 23:07:40,195 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-10-21 23:07:40,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:07:40,220 INFO L225 Difference]: With dead ends: 824 [2020-10-21 23:07:40,220 INFO L226 Difference]: Without dead ends: 674 [2020-10-21 23:07:40,221 INFO L677 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 [2020-10-21 23:07:40,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 674 states. [2020-10-21 23:07:40,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 674 to 674. [2020-10-21 23:07:40,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 674 states. [2020-10-21 23:07:40,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 674 states to 674 states and 2092 transitions. [2020-10-21 23:07:40,333 INFO L78 Accepts]: Start accepts. Automaton has 674 states and 2092 transitions. Word has length 5 [2020-10-21 23:07:40,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:07:40,334 INFO L481 AbstractCegarLoop]: Abstraction has 674 states and 2092 transitions. [2020-10-21 23:07:40,334 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-21 23:07:40,334 INFO L276 IsEmpty]: Start isEmpty. Operand 674 states and 2092 transitions. [2020-10-21 23:07:40,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-21 23:07:40,336 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:07:40,336 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:07:40,337 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-21 23:07:40,337 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:07:40,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:07:40,337 INFO L82 PathProgramCache]: Analyzing trace with hash 1756462018, now seen corresponding path program 1 times [2020-10-21 23:07:40,338 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:07:40,338 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722706618] [2020-10-21 23:07:40,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:07:40,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:07:40,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 23:07:40,525 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722706618] [2020-10-21 23:07:40,526 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:07:40,526 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-21 23:07:40,526 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836916367] [2020-10-21 23:07:40,528 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-21 23:07:40,528 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:07:40,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-21 23:07:40,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-21 23:07:40,529 INFO L87 Difference]: Start difference. First operand 674 states and 2092 transitions. Second operand 3 states. [2020-10-21 23:07:40,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:07:40,548 INFO L93 Difference]: Finished difference Result 599 states and 1822 transitions. [2020-10-21 23:07:40,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-21 23:07:40,550 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-10-21 23:07:40,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:07:40,555 INFO L225 Difference]: With dead ends: 599 [2020-10-21 23:07:40,556 INFO L226 Difference]: Without dead ends: 599 [2020-10-21 23:07:40,556 INFO L677 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 [2020-10-21 23:07:40,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2020-10-21 23:07:40,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 599. [2020-10-21 23:07:40,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 599 states. [2020-10-21 23:07:40,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 1822 transitions. [2020-10-21 23:07:40,584 INFO L78 Accepts]: Start accepts. Automaton has 599 states and 1822 transitions. Word has length 9 [2020-10-21 23:07:40,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:07:40,585 INFO L481 AbstractCegarLoop]: Abstraction has 599 states and 1822 transitions. [2020-10-21 23:07:40,585 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-21 23:07:40,586 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 1822 transitions. [2020-10-21 23:07:40,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-21 23:07:40,588 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:07:40,588 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:07:40,589 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-21 23:07:40,589 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:07:40,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:07:40,589 INFO L82 PathProgramCache]: Analyzing trace with hash 1974210350, now seen corresponding path program 1 times [2020-10-21 23:07:40,589 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:07:40,590 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590792666] [2020-10-21 23:07:40,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:07:40,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:07:40,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 23:07:40,786 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590792666] [2020-10-21 23:07:40,786 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:07:40,786 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-21 23:07:40,786 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732171609] [2020-10-21 23:07:40,787 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-21 23:07:40,787 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:07:40,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-21 23:07:40,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-21 23:07:40,788 INFO L87 Difference]: Start difference. First operand 599 states and 1822 transitions. Second operand 3 states. [2020-10-21 23:07:40,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:07:40,820 INFO L93 Difference]: Finished difference Result 584 states and 1770 transitions. [2020-10-21 23:07:40,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-21 23:07:40,822 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2020-10-21 23:07:40,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:07:40,827 INFO L225 Difference]: With dead ends: 584 [2020-10-21 23:07:40,827 INFO L226 Difference]: Without dead ends: 584 [2020-10-21 23:07:40,827 INFO L677 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 [2020-10-21 23:07:40,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2020-10-21 23:07:40,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 584. [2020-10-21 23:07:40,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 584 states. [2020-10-21 23:07:40,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 1770 transitions. [2020-10-21 23:07:40,851 INFO L78 Accepts]: Start accepts. Automaton has 584 states and 1770 transitions. Word has length 12 [2020-10-21 23:07:40,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:07:40,851 INFO L481 AbstractCegarLoop]: Abstraction has 584 states and 1770 transitions. [2020-10-21 23:07:40,851 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-21 23:07:40,852 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 1770 transitions. [2020-10-21 23:07:40,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-21 23:07:40,854 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:07:40,855 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:07:40,855 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-21 23:07:40,855 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:07:40,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:07:40,855 INFO L82 PathProgramCache]: Analyzing trace with hash 1070334446, now seen corresponding path program 1 times [2020-10-21 23:07:40,856 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:07:40,856 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936425490] [2020-10-21 23:07:40,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:07:40,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:07:40,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 23:07:40,934 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936425490] [2020-10-21 23:07:40,935 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:07:40,935 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-21 23:07:40,935 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362927076] [2020-10-21 23:07:40,935 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-21 23:07:40,936 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:07:40,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-21 23:07:40,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-21 23:07:40,936 INFO L87 Difference]: Start difference. First operand 584 states and 1770 transitions. Second operand 4 states. [2020-10-21 23:07:40,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:07:40,973 INFO L93 Difference]: Finished difference Result 776 states and 2318 transitions. [2020-10-21 23:07:40,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-21 23:07:40,975 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2020-10-21 23:07:40,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:07:40,978 INFO L225 Difference]: With dead ends: 776 [2020-10-21 23:07:40,978 INFO L226 Difference]: Without dead ends: 416 [2020-10-21 23:07:40,979 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-21 23:07:40,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2020-10-21 23:07:40,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 416. [2020-10-21 23:07:40,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 416 states. [2020-10-21 23:07:40,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 1184 transitions. [2020-10-21 23:07:40,993 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 1184 transitions. Word has length 13 [2020-10-21 23:07:40,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:07:40,994 INFO L481 AbstractCegarLoop]: Abstraction has 416 states and 1184 transitions. [2020-10-21 23:07:40,994 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-21 23:07:40,994 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 1184 transitions. [2020-10-21 23:07:40,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-21 23:07:40,997 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:07:40,998 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:07:40,998 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-21 23:07:40,998 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:07:40,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:07:40,998 INFO L82 PathProgramCache]: Analyzing trace with hash -1397561244, now seen corresponding path program 1 times [2020-10-21 23:07:40,999 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:07:40,999 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880230877] [2020-10-21 23:07:40,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:07:41,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:07:41,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 23:07:41,235 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880230877] [2020-10-21 23:07:41,235 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:07:41,235 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-21 23:07:41,235 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310528134] [2020-10-21 23:07:41,236 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-21 23:07:41,236 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:07:41,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-21 23:07:41,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-21 23:07:41,237 INFO L87 Difference]: Start difference. First operand 416 states and 1184 transitions. Second operand 6 states. [2020-10-21 23:07:41,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:07:41,440 INFO L93 Difference]: Finished difference Result 430 states and 1228 transitions. [2020-10-21 23:07:41,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-21 23:07:41,441 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2020-10-21 23:07:41,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:07:41,445 INFO L225 Difference]: With dead ends: 430 [2020-10-21 23:07:41,445 INFO L226 Difference]: Without dead ends: 430 [2020-10-21 23:07:41,445 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-10-21 23:07:41,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2020-10-21 23:07:41,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 430. [2020-10-21 23:07:41,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 430 states. [2020-10-21 23:07:41,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 1228 transitions. [2020-10-21 23:07:41,462 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 1228 transitions. Word has length 15 [2020-10-21 23:07:41,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:07:41,462 INFO L481 AbstractCegarLoop]: Abstraction has 430 states and 1228 transitions. [2020-10-21 23:07:41,462 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-21 23:07:41,462 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 1228 transitions. [2020-10-21 23:07:41,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-21 23:07:41,463 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:07:41,467 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:07:41,467 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-21 23:07:41,467 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:07:41,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:07:41,468 INFO L82 PathProgramCache]: Analyzing trace with hash -1581553398, now seen corresponding path program 2 times [2020-10-21 23:07:41,468 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:07:41,468 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295788891] [2020-10-21 23:07:41,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:07:41,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:07:41,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 23:07:41,787 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295788891] [2020-10-21 23:07:41,787 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:07:41,788 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-21 23:07:41,788 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205261426] [2020-10-21 23:07:41,788 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-21 23:07:41,788 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:07:41,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-21 23:07:41,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2020-10-21 23:07:41,790 INFO L87 Difference]: Start difference. First operand 430 states and 1228 transitions. Second operand 8 states. [2020-10-21 23:07:42,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:07:42,049 INFO L93 Difference]: Finished difference Result 472 states and 1349 transitions. [2020-10-21 23:07:42,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-21 23:07:42,053 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2020-10-21 23:07:42,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:07:42,057 INFO L225 Difference]: With dead ends: 472 [2020-10-21 23:07:42,057 INFO L226 Difference]: Without dead ends: 472 [2020-10-21 23:07:42,058 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2020-10-21 23:07:42,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2020-10-21 23:07:42,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 455. [2020-10-21 23:07:42,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 455 states. [2020-10-21 23:07:42,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 1297 transitions. [2020-10-21 23:07:42,073 INFO L78 Accepts]: Start accepts. Automaton has 455 states and 1297 transitions. Word has length 15 [2020-10-21 23:07:42,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:07:42,074 INFO L481 AbstractCegarLoop]: Abstraction has 455 states and 1297 transitions. [2020-10-21 23:07:42,074 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-21 23:07:42,074 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 1297 transitions. [2020-10-21 23:07:42,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-21 23:07:42,076 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:07:42,076 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:07:42,076 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-21 23:07:42,076 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:07:42,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:07:42,077 INFO L82 PathProgramCache]: Analyzing trace with hash 1780486270, now seen corresponding path program 3 times [2020-10-21 23:07:42,077 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:07:42,078 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342628975] [2020-10-21 23:07:42,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:07:42,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:07:42,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 23:07:42,299 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342628975] [2020-10-21 23:07:42,299 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:07:42,299 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-21 23:07:42,299 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788939421] [2020-10-21 23:07:42,300 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-21 23:07:42,300 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:07:42,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-21 23:07:42,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2020-10-21 23:07:42,301 INFO L87 Difference]: Start difference. First operand 455 states and 1297 transitions. Second operand 8 states. [2020-10-21 23:07:42,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:07:42,717 INFO L93 Difference]: Finished difference Result 529 states and 1503 transitions. [2020-10-21 23:07:42,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-21 23:07:42,720 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2020-10-21 23:07:42,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:07:42,724 INFO L225 Difference]: With dead ends: 529 [2020-10-21 23:07:42,724 INFO L226 Difference]: Without dead ends: 529 [2020-10-21 23:07:42,725 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2020-10-21 23:07:42,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2020-10-21 23:07:42,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 470. [2020-10-21 23:07:42,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 470 states. [2020-10-21 23:07:42,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 1343 transitions. [2020-10-21 23:07:42,741 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 1343 transitions. Word has length 15 [2020-10-21 23:07:42,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:07:42,742 INFO L481 AbstractCegarLoop]: Abstraction has 470 states and 1343 transitions. [2020-10-21 23:07:42,742 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-21 23:07:42,742 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 1343 transitions. [2020-10-21 23:07:42,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-21 23:07:42,743 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:07:42,743 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:07:42,744 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-21 23:07:42,744 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:07:42,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:07:42,744 INFO L82 PathProgramCache]: Analyzing trace with hash -191426498, now seen corresponding path program 4 times [2020-10-21 23:07:42,744 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:07:42,745 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513778113] [2020-10-21 23:07:42,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:07:42,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:07:42,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 23:07:42,918 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513778113] [2020-10-21 23:07:42,918 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:07:42,919 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-21 23:07:42,919 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072228965] [2020-10-21 23:07:42,919 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-21 23:07:42,919 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:07:42,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-21 23:07:42,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2020-10-21 23:07:42,920 INFO L87 Difference]: Start difference. First operand 470 states and 1343 transitions. Second operand 8 states. [2020-10-21 23:07:43,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:07:43,167 INFO L93 Difference]: Finished difference Result 489 states and 1401 transitions. [2020-10-21 23:07:43,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-21 23:07:43,168 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2020-10-21 23:07:43,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:07:43,173 INFO L225 Difference]: With dead ends: 489 [2020-10-21 23:07:43,173 INFO L226 Difference]: Without dead ends: 489 [2020-10-21 23:07:43,173 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2020-10-21 23:07:43,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489 states. [2020-10-21 23:07:43,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489 to 468. [2020-10-21 23:07:43,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 468 states. [2020-10-21 23:07:43,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 1339 transitions. [2020-10-21 23:07:43,188 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 1339 transitions. Word has length 15 [2020-10-21 23:07:43,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:07:43,189 INFO L481 AbstractCegarLoop]: Abstraction has 468 states and 1339 transitions. [2020-10-21 23:07:43,189 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-21 23:07:43,189 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 1339 transitions. [2020-10-21 23:07:43,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-21 23:07:43,190 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:07:43,190 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:07:43,191 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-21 23:07:43,191 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:07:43,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:07:43,191 INFO L82 PathProgramCache]: Analyzing trace with hash 1526214500, now seen corresponding path program 5 times [2020-10-21 23:07:43,191 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:07:43,192 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071645724] [2020-10-21 23:07:43,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:07:43,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:07:43,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 23:07:43,436 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071645724] [2020-10-21 23:07:43,437 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:07:43,437 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-21 23:07:43,437 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785583280] [2020-10-21 23:07:43,438 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-21 23:07:43,438 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:07:43,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-21 23:07:43,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2020-10-21 23:07:43,439 INFO L87 Difference]: Start difference. First operand 468 states and 1339 transitions. Second operand 8 states. [2020-10-21 23:07:43,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:07:43,751 INFO L93 Difference]: Finished difference Result 534 states and 1538 transitions. [2020-10-21 23:07:43,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-21 23:07:43,752 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2020-10-21 23:07:43,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:07:43,755 INFO L225 Difference]: With dead ends: 534 [2020-10-21 23:07:43,755 INFO L226 Difference]: Without dead ends: 534 [2020-10-21 23:07:43,756 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2020-10-21 23:07:43,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2020-10-21 23:07:43,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 508. [2020-10-21 23:07:43,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 508 states. [2020-10-21 23:07:43,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 1467 transitions. [2020-10-21 23:07:43,771 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 1467 transitions. Word has length 15 [2020-10-21 23:07:43,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:07:43,772 INFO L481 AbstractCegarLoop]: Abstraction has 508 states and 1467 transitions. [2020-10-21 23:07:43,772 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-21 23:07:43,772 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 1467 transitions. [2020-10-21 23:07:43,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-21 23:07:43,773 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:07:43,773 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:07:43,774 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-21 23:07:43,774 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:07:43,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:07:43,774 INFO L82 PathProgramCache]: Analyzing trace with hash -1845040438, now seen corresponding path program 6 times [2020-10-21 23:07:43,774 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:07:43,775 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782237355] [2020-10-21 23:07:43,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:07:43,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:07:43,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 23:07:43,955 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782237355] [2020-10-21 23:07:43,956 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:07:43,956 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-21 23:07:43,956 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784522311] [2020-10-21 23:07:43,957 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-21 23:07:43,957 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:07:43,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-21 23:07:43,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2020-10-21 23:07:43,958 INFO L87 Difference]: Start difference. First operand 508 states and 1467 transitions. Second operand 8 states. [2020-10-21 23:07:44,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:07:44,218 INFO L93 Difference]: Finished difference Result 505 states and 1456 transitions. [2020-10-21 23:07:44,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-21 23:07:44,221 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2020-10-21 23:07:44,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:07:44,225 INFO L225 Difference]: With dead ends: 505 [2020-10-21 23:07:44,226 INFO L226 Difference]: Without dead ends: 505 [2020-10-21 23:07:44,226 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2020-10-21 23:07:44,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2020-10-21 23:07:44,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 413. [2020-10-21 23:07:44,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 413 states. [2020-10-21 23:07:44,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 1173 transitions. [2020-10-21 23:07:44,241 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 1173 transitions. Word has length 15 [2020-10-21 23:07:44,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:07:44,244 INFO L481 AbstractCegarLoop]: Abstraction has 413 states and 1173 transitions. [2020-10-21 23:07:44,244 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-21 23:07:44,244 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 1173 transitions. [2020-10-21 23:07:44,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-21 23:07:44,245 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:07:44,245 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:07:44,246 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-21 23:07:44,246 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:07:44,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:07:44,246 INFO L82 PathProgramCache]: Analyzing trace with hash -374726707, now seen corresponding path program 1 times [2020-10-21 23:07:44,246 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:07:44,247 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812868192] [2020-10-21 23:07:44,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:07:44,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:07:44,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 23:07:44,366 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812868192] [2020-10-21 23:07:44,367 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:07:44,367 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-21 23:07:44,367 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57504101] [2020-10-21 23:07:44,367 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-21 23:07:44,368 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:07:44,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-21 23:07:44,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-21 23:07:44,368 INFO L87 Difference]: Start difference. First operand 413 states and 1173 transitions. Second operand 5 states. [2020-10-21 23:07:44,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:07:44,563 INFO L93 Difference]: Finished difference Result 584 states and 1635 transitions. [2020-10-21 23:07:44,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-21 23:07:44,563 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-10-21 23:07:44,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:07:44,567 INFO L225 Difference]: With dead ends: 584 [2020-10-21 23:07:44,567 INFO L226 Difference]: Without dead ends: 548 [2020-10-21 23:07:44,568 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-10-21 23:07:44,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2020-10-21 23:07:44,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 458. [2020-10-21 23:07:44,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 458 states. [2020-10-21 23:07:44,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 1293 transitions. [2020-10-21 23:07:44,583 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 1293 transitions. Word has length 16 [2020-10-21 23:07:44,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:07:44,583 INFO L481 AbstractCegarLoop]: Abstraction has 458 states and 1293 transitions. [2020-10-21 23:07:44,583 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-21 23:07:44,583 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 1293 transitions. [2020-10-21 23:07:44,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-21 23:07:44,585 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:07:44,585 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:07:44,585 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-21 23:07:44,585 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:07:44,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:07:44,586 INFO L82 PathProgramCache]: Analyzing trace with hash -374726893, now seen corresponding path program 1 times [2020-10-21 23:07:44,586 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:07:44,586 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641016962] [2020-10-21 23:07:44,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:07:44,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:07:44,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 23:07:44,682 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641016962] [2020-10-21 23:07:44,682 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:07:44,683 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-21 23:07:44,683 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948635819] [2020-10-21 23:07:44,683 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-21 23:07:44,683 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:07:44,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-21 23:07:44,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-21 23:07:44,684 INFO L87 Difference]: Start difference. First operand 458 states and 1293 transitions. Second operand 4 states. [2020-10-21 23:07:44,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:07:44,717 INFO L93 Difference]: Finished difference Result 453 states and 1142 transitions. [2020-10-21 23:07:44,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-21 23:07:44,717 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2020-10-21 23:07:44,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:07:44,720 INFO L225 Difference]: With dead ends: 453 [2020-10-21 23:07:44,720 INFO L226 Difference]: Without dead ends: 336 [2020-10-21 23:07:44,720 INFO L677 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 [2020-10-21 23:07:44,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2020-10-21 23:07:44,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 336. [2020-10-21 23:07:44,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 336 states. [2020-10-21 23:07:44,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 827 transitions. [2020-10-21 23:07:44,730 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 827 transitions. Word has length 16 [2020-10-21 23:07:44,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:07:44,730 INFO L481 AbstractCegarLoop]: Abstraction has 336 states and 827 transitions. [2020-10-21 23:07:44,730 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-21 23:07:44,730 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 827 transitions. [2020-10-21 23:07:44,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-21 23:07:44,732 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:07:44,732 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:07:44,732 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-21 23:07:44,732 INFO L429 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:07:44,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:07:44,733 INFO L82 PathProgramCache]: Analyzing trace with hash 1479250304, now seen corresponding path program 1 times [2020-10-21 23:07:44,733 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:07:44,736 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019723485] [2020-10-21 23:07:44,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:07:44,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:07:44,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 23:07:44,952 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019723485] [2020-10-21 23:07:44,952 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:07:44,952 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-21 23:07:44,953 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75276108] [2020-10-21 23:07:44,953 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-21 23:07:44,953 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:07:44,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-21 23:07:44,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-21 23:07:44,954 INFO L87 Difference]: Start difference. First operand 336 states and 827 transitions. Second operand 5 states. [2020-10-21 23:07:45,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:07:45,002 INFO L93 Difference]: Finished difference Result 288 states and 657 transitions. [2020-10-21 23:07:45,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-21 23:07:45,003 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2020-10-21 23:07:45,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:07:45,005 INFO L225 Difference]: With dead ends: 288 [2020-10-21 23:07:45,005 INFO L226 Difference]: Without dead ends: 227 [2020-10-21 23:07:45,005 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-21 23:07:45,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2020-10-21 23:07:45,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 224. [2020-10-21 23:07:45,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2020-10-21 23:07:45,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 500 transitions. [2020-10-21 23:07:45,012 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 500 transitions. Word has length 17 [2020-10-21 23:07:45,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:07:45,013 INFO L481 AbstractCegarLoop]: Abstraction has 224 states and 500 transitions. [2020-10-21 23:07:45,013 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-21 23:07:45,013 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 500 transitions. [2020-10-21 23:07:45,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-21 23:07:45,014 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:07:45,014 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:07:45,014 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-21 23:07:45,014 INFO L429 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:07:45,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:07:45,015 INFO L82 PathProgramCache]: Analyzing trace with hash -670244609, now seen corresponding path program 1 times [2020-10-21 23:07:45,015 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:07:45,015 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122436026] [2020-10-21 23:07:45,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:07:45,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:07:45,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 23:07:45,155 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122436026] [2020-10-21 23:07:45,155 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:07:45,155 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-21 23:07:45,156 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983661961] [2020-10-21 23:07:45,156 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-21 23:07:45,156 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:07:45,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-21 23:07:45,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-21 23:07:45,157 INFO L87 Difference]: Start difference. First operand 224 states and 500 transitions. Second operand 6 states. [2020-10-21 23:07:45,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:07:45,225 INFO L93 Difference]: Finished difference Result 205 states and 461 transitions. [2020-10-21 23:07:45,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-21 23:07:45,227 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2020-10-21 23:07:45,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:07:45,228 INFO L225 Difference]: With dead ends: 205 [2020-10-21 23:07:45,228 INFO L226 Difference]: Without dead ends: 175 [2020-10-21 23:07:45,229 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-10-21 23:07:45,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2020-10-21 23:07:45,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 163. [2020-10-21 23:07:45,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2020-10-21 23:07:45,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 366 transitions. [2020-10-21 23:07:45,235 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 366 transitions. Word has length 19 [2020-10-21 23:07:45,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:07:45,235 INFO L481 AbstractCegarLoop]: Abstraction has 163 states and 366 transitions. [2020-10-21 23:07:45,235 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-21 23:07:45,235 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 366 transitions. [2020-10-21 23:07:45,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-21 23:07:45,236 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:07:45,236 INFO L422 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] [2020-10-21 23:07:45,236 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-21 23:07:45,236 INFO L429 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:07:45,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:07:45,237 INFO L82 PathProgramCache]: Analyzing trace with hash -682714242, now seen corresponding path program 1 times [2020-10-21 23:07:45,237 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:07:45,237 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491197002] [2020-10-21 23:07:45,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:07:45,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:07:45,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 23:07:45,589 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491197002] [2020-10-21 23:07:45,589 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:07:45,589 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-21 23:07:45,590 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109140243] [2020-10-21 23:07:45,590 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-21 23:07:45,590 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:07:45,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-21 23:07:45,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2020-10-21 23:07:45,591 INFO L87 Difference]: Start difference. First operand 163 states and 366 transitions. Second operand 11 states. [2020-10-21 23:07:46,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:07:46,042 INFO L93 Difference]: Finished difference Result 202 states and 434 transitions. [2020-10-21 23:07:46,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-10-21 23:07:46,043 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 22 [2020-10-21 23:07:46,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:07:46,044 INFO L225 Difference]: With dead ends: 202 [2020-10-21 23:07:46,044 INFO L226 Difference]: Without dead ends: 179 [2020-10-21 23:07:46,045 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2020-10-21 23:07:46,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2020-10-21 23:07:46,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 158. [2020-10-21 23:07:46,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2020-10-21 23:07:46,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 354 transitions. [2020-10-21 23:07:46,051 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 354 transitions. Word has length 22 [2020-10-21 23:07:46,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:07:46,052 INFO L481 AbstractCegarLoop]: Abstraction has 158 states and 354 transitions. [2020-10-21 23:07:46,052 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-21 23:07:46,052 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 354 transitions. [2020-10-21 23:07:46,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-21 23:07:46,053 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:07:46,053 INFO L422 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] [2020-10-21 23:07:46,053 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-21 23:07:46,053 INFO L429 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:07:46,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:07:46,054 INFO L82 PathProgramCache]: Analyzing trace with hash 930004004, now seen corresponding path program 2 times [2020-10-21 23:07:46,054 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:07:46,055 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157233748] [2020-10-21 23:07:46,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:07:46,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:07:46,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 23:07:46,458 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157233748] [2020-10-21 23:07:46,458 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:07:46,458 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-21 23:07:46,458 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806745517] [2020-10-21 23:07:46,459 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-21 23:07:46,462 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:07:46,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-21 23:07:46,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2020-10-21 23:07:46,463 INFO L87 Difference]: Start difference. First operand 158 states and 354 transitions. Second operand 11 states. [2020-10-21 23:07:47,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:07:47,168 INFO L93 Difference]: Finished difference Result 259 states and 553 transitions. [2020-10-21 23:07:47,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-21 23:07:47,169 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 22 [2020-10-21 23:07:47,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:07:47,170 INFO L225 Difference]: With dead ends: 259 [2020-10-21 23:07:47,170 INFO L226 Difference]: Without dead ends: 192 [2020-10-21 23:07:47,171 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2020-10-21 23:07:47,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2020-10-21 23:07:47,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 160. [2020-10-21 23:07:47,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2020-10-21 23:07:47,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 361 transitions. [2020-10-21 23:07:47,177 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 361 transitions. Word has length 22 [2020-10-21 23:07:47,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:07:47,177 INFO L481 AbstractCegarLoop]: Abstraction has 160 states and 361 transitions. [2020-10-21 23:07:47,178 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-21 23:07:47,178 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 361 transitions. [2020-10-21 23:07:47,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-21 23:07:47,178 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:07:47,179 INFO L422 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] [2020-10-21 23:07:47,179 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-21 23:07:47,179 INFO L429 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:07:47,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:07:47,179 INFO L82 PathProgramCache]: Analyzing trace with hash -938748802, now seen corresponding path program 3 times [2020-10-21 23:07:47,180 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:07:47,180 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669512705] [2020-10-21 23:07:47,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:07:47,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:07:47,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 23:07:47,565 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669512705] [2020-10-21 23:07:47,566 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:07:47,566 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-21 23:07:47,566 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97685833] [2020-10-21 23:07:47,568 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-21 23:07:47,568 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:07:47,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-21 23:07:47,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2020-10-21 23:07:47,569 INFO L87 Difference]: Start difference. First operand 160 states and 361 transitions. Second operand 11 states. [2020-10-21 23:07:48,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:07:48,396 INFO L93 Difference]: Finished difference Result 253 states and 529 transitions. [2020-10-21 23:07:48,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-10-21 23:07:48,397 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 22 [2020-10-21 23:07:48,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:07:48,398 INFO L225 Difference]: With dead ends: 253 [2020-10-21 23:07:48,399 INFO L226 Difference]: Without dead ends: 176 [2020-10-21 23:07:48,399 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=62, Invalid=244, Unknown=0, NotChecked=0, Total=306 [2020-10-21 23:07:48,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2020-10-21 23:07:48,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 148. [2020-10-21 23:07:48,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2020-10-21 23:07:48,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 330 transitions. [2020-10-21 23:07:48,405 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 330 transitions. Word has length 22 [2020-10-21 23:07:48,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:07:48,405 INFO L481 AbstractCegarLoop]: Abstraction has 148 states and 330 transitions. [2020-10-21 23:07:48,405 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-21 23:07:48,405 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 330 transitions. [2020-10-21 23:07:48,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-21 23:07:48,406 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:07:48,406 INFO L422 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] [2020-10-21 23:07:48,406 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-10-21 23:07:48,407 INFO L429 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:07:48,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:07:48,407 INFO L82 PathProgramCache]: Analyzing trace with hash 1105214244, now seen corresponding path program 4 times [2020-10-21 23:07:48,407 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:07:48,408 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673360224] [2020-10-21 23:07:48,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:07:48,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:07:48,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 23:07:48,802 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673360224] [2020-10-21 23:07:48,803 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:07:48,803 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-21 23:07:48,803 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922769632] [2020-10-21 23:07:48,803 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-21 23:07:48,804 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:07:48,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-21 23:07:48,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-10-21 23:07:48,804 INFO L87 Difference]: Start difference. First operand 148 states and 330 transitions. Second operand 9 states. [2020-10-21 23:07:49,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:07:49,455 INFO L93 Difference]: Finished difference Result 280 states and 628 transitions. [2020-10-21 23:07:49,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-21 23:07:49,456 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-10-21 23:07:49,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:07:49,457 INFO L225 Difference]: With dead ends: 280 [2020-10-21 23:07:49,458 INFO L226 Difference]: Without dead ends: 222 [2020-10-21 23:07:49,458 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2020-10-21 23:07:49,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2020-10-21 23:07:49,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 155. [2020-10-21 23:07:49,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2020-10-21 23:07:49,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 343 transitions. [2020-10-21 23:07:49,463 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 343 transitions. Word has length 22 [2020-10-21 23:07:49,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:07:49,463 INFO L481 AbstractCegarLoop]: Abstraction has 155 states and 343 transitions. [2020-10-21 23:07:49,463 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-21 23:07:49,464 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 343 transitions. [2020-10-21 23:07:49,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-21 23:07:49,464 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:07:49,464 INFO L422 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] [2020-10-21 23:07:49,465 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-10-21 23:07:49,465 INFO L429 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:07:49,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:07:49,465 INFO L82 PathProgramCache]: Analyzing trace with hash -1726037150, now seen corresponding path program 5 times [2020-10-21 23:07:49,466 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:07:49,466 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864547697] [2020-10-21 23:07:49,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:07:49,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:07:49,715 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 23:07:49,715 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864547697] [2020-10-21 23:07:49,716 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:07:49,716 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-21 23:07:49,716 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573702616] [2020-10-21 23:07:49,717 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-21 23:07:49,717 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:07:49,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-21 23:07:49,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2020-10-21 23:07:49,718 INFO L87 Difference]: Start difference. First operand 155 states and 343 transitions. Second operand 11 states. [2020-10-21 23:07:49,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:07:49,995 INFO L93 Difference]: Finished difference Result 209 states and 461 transitions. [2020-10-21 23:07:49,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-21 23:07:49,996 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 22 [2020-10-21 23:07:49,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:07:49,997 INFO L225 Difference]: With dead ends: 209 [2020-10-21 23:07:49,997 INFO L226 Difference]: Without dead ends: 162 [2020-10-21 23:07:49,998 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2020-10-21 23:07:49,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2020-10-21 23:07:50,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2020-10-21 23:07:50,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2020-10-21 23:07:50,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 361 transitions. [2020-10-21 23:07:50,004 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 361 transitions. Word has length 22 [2020-10-21 23:07:50,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:07:50,004 INFO L481 AbstractCegarLoop]: Abstraction has 162 states and 361 transitions. [2020-10-21 23:07:50,004 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-21 23:07:50,004 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 361 transitions. [2020-10-21 23:07:50,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-21 23:07:50,007 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:07:50,007 INFO L422 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] [2020-10-21 23:07:50,008 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-10-21 23:07:50,008 INFO L429 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:07:50,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:07:50,008 INFO L82 PathProgramCache]: Analyzing trace with hash -1112972830, now seen corresponding path program 6 times [2020-10-21 23:07:50,008 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:07:50,009 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422478781] [2020-10-21 23:07:50,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:07:50,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:07:50,696 WARN L193 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 9 [2020-10-21 23:07:50,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 23:07:50,703 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422478781] [2020-10-21 23:07:50,704 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:07:50,704 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-21 23:07:50,704 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535641915] [2020-10-21 23:07:50,705 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-21 23:07:50,706 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:07:50,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-21 23:07:50,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2020-10-21 23:07:50,707 INFO L87 Difference]: Start difference. First operand 162 states and 361 transitions. Second operand 12 states. [2020-10-21 23:07:51,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:07:51,633 INFO L93 Difference]: Finished difference Result 253 states and 551 transitions. [2020-10-21 23:07:51,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-10-21 23:07:51,634 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2020-10-21 23:07:51,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:07:51,635 INFO L225 Difference]: With dead ends: 253 [2020-10-21 23:07:51,635 INFO L226 Difference]: Without dead ends: 185 [2020-10-21 23:07:51,635 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2020-10-21 23:07:51,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2020-10-21 23:07:51,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2020-10-21 23:07:51,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2020-10-21 23:07:51,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 416 transitions. [2020-10-21 23:07:51,641 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 416 transitions. Word has length 22 [2020-10-21 23:07:51,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:07:51,641 INFO L481 AbstractCegarLoop]: Abstraction has 185 states and 416 transitions. [2020-10-21 23:07:51,641 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-21 23:07:51,641 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 416 transitions. [2020-10-21 23:07:51,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-21 23:07:51,642 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:07:51,642 INFO L422 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] [2020-10-21 23:07:51,642 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-10-21 23:07:51,642 INFO L429 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:07:51,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:07:51,643 INFO L82 PathProgramCache]: Analyzing trace with hash 601391588, now seen corresponding path program 7 times [2020-10-21 23:07:51,645 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:07:51,654 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137596353] [2020-10-21 23:07:51,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:07:51,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:07:51,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 23:07:51,894 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137596353] [2020-10-21 23:07:51,894 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:07:51,894 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-21 23:07:51,894 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916386585] [2020-10-21 23:07:51,895 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-21 23:07:51,895 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:07:51,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-21 23:07:51,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2020-10-21 23:07:51,896 INFO L87 Difference]: Start difference. First operand 185 states and 416 transitions. Second operand 9 states. [2020-10-21 23:07:52,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:07:52,264 INFO L93 Difference]: Finished difference Result 256 states and 564 transitions. [2020-10-21 23:07:52,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-21 23:07:52,265 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-10-21 23:07:52,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:07:52,267 INFO L225 Difference]: With dead ends: 256 [2020-10-21 23:07:52,267 INFO L226 Difference]: Without dead ends: 193 [2020-10-21 23:07:52,267 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2020-10-21 23:07:52,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2020-10-21 23:07:52,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 172. [2020-10-21 23:07:52,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2020-10-21 23:07:52,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 393 transitions. [2020-10-21 23:07:52,273 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 393 transitions. Word has length 22 [2020-10-21 23:07:52,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:07:52,274 INFO L481 AbstractCegarLoop]: Abstraction has 172 states and 393 transitions. [2020-10-21 23:07:52,274 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-21 23:07:52,275 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 393 transitions. [2020-10-21 23:07:52,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-21 23:07:52,275 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:07:52,275 INFO L422 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] [2020-10-21 23:07:52,276 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-10-21 23:07:52,276 INFO L429 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:07:52,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:07:52,276 INFO L82 PathProgramCache]: Analyzing trace with hash -442978946, now seen corresponding path program 8 times [2020-10-21 23:07:52,276 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:07:52,276 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882508280] [2020-10-21 23:07:52,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:07:52,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:07:52,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 23:07:52,613 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882508280] [2020-10-21 23:07:52,613 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:07:52,613 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-21 23:07:52,613 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363745196] [2020-10-21 23:07:52,614 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-21 23:07:52,614 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:07:52,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-21 23:07:52,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2020-10-21 23:07:52,615 INFO L87 Difference]: Start difference. First operand 172 states and 393 transitions. Second operand 9 states. [2020-10-21 23:07:53,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:07:53,306 INFO L93 Difference]: Finished difference Result 320 states and 690 transitions. [2020-10-21 23:07:53,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-10-21 23:07:53,307 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-10-21 23:07:53,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:07:53,308 INFO L225 Difference]: With dead ends: 320 [2020-10-21 23:07:53,309 INFO L226 Difference]: Without dead ends: 223 [2020-10-21 23:07:53,309 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=114, Invalid=228, Unknown=0, NotChecked=0, Total=342 [2020-10-21 23:07:53,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2020-10-21 23:07:53,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 173. [2020-10-21 23:07:53,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2020-10-21 23:07:53,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 378 transitions. [2020-10-21 23:07:53,314 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 378 transitions. Word has length 22 [2020-10-21 23:07:53,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:07:53,314 INFO L481 AbstractCegarLoop]: Abstraction has 173 states and 378 transitions. [2020-10-21 23:07:53,315 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-21 23:07:53,315 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 378 transitions. [2020-10-21 23:07:53,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-21 23:07:53,315 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:07:53,315 INFO L422 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] [2020-10-21 23:07:53,316 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-10-21 23:07:53,316 INFO L429 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:07:53,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:07:53,316 INFO L82 PathProgramCache]: Analyzing trace with hash 1633801276, now seen corresponding path program 9 times [2020-10-21 23:07:53,316 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:07:53,317 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844762545] [2020-10-21 23:07:53,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:07:53,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:07:53,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 23:07:53,554 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844762545] [2020-10-21 23:07:53,554 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:07:53,554 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-21 23:07:53,555 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324781584] [2020-10-21 23:07:53,555 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-21 23:07:53,555 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:07:53,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-21 23:07:53,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-10-21 23:07:53,556 INFO L87 Difference]: Start difference. First operand 173 states and 378 transitions. Second operand 8 states. [2020-10-21 23:07:53,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:07:53,821 INFO L93 Difference]: Finished difference Result 207 states and 438 transitions. [2020-10-21 23:07:53,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-21 23:07:53,822 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2020-10-21 23:07:53,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:07:53,823 INFO L225 Difference]: With dead ends: 207 [2020-10-21 23:07:53,823 INFO L226 Difference]: Without dead ends: 166 [2020-10-21 23:07:53,824 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-21 23:07:53,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2020-10-21 23:07:53,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2020-10-21 23:07:53,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2020-10-21 23:07:53,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 359 transitions. [2020-10-21 23:07:53,828 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 359 transitions. Word has length 22 [2020-10-21 23:07:53,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:07:53,829 INFO L481 AbstractCegarLoop]: Abstraction has 166 states and 359 transitions. [2020-10-21 23:07:53,830 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-21 23:07:53,830 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 359 transitions. [2020-10-21 23:07:53,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-21 23:07:53,830 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:07:53,831 INFO L422 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] [2020-10-21 23:07:53,831 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-10-21 23:07:53,831 INFO L429 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:07:53,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:07:53,831 INFO L82 PathProgramCache]: Analyzing trace with hash 138403588, now seen corresponding path program 10 times [2020-10-21 23:07:53,832 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:07:53,832 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283591409] [2020-10-21 23:07:53,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:07:53,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:07:54,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 23:07:54,435 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283591409] [2020-10-21 23:07:54,435 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:07:54,435 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-21 23:07:54,435 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858683142] [2020-10-21 23:07:54,435 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-21 23:07:54,436 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:07:54,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-21 23:07:54,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2020-10-21 23:07:54,436 INFO L87 Difference]: Start difference. First operand 166 states and 359 transitions. Second operand 12 states. [2020-10-21 23:07:55,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:07:55,106 INFO L93 Difference]: Finished difference Result 209 states and 435 transitions. [2020-10-21 23:07:55,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-10-21 23:07:55,107 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2020-10-21 23:07:55,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:07:55,108 INFO L225 Difference]: With dead ends: 209 [2020-10-21 23:07:55,108 INFO L226 Difference]: Without dead ends: 198 [2020-10-21 23:07:55,109 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2020-10-21 23:07:55,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2020-10-21 23:07:55,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 187. [2020-10-21 23:07:55,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2020-10-21 23:07:55,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 400 transitions. [2020-10-21 23:07:55,114 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 400 transitions. Word has length 22 [2020-10-21 23:07:55,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:07:55,114 INFO L481 AbstractCegarLoop]: Abstraction has 187 states and 400 transitions. [2020-10-21 23:07:55,114 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-21 23:07:55,115 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 400 transitions. [2020-10-21 23:07:55,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-21 23:07:55,115 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:07:55,115 INFO L422 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] [2020-10-21 23:07:55,115 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-10-21 23:07:55,116 INFO L429 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:07:55,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:07:55,116 INFO L82 PathProgramCache]: Analyzing trace with hash 610131302, now seen corresponding path program 11 times [2020-10-21 23:07:55,116 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:07:55,116 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29213780] [2020-10-21 23:07:55,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:07:55,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:07:55,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 23:07:55,300 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29213780] [2020-10-21 23:07:55,300 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:07:55,301 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-21 23:07:55,301 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923107762] [2020-10-21 23:07:55,301 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-21 23:07:55,301 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:07:55,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-21 23:07:55,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-21 23:07:55,302 INFO L87 Difference]: Start difference. First operand 187 states and 400 transitions. Second operand 6 states. [2020-10-21 23:07:55,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:07:55,409 INFO L93 Difference]: Finished difference Result 223 states and 465 transitions. [2020-10-21 23:07:55,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-21 23:07:55,410 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2020-10-21 23:07:55,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:07:55,411 INFO L225 Difference]: With dead ends: 223 [2020-10-21 23:07:55,411 INFO L226 Difference]: Without dead ends: 185 [2020-10-21 23:07:55,412 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-21 23:07:55,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2020-10-21 23:07:55,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 163. [2020-10-21 23:07:55,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2020-10-21 23:07:55,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 339 transitions. [2020-10-21 23:07:55,416 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 339 transitions. Word has length 22 [2020-10-21 23:07:55,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:07:55,416 INFO L481 AbstractCegarLoop]: Abstraction has 163 states and 339 transitions. [2020-10-21 23:07:55,416 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-21 23:07:55,416 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 339 transitions. [2020-10-21 23:07:55,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-21 23:07:55,417 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:07:55,417 INFO L422 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] [2020-10-21 23:07:55,417 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2020-10-21 23:07:55,417 INFO L429 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:07:55,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:07:55,418 INFO L82 PathProgramCache]: Analyzing trace with hash 418504616, now seen corresponding path program 12 times [2020-10-21 23:07:55,418 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:07:55,418 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631961857] [2020-10-21 23:07:55,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:07:55,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:07:55,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 23:07:55,671 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631961857] [2020-10-21 23:07:55,671 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:07:55,671 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-21 23:07:55,671 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303045608] [2020-10-21 23:07:55,671 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-21 23:07:55,671 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:07:55,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-21 23:07:55,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2020-10-21 23:07:55,672 INFO L87 Difference]: Start difference. First operand 163 states and 339 transitions. Second operand 10 states. [2020-10-21 23:07:56,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:07:56,246 INFO L93 Difference]: Finished difference Result 179 states and 360 transitions. [2020-10-21 23:07:56,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-21 23:07:56,247 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2020-10-21 23:07:56,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:07:56,248 INFO L225 Difference]: With dead ends: 179 [2020-10-21 23:07:56,248 INFO L226 Difference]: Without dead ends: 163 [2020-10-21 23:07:56,249 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2020-10-21 23:07:56,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2020-10-21 23:07:56,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 155. [2020-10-21 23:07:56,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2020-10-21 23:07:56,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 323 transitions. [2020-10-21 23:07:56,252 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 323 transitions. Word has length 22 [2020-10-21 23:07:56,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:07:56,253 INFO L481 AbstractCegarLoop]: Abstraction has 155 states and 323 transitions. [2020-10-21 23:07:56,253 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-21 23:07:56,253 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 323 transitions. [2020-10-21 23:07:56,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-21 23:07:56,254 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:07:56,254 INFO L422 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] [2020-10-21 23:07:56,254 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2020-10-21 23:07:56,254 INFO L429 AbstractCegarLoop]: === Iteration 27 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:07:56,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:07:56,254 INFO L82 PathProgramCache]: Analyzing trace with hash -675586972, now seen corresponding path program 13 times [2020-10-21 23:07:56,255 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:07:56,255 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354600750] [2020-10-21 23:07:56,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:07:56,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:07:56,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 23:07:56,569 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354600750] [2020-10-21 23:07:56,569 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:07:56,569 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-21 23:07:56,569 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551106985] [2020-10-21 23:07:56,569 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-21 23:07:56,570 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:07:56,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-21 23:07:56,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-10-21 23:07:56,570 INFO L87 Difference]: Start difference. First operand 155 states and 323 transitions. Second operand 7 states. [2020-10-21 23:07:57,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:07:57,011 INFO L93 Difference]: Finished difference Result 196 states and 404 transitions. [2020-10-21 23:07:57,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-21 23:07:57,012 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2020-10-21 23:07:57,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:07:57,013 INFO L225 Difference]: With dead ends: 196 [2020-10-21 23:07:57,013 INFO L226 Difference]: Without dead ends: 145 [2020-10-21 23:07:57,014 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2020-10-21 23:07:57,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2020-10-21 23:07:57,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 136. [2020-10-21 23:07:57,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2020-10-21 23:07:57,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 289 transitions. [2020-10-21 23:07:57,017 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 289 transitions. Word has length 22 [2020-10-21 23:07:57,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:07:57,018 INFO L481 AbstractCegarLoop]: Abstraction has 136 states and 289 transitions. [2020-10-21 23:07:57,018 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-21 23:07:57,018 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 289 transitions. [2020-10-21 23:07:57,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-21 23:07:57,019 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:07:57,019 INFO L422 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] [2020-10-21 23:07:57,019 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2020-10-21 23:07:57,019 INFO L429 AbstractCegarLoop]: === Iteration 28 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:07:57,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:07:57,020 INFO L82 PathProgramCache]: Analyzing trace with hash 819589220, now seen corresponding path program 14 times [2020-10-21 23:07:57,020 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:07:57,020 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108344543] [2020-10-21 23:07:57,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:07:57,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:07:57,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 23:07:57,309 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108344543] [2020-10-21 23:07:57,309 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:07:57,310 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-21 23:07:57,310 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930040009] [2020-10-21 23:07:57,310 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-21 23:07:57,310 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:07:57,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-21 23:07:57,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2020-10-21 23:07:57,311 INFO L87 Difference]: Start difference. First operand 136 states and 289 transitions. Second operand 9 states. [2020-10-21 23:07:57,495 WARN L193 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 34 [2020-10-21 23:07:57,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:07:57,856 INFO L93 Difference]: Finished difference Result 208 states and 419 transitions. [2020-10-21 23:07:57,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-21 23:07:57,858 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-10-21 23:07:57,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:07:57,859 INFO L225 Difference]: With dead ends: 208 [2020-10-21 23:07:57,859 INFO L226 Difference]: Without dead ends: 114 [2020-10-21 23:07:57,859 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=84, Invalid=156, Unknown=0, NotChecked=0, Total=240 [2020-10-21 23:07:57,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2020-10-21 23:07:57,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 95. [2020-10-21 23:07:57,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2020-10-21 23:07:57,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 181 transitions. [2020-10-21 23:07:57,863 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 181 transitions. Word has length 22 [2020-10-21 23:07:57,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:07:57,863 INFO L481 AbstractCegarLoop]: Abstraction has 95 states and 181 transitions. [2020-10-21 23:07:57,863 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-21 23:07:57,863 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 181 transitions. [2020-10-21 23:07:57,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-21 23:07:57,864 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:07:57,864 INFO L422 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] [2020-10-21 23:07:57,864 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2020-10-21 23:07:57,864 INFO L429 AbstractCegarLoop]: === Iteration 29 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:07:57,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:07:57,864 INFO L82 PathProgramCache]: Analyzing trace with hash -2006410622, now seen corresponding path program 15 times [2020-10-21 23:07:57,864 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:07:57,865 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442723301] [2020-10-21 23:07:57,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:07:57,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:07:58,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 23:07:58,023 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442723301] [2020-10-21 23:07:58,023 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:07:58,024 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-21 23:07:58,024 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275828858] [2020-10-21 23:07:58,024 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-21 23:07:58,024 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:07:58,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-21 23:07:58,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-10-21 23:07:58,025 INFO L87 Difference]: Start difference. First operand 95 states and 181 transitions. Second operand 7 states. [2020-10-21 23:07:58,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:07:58,373 INFO L93 Difference]: Finished difference Result 134 states and 255 transitions. [2020-10-21 23:07:58,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-21 23:07:58,375 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2020-10-21 23:07:58,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:07:58,376 INFO L225 Difference]: With dead ends: 134 [2020-10-21 23:07:58,376 INFO L226 Difference]: Without dead ends: 87 [2020-10-21 23:07:58,376 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2020-10-21 23:07:58,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2020-10-21 23:07:58,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2020-10-21 23:07:58,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2020-10-21 23:07:58,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 162 transitions. [2020-10-21 23:07:58,379 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 162 transitions. Word has length 22 [2020-10-21 23:07:58,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:07:58,379 INFO L481 AbstractCegarLoop]: Abstraction has 87 states and 162 transitions. [2020-10-21 23:07:58,379 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-21 23:07:58,379 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 162 transitions. [2020-10-21 23:07:58,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-21 23:07:58,380 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:07:58,380 INFO L422 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] [2020-10-21 23:07:58,380 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2020-10-21 23:07:58,380 INFO L429 AbstractCegarLoop]: === Iteration 30 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:07:58,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:07:58,381 INFO L82 PathProgramCache]: Analyzing trace with hash 749779306, now seen corresponding path program 16 times [2020-10-21 23:07:58,381 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:07:58,381 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245234579] [2020-10-21 23:07:58,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:07:58,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:07:58,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 23:07:58,500 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245234579] [2020-10-21 23:07:58,500 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:07:58,500 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-21 23:07:58,500 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431052099] [2020-10-21 23:07:58,501 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-21 23:07:58,501 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:07:58,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-21 23:07:58,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-21 23:07:58,501 INFO L87 Difference]: Start difference. First operand 87 states and 162 transitions. Second operand 5 states. [2020-10-21 23:07:58,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:07:58,639 INFO L93 Difference]: Finished difference Result 113 states and 206 transitions. [2020-10-21 23:07:58,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-21 23:07:58,640 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2020-10-21 23:07:58,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:07:58,640 INFO L225 Difference]: With dead ends: 113 [2020-10-21 23:07:58,641 INFO L226 Difference]: Without dead ends: 75 [2020-10-21 23:07:58,641 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-21 23:07:58,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2020-10-21 23:07:58,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2020-10-21 23:07:58,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2020-10-21 23:07:58,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 136 transitions. [2020-10-21 23:07:58,643 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 136 transitions. Word has length 22 [2020-10-21 23:07:58,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:07:58,644 INFO L481 AbstractCegarLoop]: Abstraction has 75 states and 136 transitions. [2020-10-21 23:07:58,644 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-21 23:07:58,644 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 136 transitions. [2020-10-21 23:07:58,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-21 23:07:58,644 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:07:58,644 INFO L422 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] [2020-10-21 23:07:58,645 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2020-10-21 23:07:58,645 INFO L429 AbstractCegarLoop]: === Iteration 31 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:07:58,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:07:58,645 INFO L82 PathProgramCache]: Analyzing trace with hash 792213172, now seen corresponding path program 17 times [2020-10-21 23:07:58,645 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:07:58,645 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192293331] [2020-10-21 23:07:58,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:07:58,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-21 23:07:58,699 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-21 23:07:58,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-21 23:07:58,753 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-21 23:07:58,793 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-21 23:07:58,793 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-21 23:07:58,794 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2020-10-21 23:07:58,795 WARN L264 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-21 23:07:58,814 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [1802] [1802] L863-->L870: Formula: (let ((.cse7 (= 0 (mod ~y$r_buff0_thd0~0_In1211539505 256))) (.cse6 (= (mod ~y$w_buff0_used~0_In1211539505 256) 0)) (.cse9 (= (mod ~y$r_buff1_thd0~0_In1211539505 256) 0)) (.cse8 (= (mod ~y$w_buff1_used~0_In1211539505 256) 0))) (let ((.cse2 (or .cse9 .cse8)) (.cse0 (not .cse9)) (.cse1 (not .cse8)) (.cse3 (or .cse7 .cse6)) (.cse4 (not .cse7)) (.cse5 (not .cse6))) (and (= ULTIMATE.start_assume_abort_if_not_~cond_Out1211539505 |ULTIMATE.start_assume_abort_if_not_#in~cond_In1211539505|) (or (and .cse0 .cse1 (= ~y$w_buff1_used~0_Out1211539505 0)) (and .cse2 (= ~y$w_buff1_used~0_Out1211539505 ~y$w_buff1_used~0_In1211539505))) (or (and (or (and .cse2 (= ~y~0_In1211539505 ~y~0_Out1211539505)) (and (= ~y~0_Out1211539505 ~y$w_buff1~0_In1211539505) .cse0 .cse1)) .cse3) (and (= ~y$w_buff0~0_In1211539505 ~y~0_Out1211539505) .cse4 .cse5)) (= ~y$r_buff1_thd0~0_Out1211539505 ~y$r_buff1_thd0~0_In1211539505) (not (= ULTIMATE.start_assume_abort_if_not_~cond_Out1211539505 0)) (= ~y$r_buff0_thd0~0_Out1211539505 ~y$r_buff0_thd0~0_In1211539505) (or (and (= ~y$w_buff0_used~0_In1211539505 ~y$w_buff0_used~0_Out1211539505) .cse3) (and .cse4 (= ~y$w_buff0_used~0_Out1211539505 0) .cse5))))) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In1211539505|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1211539505, ~y$w_buff1~0=~y$w_buff1~0_In1211539505, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1211539505, ~y$w_buff0~0=~y$w_buff0~0_In1211539505, ~y~0=~y~0_In1211539505, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1211539505, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1211539505} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_Out1211539505, ULTIMATE.start_main_#t~ite79=|ULTIMATE.start_main_#t~ite79_Out1211539505|, ULTIMATE.start_main_#t~ite78=|ULTIMATE.start_main_#t~ite78_Out1211539505|, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In1211539505|, ULTIMATE.start_main_#t~ite83=|ULTIMATE.start_main_#t~ite83_Out1211539505|, ULTIMATE.start_main_#t~ite82=|ULTIMATE.start_main_#t~ite82_Out1211539505|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out1211539505, ULTIMATE.start_main_#t~ite81=|ULTIMATE.start_main_#t~ite81_Out1211539505|, ~y$w_buff1~0=~y$w_buff1~0_In1211539505, ULTIMATE.start_main_#t~ite80=|ULTIMATE.start_main_#t~ite80_Out1211539505|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_Out1211539505, ~y$w_buff0~0=~y$w_buff0~0_In1211539505, ~y~0=~y~0_Out1211539505, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out1211539505, ~y$w_buff1_used~0=~y$w_buff1_used~0_Out1211539505} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite83, ULTIMATE.start_main_#t~ite82, ULTIMATE.start_assume_abort_if_not_~cond, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite81, ULTIMATE.start_main_#t~ite80, ~y$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite79, ~y~0, ULTIMATE.start_main_#t~ite78, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] because there is no mapped edge [2020-10-21 23:07:58,820 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:07:58,820 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:07:58,822 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:07:58,822 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:07:58,822 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:07:58,823 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:07:58,823 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:07:58,823 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:07:58,823 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:07:58,823 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:07:58,824 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:07:58,824 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:07:58,824 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:07:58,824 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:07:58,824 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:07:58,824 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:07:58,825 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:07:58,825 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:07:58,825 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:07:58,825 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:07:58,825 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:07:58,825 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:07:58,826 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:07:58,826 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:07:58,826 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:07:58,826 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:07:58,826 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:07:58,827 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:07:58,827 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:07:58,827 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:07:58,827 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:07:58,827 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:07:58,827 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:07:58,827 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:07:58,828 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:07:58,828 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:07:58,828 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:07:58,828 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:07:58,829 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:07:58,829 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:07:58,829 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:07:58,829 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:07:58,830 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:07:58,830 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:07:58,830 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:07:58,830 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:07:58,830 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:07:58,830 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:07:58,830 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:07:58,831 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:07:58,831 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:07:58,831 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:07:58,831 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:07:58,831 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:07:58,831 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:07:58,832 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:07:58,832 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:07:58,832 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:07:58,832 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:07:58,833 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:07:58,833 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:07:58,833 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:07:58,833 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:07:58,833 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:07:58,833 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:07:58,834 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:07:58,834 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:07:58,834 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:07:58,834 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:07:58,834 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:07:58,834 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:07:58,835 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:07:58,835 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:07:58,835 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:07:58,835 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:07:58,835 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:07:58,835 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:07:58,836 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:07:58,836 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:07:58,836 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:07:58,836 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:07:58,836 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:07:58,836 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:07:58,836 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:07:58,837 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:07:58,837 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:07:58,837 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:07:58,837 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:07:58,838 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:07:58,838 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:07:58,838 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:07:58,838 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:07:58,838 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:07:58,838 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:07:58,839 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:07:58,839 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:07:58,839 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:07:58,839 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:07:58,840 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:07:58,840 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:07:58,840 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:07:58,840 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:07:58,840 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:07:58,840 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:07:58,840 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:07:58,841 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:07:58,841 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:07:58,841 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:07:58,841 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:07:58,841 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:07:58,841 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:07:58,841 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:07:58,842 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:07:58,842 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:07:58,842 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:07:58,842 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:07:58,842 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:07:58,842 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:07:58,843 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:07:58,843 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:07:58,923 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.10 11:07:58 BasicIcfg [2020-10-21 23:07:58,924 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-21 23:07:58,926 INFO L168 Benchmark]: Toolchain (without parser) took 33549.88 ms. Allocated memory was 139.5 MB in the beginning and 572.0 MB in the end (delta: 432.5 MB). Free memory was 100.8 MB in the beginning and 315.9 MB in the end (delta: -215.2 MB). Peak memory consumption was 217.4 MB. Max. memory is 7.1 GB. [2020-10-21 23:07:58,927 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 139.5 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2020-10-21 23:07:58,928 INFO L168 Benchmark]: CACSL2BoogieTranslator took 935.71 ms. Allocated memory was 139.5 MB in the beginning and 202.4 MB in the end (delta: 62.9 MB). Free memory was 99.9 MB in the beginning and 151.2 MB in the end (delta: -51.2 MB). Peak memory consumption was 24.6 MB. Max. memory is 7.1 GB. [2020-10-21 23:07:58,932 INFO L168 Benchmark]: Boogie Procedure Inliner took 71.43 ms. Allocated memory is still 202.4 MB. Free memory was 151.2 MB in the beginning and 147.9 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. [2020-10-21 23:07:58,933 INFO L168 Benchmark]: Boogie Preprocessor took 56.35 ms. Allocated memory is still 202.4 MB. Free memory was 147.9 MB in the beginning and 144.6 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. [2020-10-21 23:07:58,933 INFO L168 Benchmark]: RCFGBuilder took 3937.35 ms. Allocated memory was 202.4 MB in the beginning and 295.2 MB in the end (delta: 92.8 MB). Free memory was 143.9 MB in the beginning and 212.1 MB in the end (delta: -68.2 MB). Peak memory consumption was 105.5 MB. Max. memory is 7.1 GB. [2020-10-21 23:07:58,934 INFO L168 Benchmark]: TraceAbstraction took 28536.07 ms. Allocated memory was 295.2 MB in the beginning and 572.0 MB in the end (delta: 276.8 MB). Free memory was 209.1 MB in the beginning and 315.9 MB in the end (delta: -106.9 MB). Peak memory consumption was 169.9 MB. Max. memory is 7.1 GB. [2020-10-21 23:07:58,939 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.27 ms. Allocated memory is still 139.5 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 935.71 ms. Allocated memory was 139.5 MB in the beginning and 202.4 MB in the end (delta: 62.9 MB). Free memory was 99.9 MB in the beginning and 151.2 MB in the end (delta: -51.2 MB). Peak memory consumption was 24.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 71.43 ms. Allocated memory is still 202.4 MB. Free memory was 151.2 MB in the beginning and 147.9 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 56.35 ms. Allocated memory is still 202.4 MB. Free memory was 147.9 MB in the beginning and 144.6 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3937.35 ms. Allocated memory was 202.4 MB in the beginning and 295.2 MB in the end (delta: 92.8 MB). Free memory was 143.9 MB in the beginning and 212.1 MB in the end (delta: -68.2 MB). Peak memory consumption was 105.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 28536.07 ms. Allocated memory was 295.2 MB in the beginning and 572.0 MB in the end (delta: 276.8 MB). Free memory was 209.1 MB in the beginning and 315.9 MB in the end (delta: -106.9 MB). Peak memory consumption was 169.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1050 VarBasedMoverChecksPositive, 44 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 86 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 8.9s, 110 PlacesBefore, 37 PlacesAfterwards, 103 TransitionsBefore, 27 TransitionsAfterwards, 1970 CoEnabledTransitionPairs, 7 FixpointIterations, 36 TrivialSequentialCompositions, 44 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 10 ConcurrentYvCompositions, 3 ChoiceCompositions, 93 TotalNumberOfCompositions, 5977 MoverChecksTotal - CounterExampleResult [Line: 18]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p2_EBX = 0; [L717] 0 _Bool main$tmp_guard0; [L718] 0 _Bool main$tmp_guard1; [L720] 0 int x = 0; [L722] 0 int y = 0; [L723] 0 _Bool y$flush_delayed; [L724] 0 int y$mem_tmp; [L725] 0 _Bool y$r_buff0_thd0; [L726] 0 _Bool y$r_buff0_thd1; [L727] 0 _Bool y$r_buff0_thd2; [L728] 0 _Bool y$r_buff0_thd3; [L729] 0 _Bool y$r_buff1_thd0; [L730] 0 _Bool y$r_buff1_thd1; [L731] 0 _Bool y$r_buff1_thd2; [L732] 0 _Bool y$r_buff1_thd3; [L733] 0 _Bool y$read_delayed; [L734] 0 int *y$read_delayed_var; [L735] 0 int y$w_buff0; [L736] 0 _Bool y$w_buff0_used; [L737] 0 int y$w_buff1; [L738] 0 _Bool y$w_buff1_used; [L739] 0 _Bool weak$$choice0; [L740] 0 _Bool weak$$choice2; [L854] 0 pthread_t t2324; [L855] FCALL, FORK 0 pthread_create(&t2324, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L856] 0 pthread_t t2325; [L857] FCALL, FORK 0 pthread_create(&t2325, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L784] 2 y$w_buff1 = y$w_buff0 [L785] 2 y$w_buff0 = 2 [L786] 2 y$w_buff1_used = y$w_buff0_used [L787] 2 y$w_buff0_used = (_Bool)1 [L19] COND FALSE 2 !(!expression) [L789] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L790] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L791] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L792] 2 y$r_buff1_thd3 = y$r_buff0_thd3 [L793] 2 y$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L858] 0 pthread_t t2326; [L859] FCALL, FORK 0 pthread_create(&t2326, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L796] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L813] 3 __unbuffered_p2_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L816] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L817] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L818] 3 y$flush_delayed = weak$$choice2 [L819] 3 y$mem_tmp = y [L820] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L820] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L821] EXPR 3 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L821] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L822] EXPR 3 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L822] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1) [L822] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1 [L822] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1) [L822] EXPR 3 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L822] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L823] EXPR 3 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L823] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used) [L823] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L823] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used) [L823] EXPR 3 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L823] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L824] EXPR 3 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L824] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L825] EXPR 3 weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L825] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L826] EXPR 3 weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L826] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L827] 3 __unbuffered_p2_EBX = y [L828] EXPR 3 y$flush_delayed ? y$mem_tmp : y [L828] 3 y = y$flush_delayed ? y$mem_tmp : y [L829] 3 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L832] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L832] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L832] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L832] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L833] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L833] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L834] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L834] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L835] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L835] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L836] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L836] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L839] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L841] 3 return 0; [L744] 1 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L747] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L747] EXPR 1 y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y [L747] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L747] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L748] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L748] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L749] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L749] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L750] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L750] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L751] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L751] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L754] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L755] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L756] 1 y$flush_delayed = weak$$choice2 [L757] 1 y$mem_tmp = y [L758] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L758] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L759] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L759] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L760] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L760] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L761] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L761] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L762] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L762] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0) [L762] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L762] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L763] EXPR 1 weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L763] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L764] EXPR 1 weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L764] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0) [L764] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0 [L764] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0) [L764] EXPR 1 weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L764] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L765] 1 __unbuffered_p0_EAX = y [L766] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L766] 1 y = y$flush_delayed ? y$mem_tmp : y [L767] 1 y$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L770] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L770] EXPR 1 y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y [L770] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L770] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L771] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L771] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L772] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L772] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L773] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L773] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L774] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L774] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L777] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L779] 1 return 0; [L799] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L799] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L800] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L800] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L801] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L801] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L802] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L802] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L803] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L803] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L806] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L808] 2 return 0; [L861] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L872] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L873] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L874] 0 y$flush_delayed = weak$$choice2 [L875] 0 y$mem_tmp = y [L876] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L876] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L877] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L877] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0) [L877] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L877] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L878] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L878] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1) [L878] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L878] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L879] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L879] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L880] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L880] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L880] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L880] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L881] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L881] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L882] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L882] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L882] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0 [L882] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L882] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L882] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L883] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 1 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L884] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L884] 0 y = y$flush_delayed ? y$mem_tmp : y [L885] 0 y$flush_delayed = (_Bool)0 [L19] COND TRUE 0 !expression [L18] COND FALSE 0 !(0) [L18] 0 __assert_fail ("0", "safe023_power.opt.c", 9, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 101 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 28.2s, OverallIterations: 31, TraceHistogramMax: 1, AutomataDifference: 10.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 9.1s, HoareTripleCheckerStatistics: 730 SDtfs, 1249 SDslu, 2137 SDs, 0 SdLazy, 2973 SolverSat, 646 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 276 GetRequests, 15 SyntacticMatches, 3 SemanticMatches, 258 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 381 ImplicationChecksByTransitivity, 7.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=986occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 30 MinimizatonAttempts, 608 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 6.1s InterpolantComputationTime, 571 NumberOfCodeBlocks, 571 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 519 ConstructedInterpolants, 0 QuantifiedInterpolants, 135776 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 30 InterpolantComputations, 30 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...