/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix025_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 05:54:19,003 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 05:54:19,006 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 05:54:19,018 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 05:54:19,018 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 05:54:19,019 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 05:54:19,020 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 05:54:19,022 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 05:54:19,024 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 05:54:19,025 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 05:54:19,026 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 05:54:19,027 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 05:54:19,027 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 05:54:19,028 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 05:54:19,029 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 05:54:19,030 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 05:54:19,031 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 05:54:19,032 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 05:54:19,034 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 05:54:19,036 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 05:54:19,038 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 05:54:19,039 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 05:54:19,040 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 05:54:19,041 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 05:54:19,044 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 05:54:19,044 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 05:54:19,045 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 05:54:19,046 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 05:54:19,046 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 05:54:19,047 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 05:54:19,048 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 05:54:19,048 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 05:54:19,053 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 05:54:19,055 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 05:54:19,057 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 05:54:19,057 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 05:54:19,058 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 05:54:19,061 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 05:54:19,061 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 05:54:19,062 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 05:54:19,063 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 05:54:19,066 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf [2019-12-27 05:54:19,095 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 05:54:19,096 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 05:54:19,098 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 05:54:19,098 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 05:54:19,098 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 05:54:19,099 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 05:54:19,099 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 05:54:19,099 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 05:54:19,099 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 05:54:19,099 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 05:54:19,100 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 05:54:19,100 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 05:54:19,100 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 05:54:19,100 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 05:54:19,100 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 05:54:19,102 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 05:54:19,102 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 05:54:19,102 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 05:54:19,102 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 05:54:19,103 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 05:54:19,103 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 05:54:19,103 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 05:54:19,103 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 05:54:19,104 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 05:54:19,104 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 05:54:19,104 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 05:54:19,104 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 05:54:19,104 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 05:54:19,104 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 05:54:19,105 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 05:54:19,378 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 05:54:19,396 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 05:54:19,399 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 05:54:19,400 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 05:54:19,401 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 05:54:19,402 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix025_tso.oepc.i [2019-12-27 05:54:19,467 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/100f5ea37/62b5dcb46df1420090118bc01f3e8c8d/FLAG3e6cc7ee4 [2019-12-27 05:54:19,990 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 05:54:19,991 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix025_tso.oepc.i [2019-12-27 05:54:20,016 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/100f5ea37/62b5dcb46df1420090118bc01f3e8c8d/FLAG3e6cc7ee4 [2019-12-27 05:54:20,295 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/100f5ea37/62b5dcb46df1420090118bc01f3e8c8d [2019-12-27 05:54:20,305 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 05:54:20,307 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 05:54:20,312 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 05:54:20,313 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 05:54:20,316 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 05:54:20,317 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 05:54:20" (1/1) ... [2019-12-27 05:54:20,321 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e400b9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:54:20, skipping insertion in model container [2019-12-27 05:54:20,321 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 05:54:20" (1/1) ... [2019-12-27 05:54:20,330 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 05:54:20,384 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 05:54:20,876 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 05:54:20,897 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 05:54:21,001 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 05:54:21,072 INFO L208 MainTranslator]: Completed translation [2019-12-27 05:54:21,073 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:54:21 WrapperNode [2019-12-27 05:54:21,073 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 05:54:21,074 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 05:54:21,074 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 05:54:21,074 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 05:54:21,083 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:54:21" (1/1) ... [2019-12-27 05:54:21,105 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:54:21" (1/1) ... [2019-12-27 05:54:21,135 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 05:54:21,136 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 05:54:21,136 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 05:54:21,136 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 05:54:21,145 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:54:21" (1/1) ... [2019-12-27 05:54:21,145 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:54:21" (1/1) ... [2019-12-27 05:54:21,150 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:54:21" (1/1) ... [2019-12-27 05:54:21,151 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:54:21" (1/1) ... [2019-12-27 05:54:21,162 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:54:21" (1/1) ... [2019-12-27 05:54:21,166 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:54:21" (1/1) ... [2019-12-27 05:54:21,170 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:54:21" (1/1) ... [2019-12-27 05:54:21,176 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 05:54:21,177 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 05:54:21,177 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 05:54:21,177 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 05:54:21,178 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:54:21" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 05:54:21,248 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 05:54:21,248 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 05:54:21,248 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 05:54:21,249 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 05:54:21,249 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 05:54:21,249 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 05:54:21,249 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 05:54:21,249 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 05:54:21,249 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 05:54:21,250 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 05:54:21,250 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 05:54:21,250 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 05:54:21,250 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 05:54:21,252 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 05:54:21,997 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 05:54:21,997 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 05:54:21,999 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 05:54:21 BoogieIcfgContainer [2019-12-27 05:54:21,999 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 05:54:22,000 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 05:54:22,000 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 05:54:22,004 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 05:54:22,004 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 05:54:20" (1/3) ... [2019-12-27 05:54:22,005 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46331949 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 05:54:22, skipping insertion in model container [2019-12-27 05:54:22,005 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:54:21" (2/3) ... [2019-12-27 05:54:22,006 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46331949 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 05:54:22, skipping insertion in model container [2019-12-27 05:54:22,006 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 05:54:21" (3/3) ... [2019-12-27 05:54:22,008 INFO L109 eAbstractionObserver]: Analyzing ICFG mix025_tso.oepc.i [2019-12-27 05:54:22,019 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 05:54:22,020 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 05:54:22,031 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 05:54:22,032 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 05:54:22,100 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:22,100 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:22,101 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:22,101 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:22,101 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:22,101 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:22,102 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:22,102 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:22,103 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:22,103 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:22,104 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:22,104 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:22,104 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:22,104 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:22,105 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:22,105 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:22,105 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:22,106 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:22,106 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:22,106 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:22,106 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:22,107 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:22,107 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:22,107 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:22,108 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:22,108 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:22,108 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:22,109 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:22,109 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:22,109 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:22,109 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:22,110 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:22,110 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:22,110 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:22,111 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:22,111 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:22,111 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:22,112 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:22,112 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:22,112 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:22,112 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:22,113 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:22,113 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:22,113 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:22,113 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:22,114 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:22,114 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:22,114 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:22,114 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:22,115 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:22,115 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:22,115 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:22,115 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:22,116 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:22,116 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:22,116 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:22,116 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:22,117 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:22,117 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:22,117 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:22,117 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:22,118 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:22,118 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:22,118 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:22,119 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:22,119 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:22,120 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:22,120 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:22,120 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:22,120 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:22,121 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:22,121 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:22,121 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:22,121 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:22,122 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:22,122 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:22,122 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:22,122 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:22,123 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:22,123 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:22,123 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:22,124 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:22,124 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:22,124 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:22,124 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:22,125 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:22,125 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:22,142 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:22,143 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:22,143 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:22,144 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:22,144 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:22,144 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:22,144 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:22,144 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:22,145 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:22,145 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:22,145 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:22,145 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:22,146 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:22,146 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:22,146 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:22,146 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:22,147 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:22,147 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:22,147 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:22,147 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:22,147 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:22,148 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:22,148 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:22,148 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:22,148 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:22,149 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:22,149 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:22,149 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:22,149 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:22,149 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:22,150 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:22,150 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:22,150 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:22,150 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:22,150 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:22,151 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:22,151 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:22,151 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:22,151 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:22,152 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:22,152 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:22,152 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:22,152 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:22,152 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:22,152 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:22,153 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:22,153 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:22,153 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:22,153 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:22,153 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:22,154 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:22,154 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:22,154 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:22,154 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:22,154 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:22,155 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:22,155 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:22,155 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:22,155 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:22,155 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:22,156 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:22,156 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:22,156 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:22,156 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:22,156 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:22,157 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:22,157 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:22,157 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:22,157 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:22,157 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:22,158 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:22,158 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:22,158 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:22,158 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:22,158 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:22,158 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:22,159 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:22,159 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:22,159 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:22,159 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:22,159 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:22,160 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:22,160 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:22,160 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:22,160 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:22,160 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:22,161 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:22,161 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:22,161 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:22,161 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:22,162 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:22,162 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:22,162 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:22,162 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:22,162 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:22,166 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:22,166 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:22,167 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:22,167 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:22,167 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:22,167 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:22,167 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:22,167 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:22,168 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:22,168 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:22,168 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:22,168 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:22,168 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:22,168 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:22,169 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:22,169 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:22,169 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:22,169 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:22,169 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:22,170 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:22,170 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:22,170 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:22,170 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:22,170 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:22,170 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:22,171 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:22,171 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:22,171 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:22,171 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:22,171 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:22,172 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:22,172 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:22,172 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:22,175 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:22,175 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:22,175 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:22,176 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:22,176 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:22,176 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:22,176 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:22,177 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:22,177 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:22,177 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:22,177 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:22,177 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:22,183 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:22,183 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:22,184 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:22,184 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:22,184 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:22,184 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:22,184 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:22,185 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:22,185 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:22,185 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:54:22,202 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 05:54:22,223 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 05:54:22,223 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 05:54:22,223 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 05:54:22,223 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 05:54:22,224 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 05:54:22,224 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 05:54:22,224 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 05:54:22,224 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 05:54:22,241 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 176 places, 213 transitions [2019-12-27 05:54:22,243 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 176 places, 213 transitions [2019-12-27 05:54:22,376 INFO L132 PetriNetUnfolder]: 47/210 cut-off events. [2019-12-27 05:54:22,376 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 05:54:22,398 INFO L76 FinitePrefix]: Finished finitePrefix Result has 220 conditions, 210 events. 47/210 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 424 event pairs. 0/161 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 05:54:22,420 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 176 places, 213 transitions [2019-12-27 05:54:22,517 INFO L132 PetriNetUnfolder]: 47/210 cut-off events. [2019-12-27 05:54:22,518 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 05:54:22,525 INFO L76 FinitePrefix]: Finished finitePrefix Result has 220 conditions, 210 events. 47/210 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 424 event pairs. 0/161 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 05:54:22,547 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-27 05:54:22,548 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 05:54:26,076 WARN L192 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 89 [2019-12-27 05:54:26,202 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-12-27 05:54:26,232 INFO L206 etLargeBlockEncoding]: Checked pairs total: 84223 [2019-12-27 05:54:26,232 INFO L214 etLargeBlockEncoding]: Total number of compositions: 112 [2019-12-27 05:54:26,236 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 94 places, 104 transitions [2019-12-27 05:54:49,144 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 122130 states. [2019-12-27 05:54:49,145 INFO L276 IsEmpty]: Start isEmpty. Operand 122130 states. [2019-12-27 05:54:49,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 05:54:49,151 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:54:49,152 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 05:54:49,153 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:54:49,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:54:49,159 INFO L82 PathProgramCache]: Analyzing trace with hash 912016, now seen corresponding path program 1 times [2019-12-27 05:54:49,166 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:54:49,167 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054616962] [2019-12-27 05:54:49,167 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:54:49,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:54:49,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:54:49,428 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054616962] [2019-12-27 05:54:49,429 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:54:49,429 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 05:54:49,430 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209223470] [2019-12-27 05:54:49,436 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 05:54:49,437 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:54:49,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 05:54:49,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:54:49,455 INFO L87 Difference]: Start difference. First operand 122130 states. Second operand 3 states. [2019-12-27 05:54:50,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:54:50,989 INFO L93 Difference]: Finished difference Result 120482 states and 514480 transitions. [2019-12-27 05:54:50,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 05:54:50,991 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 05:54:50,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:54:54,596 INFO L225 Difference]: With dead ends: 120482 [2019-12-27 05:54:54,597 INFO L226 Difference]: Without dead ends: 113384 [2019-12-27 05:54:54,607 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:54:58,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113384 states. [2019-12-27 05:55:01,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113384 to 113384. [2019-12-27 05:55:01,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113384 states. [2019-12-27 05:55:02,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113384 states to 113384 states and 483579 transitions. [2019-12-27 05:55:02,008 INFO L78 Accepts]: Start accepts. Automaton has 113384 states and 483579 transitions. Word has length 3 [2019-12-27 05:55:02,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:55:02,008 INFO L462 AbstractCegarLoop]: Abstraction has 113384 states and 483579 transitions. [2019-12-27 05:55:02,008 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 05:55:02,008 INFO L276 IsEmpty]: Start isEmpty. Operand 113384 states and 483579 transitions. [2019-12-27 05:55:02,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 05:55:02,023 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:55:02,023 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:55:02,023 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:55:02,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:55:02,024 INFO L82 PathProgramCache]: Analyzing trace with hash -1106167815, now seen corresponding path program 1 times [2019-12-27 05:55:02,024 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:55:02,024 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454311674] [2019-12-27 05:55:02,025 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:55:02,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:55:02,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:55:02,245 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454311674] [2019-12-27 05:55:02,245 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:55:02,245 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 05:55:02,246 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012956092] [2019-12-27 05:55:02,247 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 05:55:02,247 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:55:02,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 05:55:02,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 05:55:02,248 INFO L87 Difference]: Start difference. First operand 113384 states and 483579 transitions. Second operand 4 states. [2019-12-27 05:55:07,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:55:07,159 INFO L93 Difference]: Finished difference Result 179498 states and 731972 transitions. [2019-12-27 05:55:07,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 05:55:07,160 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 05:55:07,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:55:08,590 INFO L225 Difference]: With dead ends: 179498 [2019-12-27 05:55:08,590 INFO L226 Difference]: Without dead ends: 179449 [2019-12-27 05:55:08,591 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 05:55:13,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179449 states. [2019-12-27 05:55:21,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179449 to 162546. [2019-12-27 05:55:21,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162546 states. [2019-12-27 05:55:23,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162546 states to 162546 states and 672884 transitions. [2019-12-27 05:55:23,722 INFO L78 Accepts]: Start accepts. Automaton has 162546 states and 672884 transitions. Word has length 11 [2019-12-27 05:55:23,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:55:23,723 INFO L462 AbstractCegarLoop]: Abstraction has 162546 states and 672884 transitions. [2019-12-27 05:55:23,723 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 05:55:23,723 INFO L276 IsEmpty]: Start isEmpty. Operand 162546 states and 672884 transitions. [2019-12-27 05:55:23,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 05:55:23,726 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:55:23,727 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:55:23,727 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:55:23,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:55:23,727 INFO L82 PathProgramCache]: Analyzing trace with hash 490332773, now seen corresponding path program 1 times [2019-12-27 05:55:23,727 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:55:23,728 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391619158] [2019-12-27 05:55:23,728 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:55:23,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:55:23,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:55:23,787 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391619158] [2019-12-27 05:55:23,787 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:55:23,787 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 05:55:23,787 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549450315] [2019-12-27 05:55:23,788 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 05:55:23,788 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:55:23,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 05:55:23,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:55:23,789 INFO L87 Difference]: Start difference. First operand 162546 states and 672884 transitions. Second operand 3 states. [2019-12-27 05:55:23,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:55:23,963 INFO L93 Difference]: Finished difference Result 34413 states and 111772 transitions. [2019-12-27 05:55:23,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 05:55:23,963 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 05:55:23,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:55:24,023 INFO L225 Difference]: With dead ends: 34413 [2019-12-27 05:55:24,023 INFO L226 Difference]: Without dead ends: 34413 [2019-12-27 05:55:24,024 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:55:24,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34413 states. [2019-12-27 05:55:24,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34413 to 34413. [2019-12-27 05:55:24,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34413 states. [2019-12-27 05:55:24,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34413 states to 34413 states and 111772 transitions. [2019-12-27 05:55:24,664 INFO L78 Accepts]: Start accepts. Automaton has 34413 states and 111772 transitions. Word has length 13 [2019-12-27 05:55:24,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:55:24,664 INFO L462 AbstractCegarLoop]: Abstraction has 34413 states and 111772 transitions. [2019-12-27 05:55:24,664 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 05:55:24,665 INFO L276 IsEmpty]: Start isEmpty. Operand 34413 states and 111772 transitions. [2019-12-27 05:55:24,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 05:55:24,668 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:55:24,668 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:55:24,668 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:55:24,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:55:24,669 INFO L82 PathProgramCache]: Analyzing trace with hash 562012763, now seen corresponding path program 1 times [2019-12-27 05:55:24,669 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:55:24,669 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819468500] [2019-12-27 05:55:24,669 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:55:24,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:55:24,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:55:24,760 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819468500] [2019-12-27 05:55:24,760 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:55:24,760 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 05:55:24,761 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387678887] [2019-12-27 05:55:24,761 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 05:55:24,761 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:55:24,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 05:55:24,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:55:24,762 INFO L87 Difference]: Start difference. First operand 34413 states and 111772 transitions. Second operand 3 states. [2019-12-27 05:55:24,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:55:24,967 INFO L93 Difference]: Finished difference Result 54627 states and 176362 transitions. [2019-12-27 05:55:24,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 05:55:24,967 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-27 05:55:24,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:55:25,056 INFO L225 Difference]: With dead ends: 54627 [2019-12-27 05:55:25,056 INFO L226 Difference]: Without dead ends: 54627 [2019-12-27 05:55:25,056 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:55:25,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54627 states. [2019-12-27 05:55:28,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54627 to 41131. [2019-12-27 05:55:28,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41131 states. [2019-12-27 05:55:28,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41131 states to 41131 states and 134258 transitions. [2019-12-27 05:55:28,302 INFO L78 Accepts]: Start accepts. Automaton has 41131 states and 134258 transitions. Word has length 16 [2019-12-27 05:55:28,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:55:28,304 INFO L462 AbstractCegarLoop]: Abstraction has 41131 states and 134258 transitions. [2019-12-27 05:55:28,304 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 05:55:28,304 INFO L276 IsEmpty]: Start isEmpty. Operand 41131 states and 134258 transitions. [2019-12-27 05:55:28,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 05:55:28,307 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:55:28,308 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:55:28,308 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:55:28,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:55:28,308 INFO L82 PathProgramCache]: Analyzing trace with hash 562138282, now seen corresponding path program 1 times [2019-12-27 05:55:28,308 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:55:28,308 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684809081] [2019-12-27 05:55:28,309 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:55:28,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:55:28,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:55:28,390 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684809081] [2019-12-27 05:55:28,391 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:55:28,391 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 05:55:28,391 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175239455] [2019-12-27 05:55:28,391 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 05:55:28,392 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:55:28,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 05:55:28,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 05:55:28,392 INFO L87 Difference]: Start difference. First operand 41131 states and 134258 transitions. Second operand 4 states. [2019-12-27 05:55:28,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:55:28,797 INFO L93 Difference]: Finished difference Result 48927 states and 157520 transitions. [2019-12-27 05:55:28,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 05:55:28,797 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-27 05:55:28,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:55:28,877 INFO L225 Difference]: With dead ends: 48927 [2019-12-27 05:55:28,877 INFO L226 Difference]: Without dead ends: 48927 [2019-12-27 05:55:28,878 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 05:55:29,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48927 states. [2019-12-27 05:55:29,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48927 to 44953. [2019-12-27 05:55:29,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44953 states. [2019-12-27 05:55:30,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44953 states to 44953 states and 145741 transitions. [2019-12-27 05:55:30,126 INFO L78 Accepts]: Start accepts. Automaton has 44953 states and 145741 transitions. Word has length 16 [2019-12-27 05:55:30,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:55:30,126 INFO L462 AbstractCegarLoop]: Abstraction has 44953 states and 145741 transitions. [2019-12-27 05:55:30,126 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 05:55:30,126 INFO L276 IsEmpty]: Start isEmpty. Operand 44953 states and 145741 transitions. [2019-12-27 05:55:30,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 05:55:30,130 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:55:30,130 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:55:30,130 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:55:30,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:55:30,131 INFO L82 PathProgramCache]: Analyzing trace with hash 173692215, now seen corresponding path program 1 times [2019-12-27 05:55:30,131 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:55:30,131 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099852524] [2019-12-27 05:55:30,131 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:55:30,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:55:30,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:55:30,197 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099852524] [2019-12-27 05:55:30,197 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:55:30,197 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 05:55:30,198 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211173053] [2019-12-27 05:55:30,198 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 05:55:30,198 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:55:30,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 05:55:30,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 05:55:30,200 INFO L87 Difference]: Start difference. First operand 44953 states and 145741 transitions. Second operand 4 states. [2019-12-27 05:55:30,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:55:30,628 INFO L93 Difference]: Finished difference Result 53251 states and 171579 transitions. [2019-12-27 05:55:30,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 05:55:30,628 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-27 05:55:30,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:55:30,718 INFO L225 Difference]: With dead ends: 53251 [2019-12-27 05:55:30,718 INFO L226 Difference]: Without dead ends: 53251 [2019-12-27 05:55:30,718 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 05:55:30,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53251 states. [2019-12-27 05:55:31,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53251 to 46409. [2019-12-27 05:55:31,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46409 states. [2019-12-27 05:55:31,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46409 states to 46409 states and 150674 transitions. [2019-12-27 05:55:31,556 INFO L78 Accepts]: Start accepts. Automaton has 46409 states and 150674 transitions. Word has length 16 [2019-12-27 05:55:31,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:55:31,556 INFO L462 AbstractCegarLoop]: Abstraction has 46409 states and 150674 transitions. [2019-12-27 05:55:31,557 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 05:55:31,557 INFO L276 IsEmpty]: Start isEmpty. Operand 46409 states and 150674 transitions. [2019-12-27 05:55:31,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 05:55:31,565 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:55:31,566 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:55:31,566 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:55:31,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:55:31,566 INFO L82 PathProgramCache]: Analyzing trace with hash 1710143018, now seen corresponding path program 1 times [2019-12-27 05:55:31,566 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:55:31,567 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910234594] [2019-12-27 05:55:31,567 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:55:31,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:55:31,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:55:31,771 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910234594] [2019-12-27 05:55:31,771 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:55:31,772 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 05:55:31,773 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934386038] [2019-12-27 05:55:31,774 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 05:55:31,774 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:55:31,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 05:55:31,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 05:55:31,774 INFO L87 Difference]: Start difference. First operand 46409 states and 150674 transitions. Second operand 7 states. [2019-12-27 05:55:33,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:55:33,502 INFO L93 Difference]: Finished difference Result 63407 states and 201418 transitions. [2019-12-27 05:55:33,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 05:55:33,503 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2019-12-27 05:55:33,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:55:33,604 INFO L225 Difference]: With dead ends: 63407 [2019-12-27 05:55:33,605 INFO L226 Difference]: Without dead ends: 63400 [2019-12-27 05:55:33,605 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-27 05:55:33,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63400 states. [2019-12-27 05:55:34,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63400 to 47584. [2019-12-27 05:55:34,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47584 states. [2019-12-27 05:55:34,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47584 states to 47584 states and 154270 transitions. [2019-12-27 05:55:34,495 INFO L78 Accepts]: Start accepts. Automaton has 47584 states and 154270 transitions. Word has length 22 [2019-12-27 05:55:34,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:55:34,496 INFO L462 AbstractCegarLoop]: Abstraction has 47584 states and 154270 transitions. [2019-12-27 05:55:34,496 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 05:55:34,496 INFO L276 IsEmpty]: Start isEmpty. Operand 47584 states and 154270 transitions. [2019-12-27 05:55:34,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 05:55:34,505 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:55:34,505 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:55:34,505 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:55:34,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:55:34,506 INFO L82 PathProgramCache]: Analyzing trace with hash 2075627383, now seen corresponding path program 1 times [2019-12-27 05:55:34,506 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:55:34,506 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532546213] [2019-12-27 05:55:34,506 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:55:34,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:55:34,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:55:34,585 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532546213] [2019-12-27 05:55:34,586 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:55:34,586 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 05:55:34,586 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475531815] [2019-12-27 05:55:34,586 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 05:55:34,586 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:55:34,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 05:55:34,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 05:55:34,587 INFO L87 Difference]: Start difference. First operand 47584 states and 154270 transitions. Second operand 5 states. [2019-12-27 05:55:35,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:55:35,327 INFO L93 Difference]: Finished difference Result 66059 states and 208933 transitions. [2019-12-27 05:55:35,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 05:55:35,327 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-27 05:55:35,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:55:35,476 INFO L225 Difference]: With dead ends: 66059 [2019-12-27 05:55:35,476 INFO L226 Difference]: Without dead ends: 66052 [2019-12-27 05:55:35,476 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 05:55:35,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66052 states. [2019-12-27 05:55:36,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66052 to 46168. [2019-12-27 05:55:36,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46168 states. [2019-12-27 05:55:36,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46168 states to 46168 states and 149707 transitions. [2019-12-27 05:55:36,706 INFO L78 Accepts]: Start accepts. Automaton has 46168 states and 149707 transitions. Word has length 22 [2019-12-27 05:55:36,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:55:36,707 INFO L462 AbstractCegarLoop]: Abstraction has 46168 states and 149707 transitions. [2019-12-27 05:55:36,707 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 05:55:36,707 INFO L276 IsEmpty]: Start isEmpty. Operand 46168 states and 149707 transitions. [2019-12-27 05:55:36,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 05:55:36,718 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:55:36,719 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:55:36,719 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:55:36,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:55:36,719 INFO L82 PathProgramCache]: Analyzing trace with hash -433341706, now seen corresponding path program 1 times [2019-12-27 05:55:36,719 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:55:36,720 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237078724] [2019-12-27 05:55:36,720 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:55:36,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:55:36,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:55:36,760 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237078724] [2019-12-27 05:55:36,760 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:55:36,761 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 05:55:36,761 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812889642] [2019-12-27 05:55:36,761 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 05:55:36,761 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:55:36,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 05:55:36,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 05:55:36,762 INFO L87 Difference]: Start difference. First operand 46168 states and 149707 transitions. Second operand 4 states. [2019-12-27 05:55:36,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:55:36,855 INFO L93 Difference]: Finished difference Result 17945 states and 54933 transitions. [2019-12-27 05:55:36,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 05:55:36,855 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-27 05:55:36,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:55:36,886 INFO L225 Difference]: With dead ends: 17945 [2019-12-27 05:55:36,886 INFO L226 Difference]: Without dead ends: 17945 [2019-12-27 05:55:36,887 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 05:55:36,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17945 states. [2019-12-27 05:55:37,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17945 to 17582. [2019-12-27 05:55:37,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17582 states. [2019-12-27 05:55:37,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17582 states to 17582 states and 53897 transitions. [2019-12-27 05:55:37,202 INFO L78 Accepts]: Start accepts. Automaton has 17582 states and 53897 transitions. Word has length 25 [2019-12-27 05:55:37,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:55:37,202 INFO L462 AbstractCegarLoop]: Abstraction has 17582 states and 53897 transitions. [2019-12-27 05:55:37,202 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 05:55:37,203 INFO L276 IsEmpty]: Start isEmpty. Operand 17582 states and 53897 transitions. [2019-12-27 05:55:37,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-27 05:55:37,214 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:55:37,215 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:55:37,215 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:55:37,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:55:37,215 INFO L82 PathProgramCache]: Analyzing trace with hash -1225408676, now seen corresponding path program 1 times [2019-12-27 05:55:37,215 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:55:37,215 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711846018] [2019-12-27 05:55:37,216 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:55:37,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:55:37,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:55:37,403 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711846018] [2019-12-27 05:55:37,403 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:55:37,403 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 05:55:37,403 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208103186] [2019-12-27 05:55:37,404 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 05:55:37,404 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:55:37,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 05:55:37,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-12-27 05:55:37,405 INFO L87 Difference]: Start difference. First operand 17582 states and 53897 transitions. Second operand 8 states. [2019-12-27 05:55:38,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:55:38,147 INFO L93 Difference]: Finished difference Result 23336 states and 70167 transitions. [2019-12-27 05:55:38,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 05:55:38,148 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 26 [2019-12-27 05:55:38,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:55:38,181 INFO L225 Difference]: With dead ends: 23336 [2019-12-27 05:55:38,181 INFO L226 Difference]: Without dead ends: 23336 [2019-12-27 05:55:38,181 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2019-12-27 05:55:38,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23336 states. [2019-12-27 05:55:38,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23336 to 17427. [2019-12-27 05:55:38,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17427 states. [2019-12-27 05:55:38,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17427 states to 17427 states and 53433 transitions. [2019-12-27 05:55:38,470 INFO L78 Accepts]: Start accepts. Automaton has 17427 states and 53433 transitions. Word has length 26 [2019-12-27 05:55:38,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:55:38,470 INFO L462 AbstractCegarLoop]: Abstraction has 17427 states and 53433 transitions. [2019-12-27 05:55:38,470 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 05:55:38,471 INFO L276 IsEmpty]: Start isEmpty. Operand 17427 states and 53433 transitions. [2019-12-27 05:55:38,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 05:55:38,482 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:55:38,483 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:55:38,483 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:55:38,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:55:38,483 INFO L82 PathProgramCache]: Analyzing trace with hash -2045967469, now seen corresponding path program 1 times [2019-12-27 05:55:38,484 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:55:38,484 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744145639] [2019-12-27 05:55:38,484 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:55:38,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:55:38,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:55:38,570 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744145639] [2019-12-27 05:55:38,570 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:55:38,571 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 05:55:38,571 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537415067] [2019-12-27 05:55:38,571 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 05:55:38,571 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:55:38,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 05:55:38,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 05:55:38,572 INFO L87 Difference]: Start difference. First operand 17427 states and 53433 transitions. Second operand 5 states. [2019-12-27 05:55:38,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:55:38,940 INFO L93 Difference]: Finished difference Result 22078 states and 66571 transitions. [2019-12-27 05:55:38,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 05:55:38,940 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-27 05:55:38,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:55:38,973 INFO L225 Difference]: With dead ends: 22078 [2019-12-27 05:55:38,974 INFO L226 Difference]: Without dead ends: 22078 [2019-12-27 05:55:38,974 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 05:55:39,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22078 states. [2019-12-27 05:55:39,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22078 to 20690. [2019-12-27 05:55:39,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20690 states. [2019-12-27 05:55:39,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20690 states to 20690 states and 63081 transitions. [2019-12-27 05:55:39,379 INFO L78 Accepts]: Start accepts. Automaton has 20690 states and 63081 transitions. Word has length 27 [2019-12-27 05:55:39,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:55:39,379 INFO L462 AbstractCegarLoop]: Abstraction has 20690 states and 63081 transitions. [2019-12-27 05:55:39,379 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 05:55:39,380 INFO L276 IsEmpty]: Start isEmpty. Operand 20690 states and 63081 transitions. [2019-12-27 05:55:39,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-27 05:55:39,394 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:55:39,394 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:55:39,394 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:55:39,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:55:39,394 INFO L82 PathProgramCache]: Analyzing trace with hash -23775369, now seen corresponding path program 1 times [2019-12-27 05:55:39,395 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:55:39,395 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210679987] [2019-12-27 05:55:39,395 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:55:39,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:55:39,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:55:39,474 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210679987] [2019-12-27 05:55:39,474 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:55:39,475 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 05:55:39,476 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501705774] [2019-12-27 05:55:39,476 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 05:55:39,476 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:55:39,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 05:55:39,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 05:55:39,477 INFO L87 Difference]: Start difference. First operand 20690 states and 63081 transitions. Second operand 5 states. [2019-12-27 05:55:39,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:55:39,615 INFO L93 Difference]: Finished difference Result 21192 states and 64416 transitions. [2019-12-27 05:55:39,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 05:55:39,615 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-27 05:55:39,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:55:39,653 INFO L225 Difference]: With dead ends: 21192 [2019-12-27 05:55:39,654 INFO L226 Difference]: Without dead ends: 21192 [2019-12-27 05:55:39,654 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 05:55:39,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21192 states. [2019-12-27 05:55:39,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21192 to 21192. [2019-12-27 05:55:39,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21192 states. [2019-12-27 05:55:39,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21192 states to 21192 states and 64416 transitions. [2019-12-27 05:55:39,948 INFO L78 Accepts]: Start accepts. Automaton has 21192 states and 64416 transitions. Word has length 28 [2019-12-27 05:55:39,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:55:39,949 INFO L462 AbstractCegarLoop]: Abstraction has 21192 states and 64416 transitions. [2019-12-27 05:55:39,949 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 05:55:39,949 INFO L276 IsEmpty]: Start isEmpty. Operand 21192 states and 64416 transitions. [2019-12-27 05:55:39,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-27 05:55:39,964 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:55:39,964 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:55:39,965 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:55:39,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:55:39,965 INFO L82 PathProgramCache]: Analyzing trace with hash -994503224, now seen corresponding path program 1 times [2019-12-27 05:55:39,965 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:55:39,965 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185796167] [2019-12-27 05:55:39,966 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:55:39,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:55:40,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:55:40,059 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185796167] [2019-12-27 05:55:40,059 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:55:40,060 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 05:55:40,060 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927473748] [2019-12-27 05:55:40,060 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 05:55:40,061 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:55:40,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 05:55:40,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 05:55:40,061 INFO L87 Difference]: Start difference. First operand 21192 states and 64416 transitions. Second operand 5 states. [2019-12-27 05:55:40,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:55:40,421 INFO L93 Difference]: Finished difference Result 24492 states and 73329 transitions. [2019-12-27 05:55:40,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 05:55:40,421 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2019-12-27 05:55:40,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:55:40,454 INFO L225 Difference]: With dead ends: 24492 [2019-12-27 05:55:40,454 INFO L226 Difference]: Without dead ends: 24492 [2019-12-27 05:55:40,455 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 05:55:40,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24492 states. [2019-12-27 05:55:40,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24492 to 20516. [2019-12-27 05:55:40,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20516 states. [2019-12-27 05:55:40,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20516 states to 20516 states and 62487 transitions. [2019-12-27 05:55:40,773 INFO L78 Accepts]: Start accepts. Automaton has 20516 states and 62487 transitions. Word has length 29 [2019-12-27 05:55:40,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:55:40,773 INFO L462 AbstractCegarLoop]: Abstraction has 20516 states and 62487 transitions. [2019-12-27 05:55:40,773 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 05:55:40,773 INFO L276 IsEmpty]: Start isEmpty. Operand 20516 states and 62487 transitions. [2019-12-27 05:55:40,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 05:55:40,793 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:55:40,793 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:55:40,794 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:55:40,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:55:40,794 INFO L82 PathProgramCache]: Analyzing trace with hash 454456511, now seen corresponding path program 1 times [2019-12-27 05:55:40,794 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:55:40,795 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565616435] [2019-12-27 05:55:40,795 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:55:40,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:55:40,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:55:40,990 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565616435] [2019-12-27 05:55:40,990 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:55:40,990 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 05:55:40,991 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178962008] [2019-12-27 05:55:40,991 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 05:55:40,991 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:55:40,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 05:55:40,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-27 05:55:40,992 INFO L87 Difference]: Start difference. First operand 20516 states and 62487 transitions. Second operand 8 states. [2019-12-27 05:55:42,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:55:42,430 INFO L93 Difference]: Finished difference Result 30060 states and 89581 transitions. [2019-12-27 05:55:42,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 05:55:42,430 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 33 [2019-12-27 05:55:42,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:55:42,473 INFO L225 Difference]: With dead ends: 30060 [2019-12-27 05:55:42,473 INFO L226 Difference]: Without dead ends: 30060 [2019-12-27 05:55:42,474 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=94, Invalid=248, Unknown=0, NotChecked=0, Total=342 [2019-12-27 05:55:42,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30060 states. [2019-12-27 05:55:42,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30060 to 22850. [2019-12-27 05:55:42,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22850 states. [2019-12-27 05:55:42,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22850 states to 22850 states and 69400 transitions. [2019-12-27 05:55:42,975 INFO L78 Accepts]: Start accepts. Automaton has 22850 states and 69400 transitions. Word has length 33 [2019-12-27 05:55:42,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:55:42,976 INFO L462 AbstractCegarLoop]: Abstraction has 22850 states and 69400 transitions. [2019-12-27 05:55:42,976 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 05:55:42,976 INFO L276 IsEmpty]: Start isEmpty. Operand 22850 states and 69400 transitions. [2019-12-27 05:55:42,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-27 05:55:42,994 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:55:42,994 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:55:42,994 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:55:42,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:55:42,995 INFO L82 PathProgramCache]: Analyzing trace with hash 1086926900, now seen corresponding path program 1 times [2019-12-27 05:55:42,995 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:55:42,995 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086385272] [2019-12-27 05:55:42,995 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:55:43,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:55:43,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:55:43,187 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086385272] [2019-12-27 05:55:43,187 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:55:43,187 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 05:55:43,188 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951581038] [2019-12-27 05:55:43,188 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 05:55:43,188 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:55:43,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 05:55:43,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-27 05:55:43,189 INFO L87 Difference]: Start difference. First operand 22850 states and 69400 transitions. Second operand 8 states. [2019-12-27 05:55:44,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:55:44,432 INFO L93 Difference]: Finished difference Result 31602 states and 94253 transitions. [2019-12-27 05:55:44,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 05:55:44,432 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 35 [2019-12-27 05:55:44,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:55:44,491 INFO L225 Difference]: With dead ends: 31602 [2019-12-27 05:55:44,491 INFO L226 Difference]: Without dead ends: 31602 [2019-12-27 05:55:44,491 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=94, Invalid=248, Unknown=0, NotChecked=0, Total=342 [2019-12-27 05:55:44,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31602 states. [2019-12-27 05:55:44,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31602 to 21638. [2019-12-27 05:55:44,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21638 states. [2019-12-27 05:55:44,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21638 states to 21638 states and 65897 transitions. [2019-12-27 05:55:44,860 INFO L78 Accepts]: Start accepts. Automaton has 21638 states and 65897 transitions. Word has length 35 [2019-12-27 05:55:44,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:55:44,860 INFO L462 AbstractCegarLoop]: Abstraction has 21638 states and 65897 transitions. [2019-12-27 05:55:44,860 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 05:55:44,860 INFO L276 IsEmpty]: Start isEmpty. Operand 21638 states and 65897 transitions. [2019-12-27 05:55:44,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-27 05:55:44,879 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:55:44,879 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:55:44,879 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:55:44,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:55:44,880 INFO L82 PathProgramCache]: Analyzing trace with hash -1061116233, now seen corresponding path program 1 times [2019-12-27 05:55:44,880 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:55:44,880 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146990129] [2019-12-27 05:55:44,880 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:55:44,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:55:45,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:55:45,132 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146990129] [2019-12-27 05:55:45,132 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:55:45,132 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 05:55:45,132 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043267094] [2019-12-27 05:55:45,133 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 05:55:45,133 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:55:45,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 05:55:45,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-12-27 05:55:45,134 INFO L87 Difference]: Start difference. First operand 21638 states and 65897 transitions. Second operand 9 states. [2019-12-27 05:55:46,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:55:46,402 INFO L93 Difference]: Finished difference Result 31922 states and 94853 transitions. [2019-12-27 05:55:46,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-27 05:55:46,402 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 37 [2019-12-27 05:55:46,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:55:46,452 INFO L225 Difference]: With dead ends: 31922 [2019-12-27 05:55:46,452 INFO L226 Difference]: Without dead ends: 31922 [2019-12-27 05:55:46,453 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2019-12-27 05:55:46,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31922 states. [2019-12-27 05:55:46,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31922 to 22466. [2019-12-27 05:55:46,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22466 states. [2019-12-27 05:55:46,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22466 states to 22466 states and 68179 transitions. [2019-12-27 05:55:46,838 INFO L78 Accepts]: Start accepts. Automaton has 22466 states and 68179 transitions. Word has length 37 [2019-12-27 05:55:46,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:55:46,838 INFO L462 AbstractCegarLoop]: Abstraction has 22466 states and 68179 transitions. [2019-12-27 05:55:46,838 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 05:55:46,839 INFO L276 IsEmpty]: Start isEmpty. Operand 22466 states and 68179 transitions. [2019-12-27 05:55:46,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-27 05:55:46,869 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:55:46,869 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:55:46,869 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:55:46,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:55:46,870 INFO L82 PathProgramCache]: Analyzing trace with hash 1548882337, now seen corresponding path program 2 times [2019-12-27 05:55:46,870 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:55:46,870 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234462734] [2019-12-27 05:55:46,870 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:55:46,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:55:47,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:55:47,064 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234462734] [2019-12-27 05:55:47,064 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:55:47,064 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 05:55:47,064 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873705823] [2019-12-27 05:55:47,065 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 05:55:47,065 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:55:47,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 05:55:47,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-12-27 05:55:47,066 INFO L87 Difference]: Start difference. First operand 22466 states and 68179 transitions. Second operand 9 states. [2019-12-27 05:55:47,374 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2019-12-27 05:55:48,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:55:48,423 INFO L93 Difference]: Finished difference Result 28418 states and 84293 transitions. [2019-12-27 05:55:48,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 05:55:48,424 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 37 [2019-12-27 05:55:48,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:55:48,465 INFO L225 Difference]: With dead ends: 28418 [2019-12-27 05:55:48,466 INFO L226 Difference]: Without dead ends: 28418 [2019-12-27 05:55:48,466 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2019-12-27 05:55:48,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28418 states. [2019-12-27 05:55:48,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28418 to 21696. [2019-12-27 05:55:48,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21696 states. [2019-12-27 05:55:48,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21696 states to 21696 states and 65742 transitions. [2019-12-27 05:55:48,827 INFO L78 Accepts]: Start accepts. Automaton has 21696 states and 65742 transitions. Word has length 37 [2019-12-27 05:55:48,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:55:48,827 INFO L462 AbstractCegarLoop]: Abstraction has 21696 states and 65742 transitions. [2019-12-27 05:55:48,827 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 05:55:48,827 INFO L276 IsEmpty]: Start isEmpty. Operand 21696 states and 65742 transitions. [2019-12-27 05:55:48,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 05:55:48,854 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:55:48,854 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:55:48,854 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:55:48,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:55:48,855 INFO L82 PathProgramCache]: Analyzing trace with hash 1485923537, now seen corresponding path program 1 times [2019-12-27 05:55:48,855 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:55:48,855 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949402597] [2019-12-27 05:55:48,855 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:55:48,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:55:48,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:55:48,895 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949402597] [2019-12-27 05:55:48,895 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:55:48,895 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 05:55:48,895 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908331598] [2019-12-27 05:55:48,896 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 05:55:48,896 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:55:48,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 05:55:48,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:55:48,896 INFO L87 Difference]: Start difference. First operand 21696 states and 65742 transitions. Second operand 3 states. [2019-12-27 05:55:49,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:55:49,064 INFO L93 Difference]: Finished difference Result 41236 states and 125000 transitions. [2019-12-27 05:55:49,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 05:55:49,065 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-27 05:55:49,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:55:49,109 INFO L225 Difference]: With dead ends: 41236 [2019-12-27 05:55:49,110 INFO L226 Difference]: Without dead ends: 22394 [2019-12-27 05:55:49,110 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:55:49,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22394 states. [2019-12-27 05:55:49,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22394 to 22213. [2019-12-27 05:55:49,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22213 states. [2019-12-27 05:55:49,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22213 states to 22213 states and 65657 transitions. [2019-12-27 05:55:49,525 INFO L78 Accepts]: Start accepts. Automaton has 22213 states and 65657 transitions. Word has length 39 [2019-12-27 05:55:49,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:55:49,525 INFO L462 AbstractCegarLoop]: Abstraction has 22213 states and 65657 transitions. [2019-12-27 05:55:49,525 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 05:55:49,525 INFO L276 IsEmpty]: Start isEmpty. Operand 22213 states and 65657 transitions. [2019-12-27 05:55:49,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 05:55:49,554 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:55:49,554 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:55:49,554 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:55:49,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:55:49,554 INFO L82 PathProgramCache]: Analyzing trace with hash 252616620, now seen corresponding path program 1 times [2019-12-27 05:55:49,555 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:55:49,555 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431724104] [2019-12-27 05:55:49,555 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:55:49,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:55:49,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:55:49,767 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431724104] [2019-12-27 05:55:49,767 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:55:49,767 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 05:55:49,768 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050207930] [2019-12-27 05:55:49,768 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 05:55:49,768 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:55:49,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 05:55:49,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-12-27 05:55:49,769 INFO L87 Difference]: Start difference. First operand 22213 states and 65657 transitions. Second operand 9 states. [2019-12-27 05:55:51,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:55:51,448 INFO L93 Difference]: Finished difference Result 31676 states and 91487 transitions. [2019-12-27 05:55:51,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-27 05:55:51,448 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 39 [2019-12-27 05:55:51,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:55:51,492 INFO L225 Difference]: With dead ends: 31676 [2019-12-27 05:55:51,493 INFO L226 Difference]: Without dead ends: 31676 [2019-12-27 05:55:51,493 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2019-12-27 05:55:51,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31676 states. [2019-12-27 05:55:51,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31676 to 20306. [2019-12-27 05:55:51,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20306 states. [2019-12-27 05:55:52,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20306 states to 20306 states and 60137 transitions. [2019-12-27 05:55:52,067 INFO L78 Accepts]: Start accepts. Automaton has 20306 states and 60137 transitions. Word has length 39 [2019-12-27 05:55:52,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:55:52,067 INFO L462 AbstractCegarLoop]: Abstraction has 20306 states and 60137 transitions. [2019-12-27 05:55:52,067 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 05:55:52,067 INFO L276 IsEmpty]: Start isEmpty. Operand 20306 states and 60137 transitions. [2019-12-27 05:55:52,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 05:55:52,084 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:55:52,084 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:55:52,085 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:55:52,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:55:52,085 INFO L82 PathProgramCache]: Analyzing trace with hash 157045846, now seen corresponding path program 2 times [2019-12-27 05:55:52,085 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:55:52,085 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463472034] [2019-12-27 05:55:52,085 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:55:52,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:55:52,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:55:52,328 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463472034] [2019-12-27 05:55:52,328 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:55:52,328 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 05:55:52,328 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276721475] [2019-12-27 05:55:52,329 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 05:55:52,329 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:55:52,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 05:55:52,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-12-27 05:55:52,330 INFO L87 Difference]: Start difference. First operand 20306 states and 60137 transitions. Second operand 9 states. [2019-12-27 05:55:53,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:55:53,478 INFO L93 Difference]: Finished difference Result 27284 states and 79224 transitions. [2019-12-27 05:55:53,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 05:55:53,478 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 39 [2019-12-27 05:55:53,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:55:53,516 INFO L225 Difference]: With dead ends: 27284 [2019-12-27 05:55:53,516 INFO L226 Difference]: Without dead ends: 27284 [2019-12-27 05:55:53,516 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2019-12-27 05:55:53,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27284 states. [2019-12-27 05:55:53,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27284 to 18887. [2019-12-27 05:55:53,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18887 states. [2019-12-27 05:55:53,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18887 states to 18887 states and 56307 transitions. [2019-12-27 05:55:53,837 INFO L78 Accepts]: Start accepts. Automaton has 18887 states and 56307 transitions. Word has length 39 [2019-12-27 05:55:53,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:55:53,837 INFO L462 AbstractCegarLoop]: Abstraction has 18887 states and 56307 transitions. [2019-12-27 05:55:53,837 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 05:55:53,837 INFO L276 IsEmpty]: Start isEmpty. Operand 18887 states and 56307 transitions. [2019-12-27 05:55:53,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 05:55:53,854 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:55:53,854 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:55:53,854 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:55:53,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:55:53,854 INFO L82 PathProgramCache]: Analyzing trace with hash 594517850, now seen corresponding path program 1 times [2019-12-27 05:55:53,854 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:55:53,854 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236923927] [2019-12-27 05:55:53,855 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:55:53,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:55:53,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:55:53,925 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236923927] [2019-12-27 05:55:53,925 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:55:53,925 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 05:55:53,925 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949740799] [2019-12-27 05:55:53,925 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 05:55:53,926 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:55:53,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 05:55:53,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 05:55:53,926 INFO L87 Difference]: Start difference. First operand 18887 states and 56307 transitions. Second operand 5 states. [2019-12-27 05:55:54,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:55:54,604 INFO L93 Difference]: Finished difference Result 26904 states and 79447 transitions. [2019-12-27 05:55:54,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 05:55:54,604 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-27 05:55:54,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:55:54,642 INFO L225 Difference]: With dead ends: 26904 [2019-12-27 05:55:54,642 INFO L226 Difference]: Without dead ends: 26904 [2019-12-27 05:55:54,642 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 05:55:54,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26904 states. [2019-12-27 05:55:54,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26904 to 24960. [2019-12-27 05:55:54,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24960 states. [2019-12-27 05:55:55,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24960 states to 24960 states and 74241 transitions. [2019-12-27 05:55:55,016 INFO L78 Accepts]: Start accepts. Automaton has 24960 states and 74241 transitions. Word has length 40 [2019-12-27 05:55:55,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:55:55,017 INFO L462 AbstractCegarLoop]: Abstraction has 24960 states and 74241 transitions. [2019-12-27 05:55:55,017 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 05:55:55,017 INFO L276 IsEmpty]: Start isEmpty. Operand 24960 states and 74241 transitions. [2019-12-27 05:55:55,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 05:55:55,038 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:55:55,038 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:55:55,038 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:55:55,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:55:55,039 INFO L82 PathProgramCache]: Analyzing trace with hash 1706121534, now seen corresponding path program 2 times [2019-12-27 05:55:55,039 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:55:55,040 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808476795] [2019-12-27 05:55:55,040 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:55:55,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:55:55,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:55:55,127 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808476795] [2019-12-27 05:55:55,128 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:55:55,128 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 05:55:55,128 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775452641] [2019-12-27 05:55:55,129 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 05:55:55,130 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:55:55,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 05:55:55,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:55:55,130 INFO L87 Difference]: Start difference. First operand 24960 states and 74241 transitions. Second operand 3 states. [2019-12-27 05:55:55,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:55:55,262 INFO L93 Difference]: Finished difference Result 24960 states and 73450 transitions. [2019-12-27 05:55:55,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 05:55:55,263 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-12-27 05:55:55,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:55:55,320 INFO L225 Difference]: With dead ends: 24960 [2019-12-27 05:55:55,320 INFO L226 Difference]: Without dead ends: 24960 [2019-12-27 05:55:55,321 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:55:55,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24960 states. [2019-12-27 05:55:55,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24960 to 24914. [2019-12-27 05:55:55,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24914 states. [2019-12-27 05:55:55,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24914 states to 24914 states and 73323 transitions. [2019-12-27 05:55:55,792 INFO L78 Accepts]: Start accepts. Automaton has 24914 states and 73323 transitions. Word has length 40 [2019-12-27 05:55:55,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:55:55,792 INFO L462 AbstractCegarLoop]: Abstraction has 24914 states and 73323 transitions. [2019-12-27 05:55:55,792 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 05:55:55,792 INFO L276 IsEmpty]: Start isEmpty. Operand 24914 states and 73323 transitions. [2019-12-27 05:55:55,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-27 05:55:55,813 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:55:55,813 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:55:55,813 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:55:55,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:55:55,814 INFO L82 PathProgramCache]: Analyzing trace with hash 1403753262, now seen corresponding path program 1 times [2019-12-27 05:55:55,814 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:55:55,814 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815223080] [2019-12-27 05:55:55,814 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:55:55,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:55:55,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:55:55,857 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815223080] [2019-12-27 05:55:55,857 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:55:55,857 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 05:55:55,857 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137600995] [2019-12-27 05:55:55,858 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 05:55:55,858 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:55:55,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 05:55:55,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 05:55:55,858 INFO L87 Difference]: Start difference. First operand 24914 states and 73323 transitions. Second operand 5 states. [2019-12-27 05:55:55,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:55:55,976 INFO L93 Difference]: Finished difference Result 23462 states and 69976 transitions. [2019-12-27 05:55:55,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 05:55:55,976 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2019-12-27 05:55:55,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:55:56,015 INFO L225 Difference]: With dead ends: 23462 [2019-12-27 05:55:56,015 INFO L226 Difference]: Without dead ends: 21668 [2019-12-27 05:55:56,015 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 05:55:56,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21668 states. [2019-12-27 05:55:56,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21668 to 20702. [2019-12-27 05:55:56,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20702 states. [2019-12-27 05:55:56,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20702 states to 20702 states and 63470 transitions. [2019-12-27 05:55:56,496 INFO L78 Accepts]: Start accepts. Automaton has 20702 states and 63470 transitions. Word has length 41 [2019-12-27 05:55:56,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:55:56,497 INFO L462 AbstractCegarLoop]: Abstraction has 20702 states and 63470 transitions. [2019-12-27 05:55:56,497 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 05:55:56,497 INFO L276 IsEmpty]: Start isEmpty. Operand 20702 states and 63470 transitions. [2019-12-27 05:55:56,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 05:55:56,516 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:55:56,516 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:55:56,517 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:55:56,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:55:56,517 INFO L82 PathProgramCache]: Analyzing trace with hash 384634377, now seen corresponding path program 1 times [2019-12-27 05:55:56,517 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:55:56,517 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421684990] [2019-12-27 05:55:56,517 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:55:56,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:55:56,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:55:56,611 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421684990] [2019-12-27 05:55:56,611 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:55:56,612 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 05:55:56,612 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301147420] [2019-12-27 05:55:56,612 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 05:55:56,612 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:55:56,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 05:55:56,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 05:55:56,613 INFO L87 Difference]: Start difference. First operand 20702 states and 63470 transitions. Second operand 6 states. [2019-12-27 05:55:57,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:55:57,467 INFO L93 Difference]: Finished difference Result 27244 states and 82518 transitions. [2019-12-27 05:55:57,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 05:55:57,468 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2019-12-27 05:55:57,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:55:57,505 INFO L225 Difference]: With dead ends: 27244 [2019-12-27 05:55:57,505 INFO L226 Difference]: Without dead ends: 27244 [2019-12-27 05:55:57,505 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-27 05:55:57,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27244 states. [2019-12-27 05:55:57,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27244 to 21871. [2019-12-27 05:55:57,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21871 states. [2019-12-27 05:55:57,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21871 states to 21871 states and 66986 transitions. [2019-12-27 05:55:57,863 INFO L78 Accepts]: Start accepts. Automaton has 21871 states and 66986 transitions. Word has length 65 [2019-12-27 05:55:57,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:55:57,863 INFO L462 AbstractCegarLoop]: Abstraction has 21871 states and 66986 transitions. [2019-12-27 05:55:57,863 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 05:55:57,863 INFO L276 IsEmpty]: Start isEmpty. Operand 21871 states and 66986 transitions. [2019-12-27 05:55:57,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 05:55:57,885 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:55:57,885 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:55:57,886 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:55:57,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:55:57,886 INFO L82 PathProgramCache]: Analyzing trace with hash 1572101585, now seen corresponding path program 2 times [2019-12-27 05:55:57,886 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:55:57,886 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551666864] [2019-12-27 05:55:57,886 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:55:57,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:55:57,958 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:55:57,958 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551666864] [2019-12-27 05:55:57,958 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:55:57,958 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 05:55:57,959 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552531140] [2019-12-27 05:55:57,959 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 05:55:57,959 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:55:57,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 05:55:57,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 05:55:57,960 INFO L87 Difference]: Start difference. First operand 21871 states and 66986 transitions. Second operand 5 states. [2019-12-27 05:55:58,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:55:58,352 INFO L93 Difference]: Finished difference Result 23936 states and 72729 transitions. [2019-12-27 05:55:58,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 05:55:58,352 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-12-27 05:55:58,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:55:58,396 INFO L225 Difference]: With dead ends: 23936 [2019-12-27 05:55:58,397 INFO L226 Difference]: Without dead ends: 23936 [2019-12-27 05:55:58,397 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 05:55:58,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23936 states. [2019-12-27 05:55:58,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23936 to 22155. [2019-12-27 05:55:58,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22155 states. [2019-12-27 05:55:58,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22155 states to 22155 states and 67844 transitions. [2019-12-27 05:55:58,766 INFO L78 Accepts]: Start accepts. Automaton has 22155 states and 67844 transitions. Word has length 65 [2019-12-27 05:55:58,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:55:58,766 INFO L462 AbstractCegarLoop]: Abstraction has 22155 states and 67844 transitions. [2019-12-27 05:55:58,766 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 05:55:58,766 INFO L276 IsEmpty]: Start isEmpty. Operand 22155 states and 67844 transitions. [2019-12-27 05:55:58,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 05:55:58,789 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:55:58,789 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:55:58,790 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:55:58,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:55:58,790 INFO L82 PathProgramCache]: Analyzing trace with hash -589431029, now seen corresponding path program 3 times [2019-12-27 05:55:58,790 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:55:58,790 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150626127] [2019-12-27 05:55:58,790 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:55:58,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:55:58,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:55:58,913 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150626127] [2019-12-27 05:55:58,913 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:55:58,913 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 05:55:58,914 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102161098] [2019-12-27 05:55:58,914 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 05:55:58,914 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:55:58,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 05:55:58,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-12-27 05:55:58,915 INFO L87 Difference]: Start difference. First operand 22155 states and 67844 transitions. Second operand 9 states. [2019-12-27 05:56:00,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:56:00,303 INFO L93 Difference]: Finished difference Result 34631 states and 105853 transitions. [2019-12-27 05:56:00,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 05:56:00,303 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-27 05:56:00,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:56:00,352 INFO L225 Difference]: With dead ends: 34631 [2019-12-27 05:56:00,352 INFO L226 Difference]: Without dead ends: 34631 [2019-12-27 05:56:00,352 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2019-12-27 05:56:00,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34631 states. [2019-12-27 05:56:00,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34631 to 22039. [2019-12-27 05:56:00,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22039 states. [2019-12-27 05:56:00,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22039 states to 22039 states and 67504 transitions. [2019-12-27 05:56:00,907 INFO L78 Accepts]: Start accepts. Automaton has 22039 states and 67504 transitions. Word has length 65 [2019-12-27 05:56:00,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:56:00,908 INFO L462 AbstractCegarLoop]: Abstraction has 22039 states and 67504 transitions. [2019-12-27 05:56:00,908 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 05:56:00,908 INFO L276 IsEmpty]: Start isEmpty. Operand 22039 states and 67504 transitions. [2019-12-27 05:56:00,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 05:56:00,932 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:56:00,932 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:56:00,932 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:56:00,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:56:00,933 INFO L82 PathProgramCache]: Analyzing trace with hash 1236323897, now seen corresponding path program 4 times [2019-12-27 05:56:00,933 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:56:00,933 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664758503] [2019-12-27 05:56:00,933 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:56:00,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:56:01,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:56:01,207 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664758503] [2019-12-27 05:56:01,208 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:56:01,208 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 05:56:01,208 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102416515] [2019-12-27 05:56:01,208 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 05:56:01,208 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:56:01,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 05:56:01,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-12-27 05:56:01,209 INFO L87 Difference]: Start difference. First operand 22039 states and 67504 transitions. Second operand 10 states. [2019-12-27 05:56:02,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:56:02,732 INFO L93 Difference]: Finished difference Result 38625 states and 117886 transitions. [2019-12-27 05:56:02,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 05:56:02,732 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 65 [2019-12-27 05:56:02,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:56:02,770 INFO L225 Difference]: With dead ends: 38625 [2019-12-27 05:56:02,771 INFO L226 Difference]: Without dead ends: 27269 [2019-12-27 05:56:02,771 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2019-12-27 05:56:02,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27269 states. [2019-12-27 05:56:03,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27269 to 24287. [2019-12-27 05:56:03,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24287 states. [2019-12-27 05:56:03,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24287 states to 24287 states and 74160 transitions. [2019-12-27 05:56:03,141 INFO L78 Accepts]: Start accepts. Automaton has 24287 states and 74160 transitions. Word has length 65 [2019-12-27 05:56:03,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:56:03,141 INFO L462 AbstractCegarLoop]: Abstraction has 24287 states and 74160 transitions. [2019-12-27 05:56:03,141 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 05:56:03,141 INFO L276 IsEmpty]: Start isEmpty. Operand 24287 states and 74160 transitions. [2019-12-27 05:56:03,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 05:56:03,166 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:56:03,166 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:56:03,166 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:56:03,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:56:03,166 INFO L82 PathProgramCache]: Analyzing trace with hash 232110765, now seen corresponding path program 5 times [2019-12-27 05:56:03,167 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:56:03,167 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430048585] [2019-12-27 05:56:03,167 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:56:03,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:56:03,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:56:03,450 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430048585] [2019-12-27 05:56:03,450 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:56:03,450 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 05:56:03,450 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095046180] [2019-12-27 05:56:03,450 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 05:56:03,451 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:56:03,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 05:56:03,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-27 05:56:03,451 INFO L87 Difference]: Start difference. First operand 24287 states and 74160 transitions. Second operand 11 states. [2019-12-27 05:56:05,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:56:05,107 INFO L93 Difference]: Finished difference Result 35856 states and 108134 transitions. [2019-12-27 05:56:05,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-27 05:56:05,108 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 65 [2019-12-27 05:56:05,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:56:05,149 INFO L225 Difference]: With dead ends: 35856 [2019-12-27 05:56:05,150 INFO L226 Difference]: Without dead ends: 29623 [2019-12-27 05:56:05,150 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=88, Invalid=332, Unknown=0, NotChecked=0, Total=420 [2019-12-27 05:56:05,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29623 states. [2019-12-27 05:56:05,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29623 to 24426. [2019-12-27 05:56:05,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24426 states. [2019-12-27 05:56:05,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24426 states to 24426 states and 74349 transitions. [2019-12-27 05:56:05,541 INFO L78 Accepts]: Start accepts. Automaton has 24426 states and 74349 transitions. Word has length 65 [2019-12-27 05:56:05,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:56:05,541 INFO L462 AbstractCegarLoop]: Abstraction has 24426 states and 74349 transitions. [2019-12-27 05:56:05,541 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 05:56:05,541 INFO L276 IsEmpty]: Start isEmpty. Operand 24426 states and 74349 transitions. [2019-12-27 05:56:05,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 05:56:05,564 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:56:05,564 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:56:05,564 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:56:05,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:56:05,565 INFO L82 PathProgramCache]: Analyzing trace with hash 1158113385, now seen corresponding path program 6 times [2019-12-27 05:56:05,565 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:56:05,565 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864636539] [2019-12-27 05:56:05,565 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:56:05,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:56:05,947 WARN L192 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 18 [2019-12-27 05:56:06,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:56:06,284 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864636539] [2019-12-27 05:56:06,284 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:56:06,284 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-27 05:56:06,285 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507202592] [2019-12-27 05:56:06,285 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 05:56:06,285 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:56:06,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 05:56:06,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2019-12-27 05:56:06,286 INFO L87 Difference]: Start difference. First operand 24426 states and 74349 transitions. Second operand 16 states. [2019-12-27 05:56:10,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:56:10,431 INFO L93 Difference]: Finished difference Result 34289 states and 103208 transitions. [2019-12-27 05:56:10,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-12-27 05:56:10,431 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 65 [2019-12-27 05:56:10,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:56:10,474 INFO L225 Difference]: With dead ends: 34289 [2019-12-27 05:56:10,474 INFO L226 Difference]: Without dead ends: 30494 [2019-12-27 05:56:10,475 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 327 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=284, Invalid=1438, Unknown=0, NotChecked=0, Total=1722 [2019-12-27 05:56:10,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30494 states. [2019-12-27 05:56:10,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30494 to 25026. [2019-12-27 05:56:10,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25026 states. [2019-12-27 05:56:10,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25026 states to 25026 states and 75839 transitions. [2019-12-27 05:56:10,876 INFO L78 Accepts]: Start accepts. Automaton has 25026 states and 75839 transitions. Word has length 65 [2019-12-27 05:56:10,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:56:10,876 INFO L462 AbstractCegarLoop]: Abstraction has 25026 states and 75839 transitions. [2019-12-27 05:56:10,876 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 05:56:10,876 INFO L276 IsEmpty]: Start isEmpty. Operand 25026 states and 75839 transitions. [2019-12-27 05:56:10,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 05:56:10,903 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:56:10,903 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:56:10,903 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:56:10,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:56:10,904 INFO L82 PathProgramCache]: Analyzing trace with hash -1439346929, now seen corresponding path program 7 times [2019-12-27 05:56:10,904 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:56:10,904 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154000648] [2019-12-27 05:56:10,904 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:56:10,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:56:11,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:56:11,234 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154000648] [2019-12-27 05:56:11,235 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:56:11,236 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 05:56:11,236 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678581749] [2019-12-27 05:56:11,236 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 05:56:11,236 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:56:11,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 05:56:11,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-27 05:56:11,237 INFO L87 Difference]: Start difference. First operand 25026 states and 75839 transitions. Second operand 11 states. [2019-12-27 05:56:12,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:56:12,900 INFO L93 Difference]: Finished difference Result 68373 states and 207631 transitions. [2019-12-27 05:56:12,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-12-27 05:56:12,900 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 65 [2019-12-27 05:56:12,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:56:12,987 INFO L225 Difference]: With dead ends: 68373 [2019-12-27 05:56:12,987 INFO L226 Difference]: Without dead ends: 57381 [2019-12-27 05:56:12,988 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 346 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=271, Invalid=1135, Unknown=0, NotChecked=0, Total=1406 [2019-12-27 05:56:13,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57381 states. [2019-12-27 05:56:13,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57381 to 31649. [2019-12-27 05:56:13,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31649 states. [2019-12-27 05:56:13,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31649 states to 31649 states and 96703 transitions. [2019-12-27 05:56:13,879 INFO L78 Accepts]: Start accepts. Automaton has 31649 states and 96703 transitions. Word has length 65 [2019-12-27 05:56:13,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:56:13,879 INFO L462 AbstractCegarLoop]: Abstraction has 31649 states and 96703 transitions. [2019-12-27 05:56:13,879 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 05:56:13,879 INFO L276 IsEmpty]: Start isEmpty. Operand 31649 states and 96703 transitions. [2019-12-27 05:56:13,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 05:56:13,912 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:56:13,912 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:56:13,912 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:56:13,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:56:13,912 INFO L82 PathProgramCache]: Analyzing trace with hash -307938741, now seen corresponding path program 8 times [2019-12-27 05:56:13,913 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:56:13,913 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142212120] [2019-12-27 05:56:13,913 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:56:13,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:56:14,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:56:14,001 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142212120] [2019-12-27 05:56:14,001 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:56:14,001 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 05:56:14,001 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305235500] [2019-12-27 05:56:14,002 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 05:56:14,002 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:56:14,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 05:56:14,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 05:56:14,002 INFO L87 Difference]: Start difference. First operand 31649 states and 96703 transitions. Second operand 6 states. [2019-12-27 05:56:14,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:56:14,682 INFO L93 Difference]: Finished difference Result 36757 states and 111396 transitions. [2019-12-27 05:56:14,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 05:56:14,682 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2019-12-27 05:56:14,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:56:14,734 INFO L225 Difference]: With dead ends: 36757 [2019-12-27 05:56:14,734 INFO L226 Difference]: Without dead ends: 36757 [2019-12-27 05:56:14,734 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-27 05:56:14,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36757 states. [2019-12-27 05:56:15,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36757 to 32304. [2019-12-27 05:56:15,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32304 states. [2019-12-27 05:56:15,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32304 states to 32304 states and 98742 transitions. [2019-12-27 05:56:15,257 INFO L78 Accepts]: Start accepts. Automaton has 32304 states and 98742 transitions. Word has length 65 [2019-12-27 05:56:15,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:56:15,258 INFO L462 AbstractCegarLoop]: Abstraction has 32304 states and 98742 transitions. [2019-12-27 05:56:15,258 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 05:56:15,258 INFO L276 IsEmpty]: Start isEmpty. Operand 32304 states and 98742 transitions. [2019-12-27 05:56:15,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 05:56:15,292 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:56:15,292 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:56:15,292 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:56:15,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:56:15,292 INFO L82 PathProgramCache]: Analyzing trace with hash 1258339691, now seen corresponding path program 9 times [2019-12-27 05:56:15,293 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:56:15,293 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897428855] [2019-12-27 05:56:15,293 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:56:15,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:56:15,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:56:15,490 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897428855] [2019-12-27 05:56:15,491 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:56:15,491 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 05:56:15,491 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641843698] [2019-12-27 05:56:15,492 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 05:56:15,492 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:56:15,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 05:56:15,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-27 05:56:15,493 INFO L87 Difference]: Start difference. First operand 32304 states and 98742 transitions. Second operand 9 states. [2019-12-27 05:56:17,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:56:17,088 INFO L93 Difference]: Finished difference Result 47264 states and 144544 transitions. [2019-12-27 05:56:17,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-27 05:56:17,088 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-27 05:56:17,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:56:17,156 INFO L225 Difference]: With dead ends: 47264 [2019-12-27 05:56:17,157 INFO L226 Difference]: Without dead ends: 47264 [2019-12-27 05:56:17,157 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=93, Invalid=369, Unknown=0, NotChecked=0, Total=462 [2019-12-27 05:56:17,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47264 states. [2019-12-27 05:56:17,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47264 to 35449. [2019-12-27 05:56:17,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35449 states. [2019-12-27 05:56:18,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35449 states to 35449 states and 109488 transitions. [2019-12-27 05:56:18,032 INFO L78 Accepts]: Start accepts. Automaton has 35449 states and 109488 transitions. Word has length 65 [2019-12-27 05:56:18,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:56:18,032 INFO L462 AbstractCegarLoop]: Abstraction has 35449 states and 109488 transitions. [2019-12-27 05:56:18,032 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 05:56:18,032 INFO L276 IsEmpty]: Start isEmpty. Operand 35449 states and 109488 transitions. [2019-12-27 05:56:18,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 05:56:18,074 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:56:18,074 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:56:18,074 INFO L410 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:56:18,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:56:18,075 INFO L82 PathProgramCache]: Analyzing trace with hash 1033810687, now seen corresponding path program 10 times [2019-12-27 05:56:18,075 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:56:18,075 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041857119] [2019-12-27 05:56:18,075 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:56:18,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:56:18,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:56:18,218 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041857119] [2019-12-27 05:56:18,218 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:56:18,218 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 05:56:18,218 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665748185] [2019-12-27 05:56:18,219 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 05:56:18,219 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:56:18,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 05:56:18,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-27 05:56:18,219 INFO L87 Difference]: Start difference. First operand 35449 states and 109488 transitions. Second operand 8 states. [2019-12-27 05:56:19,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:56:19,221 INFO L93 Difference]: Finished difference Result 50434 states and 153417 transitions. [2019-12-27 05:56:19,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 05:56:19,222 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 65 [2019-12-27 05:56:19,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:56:19,295 INFO L225 Difference]: With dead ends: 50434 [2019-12-27 05:56:19,295 INFO L226 Difference]: Without dead ends: 50434 [2019-12-27 05:56:19,298 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-12-27 05:56:19,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50434 states. [2019-12-27 05:56:19,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50434 to 35198. [2019-12-27 05:56:19,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35198 states. [2019-12-27 05:56:19,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35198 states to 35198 states and 108261 transitions. [2019-12-27 05:56:19,938 INFO L78 Accepts]: Start accepts. Automaton has 35198 states and 108261 transitions. Word has length 65 [2019-12-27 05:56:19,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:56:19,938 INFO L462 AbstractCegarLoop]: Abstraction has 35198 states and 108261 transitions. [2019-12-27 05:56:19,938 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 05:56:19,938 INFO L276 IsEmpty]: Start isEmpty. Operand 35198 states and 108261 transitions. [2019-12-27 05:56:19,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 05:56:19,977 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:56:19,977 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:56:19,978 INFO L410 AbstractCegarLoop]: === Iteration 34 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:56:19,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:56:19,978 INFO L82 PathProgramCache]: Analyzing trace with hash 910313949, now seen corresponding path program 11 times [2019-12-27 05:56:19,978 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:56:19,978 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519374352] [2019-12-27 05:56:19,978 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:56:19,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:56:20,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:56:20,069 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519374352] [2019-12-27 05:56:20,070 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:56:20,070 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 05:56:20,070 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825308571] [2019-12-27 05:56:20,070 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 05:56:20,070 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:56:20,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 05:56:20,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 05:56:20,071 INFO L87 Difference]: Start difference. First operand 35198 states and 108261 transitions. Second operand 7 states. [2019-12-27 05:56:20,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:56:20,898 INFO L93 Difference]: Finished difference Result 57171 states and 171785 transitions. [2019-12-27 05:56:20,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 05:56:20,898 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-27 05:56:20,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:56:20,978 INFO L225 Difference]: With dead ends: 57171 [2019-12-27 05:56:20,978 INFO L226 Difference]: Without dead ends: 57171 [2019-12-27 05:56:20,979 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2019-12-27 05:56:21,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57171 states. [2019-12-27 05:56:21,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57171 to 35783. [2019-12-27 05:56:21,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35783 states. [2019-12-27 05:56:21,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35783 states to 35783 states and 110150 transitions. [2019-12-27 05:56:21,915 INFO L78 Accepts]: Start accepts. Automaton has 35783 states and 110150 transitions. Word has length 65 [2019-12-27 05:56:21,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:56:21,915 INFO L462 AbstractCegarLoop]: Abstraction has 35783 states and 110150 transitions. [2019-12-27 05:56:21,915 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 05:56:21,915 INFO L276 IsEmpty]: Start isEmpty. Operand 35783 states and 110150 transitions. [2019-12-27 05:56:21,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 05:56:21,954 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:56:21,954 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:56:21,954 INFO L410 AbstractCegarLoop]: === Iteration 35 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:56:21,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:56:21,954 INFO L82 PathProgramCache]: Analyzing trace with hash 1435635091, now seen corresponding path program 12 times [2019-12-27 05:56:21,954 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:56:21,955 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274960295] [2019-12-27 05:56:21,955 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:56:21,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:56:22,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:56:22,040 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274960295] [2019-12-27 05:56:22,040 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:56:22,040 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 05:56:22,041 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730624136] [2019-12-27 05:56:22,041 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 05:56:22,041 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:56:22,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 05:56:22,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 05:56:22,042 INFO L87 Difference]: Start difference. First operand 35783 states and 110150 transitions. Second operand 7 states. [2019-12-27 05:56:23,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:56:23,198 INFO L93 Difference]: Finished difference Result 58706 states and 176491 transitions. [2019-12-27 05:56:23,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 05:56:23,199 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-27 05:56:23,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:56:23,288 INFO L225 Difference]: With dead ends: 58706 [2019-12-27 05:56:23,288 INFO L226 Difference]: Without dead ends: 58706 [2019-12-27 05:56:23,288 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-27 05:56:23,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58706 states. [2019-12-27 05:56:23,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58706 to 35451. [2019-12-27 05:56:23,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35451 states. [2019-12-27 05:56:23,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35451 states to 35451 states and 109003 transitions. [2019-12-27 05:56:23,991 INFO L78 Accepts]: Start accepts. Automaton has 35451 states and 109003 transitions. Word has length 65 [2019-12-27 05:56:23,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:56:23,992 INFO L462 AbstractCegarLoop]: Abstraction has 35451 states and 109003 transitions. [2019-12-27 05:56:23,992 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 05:56:23,992 INFO L276 IsEmpty]: Start isEmpty. Operand 35451 states and 109003 transitions. [2019-12-27 05:56:24,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 05:56:24,029 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:56:24,030 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:56:24,030 INFO L410 AbstractCegarLoop]: === Iteration 36 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:56:24,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:56:24,030 INFO L82 PathProgramCache]: Analyzing trace with hash 678923601, now seen corresponding path program 13 times [2019-12-27 05:56:24,030 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:56:24,030 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725988169] [2019-12-27 05:56:24,030 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:56:24,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:56:24,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:56:24,117 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725988169] [2019-12-27 05:56:24,117 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:56:24,117 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 05:56:24,118 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650175461] [2019-12-27 05:56:24,118 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 05:56:24,118 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:56:24,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 05:56:24,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 05:56:24,119 INFO L87 Difference]: Start difference. First operand 35451 states and 109003 transitions. Second operand 6 states. [2019-12-27 05:56:24,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:56:24,616 INFO L93 Difference]: Finished difference Result 37932 states and 115753 transitions. [2019-12-27 05:56:24,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 05:56:24,617 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2019-12-27 05:56:24,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:56:24,671 INFO L225 Difference]: With dead ends: 37932 [2019-12-27 05:56:24,671 INFO L226 Difference]: Without dead ends: 37932 [2019-12-27 05:56:24,671 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-27 05:56:24,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37932 states. [2019-12-27 05:56:25,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37932 to 36057. [2019-12-27 05:56:25,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36057 states. [2019-12-27 05:56:25,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36057 states to 36057 states and 110720 transitions. [2019-12-27 05:56:25,240 INFO L78 Accepts]: Start accepts. Automaton has 36057 states and 110720 transitions. Word has length 65 [2019-12-27 05:56:25,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:56:25,240 INFO L462 AbstractCegarLoop]: Abstraction has 36057 states and 110720 transitions. [2019-12-27 05:56:25,240 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 05:56:25,240 INFO L276 IsEmpty]: Start isEmpty. Operand 36057 states and 110720 transitions. [2019-12-27 05:56:25,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 05:56:25,281 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:56:25,281 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:56:25,281 INFO L410 AbstractCegarLoop]: === Iteration 37 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:56:25,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:56:25,282 INFO L82 PathProgramCache]: Analyzing trace with hash 2134621285, now seen corresponding path program 14 times [2019-12-27 05:56:25,282 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:56:25,282 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891685882] [2019-12-27 05:56:25,282 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:56:25,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:56:25,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:56:25,365 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891685882] [2019-12-27 05:56:25,365 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:56:25,365 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 05:56:25,365 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080155051] [2019-12-27 05:56:25,366 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 05:56:25,366 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:56:25,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 05:56:25,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 05:56:25,367 INFO L87 Difference]: Start difference. First operand 36057 states and 110720 transitions. Second operand 7 states. [2019-12-27 05:56:26,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:56:26,136 INFO L93 Difference]: Finished difference Result 75760 states and 228361 transitions. [2019-12-27 05:56:26,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 05:56:26,137 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-27 05:56:26,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:56:26,231 INFO L225 Difference]: With dead ends: 75760 [2019-12-27 05:56:26,231 INFO L226 Difference]: Without dead ends: 61949 [2019-12-27 05:56:26,232 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-27 05:56:26,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61949 states. [2019-12-27 05:56:26,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61949 to 34422. [2019-12-27 05:56:26,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34422 states. [2019-12-27 05:56:26,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34422 states to 34422 states and 104650 transitions. [2019-12-27 05:56:26,967 INFO L78 Accepts]: Start accepts. Automaton has 34422 states and 104650 transitions. Word has length 65 [2019-12-27 05:56:26,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:56:26,967 INFO L462 AbstractCegarLoop]: Abstraction has 34422 states and 104650 transitions. [2019-12-27 05:56:26,967 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 05:56:26,967 INFO L276 IsEmpty]: Start isEmpty. Operand 34422 states and 104650 transitions. [2019-12-27 05:56:27,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 05:56:27,003 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:56:27,003 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:56:27,003 INFO L410 AbstractCegarLoop]: === Iteration 38 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:56:27,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:56:27,003 INFO L82 PathProgramCache]: Analyzing trace with hash 340326165, now seen corresponding path program 15 times [2019-12-27 05:56:27,004 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:56:27,004 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98572152] [2019-12-27 05:56:27,004 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:56:27,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:56:27,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:56:27,048 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98572152] [2019-12-27 05:56:27,048 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:56:27,048 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 05:56:27,048 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136369181] [2019-12-27 05:56:27,049 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 05:56:27,049 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:56:27,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 05:56:27,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:56:27,049 INFO L87 Difference]: Start difference. First operand 34422 states and 104650 transitions. Second operand 3 states. [2019-12-27 05:56:27,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:56:27,186 INFO L93 Difference]: Finished difference Result 34421 states and 104648 transitions. [2019-12-27 05:56:27,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 05:56:27,187 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 05:56:27,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:56:27,253 INFO L225 Difference]: With dead ends: 34421 [2019-12-27 05:56:27,253 INFO L226 Difference]: Without dead ends: 34421 [2019-12-27 05:56:27,254 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:56:27,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34421 states. [2019-12-27 05:56:27,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34421 to 27531. [2019-12-27 05:56:27,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27531 states. [2019-12-27 05:56:27,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27531 states to 27531 states and 84087 transitions. [2019-12-27 05:56:27,737 INFO L78 Accepts]: Start accepts. Automaton has 27531 states and 84087 transitions. Word has length 65 [2019-12-27 05:56:27,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:56:27,738 INFO L462 AbstractCegarLoop]: Abstraction has 27531 states and 84087 transitions. [2019-12-27 05:56:27,738 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 05:56:27,738 INFO L276 IsEmpty]: Start isEmpty. Operand 27531 states and 84087 transitions. [2019-12-27 05:56:27,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 05:56:27,768 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:56:27,768 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:56:27,768 INFO L410 AbstractCegarLoop]: === Iteration 39 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:56:27,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:56:27,768 INFO L82 PathProgramCache]: Analyzing trace with hash 722146311, now seen corresponding path program 1 times [2019-12-27 05:56:27,769 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:56:27,769 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559428833] [2019-12-27 05:56:27,769 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:56:27,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:56:28,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:56:28,039 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559428833] [2019-12-27 05:56:28,040 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:56:28,040 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 05:56:28,040 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834371624] [2019-12-27 05:56:28,041 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 05:56:28,042 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:56:28,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 05:56:28,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-12-27 05:56:28,042 INFO L87 Difference]: Start difference. First operand 27531 states and 84087 transitions. Second operand 10 states. [2019-12-27 05:56:30,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:56:30,632 INFO L93 Difference]: Finished difference Result 39747 states and 119205 transitions. [2019-12-27 05:56:30,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 05:56:30,633 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 66 [2019-12-27 05:56:30,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:56:30,879 INFO L225 Difference]: With dead ends: 39747 [2019-12-27 05:56:30,879 INFO L226 Difference]: Without dead ends: 39531 [2019-12-27 05:56:30,880 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=158, Invalid=544, Unknown=0, NotChecked=0, Total=702 [2019-12-27 05:56:30,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39531 states. [2019-12-27 05:56:31,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39531 to 29700. [2019-12-27 05:56:31,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29700 states. [2019-12-27 05:56:31,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29700 states to 29700 states and 90635 transitions. [2019-12-27 05:56:31,346 INFO L78 Accepts]: Start accepts. Automaton has 29700 states and 90635 transitions. Word has length 66 [2019-12-27 05:56:31,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:56:31,347 INFO L462 AbstractCegarLoop]: Abstraction has 29700 states and 90635 transitions. [2019-12-27 05:56:31,347 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 05:56:31,347 INFO L276 IsEmpty]: Start isEmpty. Operand 29700 states and 90635 transitions. [2019-12-27 05:56:31,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 05:56:31,378 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:56:31,378 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:56:31,378 INFO L410 AbstractCegarLoop]: === Iteration 40 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:56:31,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:56:31,378 INFO L82 PathProgramCache]: Analyzing trace with hash 146045661, now seen corresponding path program 2 times [2019-12-27 05:56:31,378 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:56:31,379 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513967537] [2019-12-27 05:56:31,379 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:56:31,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:56:31,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:56:31,695 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513967537] [2019-12-27 05:56:31,695 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:56:31,696 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 05:56:31,696 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706976156] [2019-12-27 05:56:31,697 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 05:56:31,697 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:56:31,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 05:56:31,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-27 05:56:31,698 INFO L87 Difference]: Start difference. First operand 29700 states and 90635 transitions. Second operand 11 states. [2019-12-27 05:56:33,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:56:33,607 INFO L93 Difference]: Finished difference Result 40040 states and 120181 transitions. [2019-12-27 05:56:33,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 05:56:33,607 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 66 [2019-12-27 05:56:33,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:56:33,659 INFO L225 Difference]: With dead ends: 40040 [2019-12-27 05:56:33,659 INFO L226 Difference]: Without dead ends: 35805 [2019-12-27 05:56:33,659 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=124, Invalid=476, Unknown=0, NotChecked=0, Total=600 [2019-12-27 05:56:33,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35805 states. [2019-12-27 05:56:34,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35805 to 28636. [2019-12-27 05:56:34,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28636 states. [2019-12-27 05:56:34,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28636 states to 28636 states and 87504 transitions. [2019-12-27 05:56:34,144 INFO L78 Accepts]: Start accepts. Automaton has 28636 states and 87504 transitions. Word has length 66 [2019-12-27 05:56:34,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:56:34,144 INFO L462 AbstractCegarLoop]: Abstraction has 28636 states and 87504 transitions. [2019-12-27 05:56:34,144 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 05:56:34,144 INFO L276 IsEmpty]: Start isEmpty. Operand 28636 states and 87504 transitions. [2019-12-27 05:56:34,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 05:56:34,176 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:56:34,176 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:56:34,176 INFO L410 AbstractCegarLoop]: === Iteration 41 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:56:34,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:56:34,176 INFO L82 PathProgramCache]: Analyzing trace with hash -1394123175, now seen corresponding path program 3 times [2019-12-27 05:56:34,176 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:56:34,176 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832169308] [2019-12-27 05:56:34,177 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:56:34,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:56:34,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:56:34,442 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832169308] [2019-12-27 05:56:34,442 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:56:34,443 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 05:56:34,443 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432793764] [2019-12-27 05:56:34,443 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 05:56:34,443 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:56:34,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 05:56:34,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-27 05:56:34,444 INFO L87 Difference]: Start difference. First operand 28636 states and 87504 transitions. Second operand 11 states. [2019-12-27 05:56:35,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:56:35,614 INFO L93 Difference]: Finished difference Result 48424 states and 147475 transitions. [2019-12-27 05:56:35,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-27 05:56:35,614 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 66 [2019-12-27 05:56:35,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:56:35,675 INFO L225 Difference]: With dead ends: 48424 [2019-12-27 05:56:35,675 INFO L226 Difference]: Without dead ends: 41326 [2019-12-27 05:56:35,676 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=122, Invalid=478, Unknown=0, NotChecked=0, Total=600 [2019-12-27 05:56:35,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41326 states. [2019-12-27 05:56:36,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41326 to 24495. [2019-12-27 05:56:36,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24495 states. [2019-12-27 05:56:36,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24495 states to 24495 states and 74664 transitions. [2019-12-27 05:56:36,428 INFO L78 Accepts]: Start accepts. Automaton has 24495 states and 74664 transitions. Word has length 66 [2019-12-27 05:56:36,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:56:36,428 INFO L462 AbstractCegarLoop]: Abstraction has 24495 states and 74664 transitions. [2019-12-27 05:56:36,428 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 05:56:36,428 INFO L276 IsEmpty]: Start isEmpty. Operand 24495 states and 74664 transitions. [2019-12-27 05:56:36,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 05:56:36,454 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:56:36,454 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:56:36,454 INFO L410 AbstractCegarLoop]: === Iteration 42 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:56:36,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:56:36,455 INFO L82 PathProgramCache]: Analyzing trace with hash 914433021, now seen corresponding path program 4 times [2019-12-27 05:56:36,455 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:56:36,455 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027472866] [2019-12-27 05:56:36,455 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:56:36,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:56:37,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:56:37,154 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027472866] [2019-12-27 05:56:37,154 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:56:37,154 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-12-27 05:56:37,155 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199811372] [2019-12-27 05:56:37,155 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-27 05:56:37,155 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:56:37,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-27 05:56:37,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2019-12-27 05:56:37,156 INFO L87 Difference]: Start difference. First operand 24495 states and 74664 transitions. Second operand 18 states. [2019-12-27 05:56:40,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:56:40,847 INFO L93 Difference]: Finished difference Result 29133 states and 87756 transitions. [2019-12-27 05:56:40,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-12-27 05:56:40,848 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 66 [2019-12-27 05:56:40,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:56:40,889 INFO L225 Difference]: With dead ends: 29133 [2019-12-27 05:56:40,889 INFO L226 Difference]: Without dead ends: 28426 [2019-12-27 05:56:40,890 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 290 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=275, Invalid=1447, Unknown=0, NotChecked=0, Total=1722 [2019-12-27 05:56:40,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28426 states. [2019-12-27 05:56:41,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28426 to 24417. [2019-12-27 05:56:41,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24417 states. [2019-12-27 05:56:41,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24417 states to 24417 states and 74460 transitions. [2019-12-27 05:56:41,277 INFO L78 Accepts]: Start accepts. Automaton has 24417 states and 74460 transitions. Word has length 66 [2019-12-27 05:56:41,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:56:41,277 INFO L462 AbstractCegarLoop]: Abstraction has 24417 states and 74460 transitions. [2019-12-27 05:56:41,277 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-27 05:56:41,277 INFO L276 IsEmpty]: Start isEmpty. Operand 24417 states and 74460 transitions. [2019-12-27 05:56:41,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 05:56:41,306 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:56:41,306 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:56:41,306 INFO L410 AbstractCegarLoop]: === Iteration 43 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:56:41,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:56:41,306 INFO L82 PathProgramCache]: Analyzing trace with hash 743710911, now seen corresponding path program 5 times [2019-12-27 05:56:41,307 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:56:41,307 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646143020] [2019-12-27 05:56:41,307 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:56:41,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:56:41,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:56:41,439 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646143020] [2019-12-27 05:56:41,439 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:56:41,440 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 05:56:41,440 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137231290] [2019-12-27 05:56:41,440 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 05:56:41,440 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:56:41,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 05:56:41,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-27 05:56:41,441 INFO L87 Difference]: Start difference. First operand 24417 states and 74460 transitions. Second operand 9 states. [2019-12-27 05:56:43,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:56:43,539 INFO L93 Difference]: Finished difference Result 35822 states and 107089 transitions. [2019-12-27 05:56:43,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 05:56:43,540 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 66 [2019-12-27 05:56:43,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:56:43,590 INFO L225 Difference]: With dead ends: 35822 [2019-12-27 05:56:43,590 INFO L226 Difference]: Without dead ends: 35822 [2019-12-27 05:56:43,590 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=105, Invalid=447, Unknown=0, NotChecked=0, Total=552 [2019-12-27 05:56:43,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35822 states. [2019-12-27 05:56:43,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35822 to 24217. [2019-12-27 05:56:43,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24217 states. [2019-12-27 05:56:44,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24217 states to 24217 states and 73950 transitions. [2019-12-27 05:56:44,043 INFO L78 Accepts]: Start accepts. Automaton has 24217 states and 73950 transitions. Word has length 66 [2019-12-27 05:56:44,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:56:44,043 INFO L462 AbstractCegarLoop]: Abstraction has 24217 states and 73950 transitions. [2019-12-27 05:56:44,044 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 05:56:44,044 INFO L276 IsEmpty]: Start isEmpty. Operand 24217 states and 73950 transitions. [2019-12-27 05:56:44,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 05:56:44,070 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:56:44,071 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:56:44,071 INFO L410 AbstractCegarLoop]: === Iteration 44 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:56:44,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:56:44,071 INFO L82 PathProgramCache]: Analyzing trace with hash -1582795929, now seen corresponding path program 6 times [2019-12-27 05:56:44,071 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:56:44,071 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975407763] [2019-12-27 05:56:44,071 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:56:44,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:56:44,372 WARN L192 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 9 [2019-12-27 05:56:44,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:56:44,486 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975407763] [2019-12-27 05:56:44,486 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:56:44,486 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 05:56:44,486 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73545478] [2019-12-27 05:56:44,486 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 05:56:44,486 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:56:44,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 05:56:44,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-12-27 05:56:44,487 INFO L87 Difference]: Start difference. First operand 24217 states and 73950 transitions. Second operand 10 states. [2019-12-27 05:56:45,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:56:45,675 INFO L93 Difference]: Finished difference Result 29007 states and 87184 transitions. [2019-12-27 05:56:45,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 05:56:45,676 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 66 [2019-12-27 05:56:45,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:56:45,716 INFO L225 Difference]: With dead ends: 29007 [2019-12-27 05:56:45,716 INFO L226 Difference]: Without dead ends: 28038 [2019-12-27 05:56:45,716 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2019-12-27 05:56:45,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28038 states. [2019-12-27 05:56:46,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28038 to 23593. [2019-12-27 05:56:46,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23593 states. [2019-12-27 05:56:46,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23593 states to 23593 states and 72236 transitions. [2019-12-27 05:56:46,119 INFO L78 Accepts]: Start accepts. Automaton has 23593 states and 72236 transitions. Word has length 66 [2019-12-27 05:56:46,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:56:46,120 INFO L462 AbstractCegarLoop]: Abstraction has 23593 states and 72236 transitions. [2019-12-27 05:56:46,120 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 05:56:46,120 INFO L276 IsEmpty]: Start isEmpty. Operand 23593 states and 72236 transitions. [2019-12-27 05:56:46,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 05:56:46,143 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:56:46,143 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:56:46,143 INFO L410 AbstractCegarLoop]: === Iteration 45 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:56:46,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:56:46,143 INFO L82 PathProgramCache]: Analyzing trace with hash 1716780679, now seen corresponding path program 7 times [2019-12-27 05:56:46,143 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:56:46,144 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599100429] [2019-12-27 05:56:46,144 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:56:46,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:56:46,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:56:46,219 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599100429] [2019-12-27 05:56:46,220 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:56:46,220 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 05:56:46,220 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832051507] [2019-12-27 05:56:46,220 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 05:56:46,220 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:56:46,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 05:56:46,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 05:56:46,221 INFO L87 Difference]: Start difference. First operand 23593 states and 72236 transitions. Second operand 4 states. [2019-12-27 05:56:46,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:56:46,392 INFO L93 Difference]: Finished difference Result 28227 states and 85579 transitions. [2019-12-27 05:56:46,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 05:56:46,392 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-12-27 05:56:46,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:56:46,444 INFO L225 Difference]: With dead ends: 28227 [2019-12-27 05:56:46,444 INFO L226 Difference]: Without dead ends: 28227 [2019-12-27 05:56:46,445 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 05:56:46,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28227 states. [2019-12-27 05:56:46,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28227 to 23517. [2019-12-27 05:56:46,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23517 states. [2019-12-27 05:56:46,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23517 states to 23517 states and 71873 transitions. [2019-12-27 05:56:46,826 INFO L78 Accepts]: Start accepts. Automaton has 23517 states and 71873 transitions. Word has length 66 [2019-12-27 05:56:46,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:56:46,826 INFO L462 AbstractCegarLoop]: Abstraction has 23517 states and 71873 transitions. [2019-12-27 05:56:46,826 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 05:56:46,826 INFO L276 IsEmpty]: Start isEmpty. Operand 23517 states and 71873 transitions. [2019-12-27 05:56:46,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 05:56:46,848 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:56:46,849 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:56:46,849 INFO L410 AbstractCegarLoop]: === Iteration 46 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:56:46,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:56:46,849 INFO L82 PathProgramCache]: Analyzing trace with hash -185379867, now seen corresponding path program 1 times [2019-12-27 05:56:46,849 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:56:46,849 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144552297] [2019-12-27 05:56:46,849 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:56:46,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 05:56:46,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 05:56:46,952 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 05:56:46,953 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 05:56:46,957 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [893] [893] ULTIMATE.startENTRY-->L825: Formula: (let ((.cse0 (store |v_#valid_62| 0 0))) (and (= 0 v_~z$r_buff1_thd2~0_19) (= v_~main$tmp_guard0~0_10 0) (= 0 v_~z$w_buff1~0_25) (= 0 v_~weak$$choice0~0_8) (= 0 v_~z$r_buff1_thd0~0_24) (= v_~z$read_delayed_var~0.offset_6 0) (= v_~z$r_buff0_thd0~0_20 0) (= 0 v_~__unbuffered_cnt~0_20) (= |v_#NULL.offset_6| 0) (= (store |v_#length_22| |v_ULTIMATE.start_main_~#t675~0.base_21| 4) |v_#length_21|) (= 0 v_~z$flush_delayed~0_13) (= v_~__unbuffered_p2_EBX~0_16 0) (= 0 v_~z$r_buff1_thd3~0_52) (= 0 v_~z$r_buff1_thd1~0_18) (= v_~x~0_10 0) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t675~0.base_21|) (< 0 |v_#StackHeapBarrier_15|) (= v_~z$read_delayed_var~0.base_6 0) (= 0 v_~z$w_buff1_used~0_73) (= v_~y~0_15 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t675~0.base_21|) 0) (= |v_#valid_60| (store .cse0 |v_ULTIMATE.start_main_~#t675~0.base_21| 1)) (= 0 |v_#NULL.base_6|) (= 0 v_~weak$$choice2~0_33) (= v_~z$r_buff0_thd1~0_27 0) (= v_~z$read_delayed~0_7 0) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t675~0.base_21| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t675~0.base_21|) |v_ULTIMATE.start_main_~#t675~0.offset_16| 0)) |v_#memory_int_19|) (= v_~z$mem_tmp~0_10 0) (= v_~z$r_buff0_thd3~0_80 0) (= v_~main$tmp_guard1~0_14 0) (= v_~z~0_27 0) (= 0 v_~__unbuffered_p0_EAX~0_16) (= 0 v_~z$w_buff0~0_25) (= 0 v_~__unbuffered_p2_EAX~0_14) (= v_~z$r_buff0_thd2~0_21 0) (= 0 |v_ULTIMATE.start_main_~#t675~0.offset_16|) (= v_~z$w_buff0_used~0_116 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_62|, #memory_int=|v_#memory_int_20|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_~#t677~0.base=|v_ULTIMATE.start_main_~#t677~0.base_19|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_19, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_11|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_9|, ULTIMATE.start_main_~#t675~0.offset=|v_ULTIMATE.start_main_~#t675~0.offset_16|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_9|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_22|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_20, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_16, #length=|v_#length_21|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_14, ~z$mem_tmp~0=v_~z$mem_tmp~0_10, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_16, ULTIMATE.start_main_~#t675~0.base=|v_ULTIMATE.start_main_~#t675~0.base_21|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_8|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_73, ~z$flush_delayed~0=v_~z$flush_delayed~0_13, ~weak$$choice0~0=v_~weak$$choice0~0_8, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_18, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_6, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_80, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_20, ULTIMATE.start_main_~#t676~0.offset=|v_ULTIMATE.start_main_~#t676~0.offset_15|, ~x~0=v_~x~0_10, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_25, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_14, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_11|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_6, ULTIMATE.start_main_~#t676~0.base=|v_ULTIMATE.start_main_~#t676~0.base_20|, ULTIMATE.start_main_~#t677~0.offset=|v_ULTIMATE.start_main_~#t677~0.offset_15|, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_9|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_24, ~y~0=v_~y~0_15, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_21, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_7|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_116, ~z$w_buff0~0=v_~z$w_buff0~0_25, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_7|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_52, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_21|, #valid=|v_#valid_60|, #memory_int=|v_#memory_int_19|, ~z~0=v_~z~0_27, ~weak$$choice2~0=v_~weak$$choice2~0_33, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_27} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t677~0.base, ~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_~#t675~0.offset, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_~#t675~0.base, ULTIMATE.start_main_#t~nondet45, ~z$w_buff1_used~0, ~z$flush_delayed~0, ~weak$$choice0~0, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ULTIMATE.start_main_~#t676~0.offset, ~x~0, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_~#t676~0.base, ULTIMATE.start_main_~#t677~0.offset, ULTIMATE.start_main_#t~ite51, ~z$r_buff1_thd0~0, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet46, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_#t~nondet44, ~z$r_buff1_thd3~0, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 05:56:46,958 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] L4-->L746: Formula: (and (= v_~z$r_buff0_thd0~0_16 v_~z$r_buff1_thd0~0_11) (= v_~z$r_buff0_thd3~0_48 v_~z$r_buff1_thd3~0_33) (= v_~z$r_buff0_thd2~0_15 v_~z$r_buff1_thd2~0_11) (= v_~z$r_buff0_thd1~0_18 1) (not (= 0 v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_6)) (= v_~__unbuffered_p0_EAX~0_6 v_~x~0_5) (= v_~z$r_buff0_thd1~0_19 v_~z$r_buff1_thd1~0_11)) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_16, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_48, P0Thread1of1ForFork1___VERIFIER_assert_~expression=v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_6, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_19, ~x~0=v_~x~0_5, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_15} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_6, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_16, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_33, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_11, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_11, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_11, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_48, P0Thread1of1ForFork1___VERIFIER_assert_~expression=v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_6, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_18, ~x~0=v_~x~0_5, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_15} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 05:56:46,958 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [859] [859] L825-1-->L827: Formula: (and (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t676~0.base_11| 4) |v_#length_15|) (= 0 (select |v_#valid_32| |v_ULTIMATE.start_main_~#t676~0.base_11|)) (not (= 0 |v_ULTIMATE.start_main_~#t676~0.base_11|)) (= 0 |v_ULTIMATE.start_main_~#t676~0.offset_10|) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t676~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t676~0.base_11|) |v_ULTIMATE.start_main_~#t676~0.offset_10| 1)) |v_#memory_int_13|) (= |v_#valid_31| (store |v_#valid_32| |v_ULTIMATE.start_main_~#t676~0.base_11| 1)) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t676~0.base_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_4|, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_13|, #length=|v_#length_15|, ULTIMATE.start_main_~#t676~0.offset=|v_ULTIMATE.start_main_~#t676~0.offset_10|, ULTIMATE.start_main_~#t676~0.base=|v_ULTIMATE.start_main_~#t676~0.base_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, #length, ULTIMATE.start_main_~#t676~0.offset, ULTIMATE.start_main_~#t676~0.base] because there is no mapped edge [2019-12-27 05:56:46,961 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [855] [855] L827-1-->L829: Formula: (and (not (= |v_ULTIMATE.start_main_~#t677~0.base_12| 0)) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t677~0.base_12|) (= (select |v_#valid_30| |v_ULTIMATE.start_main_~#t677~0.base_12|) 0) (= 0 |v_ULTIMATE.start_main_~#t677~0.offset_10|) (= (store |v_#valid_30| |v_ULTIMATE.start_main_~#t677~0.base_12| 1) |v_#valid_29|) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t677~0.base_12| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t677~0.base_12|) |v_ULTIMATE.start_main_~#t677~0.offset_10| 2)) |v_#memory_int_11|) (= (store |v_#length_14| |v_ULTIMATE.start_main_~#t677~0.base_12| 4) |v_#length_13|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_30|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_~#t677~0.offset=|v_ULTIMATE.start_main_~#t677~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_~#t677~0.base=|v_ULTIMATE.start_main_~#t677~0.base_12|, #valid=|v_#valid_29|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_5|, #memory_int=|v_#memory_int_11|, #length=|v_#length_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t677~0.offset, ULTIMATE.start_main_~#t677~0.base, #valid, ULTIMATE.start_main_#t~nondet45, #memory_int, #length] because there is no mapped edge [2019-12-27 05:56:46,963 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [843] [843] L766-2-->L766-5: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff1_used~0_In2139381170 256))) (.cse0 (= |P1Thread1of1ForFork2_#t~ite9_Out2139381170| |P1Thread1of1ForFork2_#t~ite10_Out2139381170|)) (.cse1 (= (mod ~z$r_buff1_thd2~0_In2139381170 256) 0))) (or (and .cse0 (= |P1Thread1of1ForFork2_#t~ite9_Out2139381170| ~z~0_In2139381170) (or .cse1 .cse2)) (and (not .cse2) .cse0 (= |P1Thread1of1ForFork2_#t~ite9_Out2139381170| ~z$w_buff1~0_In2139381170) (not .cse1)))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In2139381170, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2139381170, ~z$w_buff1~0=~z$w_buff1~0_In2139381170, ~z~0=~z~0_In2139381170} OutVars{P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out2139381170|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In2139381170, P1Thread1of1ForFork2_#t~ite10=|P1Thread1of1ForFork2_#t~ite10_Out2139381170|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2139381170, ~z$w_buff1~0=~z$w_buff1~0_In2139381170, ~z~0=~z~0_In2139381170} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite10] because there is no mapped edge [2019-12-27 05:56:46,965 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [870] [870] L792-->L792-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In1525700322 256)))) (or (and (let ((.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In1525700322 256)))) (or (= (mod ~z$w_buff0_used~0_In1525700322 256) 0) (and (= 0 (mod ~z$w_buff1_used~0_In1525700322 256)) .cse0) (and (= 0 (mod ~z$r_buff1_thd3~0_In1525700322 256)) .cse0))) (= |P2Thread1of1ForFork0_#t~ite23_Out1525700322| |P2Thread1of1ForFork0_#t~ite24_Out1525700322|) .cse1 (= |P2Thread1of1ForFork0_#t~ite23_Out1525700322| ~z$w_buff1~0_In1525700322)) (and (not .cse1) (= |P2Thread1of1ForFork0_#t~ite24_Out1525700322| ~z$w_buff1~0_In1525700322) (= |P2Thread1of1ForFork0_#t~ite23_In1525700322| |P2Thread1of1ForFork0_#t~ite23_Out1525700322|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1525700322, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1525700322, P2Thread1of1ForFork0_#t~ite23=|P2Thread1of1ForFork0_#t~ite23_In1525700322|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1525700322, ~z$w_buff1~0=~z$w_buff1~0_In1525700322, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1525700322, ~weak$$choice2~0=~weak$$choice2~0_In1525700322} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1525700322, P2Thread1of1ForFork0_#t~ite23=|P2Thread1of1ForFork0_#t~ite23_Out1525700322|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1525700322, P2Thread1of1ForFork0_#t~ite24=|P2Thread1of1ForFork0_#t~ite24_Out1525700322|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1525700322, ~z$w_buff1~0=~z$w_buff1~0_In1525700322, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1525700322, ~weak$$choice2~0=~weak$$choice2~0_In1525700322} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite23, P2Thread1of1ForFork0_#t~ite24] because there is no mapped edge [2019-12-27 05:56:46,967 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [882] [882] L794-->L794-8: Formula: (let ((.cse1 (= (mod ~z$w_buff1_used~0_In-1712148126 256) 0)) (.cse4 (= (mod ~weak$$choice2~0_In-1712148126 256) 0)) (.cse2 (= (mod ~z$w_buff0_used~0_In-1712148126 256) 0)) (.cse3 (= 0 (mod ~z$r_buff1_thd3~0_In-1712148126 256))) (.cse5 (= |P2Thread1of1ForFork0_#t~ite29_Out-1712148126| |P2Thread1of1ForFork0_#t~ite30_Out-1712148126|)) (.cse0 (= (mod ~z$r_buff0_thd3~0_In-1712148126 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite28_In-1712148126| |P2Thread1of1ForFork0_#t~ite28_Out-1712148126|) (or (and (or (and .cse0 .cse1) .cse2 (and .cse0 .cse3)) .cse4 (= ~z$w_buff1_used~0_In-1712148126 |P2Thread1of1ForFork0_#t~ite29_Out-1712148126|) .cse5) (and (not .cse4) (= |P2Thread1of1ForFork0_#t~ite29_In-1712148126| |P2Thread1of1ForFork0_#t~ite29_Out-1712148126|) (= ~z$w_buff1_used~0_In-1712148126 |P2Thread1of1ForFork0_#t~ite30_Out-1712148126|)))) (let ((.cse6 (not .cse0))) (and (= |P2Thread1of1ForFork0_#t~ite29_Out-1712148126| |P2Thread1of1ForFork0_#t~ite28_Out-1712148126|) (or (not .cse1) .cse6) .cse4 (not .cse2) (or (not .cse3) .cse6) (= 0 |P2Thread1of1ForFork0_#t~ite28_Out-1712148126|) .cse5)))) InVars {P2Thread1of1ForFork0_#t~ite28=|P2Thread1of1ForFork0_#t~ite28_In-1712148126|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1712148126, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1712148126, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1712148126, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1712148126, ~weak$$choice2~0=~weak$$choice2~0_In-1712148126, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_In-1712148126|} OutVars{P2Thread1of1ForFork0_#t~ite28=|P2Thread1of1ForFork0_#t~ite28_Out-1712148126|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1712148126, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1712148126, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1712148126, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1712148126, P2Thread1of1ForFork0_#t~ite30=|P2Thread1of1ForFork0_#t~ite30_Out-1712148126|, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_Out-1712148126|, ~weak$$choice2~0=~weak$$choice2~0_In-1712148126} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite28, P2Thread1of1ForFork0_#t~ite30, P2Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-27 05:56:46,968 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [786] [786] L795-->L796: Formula: (and (= v_~z$r_buff0_thd3~0_57 v_~z$r_buff0_thd3~0_56) (not (= 0 (mod v_~weak$$choice2~0_20 256)))) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_57, ~weak$$choice2~0=v_~weak$$choice2~0_20} OutVars{P2Thread1of1ForFork0_#t~ite33=|v_P2Thread1of1ForFork0_#t~ite33_7|, P2Thread1of1ForFork0_#t~ite32=|v_P2Thread1of1ForFork0_#t~ite32_8|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_56, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_7|, ~weak$$choice2~0=v_~weak$$choice2~0_20} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite33, P2Thread1of1ForFork0_#t~ite32, ~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-27 05:56:46,969 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [795] [795] L798-->L802: Formula: (and (= v_~z~0_21 v_~z$mem_tmp~0_5) (not (= (mod v_~z$flush_delayed~0_8 256) 0)) (= 0 v_~z$flush_delayed~0_7)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~z$flush_delayed~0=v_~z$flush_delayed~0_8} OutVars{P2Thread1of1ForFork0_#t~ite37=|v_P2Thread1of1ForFork0_#t~ite37_7|, ~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~z$flush_delayed~0=v_~z$flush_delayed~0_7, ~z~0=v_~z~0_21} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite37, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-27 05:56:46,969 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [819] [819] L802-2-->L802-5: Formula: (let ((.cse1 (= |P2Thread1of1ForFork0_#t~ite38_Out-836841246| |P2Thread1of1ForFork0_#t~ite39_Out-836841246|)) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In-836841246 256))) (.cse0 (= (mod ~z$r_buff1_thd3~0_In-836841246 256) 0))) (or (and (not .cse0) .cse1 (not .cse2) (= |P2Thread1of1ForFork0_#t~ite38_Out-836841246| ~z$w_buff1~0_In-836841246)) (and (= |P2Thread1of1ForFork0_#t~ite38_Out-836841246| ~z~0_In-836841246) .cse1 (or .cse2 .cse0)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-836841246, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-836841246, ~z$w_buff1~0=~z$w_buff1~0_In-836841246, ~z~0=~z~0_In-836841246} OutVars{P2Thread1of1ForFork0_#t~ite39=|P2Thread1of1ForFork0_#t~ite39_Out-836841246|, P2Thread1of1ForFork0_#t~ite38=|P2Thread1of1ForFork0_#t~ite38_Out-836841246|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-836841246, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-836841246, ~z$w_buff1~0=~z$w_buff1~0_In-836841246, ~z~0=~z~0_In-836841246} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite39, P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-27 05:56:46,970 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [823] [823] L803-->L803-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In1522226585 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In1522226585 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite40_Out1522226585| ~z$w_buff0_used~0_In1522226585) (or .cse0 .cse1)) (and (not .cse1) (= |P2Thread1of1ForFork0_#t~ite40_Out1522226585| 0) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1522226585, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1522226585} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1522226585, P2Thread1of1ForFork0_#t~ite40=|P2Thread1of1ForFork0_#t~ite40_Out1522226585|, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1522226585} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite40] because there is no mapped edge [2019-12-27 05:56:46,971 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [818] [818] L804-->L804-2: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff0_used~0_In1135864868 256))) (.cse3 (= 0 (mod ~z$r_buff0_thd3~0_In1135864868 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd3~0_In1135864868 256))) (.cse0 (= (mod ~z$w_buff1_used~0_In1135864868 256) 0))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite41_Out1135864868| ~z$w_buff1_used~0_In1135864868) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= |P2Thread1of1ForFork0_#t~ite41_Out1135864868| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1135864868, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1135864868, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1135864868, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1135864868} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1135864868, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1135864868, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1135864868, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1135864868, P2Thread1of1ForFork0_#t~ite41=|P2Thread1of1ForFork0_#t~ite41_Out1135864868|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite41] because there is no mapped edge [2019-12-27 05:56:46,971 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L805-->L805-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-77179902 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In-77179902 256)))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork0_#t~ite42_Out-77179902| 0)) (and (= |P2Thread1of1ForFork0_#t~ite42_Out-77179902| ~z$r_buff0_thd3~0_In-77179902) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-77179902, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-77179902} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-77179902, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-77179902, P2Thread1of1ForFork0_#t~ite42=|P2Thread1of1ForFork0_#t~ite42_Out-77179902|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-27 05:56:46,972 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [835] [835] L806-->L806-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In998323406 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In998323406 256))) (.cse2 (= (mod ~z$w_buff1_used~0_In998323406 256) 0)) (.cse3 (= 0 (mod ~z$r_buff1_thd3~0_In998323406 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite43_Out998323406| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P2Thread1of1ForFork0_#t~ite43_Out998323406| ~z$r_buff1_thd3~0_In998323406) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In998323406, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In998323406, ~z$w_buff1_used~0=~z$w_buff1_used~0_In998323406, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In998323406} OutVars{P2Thread1of1ForFork0_#t~ite43=|P2Thread1of1ForFork0_#t~ite43_Out998323406|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In998323406, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In998323406, ~z$w_buff1_used~0=~z$w_buff1_used~0_In998323406, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In998323406} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite43] because there is no mapped edge [2019-12-27 05:56:46,972 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [868] [868] L806-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= v_~z$r_buff1_thd3~0_47 |v_P2Thread1of1ForFork0_#t~ite43_8|) (= (+ v_~__unbuffered_cnt~0_16 1) v_~__unbuffered_cnt~0_15) (= |v_P2Thread1of1ForFork0_#res.base_5| 0)) InVars {P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_7|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_47, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite43, ~z$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-27 05:56:46,973 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [838] [838] L747-->L747-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In862219926 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd1~0_In862219926 256) 0))) (or (and (= ~z$w_buff0_used~0_In862219926 |P0Thread1of1ForFork1_#t~ite5_Out862219926|) (or .cse0 .cse1)) (and (= 0 |P0Thread1of1ForFork1_#t~ite5_Out862219926|) (not .cse0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In862219926, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In862219926} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out862219926|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In862219926, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In862219926} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-27 05:56:46,974 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [842] [842] L748-->L748-2: Formula: (let ((.cse1 (= (mod ~z$w_buff1_used~0_In1147618263 256) 0)) (.cse0 (= 0 (mod ~z$r_buff1_thd1~0_In1147618263 256))) (.cse2 (= (mod ~z$r_buff0_thd1~0_In1147618263 256) 0)) (.cse3 (= (mod ~z$w_buff0_used~0_In1147618263 256) 0))) (or (and (= 0 |P0Thread1of1ForFork1_#t~ite6_Out1147618263|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse2 .cse3) (= ~z$w_buff1_used~0_In1147618263 |P0Thread1of1ForFork1_#t~ite6_Out1147618263|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1147618263, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1147618263, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1147618263, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1147618263} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1147618263, P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out1147618263|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1147618263, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1147618263, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1147618263} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-27 05:56:46,974 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [824] [824] L749-->L750: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1468621749 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd1~0_In-1468621749 256)))) (or (and (= ~z$r_buff0_thd1~0_In-1468621749 ~z$r_buff0_thd1~0_Out-1468621749) (or .cse0 .cse1)) (and (not .cse0) (= ~z$r_buff0_thd1~0_Out-1468621749 0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1468621749, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1468621749} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1468621749, P0Thread1of1ForFork1_#t~ite7=|P0Thread1of1ForFork1_#t~ite7_Out-1468621749|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out-1468621749} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 05:56:46,975 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [826] [826] L750-->L750-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1405764287 256))) (.cse1 (= (mod ~z$r_buff0_thd1~0_In-1405764287 256) 0)) (.cse2 (= 0 (mod ~z$r_buff1_thd1~0_In-1405764287 256))) (.cse3 (= (mod ~z$w_buff1_used~0_In-1405764287 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P0Thread1of1ForFork1_#t~ite8_Out-1405764287| ~z$r_buff1_thd1~0_In-1405764287)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork1_#t~ite8_Out-1405764287| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1405764287, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1405764287, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1405764287, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1405764287} OutVars{P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out-1405764287|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1405764287, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1405764287, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1405764287, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1405764287} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-27 05:56:46,975 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [852] [852] L750-2-->P0EXIT: Formula: (and (= v_~z$r_buff1_thd1~0_13 |v_P0Thread1of1ForFork1_#t~ite8_8|) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= (+ v_~__unbuffered_cnt~0_12 1) v_~__unbuffered_cnt~0_11) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12} OutVars{P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_7|, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_13, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8, P0Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd1~0, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-27 05:56:46,975 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L767-->L767-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-1487841888 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd2~0_In-1487841888 256) 0))) (or (and (= |P1Thread1of1ForFork2_#t~ite11_Out-1487841888| 0) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork2_#t~ite11_Out-1487841888| ~z$w_buff0_used~0_In-1487841888)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1487841888, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1487841888} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1487841888, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out-1487841888|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1487841888} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-27 05:56:46,976 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L768-->L768-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In-2084584228 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In-2084584228 256) 0)) (.cse2 (= (mod ~z$r_buff1_thd2~0_In-2084584228 256) 0)) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In-2084584228 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork2_#t~ite12_Out-2084584228| ~z$w_buff1_used~0_In-2084584228)) (and (= |P1Thread1of1ForFork2_#t~ite12_Out-2084584228| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-2084584228, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-2084584228, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2084584228, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-2084584228} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-2084584228, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-2084584228, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2084584228, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out-2084584228|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-2084584228} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-27 05:56:46,976 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L769-->L769-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In1325484193 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In1325484193 256)))) (or (and (= ~z$r_buff0_thd2~0_In1325484193 |P1Thread1of1ForFork2_#t~ite13_Out1325484193|) (or .cse0 .cse1)) (and (not .cse0) (= 0 |P1Thread1of1ForFork2_#t~ite13_Out1325484193|) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1325484193, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1325484193} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1325484193, P1Thread1of1ForFork2_#t~ite13=|P1Thread1of1ForFork2_#t~ite13_Out1325484193|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1325484193} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite13] because there is no mapped edge [2019-12-27 05:56:46,977 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] L770-->L770-2: Formula: (let ((.cse3 (= 0 (mod ~z$r_buff1_thd2~0_In-2134891904 256))) (.cse2 (= (mod ~z$w_buff1_used~0_In-2134891904 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-2134891904 256))) (.cse0 (= (mod ~z$r_buff0_thd2~0_In-2134891904 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork2_#t~ite14_Out-2134891904|)) (and (or .cse3 .cse2) (= ~z$r_buff1_thd2~0_In-2134891904 |P1Thread1of1ForFork2_#t~ite14_Out-2134891904|) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-2134891904, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-2134891904, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2134891904, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-2134891904} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-2134891904, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-2134891904, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2134891904, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out-2134891904|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-2134891904} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-27 05:56:46,977 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [866] [866] L770-2-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork2_#t~ite14_8| v_~z$r_buff1_thd2~0_15) (= v_~__unbuffered_cnt~0_13 (+ v_~__unbuffered_cnt~0_14 1)) (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_8|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_15, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_7|, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-27 05:56:46,977 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L829-1-->L835: Formula: (and (= 3 v_~__unbuffered_cnt~0_10) (= v_~main$tmp_guard0~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 05:56:46,978 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L835-2-->L835-4: Formula: (let ((.cse1 (= (mod ~z$r_buff1_thd0~0_In1224493589 256) 0)) (.cse0 (= (mod ~z$w_buff1_used~0_In1224493589 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite47_Out1224493589| ~z$w_buff1~0_In1224493589) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~z~0_In1224493589 |ULTIMATE.start_main_#t~ite47_Out1224493589|)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1224493589, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1224493589, ~z$w_buff1~0=~z$w_buff1~0_In1224493589, ~z~0=~z~0_In1224493589} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1224493589, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out1224493589|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1224493589, ~z$w_buff1~0=~z$w_buff1~0_In1224493589, ~z~0=~z~0_In1224493589} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47] because there is no mapped edge [2019-12-27 05:56:46,978 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L835-4-->L836: Formula: (= v_~z~0_20 |v_ULTIMATE.start_main_#t~ite47_7|) InVars {ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_7|} OutVars{ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_6|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_6|, ~z~0=v_~z~0_20} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48, ~z~0] because there is no mapped edge [2019-12-27 05:56:46,978 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [830] [830] L836-->L836-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In1486685777 256))) (.cse1 (= (mod ~z$r_buff0_thd0~0_In1486685777 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite49_Out1486685777| ~z$w_buff0_used~0_In1486685777)) (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite49_Out1486685777| 0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1486685777, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1486685777} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1486685777, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1486685777, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out1486685777|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-27 05:56:46,979 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [817] [817] L837-->L837-2: Formula: (let ((.cse1 (= (mod ~z$r_buff1_thd0~0_In1788516199 256) 0)) (.cse0 (= (mod ~z$w_buff1_used~0_In1788516199 256) 0)) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In1788516199 256))) (.cse2 (= 0 (mod ~z$r_buff0_thd0~0_In1788516199 256)))) (or (and (= ~z$w_buff1_used~0_In1788516199 |ULTIMATE.start_main_#t~ite50_Out1788516199|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= 0 |ULTIMATE.start_main_#t~ite50_Out1788516199|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1788516199, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1788516199, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1788516199, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1788516199} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out1788516199|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1788516199, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1788516199, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1788516199, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1788516199} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-27 05:56:46,980 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L838-->L838-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd0~0_In2005172558 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In2005172558 256) 0))) (or (and (or .cse0 .cse1) (= ~z$r_buff0_thd0~0_In2005172558 |ULTIMATE.start_main_#t~ite51_Out2005172558|)) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite51_Out2005172558| 0) (not .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2005172558, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2005172558} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2005172558, ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out2005172558|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2005172558} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-27 05:56:46,981 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L839-->L839-2: Formula: (let ((.cse3 (= (mod ~z$r_buff0_thd0~0_In-1473043913 256) 0)) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In-1473043913 256))) (.cse0 (= (mod ~z$r_buff1_thd0~0_In-1473043913 256) 0)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In-1473043913 256)))) (or (and (= |ULTIMATE.start_main_#t~ite52_Out-1473043913| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite52_Out-1473043913| ~z$r_buff1_thd0~0_In-1473043913)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1473043913, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1473043913, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1473043913, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1473043913} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out-1473043913|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1473043913, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1473043913, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1473043913, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1473043913} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-27 05:56:46,981 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [875] [875] L839-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~__unbuffered_p2_EAX~0_7 2) (= v_~__unbuffered_p0_EAX~0_9 0) (= |v_ULTIMATE.start_main_#t~ite52_10| v_~z$r_buff1_thd0~0_16) (= v_~__unbuffered_p2_EBX~0_9 0) (= 2 v_~y~0_8) (= v_~main$tmp_guard1~0_6 0) (= (mod v_~main$tmp_guard1~0_6 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_9, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_10|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_9, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_7, ~y~0=v_~y~0_8} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_9, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_9|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_12, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_9, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_16, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_6, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_7, ~y~0=v_~y~0_8, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 05:56:47,077 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 05:56:47 BasicIcfg [2019-12-27 05:56:47,077 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 05:56:47,079 INFO L168 Benchmark]: Toolchain (without parser) took 146772.72 ms. Allocated memory was 143.7 MB in the beginning and 3.1 GB in the end (delta: 3.0 GB). Free memory was 98.3 MB in the beginning and 1.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 1.7 GB. Max. memory is 7.1 GB. [2019-12-27 05:56:47,079 INFO L168 Benchmark]: CDTParser took 0.45 ms. Allocated memory is still 143.7 MB. Free memory was 118.7 MB in the beginning and 118.5 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2019-12-27 05:56:47,080 INFO L168 Benchmark]: CACSL2BoogieTranslator took 760.86 ms. Allocated memory was 143.7 MB in the beginning and 201.3 MB in the end (delta: 57.7 MB). Free memory was 98.1 MB in the beginning and 154.7 MB in the end (delta: -56.6 MB). Peak memory consumption was 20.8 MB. Max. memory is 7.1 GB. [2019-12-27 05:56:47,080 INFO L168 Benchmark]: Boogie Procedure Inliner took 61.73 ms. Allocated memory is still 201.3 MB. Free memory was 154.7 MB in the beginning and 152.0 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-27 05:56:47,080 INFO L168 Benchmark]: Boogie Preprocessor took 40.78 ms. Allocated memory is still 201.3 MB. Free memory was 152.0 MB in the beginning and 149.2 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-27 05:56:47,081 INFO L168 Benchmark]: RCFGBuilder took 822.28 ms. Allocated memory is still 201.3 MB. Free memory was 149.2 MB in the beginning and 99.1 MB in the end (delta: 50.1 MB). Peak memory consumption was 50.1 MB. Max. memory is 7.1 GB. [2019-12-27 05:56:47,081 INFO L168 Benchmark]: TraceAbstraction took 145077.35 ms. Allocated memory was 201.3 MB in the beginning and 3.1 GB in the end (delta: 2.9 GB). Free memory was 98.4 MB in the beginning and 1.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. [2019-12-27 05:56:47,083 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.45 ms. Allocated memory is still 143.7 MB. Free memory was 118.7 MB in the beginning and 118.5 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 760.86 ms. Allocated memory was 143.7 MB in the beginning and 201.3 MB in the end (delta: 57.7 MB). Free memory was 98.1 MB in the beginning and 154.7 MB in the end (delta: -56.6 MB). Peak memory consumption was 20.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 61.73 ms. Allocated memory is still 201.3 MB. Free memory was 154.7 MB in the beginning and 152.0 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 40.78 ms. Allocated memory is still 201.3 MB. Free memory was 152.0 MB in the beginning and 149.2 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 822.28 ms. Allocated memory is still 201.3 MB. Free memory was 149.2 MB in the beginning and 99.1 MB in the end (delta: 50.1 MB). Peak memory consumption was 50.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 145077.35 ms. Allocated memory was 201.3 MB in the beginning and 3.1 GB in the end (delta: 2.9 GB). Free memory was 98.4 MB in the beginning and 1.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.9s, 176 ProgramPointsBefore, 94 ProgramPointsAfterwards, 213 TransitionsBefore, 104 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 7 FixpointIterations, 33 TrivialSequentialCompositions, 46 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 33 ConcurrentYvCompositions, 31 ChoiceCompositions, 6462 VarBasedMoverChecksPositive, 197 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 84223 CheckedPairsTotal, 112 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L825] FCALL, FORK 0 pthread_create(&t675, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L731] 1 z$w_buff1 = z$w_buff0 [L732] 1 z$w_buff0 = 1 [L733] 1 z$w_buff1_used = z$w_buff0_used [L734] 1 z$w_buff0_used = (_Bool)1 [L746] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L827] FCALL, FORK 0 pthread_create(&t676, ((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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L760] 2 x = 1 [L763] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L766] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_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=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L829] FCALL, FORK 0 pthread_create(&t677, ((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}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L780] 3 y = 2 [L783] 3 __unbuffered_p2_EAX = y [L786] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L787] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L788] 3 z$flush_delayed = weak$$choice2 [L789] 3 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __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=7, weak$$choice2=1, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L790] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __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=7, weak$$choice2=1, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L790] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L766] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L791] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __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=7, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0))=1, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L791] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L792] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L793] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __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=7, weak$$choice2=1, weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used))=1, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L793] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L794] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L796] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __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=7, weak$$choice2=1, weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L796] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L797] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __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=7, weak$$choice2=1, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L802] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __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=7, weak$$choice2=1, x=1, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L802] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L803] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L804] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L805] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L746] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L747] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L748] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L767] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L768] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L769] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L835] 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __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=7, weak$$choice2=1, x=1, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L836] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L837] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L838] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 167 locations, 2 error locations. Result: UNSAFE, OverallTime: 144.7s, OverallIterations: 46, TraceHistogramMax: 1, AutomataDifference: 59.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 11001 SDtfs, 13486 SDslu, 39771 SDs, 0 SdLazy, 31945 SolverSat, 654 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 27.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 684 GetRequests, 92 SyntacticMatches, 51 SemanticMatches, 541 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2094 ImplicationChecksByTransitivity, 10.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=162546occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 48.5s AutomataMinimizationTime, 45 MinimizatonAttempts, 374971 StatesRemovedByMinimization, 42 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 6.7s InterpolantComputationTime, 2138 NumberOfCodeBlocks, 2138 NumberOfCodeBlocksAsserted, 46 NumberOfCheckSat, 2026 ConstructedInterpolants, 0 QuantifiedInterpolants, 645811 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 45 InterpolantComputations, 45 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...