/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_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 20:48:47,889 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 20:48:47,892 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 20:48:47,912 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 20:48:47,912 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 20:48:47,914 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 20:48:47,916 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 20:48:47,926 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 20:48:47,930 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 20:48:47,932 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 20:48:47,933 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 20:48:47,934 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 20:48:47,935 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 20:48:47,935 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 20:48:47,936 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 20:48:47,937 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 20:48:47,938 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 20:48:47,938 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 20:48:47,940 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 20:48:47,942 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 20:48:47,943 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 20:48:47,944 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 20:48:47,945 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 20:48:47,946 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 20:48:47,948 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 20:48:47,948 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 20:48:47,948 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 20:48:47,949 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 20:48:47,949 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 20:48:47,950 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 20:48:47,951 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 20:48:47,951 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 20:48:47,952 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 20:48:47,953 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 20:48:47,954 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 20:48:47,954 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 20:48:47,955 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 20:48:47,955 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 20:48:47,955 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 20:48:47,956 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 20:48:47,957 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 20:48:47,958 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf [2019-12-18 20:48:47,971 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 20:48:47,972 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 20:48:47,973 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 20:48:47,973 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 20:48:47,973 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 20:48:47,973 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 20:48:47,974 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 20:48:47,974 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 20:48:47,974 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 20:48:47,974 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 20:48:47,974 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 20:48:47,975 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 20:48:47,975 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 20:48:47,975 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 20:48:47,975 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 20:48:47,975 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 20:48:47,976 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 20:48:47,976 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 20:48:47,976 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 20:48:47,976 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 20:48:47,976 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 20:48:47,977 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 20:48:47,977 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 20:48:47,977 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 20:48:47,977 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 20:48:47,977 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 20:48:47,978 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 20:48:47,978 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-18 20:48:47,978 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 20:48:47,978 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 20:48:48,263 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 20:48:48,278 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 20:48:48,283 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 20:48:48,284 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 20:48:48,284 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 20:48:48,285 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix025_power.opt.i [2019-12-18 20:48:48,349 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e83cef80a/b95aed7ac1a945d2907829d4556d67ad/FLAG56bff48ff [2019-12-18 20:48:48,866 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 20:48:48,867 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix025_power.opt.i [2019-12-18 20:48:48,883 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e83cef80a/b95aed7ac1a945d2907829d4556d67ad/FLAG56bff48ff [2019-12-18 20:48:49,183 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e83cef80a/b95aed7ac1a945d2907829d4556d67ad [2019-12-18 20:48:49,191 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 20:48:49,193 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 20:48:49,194 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 20:48:49,194 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 20:48:49,198 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 20:48:49,199 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 08:48:49" (1/1) ... [2019-12-18 20:48:49,202 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7eef5ab9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:48:49, skipping insertion in model container [2019-12-18 20:48:49,202 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 08:48:49" (1/1) ... [2019-12-18 20:48:49,210 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 20:48:49,269 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 20:48:49,781 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 20:48:49,794 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 20:48:49,873 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 20:48:49,951 INFO L208 MainTranslator]: Completed translation [2019-12-18 20:48:49,952 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:48:49 WrapperNode [2019-12-18 20:48:49,952 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 20:48:49,953 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 20:48:49,953 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 20:48:49,953 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 20:48:49,962 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:48:49" (1/1) ... [2019-12-18 20:48:49,993 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:48:49" (1/1) ... [2019-12-18 20:48:50,026 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 20:48:50,027 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 20:48:50,027 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 20:48:50,027 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 20:48:50,037 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:48:49" (1/1) ... [2019-12-18 20:48:50,037 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:48:49" (1/1) ... [2019-12-18 20:48:50,042 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:48:49" (1/1) ... [2019-12-18 20:48:50,042 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:48:49" (1/1) ... [2019-12-18 20:48:50,053 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:48:49" (1/1) ... [2019-12-18 20:48:50,057 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:48:49" (1/1) ... [2019-12-18 20:48:50,060 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:48:49" (1/1) ... [2019-12-18 20:48:50,065 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 20:48:50,066 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 20:48:50,066 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 20:48:50,066 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 20:48:50,067 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:48:49" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 20:48:50,128 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 20:48:50,129 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 20:48:50,130 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 20:48:50,130 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 20:48:50,130 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 20:48:50,131 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 20:48:50,131 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 20:48:50,132 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 20:48:50,132 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 20:48:50,133 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 20:48:50,134 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 20:48:50,134 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 20:48:50,134 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 20:48:50,136 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 20:48:50,912 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 20:48:50,912 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 20:48:50,914 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 08:48:50 BoogieIcfgContainer [2019-12-18 20:48:50,914 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 20:48:50,916 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 20:48:50,916 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 20:48:50,919 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 20:48:50,919 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 08:48:49" (1/3) ... [2019-12-18 20:48:50,920 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@552b5b4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 08:48:50, skipping insertion in model container [2019-12-18 20:48:50,921 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:48:49" (2/3) ... [2019-12-18 20:48:50,921 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@552b5b4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 08:48:50, skipping insertion in model container [2019-12-18 20:48:50,921 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 08:48:50" (3/3) ... [2019-12-18 20:48:50,923 INFO L109 eAbstractionObserver]: Analyzing ICFG mix025_power.opt.i [2019-12-18 20:48:50,932 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 20:48:50,933 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 20:48:50,939 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 20:48:50,940 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 20:48:50,981 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:50,981 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:50,981 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:50,982 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:50,982 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:50,982 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:50,982 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:50,983 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:50,983 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:50,984 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:50,984 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:50,984 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:50,984 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:50,985 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:50,985 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:50,985 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:50,985 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:50,986 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:50,986 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:50,986 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:50,986 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:50,987 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:50,987 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:50,987 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:50,988 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:50,988 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:50,988 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:50,988 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:50,989 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:50,989 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:50,989 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:50,989 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:50,990 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:50,990 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:50,991 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:50,991 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:51,005 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:51,005 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:51,007 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:51,007 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:51,007 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:51,007 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:51,007 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:51,008 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:51,008 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:51,008 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:51,008 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:51,009 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:51,009 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:51,009 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:51,009 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:51,009 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:51,010 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:51,010 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:51,010 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:51,010 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:51,011 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:51,011 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:51,011 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:51,011 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:51,012 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:51,012 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:51,012 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:51,012 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:51,013 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:51,013 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:51,014 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:51,014 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:51,014 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:51,014 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:51,014 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:51,014 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:51,015 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:51,015 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:51,015 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:51,015 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:51,016 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:51,016 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:51,016 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:51,016 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:51,017 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:51,017 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:51,017 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:51,017 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:51,017 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:51,018 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:51,018 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:51,018 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:51,018 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:51,019 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:51,019 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:51,019 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:51,019 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:51,019 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:51,020 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:51,020 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:51,020 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:51,020 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:51,020 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:51,021 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:51,021 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:51,021 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:51,021 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:51,021 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:51,022 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:51,022 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:51,022 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:51,022 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:51,022 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:51,023 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:51,023 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:51,023 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:51,023 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:51,024 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:51,024 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:51,024 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:51,024 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:51,024 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:51,025 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:51,025 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:51,025 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:51,025 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:51,025 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:51,026 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:51,026 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:51,026 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:51,026 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:51,027 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:51,027 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:51,027 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:51,027 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:51,027 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:51,027 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:51,028 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:51,028 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:51,028 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:51,028 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:51,029 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:51,029 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:51,029 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:51,029 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:51,029 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:51,030 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:51,030 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:51,030 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:51,030 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:51,031 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:51,031 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:51,031 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:51,031 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:51,031 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:51,032 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:51,032 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:51,032 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:51,032 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:51,032 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:51,032 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:51,033 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:51,033 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:51,033 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:51,033 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:51,033 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:51,034 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:51,034 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:51,034 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:51,034 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:51,034 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:51,035 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:51,035 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:51,035 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:51,035 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:51,035 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:51,036 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:51,036 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:51,036 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:51,036 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:51,036 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:51,037 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:51,037 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:51,037 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:51,037 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:51,037 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:51,041 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:51,041 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:51,041 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:51,041 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:51,042 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:51,042 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:51,042 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:51,042 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:51,042 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:51,043 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:51,043 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:51,043 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:51,043 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:51,043 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:51,044 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:51,044 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:51,044 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:51,044 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:51,044 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:51,045 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:51,045 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:51,045 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:51,045 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:51,045 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:51,045 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:51,046 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:51,046 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:51,046 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:51,046 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:51,046 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:51,047 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:51,047 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:51,047 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:51,050 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:51,050 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:51,050 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:51,051 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:51,051 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:51,051 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:51,051 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:51,051 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:51,052 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:51,052 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:51,052 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:51,052 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:51,054 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:51,054 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:51,054 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:51,055 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:51,055 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:51,055 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:51,055 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:51,055 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:51,056 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:51,056 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:48:51,070 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 20:48:51,089 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 20:48:51,090 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 20:48:51,090 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 20:48:51,090 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 20:48:51,090 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 20:48:51,090 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 20:48:51,090 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 20:48:51,091 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 20:48:51,108 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 176 places, 213 transitions [2019-12-18 20:48:51,110 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 176 places, 213 transitions [2019-12-18 20:48:51,201 INFO L126 PetriNetUnfolder]: 47/210 cut-off events. [2019-12-18 20:48:51,201 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 20:48:51,225 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. 9/170 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 20:48:51,252 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 176 places, 213 transitions [2019-12-18 20:48:51,313 INFO L126 PetriNetUnfolder]: 47/210 cut-off events. [2019-12-18 20:48:51,313 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 20:48:51,327 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. 9/170 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 20:48:51,353 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-18 20:48:51,354 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-18 20:48:54,812 WARN L192 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 89 [2019-12-18 20:48:54,986 WARN L192 SmtUtils]: Spent 169.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-12-18 20:48:55,008 INFO L206 etLargeBlockEncoding]: Checked pairs total: 84223 [2019-12-18 20:48:55,008 INFO L214 etLargeBlockEncoding]: Total number of compositions: 112 [2019-12-18 20:48:55,012 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 94 places, 104 transitions [2019-12-18 20:49:15,224 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 122130 states. [2019-12-18 20:49:15,226 INFO L276 IsEmpty]: Start isEmpty. Operand 122130 states. [2019-12-18 20:49:15,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-18 20:49:15,231 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:49:15,232 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-18 20:49:15,232 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-18 20:49:15,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:49:15,239 INFO L82 PathProgramCache]: Analyzing trace with hash 912016, now seen corresponding path program 1 times [2019-12-18 20:49:15,246 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:49:15,246 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987316074] [2019-12-18 20:49:15,246 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:49:15,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:49:15,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:49:15,472 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987316074] [2019-12-18 20:49:15,472 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:49:15,473 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 20:49:15,473 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923103472] [2019-12-18 20:49:15,480 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:49:15,480 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:49:15,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:49:15,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:49:15,498 INFO L87 Difference]: Start difference. First operand 122130 states. Second operand 3 states. [2019-12-18 20:49:19,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:49:19,094 INFO L93 Difference]: Finished difference Result 120482 states and 514480 transitions. [2019-12-18 20:49:19,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:49:19,095 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-18 20:49:19,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:49:19,769 INFO L225 Difference]: With dead ends: 120482 [2019-12-18 20:49:19,769 INFO L226 Difference]: Without dead ends: 113384 [2019-12-18 20:49:19,770 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:49:24,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113384 states. [2019-12-18 20:49:26,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113384 to 113384. [2019-12-18 20:49:26,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113384 states. [2019-12-18 20:49:31,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113384 states to 113384 states and 483579 transitions. [2019-12-18 20:49:31,988 INFO L78 Accepts]: Start accepts. Automaton has 113384 states and 483579 transitions. Word has length 3 [2019-12-18 20:49:31,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:49:31,988 INFO L462 AbstractCegarLoop]: Abstraction has 113384 states and 483579 transitions. [2019-12-18 20:49:31,988 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:49:31,988 INFO L276 IsEmpty]: Start isEmpty. Operand 113384 states and 483579 transitions. [2019-12-18 20:49:31,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 20:49:31,992 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:49:31,993 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:49:31,993 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-18 20:49:31,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:49:31,993 INFO L82 PathProgramCache]: Analyzing trace with hash -1106167815, now seen corresponding path program 1 times [2019-12-18 20:49:31,994 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:49:31,994 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121876908] [2019-12-18 20:49:31,994 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:49:32,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:49:32,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:49:32,149 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121876908] [2019-12-18 20:49:32,150 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:49:32,150 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 20:49:32,150 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381404295] [2019-12-18 20:49:32,152 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 20:49:32,152 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:49:32,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 20:49:32,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 20:49:32,153 INFO L87 Difference]: Start difference. First operand 113384 states and 483579 transitions. Second operand 4 states. [2019-12-18 20:49:33,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:49:33,415 INFO L93 Difference]: Finished difference Result 179498 states and 731972 transitions. [2019-12-18 20:49:33,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 20:49:33,415 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 20:49:33,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:49:39,681 INFO L225 Difference]: With dead ends: 179498 [2019-12-18 20:49:39,682 INFO L226 Difference]: Without dead ends: 179449 [2019-12-18 20:49:39,683 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 20:49:44,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179449 states. [2019-12-18 20:49:48,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179449 to 162546. [2019-12-18 20:49:48,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162546 states. [2019-12-18 20:49:48,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162546 states to 162546 states and 672884 transitions. [2019-12-18 20:49:48,954 INFO L78 Accepts]: Start accepts. Automaton has 162546 states and 672884 transitions. Word has length 11 [2019-12-18 20:49:48,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:49:48,955 INFO L462 AbstractCegarLoop]: Abstraction has 162546 states and 672884 transitions. [2019-12-18 20:49:48,955 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 20:49:48,955 INFO L276 IsEmpty]: Start isEmpty. Operand 162546 states and 672884 transitions. [2019-12-18 20:49:48,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 20:49:48,962 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:49:48,962 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:49:48,962 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-18 20:49:48,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:49:48,963 INFO L82 PathProgramCache]: Analyzing trace with hash 490332773, now seen corresponding path program 1 times [2019-12-18 20:49:48,963 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:49:48,963 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867459131] [2019-12-18 20:49:48,963 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:49:48,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:49:49,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:49:49,017 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867459131] [2019-12-18 20:49:49,017 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:49:49,017 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 20:49:49,017 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014909073] [2019-12-18 20:49:49,018 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:49:49,018 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:49:49,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:49:49,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:49:49,018 INFO L87 Difference]: Start difference. First operand 162546 states and 672884 transitions. Second operand 3 states. [2019-12-18 20:49:53,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:49:53,999 INFO L93 Difference]: Finished difference Result 34413 states and 111772 transitions. [2019-12-18 20:49:53,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:49:53,999 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-18 20:49:54,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:49:54,060 INFO L225 Difference]: With dead ends: 34413 [2019-12-18 20:49:54,060 INFO L226 Difference]: Without dead ends: 34413 [2019-12-18 20:49:54,061 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:49:54,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34413 states. [2019-12-18 20:49:54,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34413 to 34413. [2019-12-18 20:49:54,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34413 states. [2019-12-18 20:49:54,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34413 states to 34413 states and 111772 transitions. [2019-12-18 20:49:54,817 INFO L78 Accepts]: Start accepts. Automaton has 34413 states and 111772 transitions. Word has length 13 [2019-12-18 20:49:54,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:49:54,817 INFO L462 AbstractCegarLoop]: Abstraction has 34413 states and 111772 transitions. [2019-12-18 20:49:54,818 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:49:54,818 INFO L276 IsEmpty]: Start isEmpty. Operand 34413 states and 111772 transitions. [2019-12-18 20:49:54,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 20:49:54,820 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:49:54,821 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:49:54,821 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-18 20:49:54,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:49:54,821 INFO L82 PathProgramCache]: Analyzing trace with hash 562012763, now seen corresponding path program 1 times [2019-12-18 20:49:54,821 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:49:54,821 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091569872] [2019-12-18 20:49:54,822 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:49:54,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:49:54,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:49:54,889 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091569872] [2019-12-18 20:49:54,889 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:49:54,889 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 20:49:54,889 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335602943] [2019-12-18 20:49:54,890 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:49:54,890 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:49:54,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:49:54,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:49:54,891 INFO L87 Difference]: Start difference. First operand 34413 states and 111772 transitions. Second operand 3 states. [2019-12-18 20:49:55,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:49:55,120 INFO L93 Difference]: Finished difference Result 54627 states and 176362 transitions. [2019-12-18 20:49:55,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:49:55,121 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-18 20:49:55,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:49:55,214 INFO L225 Difference]: With dead ends: 54627 [2019-12-18 20:49:55,214 INFO L226 Difference]: Without dead ends: 54627 [2019-12-18 20:49:55,214 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:49:55,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54627 states. [2019-12-18 20:49:56,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54627 to 41131. [2019-12-18 20:49:56,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41131 states. [2019-12-18 20:49:56,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41131 states to 41131 states and 134258 transitions. [2019-12-18 20:49:56,429 INFO L78 Accepts]: Start accepts. Automaton has 41131 states and 134258 transitions. Word has length 16 [2019-12-18 20:49:56,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:49:56,430 INFO L462 AbstractCegarLoop]: Abstraction has 41131 states and 134258 transitions. [2019-12-18 20:49:56,430 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:49:56,430 INFO L276 IsEmpty]: Start isEmpty. Operand 41131 states and 134258 transitions. [2019-12-18 20:49:56,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 20:49:56,433 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:49:56,433 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:49:56,433 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-18 20:49:56,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:49:56,434 INFO L82 PathProgramCache]: Analyzing trace with hash 562138282, now seen corresponding path program 1 times [2019-12-18 20:49:56,434 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:49:56,434 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668841946] [2019-12-18 20:49:56,434 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:49:56,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:49:56,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:49:56,523 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668841946] [2019-12-18 20:49:56,523 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:49:56,523 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 20:49:56,523 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109741374] [2019-12-18 20:49:56,524 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 20:49:56,524 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:49:56,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 20:49:56,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 20:49:56,524 INFO L87 Difference]: Start difference. First operand 41131 states and 134258 transitions. Second operand 4 states. [2019-12-18 20:49:56,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:49:56,973 INFO L93 Difference]: Finished difference Result 48927 states and 157520 transitions. [2019-12-18 20:49:56,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 20:49:56,974 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-18 20:49:56,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:49:57,061 INFO L225 Difference]: With dead ends: 48927 [2019-12-18 20:49:57,062 INFO L226 Difference]: Without dead ends: 48927 [2019-12-18 20:49:57,062 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 20:49:57,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48927 states. [2019-12-18 20:49:57,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48927 to 44953. [2019-12-18 20:49:57,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44953 states. [2019-12-18 20:49:57,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44953 states to 44953 states and 145741 transitions. [2019-12-18 20:49:57,883 INFO L78 Accepts]: Start accepts. Automaton has 44953 states and 145741 transitions. Word has length 16 [2019-12-18 20:49:57,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:49:57,884 INFO L462 AbstractCegarLoop]: Abstraction has 44953 states and 145741 transitions. [2019-12-18 20:49:57,884 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 20:49:57,884 INFO L276 IsEmpty]: Start isEmpty. Operand 44953 states and 145741 transitions. [2019-12-18 20:49:57,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 20:49:57,887 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:49:57,887 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:49:57,888 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-18 20:49:57,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:49:57,888 INFO L82 PathProgramCache]: Analyzing trace with hash 173692215, now seen corresponding path program 1 times [2019-12-18 20:49:57,888 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:49:57,888 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955264471] [2019-12-18 20:49:57,889 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:49:57,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:49:58,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:49:58,006 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955264471] [2019-12-18 20:49:58,006 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:49:58,006 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 20:49:58,007 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581089143] [2019-12-18 20:49:58,007 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 20:49:58,007 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:49:58,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 20:49:58,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 20:49:58,009 INFO L87 Difference]: Start difference. First operand 44953 states and 145741 transitions. Second operand 4 states. [2019-12-18 20:49:58,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:49:58,609 INFO L93 Difference]: Finished difference Result 53251 states and 171579 transitions. [2019-12-18 20:49:58,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 20:49:58,609 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-18 20:49:58,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:49:58,694 INFO L225 Difference]: With dead ends: 53251 [2019-12-18 20:49:58,694 INFO L226 Difference]: Without dead ends: 53251 [2019-12-18 20:49:58,694 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 20:49:58,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53251 states. [2019-12-18 20:49:59,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53251 to 46409. [2019-12-18 20:49:59,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46409 states. [2019-12-18 20:49:59,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46409 states to 46409 states and 150674 transitions. [2019-12-18 20:49:59,581 INFO L78 Accepts]: Start accepts. Automaton has 46409 states and 150674 transitions. Word has length 16 [2019-12-18 20:49:59,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:49:59,582 INFO L462 AbstractCegarLoop]: Abstraction has 46409 states and 150674 transitions. [2019-12-18 20:49:59,582 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 20:49:59,582 INFO L276 IsEmpty]: Start isEmpty. Operand 46409 states and 150674 transitions. [2019-12-18 20:49:59,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 20:49:59,592 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:49:59,592 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:49:59,592 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-18 20:49:59,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:49:59,593 INFO L82 PathProgramCache]: Analyzing trace with hash 1710143018, now seen corresponding path program 1 times [2019-12-18 20:49:59,593 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:49:59,593 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112073907] [2019-12-18 20:49:59,593 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:49:59,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:49:59,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:49:59,803 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112073907] [2019-12-18 20:49:59,803 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:49:59,803 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 20:49:59,803 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345846372] [2019-12-18 20:49:59,804 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 20:49:59,804 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:49:59,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 20:49:59,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-18 20:49:59,804 INFO L87 Difference]: Start difference. First operand 46409 states and 150674 transitions. Second operand 7 states. [2019-12-18 20:50:01,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:50:01,168 INFO L93 Difference]: Finished difference Result 63407 states and 201418 transitions. [2019-12-18 20:50:01,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 20:50:01,169 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2019-12-18 20:50:01,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:50:01,281 INFO L225 Difference]: With dead ends: 63407 [2019-12-18 20:50:01,642 INFO L226 Difference]: Without dead ends: 63400 [2019-12-18 20:50:01,643 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-18 20:50:01,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63400 states. [2019-12-18 20:50:02,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63400 to 47584. [2019-12-18 20:50:02,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47584 states. [2019-12-18 20:50:02,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47584 states to 47584 states and 154270 transitions. [2019-12-18 20:50:02,525 INFO L78 Accepts]: Start accepts. Automaton has 47584 states and 154270 transitions. Word has length 22 [2019-12-18 20:50:02,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:50:02,526 INFO L462 AbstractCegarLoop]: Abstraction has 47584 states and 154270 transitions. [2019-12-18 20:50:02,526 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 20:50:02,526 INFO L276 IsEmpty]: Start isEmpty. Operand 47584 states and 154270 transitions. [2019-12-18 20:50:02,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 20:50:02,534 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:50:02,534 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:50:02,535 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-18 20:50:02,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:50:02,535 INFO L82 PathProgramCache]: Analyzing trace with hash 2075627383, now seen corresponding path program 1 times [2019-12-18 20:50:02,535 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:50:02,535 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731720905] [2019-12-18 20:50:02,535 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:50:02,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:50:02,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:50:02,731 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731720905] [2019-12-18 20:50:02,732 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:50:02,732 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 20:50:02,732 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828800045] [2019-12-18 20:50:02,732 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 20:50:02,732 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:50:02,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 20:50:02,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-18 20:50:02,733 INFO L87 Difference]: Start difference. First operand 47584 states and 154270 transitions. Second operand 7 states. [2019-12-18 20:50:03,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:50:03,901 INFO L93 Difference]: Finished difference Result 66798 states and 212192 transitions. [2019-12-18 20:50:03,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 20:50:03,902 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2019-12-18 20:50:03,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:50:04,018 INFO L225 Difference]: With dead ends: 66798 [2019-12-18 20:50:04,018 INFO L226 Difference]: Without dead ends: 66791 [2019-12-18 20:50:04,019 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-18 20:50:04,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66791 states. [2019-12-18 20:50:05,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66791 to 46419. [2019-12-18 20:50:05,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46419 states. [2019-12-18 20:50:05,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46419 states to 46419 states and 150561 transitions. [2019-12-18 20:50:05,301 INFO L78 Accepts]: Start accepts. Automaton has 46419 states and 150561 transitions. Word has length 22 [2019-12-18 20:50:05,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:50:05,301 INFO L462 AbstractCegarLoop]: Abstraction has 46419 states and 150561 transitions. [2019-12-18 20:50:05,301 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 20:50:05,301 INFO L276 IsEmpty]: Start isEmpty. Operand 46419 states and 150561 transitions. [2019-12-18 20:50:05,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 20:50:05,313 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:50:05,313 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:50:05,313 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-18 20:50:05,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:50:05,313 INFO L82 PathProgramCache]: Analyzing trace with hash -433341706, now seen corresponding path program 1 times [2019-12-18 20:50:05,313 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:50:05,313 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133387655] [2019-12-18 20:50:05,314 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:50:05,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:50:05,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:50:05,367 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133387655] [2019-12-18 20:50:05,367 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:50:05,367 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 20:50:05,368 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337414250] [2019-12-18 20:50:05,368 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 20:50:05,368 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:50:05,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 20:50:05,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 20:50:05,369 INFO L87 Difference]: Start difference. First operand 46419 states and 150561 transitions. Second operand 4 states. [2019-12-18 20:50:05,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:50:05,468 INFO L93 Difference]: Finished difference Result 18049 states and 55252 transitions. [2019-12-18 20:50:05,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 20:50:05,468 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-18 20:50:05,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:50:05,503 INFO L225 Difference]: With dead ends: 18049 [2019-12-18 20:50:05,503 INFO L226 Difference]: Without dead ends: 18049 [2019-12-18 20:50:05,504 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-18 20:50:05,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18049 states. [2019-12-18 20:50:05,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18049 to 17686. [2019-12-18 20:50:05,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17686 states. [2019-12-18 20:50:05,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17686 states to 17686 states and 54216 transitions. [2019-12-18 20:50:05,781 INFO L78 Accepts]: Start accepts. Automaton has 17686 states and 54216 transitions. Word has length 25 [2019-12-18 20:50:05,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:50:05,781 INFO L462 AbstractCegarLoop]: Abstraction has 17686 states and 54216 transitions. [2019-12-18 20:50:05,781 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 20:50:05,782 INFO L276 IsEmpty]: Start isEmpty. Operand 17686 states and 54216 transitions. [2019-12-18 20:50:05,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-18 20:50:05,793 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:50:05,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] [2019-12-18 20:50:05,793 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-18 20:50:05,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:50:05,794 INFO L82 PathProgramCache]: Analyzing trace with hash -1225408676, now seen corresponding path program 1 times [2019-12-18 20:50:05,794 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:50:05,794 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786421638] [2019-12-18 20:50:05,794 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:50:05,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:50:05,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:50:05,975 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786421638] [2019-12-18 20:50:05,975 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:50:05,975 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 20:50:05,975 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235565091] [2019-12-18 20:50:05,976 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 20:50:05,976 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:50:05,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 20:50:05,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-12-18 20:50:05,976 INFO L87 Difference]: Start difference. First operand 17686 states and 54216 transitions. Second operand 8 states. [2019-12-18 20:50:06,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:50:06,818 INFO L93 Difference]: Finished difference Result 23548 states and 70801 transitions. [2019-12-18 20:50:06,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-18 20:50:06,819 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 26 [2019-12-18 20:50:06,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:50:06,860 INFO L225 Difference]: With dead ends: 23548 [2019-12-18 20:50:06,860 INFO L226 Difference]: Without dead ends: 23548 [2019-12-18 20:50:06,860 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-18 20:50:06,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23548 states. [2019-12-18 20:50:07,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23548 to 17639. [2019-12-18 20:50:07,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17639 states. [2019-12-18 20:50:07,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17639 states to 17639 states and 54067 transitions. [2019-12-18 20:50:07,175 INFO L78 Accepts]: Start accepts. Automaton has 17639 states and 54067 transitions. Word has length 26 [2019-12-18 20:50:07,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:50:07,175 INFO L462 AbstractCegarLoop]: Abstraction has 17639 states and 54067 transitions. [2019-12-18 20:50:07,175 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 20:50:07,175 INFO L276 IsEmpty]: Start isEmpty. Operand 17639 states and 54067 transitions. [2019-12-18 20:50:07,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-18 20:50:07,186 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:50:07,186 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-18 20:50:07,187 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-18 20:50:07,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:50:07,187 INFO L82 PathProgramCache]: Analyzing trace with hash -990805015, now seen corresponding path program 1 times [2019-12-18 20:50:07,187 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:50:07,187 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451415324] [2019-12-18 20:50:07,188 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:50:07,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:50:07,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:50:07,538 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451415324] [2019-12-18 20:50:07,538 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:50:07,538 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 20:50:07,538 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360617897] [2019-12-18 20:50:07,538 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 20:50:07,539 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:50:07,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 20:50:07,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-12-18 20:50:07,539 INFO L87 Difference]: Start difference. First operand 17639 states and 54067 transitions. Second operand 8 states. [2019-12-18 20:50:08,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:50:08,153 INFO L93 Difference]: Finished difference Result 23290 states and 69941 transitions. [2019-12-18 20:50:08,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-18 20:50:08,153 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 26 [2019-12-18 20:50:08,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:50:08,186 INFO L225 Difference]: With dead ends: 23290 [2019-12-18 20:50:08,186 INFO L226 Difference]: Without dead ends: 23290 [2019-12-18 20:50:08,187 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2019-12-18 20:50:08,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23290 states. [2019-12-18 20:50:08,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23290 to 17427. [2019-12-18 20:50:08,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17427 states. [2019-12-18 20:50:08,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17427 states to 17427 states and 53420 transitions. [2019-12-18 20:50:08,479 INFO L78 Accepts]: Start accepts. Automaton has 17427 states and 53420 transitions. Word has length 26 [2019-12-18 20:50:08,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:50:08,479 INFO L462 AbstractCegarLoop]: Abstraction has 17427 states and 53420 transitions. [2019-12-18 20:50:08,479 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 20:50:08,479 INFO L276 IsEmpty]: Start isEmpty. Operand 17427 states and 53420 transitions. [2019-12-18 20:50:08,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 20:50:08,491 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:50:08,491 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-18 20:50:08,492 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-18 20:50:08,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:50:08,492 INFO L82 PathProgramCache]: Analyzing trace with hash -2045967469, now seen corresponding path program 1 times [2019-12-18 20:50:08,492 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:50:08,492 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613041319] [2019-12-18 20:50:08,493 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:50:08,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:50:08,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:50:08,583 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613041319] [2019-12-18 20:50:08,584 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:50:08,584 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 20:50:08,584 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371485315] [2019-12-18 20:50:08,584 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 20:50:08,585 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:50:08,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 20:50:08,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 20:50:08,585 INFO L87 Difference]: Start difference. First operand 17427 states and 53420 transitions. Second operand 5 states. [2019-12-18 20:50:08,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:50:08,963 INFO L93 Difference]: Finished difference Result 22078 states and 66558 transitions. [2019-12-18 20:50:08,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 20:50:08,964 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-18 20:50:08,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:50:08,998 INFO L225 Difference]: With dead ends: 22078 [2019-12-18 20:50:08,998 INFO L226 Difference]: Without dead ends: 22078 [2019-12-18 20:50:08,998 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-18 20:50:09,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22078 states. [2019-12-18 20:50:09,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22078 to 20690. [2019-12-18 20:50:09,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20690 states. [2019-12-18 20:50:09,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20690 states to 20690 states and 63068 transitions. [2019-12-18 20:50:09,316 INFO L78 Accepts]: Start accepts. Automaton has 20690 states and 63068 transitions. Word has length 27 [2019-12-18 20:50:09,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:50:09,316 INFO L462 AbstractCegarLoop]: Abstraction has 20690 states and 63068 transitions. [2019-12-18 20:50:09,316 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 20:50:09,316 INFO L276 IsEmpty]: Start isEmpty. Operand 20690 states and 63068 transitions. [2019-12-18 20:50:09,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-18 20:50:09,331 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:50:09,331 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:50:09,331 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-18 20:50:09,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:50:09,332 INFO L82 PathProgramCache]: Analyzing trace with hash -23775369, now seen corresponding path program 1 times [2019-12-18 20:50:09,332 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:50:09,332 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737140474] [2019-12-18 20:50:09,332 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:50:09,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:50:09,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:50:09,415 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737140474] [2019-12-18 20:50:09,415 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:50:09,416 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 20:50:09,417 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093703461] [2019-12-18 20:50:09,418 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 20:50:09,418 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:50:09,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 20:50:09,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 20:50:09,418 INFO L87 Difference]: Start difference. First operand 20690 states and 63068 transitions. Second operand 5 states. [2019-12-18 20:50:09,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:50:09,559 INFO L93 Difference]: Finished difference Result 21192 states and 64403 transitions. [2019-12-18 20:50:09,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 20:50:09,559 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-18 20:50:09,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:50:09,605 INFO L225 Difference]: With dead ends: 21192 [2019-12-18 20:50:09,606 INFO L226 Difference]: Without dead ends: 21192 [2019-12-18 20:50:09,610 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-18 20:50:09,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21192 states. [2019-12-18 20:50:09,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21192 to 21192. [2019-12-18 20:50:09,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21192 states. [2019-12-18 20:50:10,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21192 states to 21192 states and 64403 transitions. [2019-12-18 20:50:10,012 INFO L78 Accepts]: Start accepts. Automaton has 21192 states and 64403 transitions. Word has length 28 [2019-12-18 20:50:10,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:50:10,012 INFO L462 AbstractCegarLoop]: Abstraction has 21192 states and 64403 transitions. [2019-12-18 20:50:10,012 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 20:50:10,012 INFO L276 IsEmpty]: Start isEmpty. Operand 21192 states and 64403 transitions. [2019-12-18 20:50:10,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-18 20:50:10,029 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:50:10,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] [2019-12-18 20:50:10,030 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-18 20:50:10,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:50:10,030 INFO L82 PathProgramCache]: Analyzing trace with hash -994503224, now seen corresponding path program 1 times [2019-12-18 20:50:10,030 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:50:10,031 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359693690] [2019-12-18 20:50:10,031 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:50:10,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:50:10,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:50:10,109 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359693690] [2019-12-18 20:50:10,109 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:50:10,110 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 20:50:10,110 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685126031] [2019-12-18 20:50:10,110 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 20:50:10,110 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:50:10,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 20:50:10,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 20:50:10,112 INFO L87 Difference]: Start difference. First operand 21192 states and 64403 transitions. Second operand 5 states. [2019-12-18 20:50:10,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:50:10,540 INFO L93 Difference]: Finished difference Result 24492 states and 73316 transitions. [2019-12-18 20:50:10,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 20:50:10,541 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2019-12-18 20:50:10,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:50:10,590 INFO L225 Difference]: With dead ends: 24492 [2019-12-18 20:50:10,590 INFO L226 Difference]: Without dead ends: 24492 [2019-12-18 20:50:10,592 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-18 20:50:10,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24492 states. [2019-12-18 20:50:11,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24492 to 20516. [2019-12-18 20:50:11,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20516 states. [2019-12-18 20:50:11,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20516 states to 20516 states and 62474 transitions. [2019-12-18 20:50:11,082 INFO L78 Accepts]: Start accepts. Automaton has 20516 states and 62474 transitions. Word has length 29 [2019-12-18 20:50:11,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:50:11,083 INFO L462 AbstractCegarLoop]: Abstraction has 20516 states and 62474 transitions. [2019-12-18 20:50:11,083 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 20:50:11,083 INFO L276 IsEmpty]: Start isEmpty. Operand 20516 states and 62474 transitions. [2019-12-18 20:50:11,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-18 20:50:11,102 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:50:11,102 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:50:11,103 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-18 20:50:11,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:50:11,103 INFO L82 PathProgramCache]: Analyzing trace with hash 454456511, now seen corresponding path program 1 times [2019-12-18 20:50:11,103 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:50:11,103 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390322052] [2019-12-18 20:50:11,103 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:50:11,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:50:11,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:50:11,332 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390322052] [2019-12-18 20:50:11,332 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:50:11,332 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 20:50:11,332 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702399525] [2019-12-18 20:50:11,333 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 20:50:11,333 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:50:11,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 20:50:11,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 20:50:11,333 INFO L87 Difference]: Start difference. First operand 20516 states and 62474 transitions. Second operand 9 states. [2019-12-18 20:50:12,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:50:12,803 INFO L93 Difference]: Finished difference Result 28824 states and 85873 transitions. [2019-12-18 20:50:12,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-18 20:50:12,803 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 33 [2019-12-18 20:50:12,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:50:12,855 INFO L225 Difference]: With dead ends: 28824 [2019-12-18 20:50:12,855 INFO L226 Difference]: Without dead ends: 28824 [2019-12-18 20:50:12,856 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-12-18 20:50:12,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28824 states. [2019-12-18 20:50:13,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28824 to 21776. [2019-12-18 20:50:13,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21776 states. [2019-12-18 20:50:13,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21776 states to 21776 states and 66099 transitions. [2019-12-18 20:50:13,210 INFO L78 Accepts]: Start accepts. Automaton has 21776 states and 66099 transitions. Word has length 33 [2019-12-18 20:50:13,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:50:13,211 INFO L462 AbstractCegarLoop]: Abstraction has 21776 states and 66099 transitions. [2019-12-18 20:50:13,211 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 20:50:13,211 INFO L276 IsEmpty]: Start isEmpty. Operand 21776 states and 66099 transitions. [2019-12-18 20:50:13,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-18 20:50:13,227 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:50:13,227 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-18 20:50:13,227 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-18 20:50:13,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:50:13,227 INFO L82 PathProgramCache]: Analyzing trace with hash 459337151, now seen corresponding path program 2 times [2019-12-18 20:50:13,228 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:50:13,228 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849769702] [2019-12-18 20:50:13,228 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:50:13,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:50:13,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:50:13,309 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849769702] [2019-12-18 20:50:13,309 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:50:13,309 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 20:50:13,309 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338497292] [2019-12-18 20:50:13,310 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 20:50:13,310 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:50:13,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 20:50:13,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 20:50:13,310 INFO L87 Difference]: Start difference. First operand 21776 states and 66099 transitions. Second operand 6 states. [2019-12-18 20:50:14,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:50:14,055 INFO L93 Difference]: Finished difference Result 27700 states and 82230 transitions. [2019-12-18 20:50:14,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 20:50:14,055 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2019-12-18 20:50:14,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:50:14,101 INFO L225 Difference]: With dead ends: 27700 [2019-12-18 20:50:14,101 INFO L226 Difference]: Without dead ends: 27700 [2019-12-18 20:50:14,101 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-12-18 20:50:14,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27700 states. [2019-12-18 20:50:14,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27700 to 21560. [2019-12-18 20:50:14,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21560 states. [2019-12-18 20:50:14,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21560 states to 21560 states and 65295 transitions. [2019-12-18 20:50:14,451 INFO L78 Accepts]: Start accepts. Automaton has 21560 states and 65295 transitions. Word has length 33 [2019-12-18 20:50:14,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:50:14,451 INFO L462 AbstractCegarLoop]: Abstraction has 21560 states and 65295 transitions. [2019-12-18 20:50:14,452 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 20:50:14,452 INFO L276 IsEmpty]: Start isEmpty. Operand 21560 states and 65295 transitions. [2019-12-18 20:50:14,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-18 20:50:14,470 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:50:14,471 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-18 20:50:14,471 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-18 20:50:14,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:50:14,471 INFO L82 PathProgramCache]: Analyzing trace with hash 1086926900, now seen corresponding path program 1 times [2019-12-18 20:50:14,472 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:50:14,472 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20013403] [2019-12-18 20:50:14,472 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:50:14,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:50:14,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:50:14,643 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20013403] [2019-12-18 20:50:14,643 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:50:14,643 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 20:50:14,643 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151383834] [2019-12-18 20:50:14,644 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 20:50:14,644 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:50:14,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 20:50:14,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-18 20:50:14,644 INFO L87 Difference]: Start difference. First operand 21560 states and 65295 transitions. Second operand 8 states. [2019-12-18 20:50:15,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:50:15,900 INFO L93 Difference]: Finished difference Result 30211 states and 89701 transitions. [2019-12-18 20:50:15,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-18 20:50:15,901 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 35 [2019-12-18 20:50:15,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:50:15,942 INFO L225 Difference]: With dead ends: 30211 [2019-12-18 20:50:15,942 INFO L226 Difference]: Without dead ends: 30211 [2019-12-18 20:50:15,943 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-18 20:50:16,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30211 states. [2019-12-18 20:50:16,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30211 to 21696. [2019-12-18 20:50:16,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21696 states. [2019-12-18 20:50:16,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21696 states to 21696 states and 65742 transitions. [2019-12-18 20:50:16,321 INFO L78 Accepts]: Start accepts. Automaton has 21696 states and 65742 transitions. Word has length 35 [2019-12-18 20:50:16,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:50:16,321 INFO L462 AbstractCegarLoop]: Abstraction has 21696 states and 65742 transitions. [2019-12-18 20:50:16,321 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 20:50:16,321 INFO L276 IsEmpty]: Start isEmpty. Operand 21696 states and 65742 transitions. [2019-12-18 20:50:16,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-18 20:50:16,347 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:50:16,347 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:50:16,347 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-18 20:50:16,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:50:16,348 INFO L82 PathProgramCache]: Analyzing trace with hash 1485923537, now seen corresponding path program 1 times [2019-12-18 20:50:16,348 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:50:16,348 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506329122] [2019-12-18 20:50:16,348 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:50:16,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:50:16,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:50:16,389 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506329122] [2019-12-18 20:50:16,389 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:50:16,389 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 20:50:16,389 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589674492] [2019-12-18 20:50:16,390 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:50:16,390 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:50:16,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:50:16,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:50:16,390 INFO L87 Difference]: Start difference. First operand 21696 states and 65742 transitions. Second operand 3 states. [2019-12-18 20:50:16,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:50:16,572 INFO L93 Difference]: Finished difference Result 41236 states and 125000 transitions. [2019-12-18 20:50:16,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:50:16,573 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-18 20:50:16,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:50:16,618 INFO L225 Difference]: With dead ends: 41236 [2019-12-18 20:50:16,618 INFO L226 Difference]: Without dead ends: 22394 [2019-12-18 20:50:16,619 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:50:16,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22394 states. [2019-12-18 20:50:16,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22394 to 22213. [2019-12-18 20:50:16,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22213 states. [2019-12-18 20:50:16,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22213 states to 22213 states and 65657 transitions. [2019-12-18 20:50:16,960 INFO L78 Accepts]: Start accepts. Automaton has 22213 states and 65657 transitions. Word has length 39 [2019-12-18 20:50:16,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:50:16,960 INFO L462 AbstractCegarLoop]: Abstraction has 22213 states and 65657 transitions. [2019-12-18 20:50:16,960 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:50:16,960 INFO L276 IsEmpty]: Start isEmpty. Operand 22213 states and 65657 transitions. [2019-12-18 20:50:16,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-18 20:50:16,985 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:50:16,985 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:50:16,985 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-18 20:50:16,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:50:16,986 INFO L82 PathProgramCache]: Analyzing trace with hash 252616620, now seen corresponding path program 1 times [2019-12-18 20:50:16,986 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:50:16,986 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783423307] [2019-12-18 20:50:16,986 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:50:16,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:50:17,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:50:17,206 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783423307] [2019-12-18 20:50:17,206 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:50:17,206 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 20:50:17,207 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279867113] [2019-12-18 20:50:17,207 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 20:50:17,207 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:50:17,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 20:50:17,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-12-18 20:50:17,208 INFO L87 Difference]: Start difference. First operand 22213 states and 65657 transitions. Second operand 9 states. [2019-12-18 20:50:18,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:50:18,335 INFO L93 Difference]: Finished difference Result 31676 states and 91487 transitions. [2019-12-18 20:50:18,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-18 20:50:18,337 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 39 [2019-12-18 20:50:18,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:50:18,378 INFO L225 Difference]: With dead ends: 31676 [2019-12-18 20:50:18,379 INFO L226 Difference]: Without dead ends: 31676 [2019-12-18 20:50:18,379 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2019-12-18 20:50:18,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31676 states. [2019-12-18 20:50:18,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31676 to 20306. [2019-12-18 20:50:18,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20306 states. [2019-12-18 20:50:18,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20306 states to 20306 states and 60137 transitions. [2019-12-18 20:50:18,908 INFO L78 Accepts]: Start accepts. Automaton has 20306 states and 60137 transitions. Word has length 39 [2019-12-18 20:50:18,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:50:18,908 INFO L462 AbstractCegarLoop]: Abstraction has 20306 states and 60137 transitions. [2019-12-18 20:50:18,908 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 20:50:18,908 INFO L276 IsEmpty]: Start isEmpty. Operand 20306 states and 60137 transitions. [2019-12-18 20:50:18,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-18 20:50:18,928 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:50:18,928 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:50:18,928 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-18 20:50:18,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:50:18,928 INFO L82 PathProgramCache]: Analyzing trace with hash 157045846, now seen corresponding path program 2 times [2019-12-18 20:50:18,928 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:50:18,928 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910116089] [2019-12-18 20:50:18,929 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:50:18,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:50:19,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-18 20:50:19,117 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910116089] [2019-12-18 20:50:19,117 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:50:19,117 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 20:50:19,118 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486048808] [2019-12-18 20:50:19,118 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 20:50:19,118 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:50:19,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 20:50:19,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-12-18 20:50:19,118 INFO L87 Difference]: Start difference. First operand 20306 states and 60137 transitions. Second operand 9 states. [2019-12-18 20:50:20,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:50:20,491 INFO L93 Difference]: Finished difference Result 27284 states and 79224 transitions. [2019-12-18 20:50:20,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-18 20:50:20,491 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 39 [2019-12-18 20:50:20,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:50:20,539 INFO L225 Difference]: With dead ends: 27284 [2019-12-18 20:50:20,539 INFO L226 Difference]: Without dead ends: 27284 [2019-12-18 20:50:20,540 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2019-12-18 20:50:20,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27284 states. [2019-12-18 20:50:20,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27284 to 18887. [2019-12-18 20:50:20,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18887 states. [2019-12-18 20:50:20,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18887 states to 18887 states and 56307 transitions. [2019-12-18 20:50:20,868 INFO L78 Accepts]: Start accepts. Automaton has 18887 states and 56307 transitions. Word has length 39 [2019-12-18 20:50:20,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:50:20,868 INFO L462 AbstractCegarLoop]: Abstraction has 18887 states and 56307 transitions. [2019-12-18 20:50:20,869 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 20:50:20,869 INFO L276 IsEmpty]: Start isEmpty. Operand 18887 states and 56307 transitions. [2019-12-18 20:50:20,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 20:50:20,887 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:50:20,887 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:50:20,887 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-18 20:50:20,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:50:20,887 INFO L82 PathProgramCache]: Analyzing trace with hash 594517850, now seen corresponding path program 1 times [2019-12-18 20:50:20,887 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:50:20,888 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213357152] [2019-12-18 20:50:20,888 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:50:20,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:50:20,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:50:20,961 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213357152] [2019-12-18 20:50:20,962 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:50:20,962 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 20:50:20,962 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419094260] [2019-12-18 20:50:20,962 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 20:50:20,963 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:50:20,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 20:50:20,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 20:50:20,963 INFO L87 Difference]: Start difference. First operand 18887 states and 56307 transitions. Second operand 5 states. [2019-12-18 20:50:21,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:50:21,582 INFO L93 Difference]: Finished difference Result 26904 states and 79447 transitions. [2019-12-18 20:50:21,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 20:50:21,583 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-18 20:50:21,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:50:21,621 INFO L225 Difference]: With dead ends: 26904 [2019-12-18 20:50:21,621 INFO L226 Difference]: Without dead ends: 26904 [2019-12-18 20:50:21,621 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-18 20:50:21,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26904 states. [2019-12-18 20:50:21,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26904 to 24960. [2019-12-18 20:50:21,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24960 states. [2019-12-18 20:50:22,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24960 states to 24960 states and 74241 transitions. [2019-12-18 20:50:22,010 INFO L78 Accepts]: Start accepts. Automaton has 24960 states and 74241 transitions. Word has length 40 [2019-12-18 20:50:22,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:50:22,010 INFO L462 AbstractCegarLoop]: Abstraction has 24960 states and 74241 transitions. [2019-12-18 20:50:22,010 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 20:50:22,010 INFO L276 IsEmpty]: Start isEmpty. Operand 24960 states and 74241 transitions. [2019-12-18 20:50:22,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 20:50:22,036 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:50:22,036 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:50:22,036 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-18 20:50:22,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:50:22,036 INFO L82 PathProgramCache]: Analyzing trace with hash 1706121534, now seen corresponding path program 2 times [2019-12-18 20:50:22,036 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:50:22,036 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817218706] [2019-12-18 20:50:22,037 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:50:22,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:50:22,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:50:22,102 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817218706] [2019-12-18 20:50:22,103 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:50:22,103 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 20:50:22,103 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163495501] [2019-12-18 20:50:22,103 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:50:22,104 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:50:22,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:50:22,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:50:22,104 INFO L87 Difference]: Start difference. First operand 24960 states and 74241 transitions. Second operand 3 states. [2019-12-18 20:50:22,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:50:22,195 INFO L93 Difference]: Finished difference Result 24960 states and 73450 transitions. [2019-12-18 20:50:22,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:50:22,195 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-12-18 20:50:22,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:50:22,227 INFO L225 Difference]: With dead ends: 24960 [2019-12-18 20:50:22,227 INFO L226 Difference]: Without dead ends: 24960 [2019-12-18 20:50:22,227 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:50:22,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24960 states. [2019-12-18 20:50:22,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24960 to 24914. [2019-12-18 20:50:22,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24914 states. [2019-12-18 20:50:22,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24914 states to 24914 states and 73323 transitions. [2019-12-18 20:50:22,816 INFO L78 Accepts]: Start accepts. Automaton has 24914 states and 73323 transitions. Word has length 40 [2019-12-18 20:50:22,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:50:22,816 INFO L462 AbstractCegarLoop]: Abstraction has 24914 states and 73323 transitions. [2019-12-18 20:50:22,817 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:50:22,817 INFO L276 IsEmpty]: Start isEmpty. Operand 24914 states and 73323 transitions. [2019-12-18 20:50:22,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-18 20:50:22,841 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:50:22,841 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:50:22,841 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-18 20:50:22,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:50:22,842 INFO L82 PathProgramCache]: Analyzing trace with hash 1403753262, now seen corresponding path program 1 times [2019-12-18 20:50:22,842 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:50:22,842 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824376809] [2019-12-18 20:50:22,842 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:50:22,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:50:22,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:50:22,881 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824376809] [2019-12-18 20:50:22,881 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:50:22,881 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 20:50:22,881 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312555638] [2019-12-18 20:50:22,882 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 20:50:22,882 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:50:22,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 20:50:22,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 20:50:22,882 INFO L87 Difference]: Start difference. First operand 24914 states and 73323 transitions. Second operand 5 states. [2019-12-18 20:50:22,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:50:22,984 INFO L93 Difference]: Finished difference Result 23462 states and 69976 transitions. [2019-12-18 20:50:22,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 20:50:22,985 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2019-12-18 20:50:22,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:50:23,014 INFO L225 Difference]: With dead ends: 23462 [2019-12-18 20:50:23,014 INFO L226 Difference]: Without dead ends: 21668 [2019-12-18 20:50:23,014 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-18 20:50:23,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21668 states. [2019-12-18 20:50:23,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21668 to 20702. [2019-12-18 20:50:23,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20702 states. [2019-12-18 20:50:23,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20702 states to 20702 states and 63470 transitions. [2019-12-18 20:50:23,324 INFO L78 Accepts]: Start accepts. Automaton has 20702 states and 63470 transitions. Word has length 41 [2019-12-18 20:50:23,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:50:23,324 INFO L462 AbstractCegarLoop]: Abstraction has 20702 states and 63470 transitions. [2019-12-18 20:50:23,325 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 20:50:23,325 INFO L276 IsEmpty]: Start isEmpty. Operand 20702 states and 63470 transitions. [2019-12-18 20:50:23,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 20:50:23,345 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:50:23,345 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-18 20:50:23,345 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-18 20:50:23,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:50:23,346 INFO L82 PathProgramCache]: Analyzing trace with hash 384634377, now seen corresponding path program 1 times [2019-12-18 20:50:23,346 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:50:23,346 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36283232] [2019-12-18 20:50:23,346 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:50:23,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:50:23,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-18 20:50:23,427 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36283232] [2019-12-18 20:50:23,427 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:50:23,428 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 20:50:23,428 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396774232] [2019-12-18 20:50:23,428 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 20:50:23,428 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:50:23,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 20:50:23,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 20:50:23,429 INFO L87 Difference]: Start difference. First operand 20702 states and 63470 transitions. Second operand 6 states. [2019-12-18 20:50:24,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:50:24,202 INFO L93 Difference]: Finished difference Result 27244 states and 82518 transitions. [2019-12-18 20:50:24,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-18 20:50:24,203 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2019-12-18 20:50:24,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:50:24,239 INFO L225 Difference]: With dead ends: 27244 [2019-12-18 20:50:24,239 INFO L226 Difference]: Without dead ends: 27244 [2019-12-18 20:50:24,240 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 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-18 20:50:24,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27244 states. [2019-12-18 20:50:24,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27244 to 21871. [2019-12-18 20:50:24,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21871 states. [2019-12-18 20:50:24,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21871 states to 21871 states and 66986 transitions. [2019-12-18 20:50:24,590 INFO L78 Accepts]: Start accepts. Automaton has 21871 states and 66986 transitions. Word has length 65 [2019-12-18 20:50:24,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:50:24,590 INFO L462 AbstractCegarLoop]: Abstraction has 21871 states and 66986 transitions. [2019-12-18 20:50:24,591 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 20:50:24,591 INFO L276 IsEmpty]: Start isEmpty. Operand 21871 states and 66986 transitions. [2019-12-18 20:50:24,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 20:50:24,612 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:50:24,612 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-18 20:50:24,612 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-18 20:50:24,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:50:24,612 INFO L82 PathProgramCache]: Analyzing trace with hash 1572101585, now seen corresponding path program 2 times [2019-12-18 20:50:24,612 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:50:24,613 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009449597] [2019-12-18 20:50:24,613 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:50:24,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:50:24,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:50:24,687 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009449597] [2019-12-18 20:50:24,687 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:50:24,687 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 20:50:24,687 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502436986] [2019-12-18 20:50:24,688 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 20:50:24,688 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:50:24,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 20:50:24,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 20:50:24,689 INFO L87 Difference]: Start difference. First operand 21871 states and 66986 transitions. Second operand 5 states. [2019-12-18 20:50:25,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:50:25,137 INFO L93 Difference]: Finished difference Result 23936 states and 72729 transitions. [2019-12-18 20:50:25,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 20:50:25,138 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-12-18 20:50:25,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:50:25,194 INFO L225 Difference]: With dead ends: 23936 [2019-12-18 20:50:25,195 INFO L226 Difference]: Without dead ends: 23936 [2019-12-18 20:50:25,195 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-18 20:50:25,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23936 states. [2019-12-18 20:50:25,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23936 to 22155. [2019-12-18 20:50:25,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22155 states. [2019-12-18 20:50:25,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22155 states to 22155 states and 67844 transitions. [2019-12-18 20:50:25,814 INFO L78 Accepts]: Start accepts. Automaton has 22155 states and 67844 transitions. Word has length 65 [2019-12-18 20:50:25,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:50:25,815 INFO L462 AbstractCegarLoop]: Abstraction has 22155 states and 67844 transitions. [2019-12-18 20:50:25,815 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 20:50:25,815 INFO L276 IsEmpty]: Start isEmpty. Operand 22155 states and 67844 transitions. [2019-12-18 20:50:25,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 20:50:25,844 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:50:25,845 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-18 20:50:25,845 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-18 20:50:25,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:50:25,845 INFO L82 PathProgramCache]: Analyzing trace with hash -589431029, now seen corresponding path program 3 times [2019-12-18 20:50:25,845 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:50:25,846 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609839813] [2019-12-18 20:50:25,846 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:50:25,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:50:25,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:50:25,969 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609839813] [2019-12-18 20:50:25,970 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:50:25,970 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 20:50:25,970 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119029541] [2019-12-18 20:50:25,971 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 20:50:25,971 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:50:25,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 20:50:25,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-12-18 20:50:25,972 INFO L87 Difference]: Start difference. First operand 22155 states and 67844 transitions. Second operand 9 states. [2019-12-18 20:50:27,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:50:27,377 INFO L93 Difference]: Finished difference Result 34631 states and 105853 transitions. [2019-12-18 20:50:27,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-18 20:50:27,378 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-18 20:50:27,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:50:27,424 INFO L225 Difference]: With dead ends: 34631 [2019-12-18 20:50:27,424 INFO L226 Difference]: Without dead ends: 34631 [2019-12-18 20:50:27,424 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-18 20:50:27,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34631 states. [2019-12-18 20:50:27,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34631 to 22039. [2019-12-18 20:50:27,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22039 states. [2019-12-18 20:50:27,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22039 states to 22039 states and 67504 transitions. [2019-12-18 20:50:27,827 INFO L78 Accepts]: Start accepts. Automaton has 22039 states and 67504 transitions. Word has length 65 [2019-12-18 20:50:27,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:50:27,828 INFO L462 AbstractCegarLoop]: Abstraction has 22039 states and 67504 transitions. [2019-12-18 20:50:27,828 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 20:50:27,828 INFO L276 IsEmpty]: Start isEmpty. Operand 22039 states and 67504 transitions. [2019-12-18 20:50:27,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 20:50:27,849 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:50:27,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] [2019-12-18 20:50:27,849 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-18 20:50:27,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:50:27,850 INFO L82 PathProgramCache]: Analyzing trace with hash 1236323897, now seen corresponding path program 4 times [2019-12-18 20:50:27,850 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:50:27,850 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062311393] [2019-12-18 20:50:27,850 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:50:27,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:50:28,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:50:28,111 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062311393] [2019-12-18 20:50:28,111 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:50:28,111 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 20:50:28,111 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895479274] [2019-12-18 20:50:28,111 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 20:50:28,112 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:50:28,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 20:50:28,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-12-18 20:50:28,112 INFO L87 Difference]: Start difference. First operand 22039 states and 67504 transitions. Second operand 10 states. [2019-12-18 20:50:29,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:50:29,524 INFO L93 Difference]: Finished difference Result 38625 states and 117886 transitions. [2019-12-18 20:50:29,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-18 20:50:29,524 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 65 [2019-12-18 20:50:29,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:50:29,562 INFO L225 Difference]: With dead ends: 38625 [2019-12-18 20:50:29,562 INFO L226 Difference]: Without dead ends: 27269 [2019-12-18 20:50:29,563 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-18 20:50:29,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27269 states. [2019-12-18 20:50:29,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27269 to 24287. [2019-12-18 20:50:29,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24287 states. [2019-12-18 20:50:29,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24287 states to 24287 states and 74160 transitions. [2019-12-18 20:50:29,939 INFO L78 Accepts]: Start accepts. Automaton has 24287 states and 74160 transitions. Word has length 65 [2019-12-18 20:50:29,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:50:29,939 INFO L462 AbstractCegarLoop]: Abstraction has 24287 states and 74160 transitions. [2019-12-18 20:50:29,939 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 20:50:29,939 INFO L276 IsEmpty]: Start isEmpty. Operand 24287 states and 74160 transitions. [2019-12-18 20:50:29,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 20:50:29,967 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:50:29,967 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-18 20:50:29,967 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-18 20:50:29,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:50:29,968 INFO L82 PathProgramCache]: Analyzing trace with hash 232110765, now seen corresponding path program 5 times [2019-12-18 20:50:29,968 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:50:29,968 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715557255] [2019-12-18 20:50:29,968 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:50:29,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:50:30,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:50:30,024 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715557255] [2019-12-18 20:50:30,024 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:50:30,025 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 20:50:30,025 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111468536] [2019-12-18 20:50:30,025 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:50:30,025 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:50:30,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:50:30,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:50:30,026 INFO L87 Difference]: Start difference. First operand 24287 states and 74160 transitions. Second operand 3 states. [2019-12-18 20:50:30,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:50:30,112 INFO L93 Difference]: Finished difference Result 24286 states and 74158 transitions. [2019-12-18 20:50:30,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:50:30,113 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-18 20:50:30,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:50:30,144 INFO L225 Difference]: With dead ends: 24286 [2019-12-18 20:50:30,145 INFO L226 Difference]: Without dead ends: 24286 [2019-12-18 20:50:30,145 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:50:30,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24286 states. [2019-12-18 20:50:30,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24286 to 21053. [2019-12-18 20:50:30,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21053 states. [2019-12-18 20:50:30,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21053 states to 21053 states and 65003 transitions. [2019-12-18 20:50:30,722 INFO L78 Accepts]: Start accepts. Automaton has 21053 states and 65003 transitions. Word has length 65 [2019-12-18 20:50:30,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:50:30,722 INFO L462 AbstractCegarLoop]: Abstraction has 21053 states and 65003 transitions. [2019-12-18 20:50:30,722 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:50:30,722 INFO L276 IsEmpty]: Start isEmpty. Operand 21053 states and 65003 transitions. [2019-12-18 20:50:30,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 20:50:30,747 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:50:30,747 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-18 20:50:30,747 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-18 20:50:30,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:50:30,748 INFO L82 PathProgramCache]: Analyzing trace with hash -2123111745, now seen corresponding path program 1 times [2019-12-18 20:50:30,748 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:50:30,748 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437814488] [2019-12-18 20:50:30,748 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:50:30,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:50:30,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:50:30,846 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437814488] [2019-12-18 20:50:30,846 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:50:30,846 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 20:50:30,846 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126827789] [2019-12-18 20:50:30,847 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 20:50:30,847 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:50:30,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 20:50:30,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 20:50:30,848 INFO L87 Difference]: Start difference. First operand 21053 states and 65003 transitions. Second operand 7 states. [2019-12-18 20:50:32,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:50:32,323 INFO L93 Difference]: Finished difference Result 28928 states and 87528 transitions. [2019-12-18 20:50:32,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-18 20:50:32,324 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 66 [2019-12-18 20:50:32,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:50:32,363 INFO L225 Difference]: With dead ends: 28928 [2019-12-18 20:50:32,364 INFO L226 Difference]: Without dead ends: 28928 [2019-12-18 20:50:32,364 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=367, Unknown=0, NotChecked=0, Total=462 [2019-12-18 20:50:32,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28928 states. [2019-12-18 20:50:32,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28928 to 20770. [2019-12-18 20:50:32,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20770 states. [2019-12-18 20:50:32,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20770 states to 20770 states and 64075 transitions. [2019-12-18 20:50:32,736 INFO L78 Accepts]: Start accepts. Automaton has 20770 states and 64075 transitions. Word has length 66 [2019-12-18 20:50:32,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:50:32,737 INFO L462 AbstractCegarLoop]: Abstraction has 20770 states and 64075 transitions. [2019-12-18 20:50:32,737 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 20:50:32,737 INFO L276 IsEmpty]: Start isEmpty. Operand 20770 states and 64075 transitions. [2019-12-18 20:50:32,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 20:50:32,760 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:50:32,760 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-18 20:50:32,760 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-18 20:50:32,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:50:32,760 INFO L82 PathProgramCache]: Analyzing trace with hash -1476982063, now seen corresponding path program 2 times [2019-12-18 20:50:32,760 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:50:32,760 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594805052] [2019-12-18 20:50:32,761 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:50:32,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:50:33,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:50:33,048 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594805052] [2019-12-18 20:50:33,048 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:50:33,049 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 20:50:33,049 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558471666] [2019-12-18 20:50:33,049 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 20:50:33,049 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:50:33,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 20:50:33,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 20:50:33,050 INFO L87 Difference]: Start difference. First operand 20770 states and 64075 transitions. Second operand 11 states. [2019-12-18 20:50:34,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:50:34,508 INFO L93 Difference]: Finished difference Result 29836 states and 90982 transitions. [2019-12-18 20:50:34,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-18 20:50:34,509 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 66 [2019-12-18 20:50:34,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:50:34,544 INFO L225 Difference]: With dead ends: 29836 [2019-12-18 20:50:34,544 INFO L226 Difference]: Without dead ends: 25428 [2019-12-18 20:50:34,544 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-18 20:50:34,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25428 states. [2019-12-18 20:50:34,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25428 to 20919. [2019-12-18 20:50:34,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20919 states. [2019-12-18 20:50:34,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20919 states to 20919 states and 64294 transitions. [2019-12-18 20:50:34,907 INFO L78 Accepts]: Start accepts. Automaton has 20919 states and 64294 transitions. Word has length 66 [2019-12-18 20:50:34,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:50:34,907 INFO L462 AbstractCegarLoop]: Abstraction has 20919 states and 64294 transitions. [2019-12-18 20:50:34,907 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 20:50:34,907 INFO L276 IsEmpty]: Start isEmpty. Operand 20919 states and 64294 transitions. [2019-12-18 20:50:34,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 20:50:34,930 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:50:34,931 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-18 20:50:34,931 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-18 20:50:34,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:50:34,931 INFO L82 PathProgramCache]: Analyzing trace with hash 1459295381, now seen corresponding path program 3 times [2019-12-18 20:50:34,931 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:50:34,931 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183380969] [2019-12-18 20:50:34,931 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:50:34,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:50:35,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:50:35,743 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183380969] [2019-12-18 20:50:35,743 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:50:35,744 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-12-18 20:50:35,744 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258377216] [2019-12-18 20:50:35,744 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-12-18 20:50:35,744 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:50:35,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-12-18 20:50:35,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2019-12-18 20:50:35,745 INFO L87 Difference]: Start difference. First operand 20919 states and 64294 transitions. Second operand 21 states. [2019-12-18 20:50:44,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:50:44,958 INFO L93 Difference]: Finished difference Result 35100 states and 105551 transitions. [2019-12-18 20:50:44,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2019-12-18 20:50:44,958 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 66 [2019-12-18 20:50:44,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:50:45,000 INFO L225 Difference]: With dead ends: 35100 [2019-12-18 20:50:45,000 INFO L226 Difference]: Without dead ends: 29998 [2019-12-18 20:50:45,003 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3723 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=1120, Invalid=10010, Unknown=0, NotChecked=0, Total=11130 [2019-12-18 20:50:45,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29998 states. [2019-12-18 20:50:45,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29998 to 22035. [2019-12-18 20:50:45,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22035 states. [2019-12-18 20:50:45,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22035 states to 22035 states and 67393 transitions. [2019-12-18 20:50:45,592 INFO L78 Accepts]: Start accepts. Automaton has 22035 states and 67393 transitions. Word has length 66 [2019-12-18 20:50:45,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:50:45,592 INFO L462 AbstractCegarLoop]: Abstraction has 22035 states and 67393 transitions. [2019-12-18 20:50:45,592 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-12-18 20:50:45,592 INFO L276 IsEmpty]: Start isEmpty. Operand 22035 states and 67393 transitions. [2019-12-18 20:50:45,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 20:50:45,614 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:50:45,614 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-18 20:50:45,614 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-18 20:50:45,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:50:45,615 INFO L82 PathProgramCache]: Analyzing trace with hash 227474065, now seen corresponding path program 4 times [2019-12-18 20:50:45,615 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:50:45,615 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413563764] [2019-12-18 20:50:45,615 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:50:45,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:50:46,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:50:46,079 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413563764] [2019-12-18 20:50:46,079 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:50:46,079 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 20:50:46,079 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805749323] [2019-12-18 20:50:46,079 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 20:50:46,080 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:50:46,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 20:50:46,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2019-12-18 20:50:46,080 INFO L87 Difference]: Start difference. First operand 22035 states and 67393 transitions. Second operand 16 states. [2019-12-18 20:50:50,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:50:50,507 INFO L93 Difference]: Finished difference Result 36762 states and 109963 transitions. [2019-12-18 20:50:50,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-12-18 20:50:50,508 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 66 [2019-12-18 20:50:50,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:50:50,549 INFO L225 Difference]: With dead ends: 36762 [2019-12-18 20:50:50,549 INFO L226 Difference]: Without dead ends: 27799 [2019-12-18 20:50:50,550 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 2 SyntacticMatches, 6 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 817 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=432, Invalid=2990, Unknown=0, NotChecked=0, Total=3422 [2019-12-18 20:50:50,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27799 states. [2019-12-18 20:50:50,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27799 to 22733. [2019-12-18 20:50:50,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22733 states. [2019-12-18 20:50:50,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22733 states to 22733 states and 69491 transitions. [2019-12-18 20:50:50,930 INFO L78 Accepts]: Start accepts. Automaton has 22733 states and 69491 transitions. Word has length 66 [2019-12-18 20:50:50,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:50:50,930 INFO L462 AbstractCegarLoop]: Abstraction has 22733 states and 69491 transitions. [2019-12-18 20:50:50,930 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 20:50:50,931 INFO L276 IsEmpty]: Start isEmpty. Operand 22733 states and 69491 transitions. [2019-12-18 20:50:50,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 20:50:50,954 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:50:50,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, 1] [2019-12-18 20:50:50,954 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-18 20:50:50,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:50:50,954 INFO L82 PathProgramCache]: Analyzing trace with hash 1406745985, now seen corresponding path program 5 times [2019-12-18 20:50:50,954 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:50:50,954 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848706230] [2019-12-18 20:50:50,955 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:50:50,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:50:51,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:50:51,028 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848706230] [2019-12-18 20:50:51,028 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:50:51,029 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 20:50:51,029 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395683555] [2019-12-18 20:50:51,029 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 20:50:51,029 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:50:51,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 20:50:51,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 20:50:51,030 INFO L87 Difference]: Start difference. First operand 22733 states and 69491 transitions. Second operand 7 states. [2019-12-18 20:50:51,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:50:51,697 INFO L93 Difference]: Finished difference Result 54588 states and 165972 transitions. [2019-12-18 20:50:51,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 20:50:51,698 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 66 [2019-12-18 20:50:51,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:50:51,776 INFO L225 Difference]: With dead ends: 54588 [2019-12-18 20:50:51,776 INFO L226 Difference]: Without dead ends: 40130 [2019-12-18 20:50:51,779 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-18 20:50:51,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40130 states. [2019-12-18 20:50:52,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40130 to 22237. [2019-12-18 20:50:52,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22237 states. [2019-12-18 20:50:52,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22237 states to 22237 states and 67962 transitions. [2019-12-18 20:50:52,513 INFO L78 Accepts]: Start accepts. Automaton has 22237 states and 67962 transitions. Word has length 66 [2019-12-18 20:50:52,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:50:52,514 INFO L462 AbstractCegarLoop]: Abstraction has 22237 states and 67962 transitions. [2019-12-18 20:50:52,514 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 20:50:52,514 INFO L276 IsEmpty]: Start isEmpty. Operand 22237 states and 67962 transitions. [2019-12-18 20:50:52,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 20:50:52,539 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:50:52,539 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-18 20:50:52,539 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-18 20:50:52,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:50:52,540 INFO L82 PathProgramCache]: Analyzing trace with hash -387549135, now seen corresponding path program 6 times [2019-12-18 20:50:52,540 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:50:52,540 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987582155] [2019-12-18 20:50:52,540 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:50:52,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:50:52,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:50:52,811 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987582155] [2019-12-18 20:50:52,811 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:50:52,811 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 20:50:52,811 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944198429] [2019-12-18 20:50:52,812 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 20:50:52,812 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:50:52,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 20:50:52,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 20:50:52,812 INFO L87 Difference]: Start difference. First operand 22237 states and 67962 transitions. Second operand 11 states. [2019-12-18 20:50:54,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:50:54,264 INFO L93 Difference]: Finished difference Result 29945 states and 90899 transitions. [2019-12-18 20:50:54,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-18 20:50:54,265 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 66 [2019-12-18 20:50:54,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:50:54,303 INFO L225 Difference]: With dead ends: 29945 [2019-12-18 20:50:54,303 INFO L226 Difference]: Without dead ends: 25755 [2019-12-18 20:50:54,303 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2019-12-18 20:50:54,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25755 states. [2019-12-18 20:50:54,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25755 to 22117. [2019-12-18 20:50:54,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22117 states. [2019-12-18 20:50:54,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22117 states to 22117 states and 67604 transitions. [2019-12-18 20:50:54,661 INFO L78 Accepts]: Start accepts. Automaton has 22117 states and 67604 transitions. Word has length 66 [2019-12-18 20:50:54,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:50:54,661 INFO L462 AbstractCegarLoop]: Abstraction has 22117 states and 67604 transitions. [2019-12-18 20:50:54,661 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 20:50:54,661 INFO L276 IsEmpty]: Start isEmpty. Operand 22117 states and 67604 transitions. [2019-12-18 20:50:54,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 20:50:54,686 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:50:54,686 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-18 20:50:54,686 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-18 20:50:54,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:50:54,686 INFO L82 PathProgramCache]: Analyzing trace with hash 1716780679, now seen corresponding path program 7 times [2019-12-18 20:50:54,686 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:50:54,686 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508355744] [2019-12-18 20:50:54,686 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:50:54,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:50:54,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:50:54,763 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508355744] [2019-12-18 20:50:54,763 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:50:54,763 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 20:50:54,763 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251670402] [2019-12-18 20:50:54,763 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 20:50:54,764 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:50:54,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 20:50:54,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 20:50:54,764 INFO L87 Difference]: Start difference. First operand 22117 states and 67604 transitions. Second operand 4 states. [2019-12-18 20:50:54,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:50:54,991 INFO L93 Difference]: Finished difference Result 25925 states and 78557 transitions. [2019-12-18 20:50:54,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:50:54,991 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-12-18 20:50:54,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:50:55,054 INFO L225 Difference]: With dead ends: 25925 [2019-12-18 20:50:55,054 INFO L226 Difference]: Without dead ends: 25925 [2019-12-18 20:50:55,055 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-18 20:50:55,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25925 states. [2019-12-18 20:50:55,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25925 to 21908. [2019-12-18 20:50:55,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21908 states. [2019-12-18 20:50:55,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21908 states to 21908 states and 66965 transitions. [2019-12-18 20:50:55,745 INFO L78 Accepts]: Start accepts. Automaton has 21908 states and 66965 transitions. Word has length 66 [2019-12-18 20:50:55,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:50:55,745 INFO L462 AbstractCegarLoop]: Abstraction has 21908 states and 66965 transitions. [2019-12-18 20:50:55,745 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 20:50:55,745 INFO L276 IsEmpty]: Start isEmpty. Operand 21908 states and 66965 transitions. [2019-12-18 20:50:55,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 20:50:55,777 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:50:55,778 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-18 20:50:55,778 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-18 20:50:55,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:50:55,778 INFO L82 PathProgramCache]: Analyzing trace with hash 1309527475, now seen corresponding path program 1 times [2019-12-18 20:50:55,778 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:50:55,778 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533210158] [2019-12-18 20:50:55,779 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:50:55,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:50:56,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:50:56,446 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533210158] [2019-12-18 20:50:56,446 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:50:56,446 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 20:50:56,446 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874835974] [2019-12-18 20:50:56,447 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 20:50:56,447 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:50:56,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 20:50:56,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2019-12-18 20:50:56,448 INFO L87 Difference]: Start difference. First operand 21908 states and 66965 transitions. Second operand 16 states. [2019-12-18 20:51:00,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:51:00,380 INFO L93 Difference]: Finished difference Result 34162 states and 102233 transitions. [2019-12-18 20:51:00,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-12-18 20:51:00,380 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 67 [2019-12-18 20:51:00,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:51:00,423 INFO L225 Difference]: With dead ends: 34162 [2019-12-18 20:51:00,423 INFO L226 Difference]: Without dead ends: 30997 [2019-12-18 20:51:00,424 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 0 SyntacticMatches, 5 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 471 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=359, Invalid=1533, Unknown=0, NotChecked=0, Total=1892 [2019-12-18 20:51:00,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30997 states. [2019-12-18 20:51:00,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30997 to 22446. [2019-12-18 20:51:00,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22446 states. [2019-12-18 20:51:00,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22446 states to 22446 states and 68289 transitions. [2019-12-18 20:51:00,799 INFO L78 Accepts]: Start accepts. Automaton has 22446 states and 68289 transitions. Word has length 67 [2019-12-18 20:51:00,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:51:00,799 INFO L462 AbstractCegarLoop]: Abstraction has 22446 states and 68289 transitions. [2019-12-18 20:51:00,799 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 20:51:00,800 INFO L276 IsEmpty]: Start isEmpty. Operand 22446 states and 68289 transitions. [2019-12-18 20:51:00,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 20:51:00,821 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:51:00,821 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-18 20:51:00,821 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-18 20:51:00,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:51:00,822 INFO L82 PathProgramCache]: Analyzing trace with hash -1532450363, now seen corresponding path program 2 times [2019-12-18 20:51:00,822 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:51:00,822 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454162787] [2019-12-18 20:51:00,822 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:51:00,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:51:01,227 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:51:01,227 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454162787] [2019-12-18 20:51:01,227 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:51:01,227 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 20:51:01,227 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960665200] [2019-12-18 20:51:01,228 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 20:51:01,228 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:51:01,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 20:51:01,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2019-12-18 20:51:01,228 INFO L87 Difference]: Start difference. First operand 22446 states and 68289 transitions. Second operand 16 states. [2019-12-18 20:51:05,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:51:05,740 INFO L93 Difference]: Finished difference Result 36918 states and 110886 transitions. [2019-12-18 20:51:05,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-12-18 20:51:05,740 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 67 [2019-12-18 20:51:05,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:51:05,787 INFO L225 Difference]: With dead ends: 36918 [2019-12-18 20:51:05,787 INFO L226 Difference]: Without dead ends: 32150 [2019-12-18 20:51:05,788 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 1 SyntacticMatches, 5 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 886 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=425, Invalid=3115, Unknown=0, NotChecked=0, Total=3540 [2019-12-18 20:51:05,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32150 states. [2019-12-18 20:51:06,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32150 to 24348. [2019-12-18 20:51:06,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24348 states. [2019-12-18 20:51:06,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24348 states to 24348 states and 73867 transitions. [2019-12-18 20:51:06,395 INFO L78 Accepts]: Start accepts. Automaton has 24348 states and 73867 transitions. Word has length 67 [2019-12-18 20:51:06,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:51:06,396 INFO L462 AbstractCegarLoop]: Abstraction has 24348 states and 73867 transitions. [2019-12-18 20:51:06,396 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 20:51:06,396 INFO L276 IsEmpty]: Start isEmpty. Operand 24348 states and 73867 transitions. [2019-12-18 20:51:06,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 20:51:06,424 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:51:06,424 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-18 20:51:06,424 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-18 20:51:06,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:51:06,424 INFO L82 PathProgramCache]: Analyzing trace with hash -810277501, now seen corresponding path program 3 times [2019-12-18 20:51:06,425 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:51:06,425 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086318631] [2019-12-18 20:51:06,425 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:51:06,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:51:06,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:51:06,728 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086318631] [2019-12-18 20:51:06,729 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:51:06,729 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 20:51:06,729 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610300638] [2019-12-18 20:51:06,730 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 20:51:06,730 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:51:06,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 20:51:06,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-18 20:51:06,731 INFO L87 Difference]: Start difference. First operand 24348 states and 73867 transitions. Second operand 12 states. [2019-12-18 20:51:08,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:51:08,858 INFO L93 Difference]: Finished difference Result 33681 states and 100978 transitions. [2019-12-18 20:51:08,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 20:51:08,858 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 67 [2019-12-18 20:51:08,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:51:08,901 INFO L225 Difference]: With dead ends: 33681 [2019-12-18 20:51:08,901 INFO L226 Difference]: Without dead ends: 30158 [2019-12-18 20:51:08,902 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=124, Invalid=476, Unknown=0, NotChecked=0, Total=600 [2019-12-18 20:51:08,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30158 states. [2019-12-18 20:51:09,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30158 to 23258. [2019-12-18 20:51:09,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23258 states. [2019-12-18 20:51:09,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23258 states to 23258 states and 70833 transitions. [2019-12-18 20:51:09,309 INFO L78 Accepts]: Start accepts. Automaton has 23258 states and 70833 transitions. Word has length 67 [2019-12-18 20:51:09,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:51:09,309 INFO L462 AbstractCegarLoop]: Abstraction has 23258 states and 70833 transitions. [2019-12-18 20:51:09,309 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 20:51:09,309 INFO L276 IsEmpty]: Start isEmpty. Operand 23258 states and 70833 transitions. [2019-12-18 20:51:09,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 20:51:09,337 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:51:09,337 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-18 20:51:09,337 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-18 20:51:09,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:51:09,337 INFO L82 PathProgramCache]: Analyzing trace with hash -1426167887, now seen corresponding path program 4 times [2019-12-18 20:51:09,338 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:51:09,338 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983569139] [2019-12-18 20:51:09,338 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:51:09,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:51:09,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:51:09,658 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983569139] [2019-12-18 20:51:09,658 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:51:09,658 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-18 20:51:09,658 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848294702] [2019-12-18 20:51:09,659 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-18 20:51:09,659 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:51:09,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-18 20:51:09,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2019-12-18 20:51:09,660 INFO L87 Difference]: Start difference. First operand 23258 states and 70833 transitions. Second operand 14 states. [2019-12-18 20:51:12,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:51:12,358 INFO L93 Difference]: Finished difference Result 33574 states and 101107 transitions. [2019-12-18 20:51:12,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-12-18 20:51:12,358 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 67 [2019-12-18 20:51:12,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:51:12,399 INFO L225 Difference]: With dead ends: 33574 [2019-12-18 20:51:12,399 INFO L226 Difference]: Without dead ends: 28948 [2019-12-18 20:51:12,400 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 303 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=307, Invalid=1333, Unknown=0, NotChecked=0, Total=1640 [2019-12-18 20:51:12,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28948 states. [2019-12-18 20:51:12,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28948 to 21607. [2019-12-18 20:51:12,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21607 states. [2019-12-18 20:51:13,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21607 states to 21607 states and 65958 transitions. [2019-12-18 20:51:13,047 INFO L78 Accepts]: Start accepts. Automaton has 21607 states and 65958 transitions. Word has length 67 [2019-12-18 20:51:13,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:51:13,047 INFO L462 AbstractCegarLoop]: Abstraction has 21607 states and 65958 transitions. [2019-12-18 20:51:13,047 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-18 20:51:13,047 INFO L276 IsEmpty]: Start isEmpty. Operand 21607 states and 65958 transitions. [2019-12-18 20:51:13,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 20:51:13,070 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:51:13,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, 1] [2019-12-18 20:51:13,071 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-18 20:51:13,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:51:13,071 INFO L82 PathProgramCache]: Analyzing trace with hash 776047703, now seen corresponding path program 5 times [2019-12-18 20:51:13,071 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:51:13,071 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182683443] [2019-12-18 20:51:13,071 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:51:13,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:51:13,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:51:13,374 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182683443] [2019-12-18 20:51:13,374 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:51:13,374 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 20:51:13,374 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009701453] [2019-12-18 20:51:13,375 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-18 20:51:13,375 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:51:13,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-18 20:51:13,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2019-12-18 20:51:13,376 INFO L87 Difference]: Start difference. First operand 21607 states and 65958 transitions. Second operand 13 states. [2019-12-18 20:51:15,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:51:15,096 INFO L93 Difference]: Finished difference Result 26981 states and 81636 transitions. [2019-12-18 20:51:15,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-18 20:51:15,097 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 67 [2019-12-18 20:51:15,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:51:15,135 INFO L225 Difference]: With dead ends: 26981 [2019-12-18 20:51:15,135 INFO L226 Difference]: Without dead ends: 25788 [2019-12-18 20:51:15,135 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=111, Invalid=441, Unknown=0, NotChecked=0, Total=552 [2019-12-18 20:51:15,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25788 states. [2019-12-18 20:51:15,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25788 to 21425. [2019-12-18 20:51:15,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21425 states. [2019-12-18 20:51:15,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21425 states to 21425 states and 65492 transitions. [2019-12-18 20:51:15,486 INFO L78 Accepts]: Start accepts. Automaton has 21425 states and 65492 transitions. Word has length 67 [2019-12-18 20:51:15,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:51:15,486 INFO L462 AbstractCegarLoop]: Abstraction has 21425 states and 65492 transitions. [2019-12-18 20:51:15,486 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-18 20:51:15,486 INFO L276 IsEmpty]: Start isEmpty. Operand 21425 states and 65492 transitions. [2019-12-18 20:51:15,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 20:51:15,508 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:51:15,508 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-18 20:51:15,508 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-18 20:51:15,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:51:15,509 INFO L82 PathProgramCache]: Analyzing trace with hash -185379867, now seen corresponding path program 6 times [2019-12-18 20:51:15,509 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:51:15,509 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139356058] [2019-12-18 20:51:15,509 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:51:15,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 20:51:15,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 20:51:15,630 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 20:51:15,630 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 20:51:15,634 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_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t660~0.base_21| 4)) (= 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) (= 0 v_~z$flush_delayed~0_13) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t660~0.base_21|) (= 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) (< 0 |v_#StackHeapBarrier_15|) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t660~0.base_21|)) (= v_~z$read_delayed_var~0.base_6 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t660~0.base_21| 1) |v_#valid_60|) (= 0 v_~z$w_buff1_used~0_73) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t660~0.base_21| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t660~0.base_21|) |v_ULTIMATE.start_main_~#t660~0.offset_16| 0)) |v_#memory_int_19|) (= v_~y~0_15 0) (= 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) (= 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) (= |v_ULTIMATE.start_main_~#t660~0.offset_16| 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) (= 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_~#t662~0.base=|v_ULTIMATE.start_main_~#t662~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_#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, ULTIMATE.start_main_~#t660~0.offset=|v_ULTIMATE.start_main_~#t660~0.offset_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_#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, ~x~0=v_~x~0_10, ULTIMATE.start_main_~#t661~0.offset=|v_ULTIMATE.start_main_~#t661~0.offset_15|, ~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_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_9|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_24, ULTIMATE.start_main_~#t660~0.base=|v_ULTIMATE.start_main_~#t660~0.base_21|, ~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_~#t662~0.offset=|v_ULTIMATE.start_main_~#t662~0.offset_15|, 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, ULTIMATE.start_main_~#t661~0.base=|v_ULTIMATE.start_main_~#t661~0.base_20|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t662~0.base, ~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ULTIMATE.start_main_~#t660~0.offset, #length, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, 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, ~x~0, ULTIMATE.start_main_~#t661~0.offset, ~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_#t~ite51, ~z$r_buff1_thd0~0, ULTIMATE.start_main_~#t660~0.base, ~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_~#t662~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0, ULTIMATE.start_main_~#t661~0.base] because there is no mapped edge [2019-12-18 20:51:15,636 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-18 20:51:15,636 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [859] [859] L825-1-->L827: Formula: (and (not (= 0 |v_ULTIMATE.start_main_~#t661~0.base_11|)) (= (store |v_#valid_32| |v_ULTIMATE.start_main_~#t661~0.base_11| 1) |v_#valid_31|) (= |v_#memory_int_13| (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t661~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t661~0.base_11|) |v_ULTIMATE.start_main_~#t661~0.offset_10| 1))) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t661~0.base_11| 4) |v_#length_15|) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t661~0.base_11|) (= |v_ULTIMATE.start_main_~#t661~0.offset_10| 0) (= 0 (select |v_#valid_32| |v_ULTIMATE.start_main_~#t661~0.base_11|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t661~0.offset=|v_ULTIMATE.start_main_~#t661~0.offset_10|, #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_~#t661~0.base=|v_ULTIMATE.start_main_~#t661~0.base_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t661~0.offset, ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, #length, ULTIMATE.start_main_~#t661~0.base] because there is no mapped edge [2019-12-18 20:51:15,638 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [855] [855] L827-1-->L829: Formula: (and (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t662~0.base_12| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t662~0.base_12|) |v_ULTIMATE.start_main_~#t662~0.offset_10| 2)) |v_#memory_int_11|) (not (= |v_ULTIMATE.start_main_~#t662~0.base_12| 0)) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t662~0.base_12|) (= (store |v_#length_14| |v_ULTIMATE.start_main_~#t662~0.base_12| 4) |v_#length_13|) (= 0 (select |v_#valid_30| |v_ULTIMATE.start_main_~#t662~0.base_12|)) (= |v_#valid_29| (store |v_#valid_30| |v_ULTIMATE.start_main_~#t662~0.base_12| 1)) (= |v_ULTIMATE.start_main_~#t662~0.offset_10| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_30|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_~#t662~0.offset=|v_ULTIMATE.start_main_~#t662~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_~#t662~0.base=|v_ULTIMATE.start_main_~#t662~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_~#t662~0.offset, ULTIMATE.start_main_~#t662~0.base, #valid, ULTIMATE.start_main_#t~nondet45, #memory_int, #length] because there is no mapped edge [2019-12-18 20:51:15,641 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [843] [843] L766-2-->L766-5: Formula: (let ((.cse0 (= |P1Thread1of1ForFork2_#t~ite9_Out1570075152| |P1Thread1of1ForFork2_#t~ite10_Out1570075152|)) (.cse2 (= 0 (mod ~z$r_buff1_thd2~0_In1570075152 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In1570075152 256)))) (or (and .cse0 (= |P1Thread1of1ForFork2_#t~ite9_Out1570075152| ~z~0_In1570075152) (or .cse1 .cse2)) (and .cse0 (not .cse2) (= |P1Thread1of1ForFork2_#t~ite9_Out1570075152| ~z$w_buff1~0_In1570075152) (not .cse1)))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1570075152, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1570075152, ~z$w_buff1~0=~z$w_buff1~0_In1570075152, ~z~0=~z~0_In1570075152} OutVars{P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out1570075152|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1570075152, P1Thread1of1ForFork2_#t~ite10=|P1Thread1of1ForFork2_#t~ite10_Out1570075152|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1570075152, ~z$w_buff1~0=~z$w_buff1~0_In1570075152, ~z~0=~z~0_In1570075152} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite10] because there is no mapped edge [2019-12-18 20:51:15,642 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [870] [870] L792-->L792-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1136653629 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite24_Out-1136653629| |P2Thread1of1ForFork0_#t~ite23_Out-1136653629|) .cse0 (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In-1136653629 256) 0))) (or (and .cse1 (= 0 (mod ~z$w_buff1_used~0_In-1136653629 256))) (and .cse1 (= 0 (mod ~z$r_buff1_thd3~0_In-1136653629 256))) (= 0 (mod ~z$w_buff0_used~0_In-1136653629 256)))) (= ~z$w_buff1~0_In-1136653629 |P2Thread1of1ForFork0_#t~ite23_Out-1136653629|)) (and (not .cse0) (= ~z$w_buff1~0_In-1136653629 |P2Thread1of1ForFork0_#t~ite24_Out-1136653629|) (= |P2Thread1of1ForFork0_#t~ite23_In-1136653629| |P2Thread1of1ForFork0_#t~ite23_Out-1136653629|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1136653629, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1136653629, P2Thread1of1ForFork0_#t~ite23=|P2Thread1of1ForFork0_#t~ite23_In-1136653629|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1136653629, ~z$w_buff1~0=~z$w_buff1~0_In-1136653629, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1136653629, ~weak$$choice2~0=~weak$$choice2~0_In-1136653629} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1136653629, P2Thread1of1ForFork0_#t~ite23=|P2Thread1of1ForFork0_#t~ite23_Out-1136653629|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1136653629, P2Thread1of1ForFork0_#t~ite24=|P2Thread1of1ForFork0_#t~ite24_Out-1136653629|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1136653629, ~z$w_buff1~0=~z$w_buff1~0_In-1136653629, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1136653629, ~weak$$choice2~0=~weak$$choice2~0_In-1136653629} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite23, P2Thread1of1ForFork0_#t~ite24] because there is no mapped edge [2019-12-18 20:51:15,644 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [882] [882] L794-->L794-8: Formula: (let ((.cse5 (= (mod ~z$w_buff1_used~0_In1397763898 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd3~0_In1397763898 256))) (.cse6 (= 0 (mod ~z$r_buff0_thd3~0_In1397763898 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In1397763898 256))) (.cse3 (= |P2Thread1of1ForFork0_#t~ite29_Out1397763898| |P2Thread1of1ForFork0_#t~ite30_Out1397763898|)) (.cse4 (= 0 (mod ~weak$$choice2~0_In1397763898 256)))) (or (let ((.cse2 (not .cse6))) (and (not .cse0) (or (not .cse1) .cse2) .cse3 (= 0 |P2Thread1of1ForFork0_#t~ite28_Out1397763898|) .cse4 (= |P2Thread1of1ForFork0_#t~ite29_Out1397763898| |P2Thread1of1ForFork0_#t~ite28_Out1397763898|) (or (not .cse5) .cse2))) (and (or (and (or (and .cse6 .cse5) (and .cse1 .cse6) .cse0) .cse3 .cse4 (= |P2Thread1of1ForFork0_#t~ite29_Out1397763898| ~z$w_buff1_used~0_In1397763898)) (and (= ~z$w_buff1_used~0_In1397763898 |P2Thread1of1ForFork0_#t~ite30_Out1397763898|) (not .cse4) (= |P2Thread1of1ForFork0_#t~ite29_Out1397763898| |P2Thread1of1ForFork0_#t~ite29_In1397763898|))) (= |P2Thread1of1ForFork0_#t~ite28_In1397763898| |P2Thread1of1ForFork0_#t~ite28_Out1397763898|)))) InVars {P2Thread1of1ForFork0_#t~ite28=|P2Thread1of1ForFork0_#t~ite28_In1397763898|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1397763898, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1397763898, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1397763898, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1397763898, ~weak$$choice2~0=~weak$$choice2~0_In1397763898, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_In1397763898|} OutVars{P2Thread1of1ForFork0_#t~ite28=|P2Thread1of1ForFork0_#t~ite28_Out1397763898|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1397763898, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1397763898, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1397763898, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1397763898, P2Thread1of1ForFork0_#t~ite30=|P2Thread1of1ForFork0_#t~ite30_Out1397763898|, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_Out1397763898|, ~weak$$choice2~0=~weak$$choice2~0_In1397763898} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite28, P2Thread1of1ForFork0_#t~ite30, P2Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-18 20:51:15,645 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-18 20:51:15,646 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-18 20:51:15,646 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [819] [819] L802-2-->L802-5: Formula: (let ((.cse0 (= |P2Thread1of1ForFork0_#t~ite38_Out1535740364| |P2Thread1of1ForFork0_#t~ite39_Out1535740364|)) (.cse2 (= (mod ~z$r_buff1_thd3~0_In1535740364 256) 0)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In1535740364 256)))) (or (and .cse0 (= |P2Thread1of1ForFork0_#t~ite38_Out1535740364| ~z~0_In1535740364) (or .cse1 .cse2)) (and .cse0 (= |P2Thread1of1ForFork0_#t~ite38_Out1535740364| ~z$w_buff1~0_In1535740364) (not .cse2) (not .cse1)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1535740364, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1535740364, ~z$w_buff1~0=~z$w_buff1~0_In1535740364, ~z~0=~z~0_In1535740364} OutVars{P2Thread1of1ForFork0_#t~ite39=|P2Thread1of1ForFork0_#t~ite39_Out1535740364|, P2Thread1of1ForFork0_#t~ite38=|P2Thread1of1ForFork0_#t~ite38_Out1535740364|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1535740364, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1535740364, ~z$w_buff1~0=~z$w_buff1~0_In1535740364, ~z~0=~z~0_In1535740364} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite39, P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-18 20:51:15,647 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [823] [823] L803-->L803-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In227261433 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In227261433 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite40_Out227261433| ~z$w_buff0_used~0_In227261433) (or .cse0 .cse1)) (and (= |P2Thread1of1ForFork0_#t~ite40_Out227261433| 0) (not .cse1) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In227261433, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In227261433} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In227261433, P2Thread1of1ForFork0_#t~ite40=|P2Thread1of1ForFork0_#t~ite40_Out227261433|, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In227261433} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite40] because there is no mapped edge [2019-12-18 20:51:15,648 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [818] [818] L804-->L804-2: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff0_used~0_In654966931 256))) (.cse3 (= 0 (mod ~z$r_buff0_thd3~0_In654966931 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In654966931 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd3~0_In654966931 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P2Thread1of1ForFork0_#t~ite41_Out654966931| ~z$w_buff1_used~0_In654966931)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= |P2Thread1of1ForFork0_#t~ite41_Out654966931| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In654966931, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In654966931, ~z$w_buff1_used~0=~z$w_buff1_used~0_In654966931, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In654966931} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In654966931, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In654966931, ~z$w_buff1_used~0=~z$w_buff1_used~0_In654966931, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In654966931, P2Thread1of1ForFork0_#t~ite41=|P2Thread1of1ForFork0_#t~ite41_Out654966931|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite41] because there is no mapped edge [2019-12-18 20:51:15,648 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L805-->L805-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-1851048468 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1851048468 256)))) (or (and (= ~z$r_buff0_thd3~0_In-1851048468 |P2Thread1of1ForFork0_#t~ite42_Out-1851048468|) (or .cse0 .cse1)) (and (not .cse1) (= 0 |P2Thread1of1ForFork0_#t~ite42_Out-1851048468|) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1851048468, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1851048468} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1851048468, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1851048468, P2Thread1of1ForFork0_#t~ite42=|P2Thread1of1ForFork0_#t~ite42_Out-1851048468|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-18 20:51:15,649 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [835] [835] L806-->L806-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In-1089374552 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1089374552 256))) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In-1089374552 256))) (.cse2 (= 0 (mod ~z$r_buff1_thd3~0_In-1089374552 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork0_#t~ite43_Out-1089374552| 0)) (and (or .cse1 .cse0) (= |P2Thread1of1ForFork0_#t~ite43_Out-1089374552| ~z$r_buff1_thd3~0_In-1089374552) (or .cse3 .cse2)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1089374552, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1089374552, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1089374552, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1089374552} OutVars{P2Thread1of1ForFork0_#t~ite43=|P2Thread1of1ForFork0_#t~ite43_Out-1089374552|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1089374552, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1089374552, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1089374552, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1089374552} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite43] because there is no mapped edge [2019-12-18 20:51:15,649 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-18 20:51:15,650 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [838] [838] L747-->L747-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd1~0_In-2022006577 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In-2022006577 256) 0))) (or (and (not .cse0) (= |P0Thread1of1ForFork1_#t~ite5_Out-2022006577| 0) (not .cse1)) (and (= ~z$w_buff0_used~0_In-2022006577 |P0Thread1of1ForFork1_#t~ite5_Out-2022006577|) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-2022006577, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-2022006577} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out-2022006577|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2022006577, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-2022006577} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-18 20:51:15,651 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [842] [842] L748-->L748-2: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff1_used~0_In96399663 256))) (.cse3 (= (mod ~z$r_buff1_thd1~0_In96399663 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In96399663 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd1~0_In96399663 256)))) (or (and (= 0 |P0Thread1of1ForFork1_#t~ite6_Out96399663|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= ~z$w_buff1_used~0_In96399663 |P0Thread1of1ForFork1_#t~ite6_Out96399663|) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In96399663, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In96399663, ~z$w_buff1_used~0=~z$w_buff1_used~0_In96399663, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In96399663} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In96399663, P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out96399663|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In96399663, ~z$w_buff1_used~0=~z$w_buff1_used~0_In96399663, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In96399663} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-18 20:51:15,651 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [824] [824] L749-->L750: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-337145726 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd1~0_In-337145726 256)))) (or (and (not .cse0) (= ~z$r_buff0_thd1~0_Out-337145726 0) (not .cse1)) (and (= ~z$r_buff0_thd1~0_Out-337145726 ~z$r_buff0_thd1~0_In-337145726) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-337145726, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-337145726} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-337145726, P0Thread1of1ForFork1_#t~ite7=|P0Thread1of1ForFork1_#t~ite7_Out-337145726|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out-337145726} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 20:51:15,651 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [826] [826] L750-->L750-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff1_thd1~0_In1391545840 256))) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In1391545840 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd1~0_In1391545840 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In1391545840 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork1_#t~ite8_Out1391545840| 0)) (and (or .cse2 .cse3) (= |P0Thread1of1ForFork1_#t~ite8_Out1391545840| ~z$r_buff1_thd1~0_In1391545840) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1391545840, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1391545840, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1391545840, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1391545840} OutVars{P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out1391545840|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1391545840, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1391545840, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1391545840, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1391545840} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-18 20:51:15,652 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-18 20:51:15,652 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L767-->L767-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In804853791 256))) (.cse1 (= (mod ~z$r_buff0_thd2~0_In804853791 256) 0))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork2_#t~ite11_Out804853791| 0)) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork2_#t~ite11_Out804853791| ~z$w_buff0_used~0_In804853791)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In804853791, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In804853791} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In804853791, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out804853791|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In804853791} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-18 20:51:15,652 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L768-->L768-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In968806814 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd2~0_In968806814 256) 0)) (.cse2 (= 0 (mod ~z$r_buff1_thd2~0_In968806814 256))) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In968806814 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork2_#t~ite12_Out968806814| ~z$w_buff1_used~0_In968806814)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork2_#t~ite12_Out968806814| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In968806814, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In968806814, ~z$w_buff1_used~0=~z$w_buff1_used~0_In968806814, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In968806814} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In968806814, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In968806814, ~z$w_buff1_used~0=~z$w_buff1_used~0_In968806814, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out968806814|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In968806814} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-18 20:51:15,653 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L769-->L769-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-2084084457 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In-2084084457 256)))) (or (and (= |P1Thread1of1ForFork2_#t~ite13_Out-2084084457| ~z$r_buff0_thd2~0_In-2084084457) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |P1Thread1of1ForFork2_#t~ite13_Out-2084084457| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-2084084457, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-2084084457} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-2084084457, P1Thread1of1ForFork2_#t~ite13=|P1Thread1of1ForFork2_#t~ite13_Out-2084084457|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-2084084457} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite13] because there is no mapped edge [2019-12-18 20:51:15,654 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] L770-->L770-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In1229335800 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In1229335800 256))) (.cse2 (= (mod ~z$w_buff1_used~0_In1229335800 256) 0)) (.cse3 (= 0 (mod ~z$r_buff1_thd2~0_In1229335800 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork2_#t~ite14_Out1229335800| ~z$r_buff1_thd2~0_In1229335800)) (and (= 0 |P1Thread1of1ForFork2_#t~ite14_Out1229335800|) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1229335800, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1229335800, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1229335800, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1229335800} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1229335800, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1229335800, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1229335800, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out1229335800|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1229335800} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-18 20:51:15,654 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-18 20:51:15,654 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-18 20:51:15,655 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L835-2-->L835-4: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In-269124084 256))) (.cse1 (= (mod ~z$w_buff1_used~0_In-269124084 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite47_Out-269124084| ~z~0_In-269124084)) (and (= |ULTIMATE.start_main_#t~ite47_Out-269124084| ~z$w_buff1~0_In-269124084) (not .cse0) (not .cse1)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-269124084, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-269124084, ~z$w_buff1~0=~z$w_buff1~0_In-269124084, ~z~0=~z~0_In-269124084} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-269124084, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out-269124084|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-269124084, ~z$w_buff1~0=~z$w_buff1~0_In-269124084, ~z~0=~z~0_In-269124084} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47] because there is no mapped edge [2019-12-18 20:51:15,655 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-18 20:51:15,655 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [830] [830] L836-->L836-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In1261142528 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In1261142528 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite49_Out1261142528| 0)) (and (= |ULTIMATE.start_main_#t~ite49_Out1261142528| ~z$w_buff0_used~0_In1261142528) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1261142528, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1261142528} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1261142528, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1261142528, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out1261142528|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-18 20:51:15,656 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [817] [817] L837-->L837-2: Formula: (let ((.cse3 (= 0 (mod ~z$w_buff0_used~0_In-338723976 256))) (.cse2 (= (mod ~z$r_buff0_thd0~0_In-338723976 256) 0)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In-338723976 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In-338723976 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite50_Out-338723976|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= ~z$w_buff1_used~0_In-338723976 |ULTIMATE.start_main_#t~ite50_Out-338723976|) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-338723976, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-338723976, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-338723976, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-338723976} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out-338723976|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-338723976, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-338723976, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-338723976, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-338723976} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-18 20:51:15,657 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L838-->L838-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In23917037 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In23917037 256)))) (or (and (or .cse0 .cse1) (= ~z$r_buff0_thd0~0_In23917037 |ULTIMATE.start_main_#t~ite51_Out23917037|)) (and (not .cse1) (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite51_Out23917037|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In23917037, ~z$w_buff0_used~0=~z$w_buff0_used~0_In23917037} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In23917037, ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out23917037|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In23917037} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-18 20:51:15,657 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L839-->L839-2: Formula: (let ((.cse3 (= 0 (mod ~z$r_buff1_thd0~0_In2027478467 256))) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In2027478467 256))) (.cse0 (= (mod ~z$r_buff0_thd0~0_In2027478467 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In2027478467 256) 0))) (or (and (or .cse0 .cse1) (= ~z$r_buff1_thd0~0_In2027478467 |ULTIMATE.start_main_#t~ite52_Out2027478467|) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite52_Out2027478467|) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2027478467, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2027478467, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In2027478467, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2027478467} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out2027478467|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2027478467, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2027478467, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In2027478467, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2027478467} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-18 20:51:15,658 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-18 20:51:15,763 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 08:51:15 BasicIcfg [2019-12-18 20:51:15,763 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 20:51:15,765 INFO L168 Benchmark]: Toolchain (without parser) took 146572.38 ms. Allocated memory was 145.8 MB in the beginning and 3.4 GB in the end (delta: 3.3 GB). Free memory was 102.0 MB in the beginning and 1.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. [2019-12-18 20:51:15,768 INFO L168 Benchmark]: CDTParser took 1.37 ms. Allocated memory is still 145.8 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-18 20:51:15,769 INFO L168 Benchmark]: CACSL2BoogieTranslator took 758.40 ms. Allocated memory was 145.8 MB in the beginning and 202.9 MB in the end (delta: 57.1 MB). Free memory was 101.6 MB in the beginning and 156.2 MB in the end (delta: -54.6 MB). Peak memory consumption was 22.1 MB. Max. memory is 7.1 GB. [2019-12-18 20:51:15,769 INFO L168 Benchmark]: Boogie Procedure Inliner took 74.03 ms. Allocated memory is still 202.9 MB. Free memory was 156.2 MB in the beginning and 153.5 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-18 20:51:15,769 INFO L168 Benchmark]: Boogie Preprocessor took 38.57 ms. Allocated memory is still 202.9 MB. Free memory was 153.5 MB in the beginning and 150.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-18 20:51:15,769 INFO L168 Benchmark]: RCFGBuilder took 848.85 ms. Allocated memory is still 202.9 MB. Free memory was 150.9 MB in the beginning and 101.0 MB in the end (delta: 49.9 MB). Peak memory consumption was 49.9 MB. Max. memory is 7.1 GB. [2019-12-18 20:51:15,770 INFO L168 Benchmark]: TraceAbstraction took 144847.45 ms. Allocated memory was 202.9 MB in the beginning and 3.4 GB in the end (delta: 3.2 GB). Free memory was 100.4 MB in the beginning and 1.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 1.7 GB. Max. memory is 7.1 GB. [2019-12-18 20:51:15,772 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.37 ms. Allocated memory is still 145.8 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 758.40 ms. Allocated memory was 145.8 MB in the beginning and 202.9 MB in the end (delta: 57.1 MB). Free memory was 101.6 MB in the beginning and 156.2 MB in the end (delta: -54.6 MB). Peak memory consumption was 22.1 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 74.03 ms. Allocated memory is still 202.9 MB. Free memory was 156.2 MB in the beginning and 153.5 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 38.57 ms. Allocated memory is still 202.9 MB. Free memory was 153.5 MB in the beginning and 150.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 848.85 ms. Allocated memory is still 202.9 MB. Free memory was 150.9 MB in the beginning and 101.0 MB in the end (delta: 49.9 MB). Peak memory consumption was 49.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 144847.45 ms. Allocated memory was 202.9 MB in the beginning and 3.4 GB in the end (delta: 3.2 GB). Free memory was 100.4 MB in the beginning and 1.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 1.7 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(&t660, ((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(&t661, ((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(&t662, ((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.5s, OverallIterations: 41, TraceHistogramMax: 1, AutomataDifference: 70.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 9710 SDtfs, 11816 SDslu, 38448 SDs, 0 SdLazy, 38379 SolverSat, 719 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 31.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 744 GetRequests, 72 SyntacticMatches, 46 SemanticMatches, 626 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6944 ImplicationChecksByTransitivity, 13.0s 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: 41.1s AutomataMinimizationTime, 40 MinimizatonAttempts, 251671 StatesRemovedByMinimization, 37 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 6.5s InterpolantComputationTime, 1808 NumberOfCodeBlocks, 1808 NumberOfCodeBlocksAsserted, 41 NumberOfCheckSat, 1701 ConstructedInterpolants, 0 QuantifiedInterpolants, 559340 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 40 InterpolantComputations, 40 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...