/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/seq-pthread/cs_stateful-2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-10 01:50:00,571 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-10 01:50:00,604 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-10 01:50:00,624 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-10 01:50:00,624 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-10 01:50:00,625 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-10 01:50:00,626 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-10 01:50:00,627 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-10 01:50:00,628 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-10 01:50:00,628 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-10 01:50:00,629 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-10 01:50:00,629 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-10 01:50:00,630 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-10 01:50:00,630 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-10 01:50:00,631 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-10 01:50:00,631 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-10 01:50:00,632 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-10 01:50:00,632 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-10 01:50:00,634 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-10 01:50:00,635 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-10 01:50:00,636 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-10 01:50:00,637 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-10 01:50:00,637 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-10 01:50:00,638 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-10 01:50:00,640 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-10 01:50:00,640 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-10 01:50:00,640 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-10 01:50:00,641 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-10 01:50:00,641 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-10 01:50:00,641 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-10 01:50:00,642 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-10 01:50:00,642 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-10 01:50:00,643 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-10 01:50:00,643 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-10 01:50:00,644 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-10 01:50:00,644 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-10 01:50:00,644 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-10 01:50:00,644 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-10 01:50:00,645 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-10 01:50:00,645 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-10 01:50:00,646 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-10 01:50:00,659 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_Default.epf [2022-01-10 01:50:00,676 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-10 01:50:00,676 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-10 01:50:00,676 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-10 01:50:00,676 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-10 01:50:00,677 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-10 01:50:00,677 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-10 01:50:00,677 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-10 01:50:00,677 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-10 01:50:00,677 INFO L138 SettingsManager]: * Use SBE=true [2022-01-10 01:50:00,677 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-10 01:50:00,677 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-10 01:50:00,678 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-10 01:50:00,678 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-10 01:50:00,678 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-10 01:50:00,678 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-10 01:50:00,678 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-10 01:50:00,678 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-10 01:50:00,678 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-10 01:50:00,678 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-10 01:50:00,678 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-10 01:50:00,678 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-10 01:50:00,678 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 01:50:00,678 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-10 01:50:00,679 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-10 01:50:00,679 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-10 01:50:00,679 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-10 01:50:00,679 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-10 01:50:00,679 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-10 01:50:00,679 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-10 01:50:00,679 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-10 01:50:00,679 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-01-10 01:50:00,823 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-10 01:50:00,839 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-10 01:50:00,842 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-10 01:50:00,843 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-10 01:50:00,844 INFO L275 PluginConnector]: CDTParser initialized [2022-01-10 01:50:00,844 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-pthread/cs_stateful-2.i [2022-01-10 01:50:00,892 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f9fa5948c/dde239ee77344796af1ec08bd9b49cab/FLAGd0f7d4570 [2022-01-10 01:50:01,281 INFO L306 CDTParser]: Found 1 translation units. [2022-01-10 01:50:01,282 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-pthread/cs_stateful-2.i [2022-01-10 01:50:01,295 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f9fa5948c/dde239ee77344796af1ec08bd9b49cab/FLAGd0f7d4570 [2022-01-10 01:50:01,306 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f9fa5948c/dde239ee77344796af1ec08bd9b49cab [2022-01-10 01:50:01,308 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-10 01:50:01,310 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-10 01:50:01,313 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-10 01:50:01,313 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-10 01:50:01,315 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-10 01:50:01,316 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:50:01" (1/1) ... [2022-01-10 01:50:01,316 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78d557a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:50:01, skipping insertion in model container [2022-01-10 01:50:01,317 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:50:01" (1/1) ... [2022-01-10 01:50:01,322 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-10 01:50:01,370 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 01:50:01,583 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-pthread/cs_stateful-2.i[23607,23620] [2022-01-10 01:50:01,651 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 01:50:01,658 INFO L203 MainTranslator]: Completed pre-run [2022-01-10 01:50:01,683 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-pthread/cs_stateful-2.i[23607,23620] [2022-01-10 01:50:01,718 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 01:50:01,749 INFO L208 MainTranslator]: Completed translation [2022-01-10 01:50:01,749 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:50:01 WrapperNode [2022-01-10 01:50:01,749 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-10 01:50:01,750 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-10 01:50:01,750 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-10 01:50:01,750 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-10 01:50:01,755 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:50:01" (1/1) ... [2022-01-10 01:50:01,769 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:50:01" (1/1) ... [2022-01-10 01:50:01,798 INFO L137 Inliner]: procedures = 145, calls = 245, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 539 [2022-01-10 01:50:01,799 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-10 01:50:01,799 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-10 01:50:01,800 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-10 01:50:01,800 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-10 01:50:01,808 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:50:01" (1/1) ... [2022-01-10 01:50:01,808 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:50:01" (1/1) ... [2022-01-10 01:50:01,814 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:50:01" (1/1) ... [2022-01-10 01:50:01,814 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:50:01" (1/1) ... [2022-01-10 01:50:01,840 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:50:01" (1/1) ... [2022-01-10 01:50:01,859 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:50:01" (1/1) ... [2022-01-10 01:50:01,862 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:50:01" (1/1) ... [2022-01-10 01:50:01,867 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-10 01:50:01,867 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-10 01:50:01,868 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-10 01:50:01,868 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-10 01:50:01,871 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:50:01" (1/1) ... [2022-01-10 01:50:01,879 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 01:50:01,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 01:50:01,900 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-01-10 01:50:01,902 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-01-10 01:50:01,948 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-01-10 01:50:01,948 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-10 01:50:01,948 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-01-10 01:50:01,948 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-01-10 01:50:01,948 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-10 01:50:01,948 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-10 01:50:01,948 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-01-10 01:50:01,949 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_mutex_init [2022-01-10 01:50:01,949 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_mutex_init [2022-01-10 01:50:01,949 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_mutex_lock [2022-01-10 01:50:01,949 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_mutex_lock [2022-01-10 01:50:01,949 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_create [2022-01-10 01:50:01,949 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_create [2022-01-10 01:50:01,949 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-01-10 01:50:01,949 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_join [2022-01-10 01:50:01,949 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_join [2022-01-10 01:50:01,956 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~$Pointer$ [2022-01-10 01:50:01,956 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~$Pointer$ [2022-01-10 01:50:01,956 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-10 01:50:01,956 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-01-10 01:50:01,956 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_cs [2022-01-10 01:50:01,956 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_cs [2022-01-10 01:50:01,956 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-10 01:50:01,956 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_mutex_unlock [2022-01-10 01:50:01,957 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_mutex_unlock [2022-01-10 01:50:01,957 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-10 01:50:01,957 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-10 01:50:02,074 INFO L234 CfgBuilder]: Building ICFG [2022-01-10 01:50:02,075 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-10 01:50:02,309 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L750: SUMMARY for call __CS_cs(); srcloc: null [2022-01-10 01:50:02,309 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L750-1: assume 0 != ~__CS_ret~0 % 256;main_thread_#res#1.base, main_thread_#res#1.offset := 0, 0;call ULTIMATE.dealloc(main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset);havoc main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset;call ULTIMATE.dealloc(main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset);havoc main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset; [2022-01-10 01:50:02,309 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L750-1: assume !(0 != ~__CS_ret~0 % 256); [2022-01-10 01:50:02,309 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##31: assume !(0 != ~__CS_ret~0 % 256); [2022-01-10 01:50:02,310 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##30: assume 0 != ~__CS_ret~0 % 256;main_thread_#res#1.base, main_thread_#res#1.offset := 0, 0;call ULTIMATE.dealloc(main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset);havoc main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset;call ULTIMATE.dealloc(main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset);havoc main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset; [2022-01-10 01:50:02,310 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##29: assume !(0 != ~__CS_ret~0 % 256); [2022-01-10 01:50:02,310 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##28: assume 0 != ~__CS_ret~0 % 256;main_thread_#res#1.base, main_thread_#res#1.offset := 0, 0;call ULTIMATE.dealloc(main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset);havoc main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset;call ULTIMATE.dealloc(main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset);havoc main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset; [2022-01-10 01:50:04,523 INFO L275 CfgBuilder]: Performing block encoding [2022-01-10 01:50:04,530 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-10 01:50:04,530 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-01-10 01:50:04,532 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:50:04 BoogieIcfgContainer [2022-01-10 01:50:04,532 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-10 01:50:04,534 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-10 01:50:04,534 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-10 01:50:04,536 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-10 01:50:04,536 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 01:50:01" (1/3) ... [2022-01-10 01:50:04,537 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f64f4a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:50:04, skipping insertion in model container [2022-01-10 01:50:04,537 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:50:01" (2/3) ... [2022-01-10 01:50:04,537 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f64f4a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:50:04, skipping insertion in model container [2022-01-10 01:50:04,537 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:50:04" (3/3) ... [2022-01-10 01:50:04,538 INFO L111 eAbstractionObserver]: Analyzing ICFG cs_stateful-2.i [2022-01-10 01:50:04,543 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-10 01:50:04,543 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-10 01:50:04,582 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-10 01:50:04,588 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-01-10 01:50:04,588 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-10 01:50:04,611 INFO L276 IsEmpty]: Start isEmpty. Operand has 175 states, 111 states have (on average 1.4504504504504505) internal successors, (161), 112 states have internal predecessors, (161), 54 states have call successors, (54), 8 states have call predecessors, (54), 8 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2022-01-10 01:50:04,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-01-10 01:50:04,621 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 01:50:04,622 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 01:50:04,622 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 01:50:04,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 01:50:04,626 INFO L85 PathProgramCache]: Analyzing trace with hash 246520095, now seen corresponding path program 1 times [2022-01-10 01:50:04,632 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 01:50:04,632 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634787486] [2022-01-10 01:50:04,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:50:04,633 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 01:50:04,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:04,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 01:50:04,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:04,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-01-10 01:50:04,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:04,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-01-10 01:50:04,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:05,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-01-10 01:50:05,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:05,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-01-10 01:50:05,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:05,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-01-10 01:50:05,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:05,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-01-10 01:50:05,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:05,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-01-10 01:50:05,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:05,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-01-10 01:50:05,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:05,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-01-10 01:50:05,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:05,071 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2022-01-10 01:50:05,072 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 01:50:05,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634787486] [2022-01-10 01:50:05,073 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634787486] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 01:50:05,073 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 01:50:05,073 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 01:50:05,075 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674877448] [2022-01-10 01:50:05,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 01:50:05,078 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-01-10 01:50:05,078 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 01:50:05,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-01-10 01:50:05,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-10 01:50:05,103 INFO L87 Difference]: Start difference. First operand has 175 states, 111 states have (on average 1.4504504504504505) internal successors, (161), 112 states have internal predecessors, (161), 54 states have call successors, (54), 8 states have call predecessors, (54), 8 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) Second operand has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2022-01-10 01:50:05,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 01:50:05,159 INFO L93 Difference]: Finished difference Result 348 states and 578 transitions. [2022-01-10 01:50:05,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-01-10 01:50:05,162 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 72 [2022-01-10 01:50:05,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 01:50:05,175 INFO L225 Difference]: With dead ends: 348 [2022-01-10 01:50:05,175 INFO L226 Difference]: Without dead ends: 171 [2022-01-10 01:50:05,180 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-10 01:50:05,182 INFO L933 BasicCegarLoop]: 265 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 01:50:05,186 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 01:50:05,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2022-01-10 01:50:05,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2022-01-10 01:50:05,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 108 states have (on average 1.4166666666666667) internal successors, (153), 108 states have internal predecessors, (153), 54 states have call successors, (54), 8 states have call predecessors, (54), 8 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2022-01-10 01:50:05,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 261 transitions. [2022-01-10 01:50:05,237 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 261 transitions. Word has length 72 [2022-01-10 01:50:05,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 01:50:05,237 INFO L470 AbstractCegarLoop]: Abstraction has 171 states and 261 transitions. [2022-01-10 01:50:05,237 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2022-01-10 01:50:05,238 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 261 transitions. [2022-01-10 01:50:05,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-01-10 01:50:05,245 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 01:50:05,245 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 01:50:05,245 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-10 01:50:05,246 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 01:50:05,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 01:50:05,247 INFO L85 PathProgramCache]: Analyzing trace with hash 1330951645, now seen corresponding path program 1 times [2022-01-10 01:50:05,247 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 01:50:05,249 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607902648] [2022-01-10 01:50:05,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:50:05,252 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 01:50:05,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:05,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 01:50:05,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:05,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-01-10 01:50:05,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:05,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-01-10 01:50:05,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:05,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-01-10 01:50:05,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:05,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-01-10 01:50:05,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:05,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-01-10 01:50:05,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:05,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-01-10 01:50:05,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:05,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-01-10 01:50:05,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:05,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-01-10 01:50:05,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:05,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-01-10 01:50:05,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:05,510 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2022-01-10 01:50:05,510 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 01:50:05,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607902648] [2022-01-10 01:50:05,511 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607902648] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 01:50:05,511 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 01:50:05,511 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 01:50:05,511 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423519639] [2022-01-10 01:50:05,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 01:50:05,512 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 01:50:05,512 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 01:50:05,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 01:50:05,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 01:50:05,513 INFO L87 Difference]: Start difference. First operand 171 states and 261 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2022-01-10 01:50:05,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 01:50:05,561 INFO L93 Difference]: Finished difference Result 340 states and 520 transitions. [2022-01-10 01:50:05,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 01:50:05,573 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 72 [2022-01-10 01:50:05,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 01:50:05,575 INFO L225 Difference]: With dead ends: 340 [2022-01-10 01:50:05,575 INFO L226 Difference]: Without dead ends: 175 [2022-01-10 01:50:05,577 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 01:50:05,577 INFO L933 BasicCegarLoop]: 258 mSDtfsCounter, 4 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 514 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 01:50:05,578 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 514 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 01:50:05,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2022-01-10 01:50:05,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 172. [2022-01-10 01:50:05,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 109 states have (on average 1.4128440366972477) internal successors, (154), 109 states have internal predecessors, (154), 54 states have call successors, (54), 8 states have call predecessors, (54), 8 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2022-01-10 01:50:05,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 262 transitions. [2022-01-10 01:50:05,589 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 262 transitions. Word has length 72 [2022-01-10 01:50:05,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 01:50:05,589 INFO L470 AbstractCegarLoop]: Abstraction has 172 states and 262 transitions. [2022-01-10 01:50:05,589 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2022-01-10 01:50:05,589 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 262 transitions. [2022-01-10 01:50:05,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-01-10 01:50:05,590 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 01:50:05,590 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 01:50:05,590 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-10 01:50:05,591 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 01:50:05,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 01:50:05,591 INFO L85 PathProgramCache]: Analyzing trace with hash 1826847327, now seen corresponding path program 1 times [2022-01-10 01:50:05,591 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 01:50:05,591 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818607075] [2022-01-10 01:50:05,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:50:05,591 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 01:50:05,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:05,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-10 01:50:05,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:05,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-01-10 01:50:05,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:05,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-01-10 01:50:05,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:05,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-01-10 01:50:05,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:05,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-01-10 01:50:05,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:05,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-01-10 01:50:05,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:05,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-01-10 01:50:05,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:05,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-01-10 01:50:05,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:05,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-01-10 01:50:05,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:05,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-01-10 01:50:05,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:05,744 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2022-01-10 01:50:05,745 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 01:50:05,745 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818607075] [2022-01-10 01:50:05,745 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818607075] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 01:50:05,745 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 01:50:05,745 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 01:50:05,745 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053585893] [2022-01-10 01:50:05,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 01:50:05,746 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 01:50:05,746 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 01:50:05,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 01:50:05,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 01:50:05,746 INFO L87 Difference]: Start difference. First operand 172 states and 262 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2022-01-10 01:50:05,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 01:50:05,764 INFO L93 Difference]: Finished difference Result 343 states and 524 transitions. [2022-01-10 01:50:05,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 01:50:05,765 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 75 [2022-01-10 01:50:05,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 01:50:05,766 INFO L225 Difference]: With dead ends: 343 [2022-01-10 01:50:05,766 INFO L226 Difference]: Without dead ends: 174 [2022-01-10 01:50:05,767 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 01:50:05,768 INFO L933 BasicCegarLoop]: 259 mSDtfsCounter, 1 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 515 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 01:50:05,768 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 515 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 01:50:05,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2022-01-10 01:50:05,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 173. [2022-01-10 01:50:05,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 110 states have (on average 1.4090909090909092) internal successors, (155), 110 states have internal predecessors, (155), 54 states have call successors, (54), 8 states have call predecessors, (54), 8 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2022-01-10 01:50:05,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 263 transitions. [2022-01-10 01:50:05,777 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 263 transitions. Word has length 75 [2022-01-10 01:50:05,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 01:50:05,778 INFO L470 AbstractCegarLoop]: Abstraction has 173 states and 263 transitions. [2022-01-10 01:50:05,778 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2022-01-10 01:50:05,778 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 263 transitions. [2022-01-10 01:50:05,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-01-10 01:50:05,779 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 01:50:05,779 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 01:50:05,779 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-10 01:50:05,779 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 01:50:05,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 01:50:05,780 INFO L85 PathProgramCache]: Analyzing trace with hash -541531615, now seen corresponding path program 1 times [2022-01-10 01:50:05,780 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 01:50:05,780 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700380376] [2022-01-10 01:50:05,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:50:05,780 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 01:50:05,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:05,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-01-10 01:50:05,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:05,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-01-10 01:50:05,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:05,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-01-10 01:50:05,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:05,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-01-10 01:50:05,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:05,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-01-10 01:50:05,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:05,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-01-10 01:50:05,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:05,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-01-10 01:50:05,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:05,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-01-10 01:50:05,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:05,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-01-10 01:50:05,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:05,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-01-10 01:50:05,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:05,932 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2022-01-10 01:50:05,932 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 01:50:05,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700380376] [2022-01-10 01:50:05,933 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700380376] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 01:50:05,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1649009126] [2022-01-10 01:50:05,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:50:05,933 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 01:50:05,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 01:50:05,950 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 01:50:05,963 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-01-10 01:50:06,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:06,509 INFO L263 TraceCheckSpWp]: Trace formula consists of 1765 conjuncts, 3 conjunts are in the unsatisfiable core [2022-01-10 01:50:06,514 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 01:50:06,733 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2022-01-10 01:50:06,734 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 01:50:06,852 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2022-01-10 01:50:06,852 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1649009126] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 01:50:06,852 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 01:50:06,852 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2022-01-10 01:50:06,853 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608210349] [2022-01-10 01:50:06,853 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 01:50:06,854 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 01:50:06,854 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 01:50:06,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 01:50:06,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-01-10 01:50:06,858 INFO L87 Difference]: Start difference. First operand 173 states and 263 transitions. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 1 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2022-01-10 01:50:06,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 01:50:06,890 INFO L93 Difference]: Finished difference Result 347 states and 529 transitions. [2022-01-10 01:50:06,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 01:50:06,891 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 1 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 77 [2022-01-10 01:50:06,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 01:50:06,892 INFO L225 Difference]: With dead ends: 347 [2022-01-10 01:50:06,892 INFO L226 Difference]: Without dead ends: 177 [2022-01-10 01:50:06,893 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 171 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-01-10 01:50:06,898 INFO L933 BasicCegarLoop]: 259 mSDtfsCounter, 3 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 515 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 01:50:06,899 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 515 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 01:50:06,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2022-01-10 01:50:06,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2022-01-10 01:50:06,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 114 states have (on average 1.394736842105263) internal successors, (159), 114 states have internal predecessors, (159), 54 states have call successors, (54), 8 states have call predecessors, (54), 8 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2022-01-10 01:50:06,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 267 transitions. [2022-01-10 01:50:06,918 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 267 transitions. Word has length 77 [2022-01-10 01:50:06,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 01:50:06,920 INFO L470 AbstractCegarLoop]: Abstraction has 177 states and 267 transitions. [2022-01-10 01:50:06,920 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 1 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2022-01-10 01:50:06,920 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 267 transitions. [2022-01-10 01:50:06,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-01-10 01:50:06,922 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 01:50:06,922 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 01:50:06,946 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-01-10 01:50:07,131 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 01:50:07,131 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 01:50:07,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 01:50:07,132 INFO L85 PathProgramCache]: Analyzing trace with hash -1454696411, now seen corresponding path program 2 times [2022-01-10 01:50:07,132 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 01:50:07,132 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141996539] [2022-01-10 01:50:07,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:50:07,132 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 01:50:07,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:07,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-01-10 01:50:07,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:07,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-01-10 01:50:07,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:07,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-01-10 01:50:07,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:07,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-01-10 01:50:07,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:07,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-01-10 01:50:07,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:07,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-01-10 01:50:07,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:07,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-01-10 01:50:07,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:07,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-01-10 01:50:07,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:07,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-01-10 01:50:07,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:07,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-01-10 01:50:07,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:07,327 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 189 trivial. 0 not checked. [2022-01-10 01:50:07,327 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 01:50:07,327 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141996539] [2022-01-10 01:50:07,327 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1141996539] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 01:50:07,327 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [971929697] [2022-01-10 01:50:07,327 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-10 01:50:07,327 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 01:50:07,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 01:50:07,328 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 01:50:07,331 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-01-10 01:50:08,049 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-01-10 01:50:08,050 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 01:50:08,058 INFO L263 TraceCheckSpWp]: Trace formula consists of 1519 conjuncts, 5 conjunts are in the unsatisfiable core [2022-01-10 01:50:08,067 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 01:50:08,302 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2022-01-10 01:50:08,302 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 01:50:08,303 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [971929697] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 01:50:08,303 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-10 01:50:08,303 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2022-01-10 01:50:08,303 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624871662] [2022-01-10 01:50:08,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 01:50:08,303 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 01:50:08,304 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 01:50:08,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 01:50:08,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-01-10 01:50:08,304 INFO L87 Difference]: Start difference. First operand 177 states and 267 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2022-01-10 01:50:08,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 01:50:08,330 INFO L93 Difference]: Finished difference Result 339 states and 524 transitions. [2022-01-10 01:50:08,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 01:50:08,331 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 81 [2022-01-10 01:50:08,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 01:50:08,334 INFO L225 Difference]: With dead ends: 339 [2022-01-10 01:50:08,334 INFO L226 Difference]: Without dead ends: 313 [2022-01-10 01:50:08,334 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-01-10 01:50:08,335 INFO L933 BasicCegarLoop]: 375 mSDtfsCounter, 208 mSDsluCounter, 626 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 1001 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 01:50:08,335 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [208 Valid, 1001 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 01:50:08,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2022-01-10 01:50:08,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 312. [2022-01-10 01:50:08,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 312 states, 198 states have (on average 1.4292929292929293) internal successors, (283), 198 states have internal predecessors, (283), 97 states have call successors, (97), 16 states have call predecessors, (97), 16 states have return successors, (105), 97 states have call predecessors, (105), 97 states have call successors, (105) [2022-01-10 01:50:08,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 485 transitions. [2022-01-10 01:50:08,348 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 485 transitions. Word has length 81 [2022-01-10 01:50:08,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 01:50:08,349 INFO L470 AbstractCegarLoop]: Abstraction has 312 states and 485 transitions. [2022-01-10 01:50:08,349 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2022-01-10 01:50:08,349 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 485 transitions. [2022-01-10 01:50:08,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2022-01-10 01:50:08,351 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 01:50:08,351 INFO L514 BasicCegarLoop]: trace histogram [14, 14, 14, 4, 4, 4, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 01:50:08,374 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-01-10 01:50:08,568 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 01:50:08,569 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 01:50:08,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 01:50:08,569 INFO L85 PathProgramCache]: Analyzing trace with hash -613977023, now seen corresponding path program 1 times [2022-01-10 01:50:08,569 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 01:50:08,569 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404856617] [2022-01-10 01:50:08,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:50:08,569 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 01:50:08,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:08,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-10 01:50:08,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:08,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:50:08,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:08,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-10 01:50:08,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:08,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-01-10 01:50:08,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:08,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-01-10 01:50:08,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:08,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-10 01:50:08,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:08,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-01-10 01:50:08,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:08,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-10 01:50:08,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:08,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-01-10 01:50:08,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:08,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-01-10 01:50:08,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:08,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-10 01:50:08,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:08,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-01-10 01:50:08,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:08,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-01-10 01:50:08,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:08,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-01-10 01:50:08,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:08,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-01-10 01:50:08,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:08,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-01-10 01:50:08,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:08,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-01-10 01:50:08,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:08,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-01-10 01:50:08,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:08,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-01-10 01:50:08,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:08,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-01-10 01:50:08,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:08,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-01-10 01:50:08,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:08,864 INFO L134 CoverageAnalysis]: Checked inductivity of 416 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 415 trivial. 0 not checked. [2022-01-10 01:50:08,865 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 01:50:08,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404856617] [2022-01-10 01:50:08,865 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404856617] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 01:50:08,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2038506851] [2022-01-10 01:50:08,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:50:08,865 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 01:50:08,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 01:50:08,880 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 01:50:08,907 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-01-10 01:50:09,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:09,661 INFO L263 TraceCheckSpWp]: Trace formula consists of 2132 conjuncts, 3 conjunts are in the unsatisfiable core [2022-01-10 01:50:09,665 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 01:50:09,880 INFO L134 CoverageAnalysis]: Checked inductivity of 416 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 415 trivial. 0 not checked. [2022-01-10 01:50:09,880 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 01:50:10,187 INFO L134 CoverageAnalysis]: Checked inductivity of 416 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 415 trivial. 0 not checked. [2022-01-10 01:50:10,188 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2038506851] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 01:50:10,188 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 01:50:10,188 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 4, 4] total 9 [2022-01-10 01:50:10,188 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352776820] [2022-01-10 01:50:10,188 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 01:50:10,189 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-10 01:50:10,189 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 01:50:10,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-10 01:50:10,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-01-10 01:50:10,189 INFO L87 Difference]: Start difference. First operand 312 states and 485 transitions. Second operand has 9 states, 9 states have (on average 10.11111111111111) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (43), 6 states have call predecessors, (43), 2 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) [2022-01-10 01:50:12,252 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-10 01:50:14,266 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-10 01:50:14,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 01:50:14,669 INFO L93 Difference]: Finished difference Result 631 states and 988 transitions. [2022-01-10 01:50:14,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-10 01:50:14,669 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.11111111111111) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (43), 6 states have call predecessors, (43), 2 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) Word has length 155 [2022-01-10 01:50:14,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 01:50:14,672 INFO L225 Difference]: With dead ends: 631 [2022-01-10 01:50:14,672 INFO L226 Difference]: Without dead ends: 331 [2022-01-10 01:50:14,673 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 355 GetRequests, 346 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-01-10 01:50:14,674 INFO L933 BasicCegarLoop]: 254 mSDtfsCounter, 100 mSDsluCounter, 357 mSDsCounter, 0 mSdLazyCounter, 314 mSolverCounterSat, 227 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 611 SdHoareTripleChecker+Invalid, 543 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 227 IncrementalHoareTripleChecker+Valid, 314 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2022-01-10 01:50:14,674 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [102 Valid, 611 Invalid, 543 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [227 Valid, 314 Invalid, 2 Unknown, 0 Unchecked, 4.4s Time] [2022-01-10 01:50:14,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2022-01-10 01:50:14,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 325. [2022-01-10 01:50:14,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 209 states have (on average 1.4114832535885167) internal successors, (295), 211 states have internal predecessors, (295), 97 states have call successors, (97), 16 states have call predecessors, (97), 18 states have return successors, (111), 97 states have call predecessors, (111), 97 states have call successors, (111) [2022-01-10 01:50:14,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 503 transitions. [2022-01-10 01:50:14,687 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 503 transitions. Word has length 155 [2022-01-10 01:50:14,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 01:50:14,687 INFO L470 AbstractCegarLoop]: Abstraction has 325 states and 503 transitions. [2022-01-10 01:50:14,688 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.11111111111111) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (43), 6 states have call predecessors, (43), 2 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) [2022-01-10 01:50:14,688 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 503 transitions. [2022-01-10 01:50:14,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2022-01-10 01:50:14,690 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 01:50:14,690 INFO L514 BasicCegarLoop]: trace histogram [14, 14, 14, 6, 6, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 01:50:14,712 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-01-10 01:50:14,909 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 01:50:14,909 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 01:50:14,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 01:50:14,910 INFO L85 PathProgramCache]: Analyzing trace with hash -1817944839, now seen corresponding path program 2 times [2022-01-10 01:50:14,910 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 01:50:14,910 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410349472] [2022-01-10 01:50:14,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:50:14,910 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 01:50:27,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:28,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-01-10 01:50:28,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:28,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:50:28,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:28,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-10 01:50:28,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:28,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-01-10 01:50:28,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:28,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-01-10 01:50:28,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:28,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-10 01:50:28,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:28,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-01-10 01:50:28,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:28,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-10 01:50:28,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:28,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-01-10 01:50:28,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:28,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-01-10 01:50:28,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:28,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-10 01:50:28,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:28,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-01-10 01:50:28,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:28,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-01-10 01:50:28,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:28,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-01-10 01:50:28,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:28,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-01-10 01:50:28,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:28,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-01-10 01:50:28,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:28,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-01-10 01:50:28,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:28,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-01-10 01:50:28,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:28,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-01-10 01:50:28,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:28,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-01-10 01:50:28,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:28,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-01-10 01:50:28,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:28,449 INFO L134 CoverageAnalysis]: Checked inductivity of 453 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 444 trivial. 0 not checked. [2022-01-10 01:50:28,450 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 01:50:28,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410349472] [2022-01-10 01:50:28,450 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410349472] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 01:50:28,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1664159145] [2022-01-10 01:50:28,450 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-10 01:50:28,450 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 01:50:28,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 01:50:28,452 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 01:50:28,452 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-01-10 01:50:29,357 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-01-10 01:50:29,357 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 01:50:29,364 INFO L263 TraceCheckSpWp]: Trace formula consists of 1583 conjuncts, 7 conjunts are in the unsatisfiable core [2022-01-10 01:50:29,368 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 01:50:29,625 INFO L134 CoverageAnalysis]: Checked inductivity of 453 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 453 trivial. 0 not checked. [2022-01-10 01:50:29,625 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 01:50:29,626 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1664159145] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 01:50:29,626 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-10 01:50:29,626 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [12] total 13 [2022-01-10 01:50:29,626 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829036184] [2022-01-10 01:50:29,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 01:50:29,627 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 01:50:29,627 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 01:50:29,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 01:50:29,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2022-01-10 01:50:29,627 INFO L87 Difference]: Start difference. First operand 325 states and 503 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2022-01-10 01:50:29,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 01:50:29,661 INFO L93 Difference]: Finished difference Result 619 states and 965 transitions. [2022-01-10 01:50:29,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 01:50:29,662 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 164 [2022-01-10 01:50:29,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 01:50:29,664 INFO L225 Difference]: With dead ends: 619 [2022-01-10 01:50:29,664 INFO L226 Difference]: Without dead ends: 325 [2022-01-10 01:50:29,665 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 202 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2022-01-10 01:50:29,666 INFO L933 BasicCegarLoop]: 259 mSDtfsCounter, 0 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 516 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 01:50:29,666 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 516 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 01:50:29,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2022-01-10 01:50:29,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 325. [2022-01-10 01:50:29,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 209 states have (on average 1.4066985645933014) internal successors, (294), 211 states have internal predecessors, (294), 97 states have call successors, (97), 16 states have call predecessors, (97), 18 states have return successors, (111), 97 states have call predecessors, (111), 97 states have call successors, (111) [2022-01-10 01:50:29,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 502 transitions. [2022-01-10 01:50:29,697 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 502 transitions. Word has length 164 [2022-01-10 01:50:29,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 01:50:29,697 INFO L470 AbstractCegarLoop]: Abstraction has 325 states and 502 transitions. [2022-01-10 01:50:29,697 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2022-01-10 01:50:29,697 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 502 transitions. [2022-01-10 01:50:29,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2022-01-10 01:50:29,700 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 01:50:29,700 INFO L514 BasicCegarLoop]: trace histogram [15, 15, 15, 6, 6, 5, 5, 5, 5, 5, 5, 5, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 01:50:29,736 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-01-10 01:50:29,915 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 01:50:29,916 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 01:50:29,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 01:50:29,916 INFO L85 PathProgramCache]: Analyzing trace with hash 755632713, now seen corresponding path program 1 times [2022-01-10 01:50:29,916 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 01:50:29,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267250182] [2022-01-10 01:50:29,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:50:29,916 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 01:50:30,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:30,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-01-10 01:50:30,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:30,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-10 01:50:30,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:30,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-10 01:50:30,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:30,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-01-10 01:50:30,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:30,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:50:30,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:30,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-10 01:50:30,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:30,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-01-10 01:50:30,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:30,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-01-10 01:50:30,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:30,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-10 01:50:30,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:30,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-01-10 01:50:30,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:30,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-10 01:50:30,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:30,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-01-10 01:50:30,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:30,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-01-10 01:50:30,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:30,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-10 01:50:30,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:30,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-01-10 01:50:30,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:30,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-01-10 01:50:30,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:30,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-01-10 01:50:30,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:30,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-01-10 01:50:30,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:30,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-01-10 01:50:30,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:30,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2022-01-10 01:50:30,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:30,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2022-01-10 01:50:30,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:30,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2022-01-10 01:50:30,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:30,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2022-01-10 01:50:30,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:30,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2022-01-10 01:50:30,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:30,340 INFO L134 CoverageAnalysis]: Checked inductivity of 542 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 538 trivial. 0 not checked. [2022-01-10 01:50:30,340 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 01:50:30,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267250182] [2022-01-10 01:50:30,340 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267250182] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 01:50:30,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1214449774] [2022-01-10 01:50:30,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:50:30,340 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 01:50:30,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 01:50:30,356 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 01:50:30,357 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-01-10 01:50:31,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:31,253 INFO L263 TraceCheckSpWp]: Trace formula consists of 2467 conjuncts, 10 conjunts are in the unsatisfiable core [2022-01-10 01:50:31,258 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 01:50:31,286 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 16 [2022-01-10 01:50:31,321 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-01-10 01:50:31,468 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-01-10 01:50:31,552 INFO L134 CoverageAnalysis]: Checked inductivity of 542 backedges. 200 proven. 5 refuted. 0 times theorem prover too weak. 337 trivial. 0 not checked. [2022-01-10 01:50:31,553 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 01:50:31,730 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2022-01-10 01:50:31,964 INFO L134 CoverageAnalysis]: Checked inductivity of 542 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 537 trivial. 0 not checked. [2022-01-10 01:50:31,964 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1214449774] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 01:50:31,964 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 01:50:31,964 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 5] total 12 [2022-01-10 01:50:31,965 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35574360] [2022-01-10 01:50:31,965 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 01:50:31,965 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-10 01:50:31,965 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 01:50:31,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-10 01:50:31,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-01-10 01:50:31,966 INFO L87 Difference]: Start difference. First operand 325 states and 502 transitions. Second operand has 12 states, 12 states have (on average 8.583333333333334) internal successors, (103), 8 states have internal predecessors, (103), 8 states have call successors, (42), 8 states have call predecessors, (42), 6 states have return successors, (40), 8 states have call predecessors, (40), 8 states have call successors, (40) [2022-01-10 01:50:33,990 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-10 01:50:35,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 01:50:35,544 INFO L93 Difference]: Finished difference Result 747 states and 1193 transitions. [2022-01-10 01:50:35,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-01-10 01:50:35,545 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 8.583333333333334) internal successors, (103), 8 states have internal predecessors, (103), 8 states have call successors, (42), 8 states have call predecessors, (42), 6 states have return successors, (40), 8 states have call predecessors, (40), 8 states have call successors, (40) Word has length 186 [2022-01-10 01:50:35,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 01:50:35,549 INFO L225 Difference]: With dead ends: 747 [2022-01-10 01:50:35,549 INFO L226 Difference]: Without dead ends: 717 [2022-01-10 01:50:35,550 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 444 GetRequests, 419 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=187, Invalid=463, Unknown=0, NotChecked=0, Total=650 [2022-01-10 01:50:35,550 INFO L933 BasicCegarLoop]: 260 mSDtfsCounter, 710 mSDsluCounter, 541 mSDsCounter, 0 mSdLazyCounter, 1245 mSolverCounterSat, 769 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 742 SdHoareTripleChecker+Valid, 801 SdHoareTripleChecker+Invalid, 2015 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 769 IncrementalHoareTripleChecker+Valid, 1245 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2022-01-10 01:50:35,550 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [742 Valid, 801 Invalid, 2015 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [769 Valid, 1245 Invalid, 1 Unknown, 0 Unchecked, 3.3s Time] [2022-01-10 01:50:35,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2022-01-10 01:50:35,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 680. [2022-01-10 01:50:35,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 680 states, 427 states have (on average 1.4285714285714286) internal successors, (610), 434 states have internal predecessors, (610), 211 states have call successors, (211), 32 states have call predecessors, (211), 41 states have return successors, (265), 213 states have call predecessors, (265), 211 states have call successors, (265) [2022-01-10 01:50:35,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 680 states to 680 states and 1086 transitions. [2022-01-10 01:50:35,582 INFO L78 Accepts]: Start accepts. Automaton has 680 states and 1086 transitions. Word has length 186 [2022-01-10 01:50:35,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 01:50:35,582 INFO L470 AbstractCegarLoop]: Abstraction has 680 states and 1086 transitions. [2022-01-10 01:50:35,582 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.583333333333334) internal successors, (103), 8 states have internal predecessors, (103), 8 states have call successors, (42), 8 states have call predecessors, (42), 6 states have return successors, (40), 8 states have call predecessors, (40), 8 states have call successors, (40) [2022-01-10 01:50:35,583 INFO L276 IsEmpty]: Start isEmpty. Operand 680 states and 1086 transitions. [2022-01-10 01:50:35,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2022-01-10 01:50:35,585 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 01:50:35,586 INFO L514 BasicCegarLoop]: trace histogram [15, 15, 15, 6, 6, 5, 5, 5, 5, 5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 01:50:35,619 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-01-10 01:50:35,799 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 01:50:35,800 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 01:50:35,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 01:50:35,800 INFO L85 PathProgramCache]: Analyzing trace with hash -2108443675, now seen corresponding path program 1 times [2022-01-10 01:50:35,800 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 01:50:35,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895696980] [2022-01-10 01:50:35,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:50:35,801 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 01:50:45,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:45,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-01-10 01:50:45,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:45,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:50:45,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:45,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-10 01:50:45,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:45,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-01-10 01:50:45,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:45,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:50:45,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:45,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-10 01:50:45,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:45,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-01-10 01:50:45,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:45,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-01-10 01:50:45,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:45,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-10 01:50:45,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:45,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-01-10 01:50:45,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:45,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-10 01:50:45,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:45,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-01-10 01:50:45,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:45,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-01-10 01:50:45,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:45,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-10 01:50:45,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:45,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-01-10 01:50:45,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:45,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-01-10 01:50:45,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:45,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-01-10 01:50:45,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:45,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-01-10 01:50:45,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:45,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2022-01-10 01:50:45,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:45,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-01-10 01:50:45,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:45,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2022-01-10 01:50:45,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:45,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-01-10 01:50:45,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:45,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-01-10 01:50:45,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:45,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2022-01-10 01:50:45,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:45,397 INFO L134 CoverageAnalysis]: Checked inductivity of 546 backedges. 8 proven. 9 refuted. 0 times theorem prover too weak. 529 trivial. 0 not checked. [2022-01-10 01:50:45,397 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 01:50:45,397 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895696980] [2022-01-10 01:50:45,398 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895696980] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 01:50:45,398 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1467066484] [2022-01-10 01:50:45,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:50:45,398 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 01:50:45,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 01:50:45,412 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 01:50:45,412 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-01-10 01:50:46,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:46,366 INFO L263 TraceCheckSpWp]: Trace formula consists of 2433 conjuncts, 10 conjunts are in the unsatisfiable core [2022-01-10 01:50:46,370 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 01:50:46,800 INFO L134 CoverageAnalysis]: Checked inductivity of 546 backedges. 74 proven. 126 refuted. 0 times theorem prover too weak. 346 trivial. 0 not checked. [2022-01-10 01:50:46,800 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 01:50:47,271 INFO L134 CoverageAnalysis]: Checked inductivity of 546 backedges. 17 proven. 9 refuted. 0 times theorem prover too weak. 520 trivial. 0 not checked. [2022-01-10 01:50:47,271 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1467066484] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 01:50:47,271 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 01:50:47,271 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7, 8] total 22 [2022-01-10 01:50:47,271 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738277513] [2022-01-10 01:50:47,271 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 01:50:47,273 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-01-10 01:50:47,273 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 01:50:47,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-01-10 01:50:47,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=388, Unknown=0, NotChecked=0, Total=462 [2022-01-10 01:50:47,274 INFO L87 Difference]: Start difference. First operand 680 states and 1086 transitions. Second operand has 22 states, 21 states have (on average 6.666666666666667) internal successors, (140), 16 states have internal predecessors, (140), 7 states have call successors, (43), 6 states have call predecessors, (43), 9 states have return successors, (46), 11 states have call predecessors, (46), 7 states have call successors, (46) [2022-01-10 01:50:49,312 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-10 01:50:51,326 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-10 01:50:53,345 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-10 01:50:55,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 01:50:55,920 INFO L93 Difference]: Finished difference Result 1932 states and 3206 transitions. [2022-01-10 01:50:55,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-01-10 01:50:55,920 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 6.666666666666667) internal successors, (140), 16 states have internal predecessors, (140), 7 states have call successors, (43), 6 states have call predecessors, (43), 9 states have return successors, (46), 11 states have call predecessors, (46), 7 states have call successors, (46) Word has length 187 [2022-01-10 01:50:55,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 01:50:55,921 INFO L225 Difference]: With dead ends: 1932 [2022-01-10 01:50:55,921 INFO L226 Difference]: Without dead ends: 0 [2022-01-10 01:50:55,929 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 453 GetRequests, 417 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=244, Invalid=1088, Unknown=0, NotChecked=0, Total=1332 [2022-01-10 01:50:55,931 INFO L933 BasicCegarLoop]: 240 mSDtfsCounter, 809 mSDsluCounter, 1048 mSDsCounter, 0 mSdLazyCounter, 2987 mSolverCounterSat, 842 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 825 SdHoareTripleChecker+Valid, 1288 SdHoareTripleChecker+Invalid, 3832 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 842 IncrementalHoareTripleChecker+Valid, 2987 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.2s IncrementalHoareTripleChecker+Time [2022-01-10 01:50:55,931 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [825 Valid, 1288 Invalid, 3832 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [842 Valid, 2987 Invalid, 3 Unknown, 0 Unchecked, 8.2s Time] [2022-01-10 01:50:55,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-01-10 01:50:55,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-01-10 01:50:55,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 01:50:55,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-01-10 01:50:55,932 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 187 [2022-01-10 01:50:55,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 01:50:55,932 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-01-10 01:50:55,932 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 6.666666666666667) internal successors, (140), 16 states have internal predecessors, (140), 7 states have call successors, (43), 6 states have call predecessors, (43), 9 states have return successors, (46), 11 states have call predecessors, (46), 7 states have call successors, (46) [2022-01-10 01:50:55,933 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-01-10 01:50:55,933 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-01-10 01:50:55,934 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-01-10 01:50:55,977 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-01-10 01:50:56,158 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 01:50:56,160 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-01-10 01:50:58,998 INFO L861 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 5 7) the Hoare annotation is: true [2022-01-10 01:50:58,998 INFO L858 garLoopResultBuilder]: For program point L6(line 6) no Hoare annotation was computed. [2022-01-10 01:50:58,998 INFO L858 garLoopResultBuilder]: For program point L6-2(lines 5 7) no Hoare annotation was computed. [2022-01-10 01:50:58,998 INFO L858 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 5 7) no Hoare annotation was computed. [2022-01-10 01:50:58,998 INFO L858 garLoopResultBuilder]: For program point __CS_pthread_mutex_initEXIT(lines 569 572) no Hoare annotation was computed. [2022-01-10 01:50:58,998 INFO L861 garLoopResultBuilder]: At program point __CS_pthread_mutex_initENTRY(lines 569 572) the Hoare annotation is: true [2022-01-10 01:50:58,998 INFO L858 garLoopResultBuilder]: For program point __CS_pthread_mutex_initFINAL(lines 569 572) no Hoare annotation was computed. [2022-01-10 01:50:58,998 INFO L858 garLoopResultBuilder]: For program point __CS_pthread_joinEXIT(lines 642 663) no Hoare annotation was computed. [2022-01-10 01:50:58,998 INFO L854 garLoopResultBuilder]: At program point __CS_pthread_joinENTRY(lines 642 663) the Hoare annotation is: (or (not (= ~__CS_ret_PREEMPTED~0 1)) (and (= ~__CS_error~0 |old(~__CS_error~0)|) (= |old(~__CS_ret~0)| ~__CS_ret~0)) (not (= (mod |old(~__CS_ret~0)| 256) 0))) [2022-01-10 01:50:58,998 INFO L858 garLoopResultBuilder]: For program point __CS_pthread_joinFINAL(lines 642 663) no Hoare annotation was computed. [2022-01-10 01:50:58,998 INFO L854 garLoopResultBuilder]: At program point L661(line 661) the Hoare annotation is: (or (not (= ~__CS_ret_PREEMPTED~0 1)) (and (= ~__CS_error~0 |old(~__CS_error~0)|) (= |old(~__CS_ret~0)| ~__CS_ret~0)) (not (= (mod |old(~__CS_ret~0)| 256) 0))) [2022-01-10 01:50:58,999 INFO L858 garLoopResultBuilder]: For program point L661-1(line 661) no Hoare annotation was computed. [2022-01-10 01:50:58,999 INFO L858 garLoopResultBuilder]: For program point L655(lines 655 660) no Hoare annotation was computed. [2022-01-10 01:50:58,999 INFO L858 garLoopResultBuilder]: For program point L650(line 650) no Hoare annotation was computed. [2022-01-10 01:50:58,999 INFO L858 garLoopResultBuilder]: For program point L650-2(lines 650 654) no Hoare annotation was computed. [2022-01-10 01:50:58,999 INFO L858 garLoopResultBuilder]: For program point L644(lines 644 649) no Hoare annotation was computed. [2022-01-10 01:50:58,999 INFO L854 garLoopResultBuilder]: At program point __CS_pthread_mutex_lockENTRY(lines 582 587) the Hoare annotation is: (or (and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~__CS_ret~0)| ~__CS_ret~0)) (not (= ~__CS_ret_PREEMPTED~0 1)) (not (= (mod |old(~__CS_ret~0)| 256) 0))) [2022-01-10 01:50:58,999 INFO L858 garLoopResultBuilder]: For program point L584(lines 584 585) no Hoare annotation was computed. [2022-01-10 01:50:58,999 INFO L858 garLoopResultBuilder]: For program point L584-1(lines 584 585) no Hoare annotation was computed. [2022-01-10 01:50:58,999 INFO L858 garLoopResultBuilder]: For program point __CS_pthread_mutex_lockEXIT(lines 582 587) no Hoare annotation was computed. [2022-01-10 01:50:58,999 INFO L858 garLoopResultBuilder]: For program point __CS_pthread_mutex_lockFINAL(lines 582 587) no Hoare annotation was computed. [2022-01-10 01:50:58,999 INFO L854 garLoopResultBuilder]: At program point L729(line 729) the Hoare annotation is: (let ((.cse0 (not (= ~__CS_ret_PREEMPTED~0 1))) (.cse1 (not (= (mod |old(~__CS_ret~0)| 256) 0)))) (and (or (and (= (mod ~__CS_ret~0 256) 0) (= |old(~__CS_thread~0.offset)| ~__CS_thread~0.offset) (not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset| 0))) .cse0 .cse1) (or (not (= 0 |old(~__CS_error~0)|)) (= ~__CS_error~0 0) .cse0 .cse1))) [2022-01-10 01:50:58,999 INFO L858 garLoopResultBuilder]: For program point L729-1(lines 722 753) no Hoare annotation was computed. [2022-01-10 01:50:58,999 INFO L854 garLoopResultBuilder]: At program point L696(line 696) the Hoare annotation is: (let ((.cse0 (not (= ~__CS_ret_PREEMPTED~0 1))) (.cse1 (not (= (mod |old(~__CS_ret~0)| 256) 0)))) (and (or (and (= (mod ~__CS_ret~0 256) 0) (= |old(~__CS_thread~0.offset)| ~__CS_thread~0.offset)) .cse0 .cse1) (or (not (= 0 |old(~__CS_error~0)|)) (= ~__CS_error~0 0) .cse0 .cse1))) [2022-01-10 01:50:58,999 INFO L858 garLoopResultBuilder]: For program point L696-1(line 696) no Hoare annotation was computed. [2022-01-10 01:50:58,999 INFO L854 garLoopResultBuilder]: At program point L713(line 713) the Hoare annotation is: (or (not (= ~__CS_ret_PREEMPTED~0 1)) (and (= |old(~__CS_thread~0.offset)| ~__CS_thread~0.offset) (= |#funAddr~thread2.offset| |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset|)) (not (= (mod |old(~__CS_ret~0)| 256) 0))) [2022-01-10 01:50:58,999 INFO L858 garLoopResultBuilder]: For program point L713-1(lines 706 720) no Hoare annotation was computed. [2022-01-10 01:50:58,999 INFO L854 garLoopResultBuilder]: At program point L697(line 697) the Hoare annotation is: (or (= |old(~__CS_thread~0.offset)| ~__CS_thread~0.offset) (not (= ~__CS_ret_PREEMPTED~0 1)) (not (= (mod |old(~__CS_ret~0)| 256) 0))) [2022-01-10 01:50:59,000 INFO L858 garLoopResultBuilder]: For program point L697-1(lines 690 704) no Hoare annotation was computed. [2022-01-10 01:50:59,000 INFO L858 garLoopResultBuilder]: For program point ##fun~$Pointer$~TO~$Pointer$FINAL(line -1) no Hoare annotation was computed. [2022-01-10 01:50:59,000 INFO L854 garLoopResultBuilder]: At program point L747(lines 743 751) the Hoare annotation is: (or (not (= ~__CS_ret_PREEMPTED~0 1)) (and (= (mod ~__CS_ret~0 256) 0) (not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset| 0))) (not (= (mod |old(~__CS_ret~0)| 256) 0))) [2022-01-10 01:50:59,000 INFO L854 garLoopResultBuilder]: At program point L714(line 714) the Hoare annotation is: (or (not (= ~__CS_ret_PREEMPTED~0 1)) (and (= (mod ~__CS_ret~0 256) 0) (= |old(~__CS_thread~0.offset)| ~__CS_thread~0.offset) (= |#funAddr~thread2.offset| |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset|)) (not (= (mod |old(~__CS_ret~0)| 256) 0))) [2022-01-10 01:50:59,000 INFO L858 garLoopResultBuilder]: For program point L714-1(line 714) no Hoare annotation was computed. [2022-01-10 01:50:59,000 INFO L858 garLoopResultBuilder]: For program point ##fun~$Pointer$~TO~$Pointer$EXIT(line -1) no Hoare annotation was computed. [2022-01-10 01:50:59,000 INFO L854 garLoopResultBuilder]: At program point L731(line 731) the Hoare annotation is: (let ((.cse0 (not (= ~__CS_ret_PREEMPTED~0 1))) (.cse1 (not (= (mod |old(~__CS_ret~0)| 256) 0)))) (and (or (and (= (mod ~__CS_ret~0 256) 0) (= |old(~__CS_thread~0.offset)| ~__CS_thread~0.offset) (not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset| 0))) .cse0 .cse1) (or (not (= 0 |old(~__CS_error~0)|)) (= ~__CS_error~0 0) .cse0 .cse1))) [2022-01-10 01:50:59,000 INFO L858 garLoopResultBuilder]: For program point L731-1(lines 722 753) no Hoare annotation was computed. [2022-01-10 01:50:59,000 INFO L854 garLoopResultBuilder]: At program point L698(line 698) the Hoare annotation is: (or (and (= (mod ~__CS_ret~0 256) 0) (= |old(~__CS_thread~0.offset)| ~__CS_thread~0.offset)) (not (= ~__CS_ret_PREEMPTED~0 1)) (not (= (mod |old(~__CS_ret~0)| 256) 0))) [2022-01-10 01:50:59,000 INFO L858 garLoopResultBuilder]: For program point L698-1(line 698) no Hoare annotation was computed. [2022-01-10 01:50:59,000 INFO L854 garLoopResultBuilder]: At program point L715(line 715) the Hoare annotation is: (let ((.cse0 (= |old(~__CS_thread~0.offset)| ~__CS_thread~0.offset)) (.cse2 (= |#funAddr~thread2.offset| |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset|))) (or (let ((.cse1 (+ ~__CS_ret~0 (* (div ~__CS_ret_PREEMPTED~0 256) 256)))) (and .cse0 (<= .cse1 ~__CS_ret_PREEMPTED~0) .cse2 (<= ~__CS_ret_PREEMPTED~0 .cse1))) (not (= ~__CS_ret_PREEMPTED~0 1)) (and (= (mod ~__CS_ret~0 256) 0) .cse0 .cse2) (not (= (mod |old(~__CS_ret~0)| 256) 0)))) [2022-01-10 01:50:59,000 INFO L858 garLoopResultBuilder]: For program point L715-1(lines 706 720) no Hoare annotation was computed. [2022-01-10 01:50:59,000 INFO L854 garLoopResultBuilder]: At program point L699(line 699) the Hoare annotation is: (let ((.cse0 (= |old(~__CS_thread~0.offset)| ~__CS_thread~0.offset))) (or (and (= (mod ~__CS_ret~0 256) 0) .cse0) (not (= ~__CS_ret_PREEMPTED~0 1)) (not (= (mod |old(~__CS_ret~0)| 256) 0)) (let ((.cse1 (+ ~__CS_ret~0 (* (div ~__CS_ret_PREEMPTED~0 256) 256)))) (and .cse0 (<= .cse1 ~__CS_ret_PREEMPTED~0) (<= ~__CS_ret_PREEMPTED~0 .cse1))))) [2022-01-10 01:50:59,000 INFO L858 garLoopResultBuilder]: For program point L699-1(lines 690 704) no Hoare annotation was computed. [2022-01-10 01:50:59,000 INFO L854 garLoopResultBuilder]: At program point L733(line 733) the Hoare annotation is: (let ((.cse0 (not (= ~__CS_ret_PREEMPTED~0 1))) (.cse1 (not (= (mod |old(~__CS_ret~0)| 256) 0)))) (and (or (and (= (mod ~__CS_ret~0 256) 0) (= |old(~__CS_thread~0.offset)| ~__CS_thread~0.offset) (not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset| 0))) .cse0 .cse1) (or (not (= 0 |old(~__CS_error~0)|)) (= ~__CS_error~0 0) .cse0 .cse1))) [2022-01-10 01:50:59,000 INFO L858 garLoopResultBuilder]: For program point L733-1(lines 722 753) no Hoare annotation was computed. [2022-01-10 01:50:59,000 INFO L854 garLoopResultBuilder]: At program point L717(line 717) the Hoare annotation is: (or (not (= ~__CS_ret_PREEMPTED~0 1)) (and (= (mod ~__CS_ret~0 256) 0) (= |old(~__CS_thread~0.offset)| ~__CS_thread~0.offset) (= |#funAddr~thread2.offset| |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset|)) (not (= (mod |old(~__CS_ret~0)| 256) 0))) [2022-01-10 01:50:59,001 INFO L858 garLoopResultBuilder]: For program point L717-1(lines 706 720) no Hoare annotation was computed. [2022-01-10 01:50:59,001 INFO L854 garLoopResultBuilder]: At program point L734(line 734) the Hoare annotation is: (let ((.cse0 (not (= ~__CS_ret_PREEMPTED~0 1))) (.cse1 (not (= (mod |old(~__CS_ret~0)| 256) 0)))) (and (or (and (= (mod ~__CS_ret~0 256) 0) (= |old(~__CS_thread~0.offset)| ~__CS_thread~0.offset) (not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset| 0))) .cse0 .cse1) (or (not (= 0 |old(~__CS_error~0)|)) (= ~__CS_error~0 0) .cse0 .cse1))) [2022-01-10 01:50:59,001 INFO L858 garLoopResultBuilder]: For program point L734-1(line 734) no Hoare annotation was computed. [2022-01-10 01:50:59,001 INFO L854 garLoopResultBuilder]: At program point L701(line 701) the Hoare annotation is: (or (and (= (mod ~__CS_ret~0 256) 0) (= |old(~__CS_thread~0.offset)| ~__CS_thread~0.offset)) (not (= ~__CS_ret_PREEMPTED~0 1)) (not (= (mod |old(~__CS_ret~0)| 256) 0))) [2022-01-10 01:50:59,001 INFO L858 garLoopResultBuilder]: For program point L701-1(lines 690 704) no Hoare annotation was computed. [2022-01-10 01:50:59,001 INFO L854 garLoopResultBuilder]: At program point L718(line 718) the Hoare annotation is: (or (not (= ~__CS_ret_PREEMPTED~0 1)) (and (= (mod ~__CS_ret~0 256) 0) (= |old(~__CS_thread~0.offset)| ~__CS_thread~0.offset) (= |#funAddr~thread2.offset| |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset|)) (not (= (mod |old(~__CS_ret~0)| 256) 0))) [2022-01-10 01:50:59,001 INFO L858 garLoopResultBuilder]: For program point L718-1(line 718) no Hoare annotation was computed. [2022-01-10 01:50:59,001 INFO L854 garLoopResultBuilder]: At program point L735(line 735) the Hoare annotation is: (let ((.cse0 (not (= ~__CS_ret_PREEMPTED~0 1))) (.cse1 (not (= (mod |old(~__CS_ret~0)| 256) 0)))) (and (or .cse0 (and (= (mod ~__CS_ret~0 256) 0) (not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset| 0))) .cse1) (or (not (= 0 |old(~__CS_error~0)|)) (= ~__CS_error~0 0) .cse0 .cse1))) [2022-01-10 01:50:59,001 INFO L858 garLoopResultBuilder]: For program point L735-1(lines 722 753) no Hoare annotation was computed. [2022-01-10 01:50:59,001 INFO L854 garLoopResultBuilder]: At program point L702(line 702) the Hoare annotation is: (or (and (= (mod ~__CS_ret~0 256) 0) (= |old(~__CS_thread~0.offset)| ~__CS_thread~0.offset)) (not (= ~__CS_ret_PREEMPTED~0 1)) (not (= (mod |old(~__CS_ret~0)| 256) 0))) [2022-01-10 01:50:59,001 INFO L858 garLoopResultBuilder]: For program point L702-1(line 702) no Hoare annotation was computed. [2022-01-10 01:50:59,001 INFO L858 garLoopResultBuilder]: For program point L752(lines 722 753) no Hoare annotation was computed. [2022-01-10 01:50:59,001 INFO L854 garLoopResultBuilder]: At program point L719(line 719) the Hoare annotation is: (or (not (= ~__CS_ret_PREEMPTED~0 1)) (and (= |old(~__CS_thread~0.offset)| ~__CS_thread~0.offset) (= |#funAddr~thread2.offset| |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset|)) (not (= (mod |old(~__CS_ret~0)| 256) 0))) [2022-01-10 01:50:59,001 INFO L858 garLoopResultBuilder]: For program point L719-1(lines 706 720) no Hoare annotation was computed. [2022-01-10 01:50:59,001 INFO L854 garLoopResultBuilder]: At program point L736(line 736) the Hoare annotation is: (let ((.cse0 (not (= ~__CS_ret_PREEMPTED~0 1))) (.cse1 (not (= (mod |old(~__CS_ret~0)| 256) 0)))) (and (or .cse0 (and (= (mod ~__CS_ret~0 256) 0) (not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset| 0))) .cse1) (or (not (= 0 |old(~__CS_error~0)|)) (= ~__CS_error~0 0) .cse0 .cse1))) [2022-01-10 01:50:59,001 INFO L858 garLoopResultBuilder]: For program point L736-1(line 736) no Hoare annotation was computed. [2022-01-10 01:50:59,001 INFO L854 garLoopResultBuilder]: At program point L703(line 703) the Hoare annotation is: (or (= |old(~__CS_thread~0.offset)| ~__CS_thread~0.offset) (not (= ~__CS_ret_PREEMPTED~0 1)) (not (= (mod |old(~__CS_ret~0)| 256) 0))) [2022-01-10 01:50:59,002 INFO L858 garLoopResultBuilder]: For program point L703-1(lines 690 704) no Hoare annotation was computed. [2022-01-10 01:50:59,002 INFO L854 garLoopResultBuilder]: At program point L737(line 737) the Hoare annotation is: (let ((.cse0 (not (= ~__CS_ret_PREEMPTED~0 1))) (.cse1 (not (= (mod |old(~__CS_ret~0)| 256) 0)))) (and (or .cse0 (and (= (mod ~__CS_ret~0 256) 0) (not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset| 0))) .cse1) (or (not (= 0 |old(~__CS_error~0)|)) (= ~__CS_error~0 0) .cse0 .cse1))) [2022-01-10 01:50:59,002 INFO L858 garLoopResultBuilder]: For program point L737-1(lines 722 753) no Hoare annotation was computed. [2022-01-10 01:50:59,002 INFO L854 garLoopResultBuilder]: At program point L721(lines 721 753) the Hoare annotation is: (or (not (= ~__CS_ret_PREEMPTED~0 1)) (not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset| 0)) (not (= (mod |old(~__CS_ret~0)| 256) 0))) [2022-01-10 01:50:59,002 INFO L854 garLoopResultBuilder]: At program point L738(line 738) the Hoare annotation is: (let ((.cse0 (not (= ~__CS_ret_PREEMPTED~0 1))) (.cse1 (not (= (mod |old(~__CS_ret~0)| 256) 0)))) (and (or .cse0 (and (= (mod ~__CS_ret~0 256) 0) (not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset| 0))) .cse1) (or (not (= 0 |old(~__CS_error~0)|)) (= ~__CS_error~0 0) .cse0 .cse1))) [2022-01-10 01:50:59,002 INFO L858 garLoopResultBuilder]: For program point L738-1(line 738) no Hoare annotation was computed. [2022-01-10 01:50:59,002 INFO L854 garLoopResultBuilder]: At program point L705(lines 705 720) the Hoare annotation is: (or (not (= ~__CS_ret_PREEMPTED~0 1)) (and (= |old(~__CS_thread~0.offset)| ~__CS_thread~0.offset) (= |#funAddr~thread2.offset| |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset|)) (not (= (mod |old(~__CS_ret~0)| 256) 0))) [2022-01-10 01:50:59,002 INFO L854 garLoopResultBuilder]: At program point L689(lines 689 704) the Hoare annotation is: (or (= |old(~__CS_thread~0.offset)| ~__CS_thread~0.offset) (not (= ~__CS_ret_PREEMPTED~0 1)) (not (= (mod |old(~__CS_ret~0)| 256) 0))) [2022-01-10 01:50:59,002 INFO L854 garLoopResultBuilder]: At program point ##fun~$Pointer$~TO~$Pointer$ENTRY(line -1) the Hoare annotation is: (or (not (= ~__CS_ret_PREEMPTED~0 1)) (and (= |old(#length)| |#length|) (= |old(~__CS_thread~0.offset)| ~__CS_thread~0.offset) (= |#memory_int| |old(#memory_int)|) (= ~__CS_error~0 |old(~__CS_error~0)|) (= ~__CS_thread~0.base |old(~__CS_thread~0.base)|) (= |old(~__CS_round~0)| ~__CS_round~0) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~__CS_ret~0)| ~__CS_ret~0) (= |old(#valid)| |#valid|) (= ~__CS_thread_index~0 |old(~__CS_thread_index~0)|)) (not (= (mod |old(~__CS_ret~0)| 256) 0))) [2022-01-10 01:50:59,002 INFO L854 garLoopResultBuilder]: At program point L739(line 739) the Hoare annotation is: (or (not (= ~__CS_ret_PREEMPTED~0 1)) (not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset| 0)) (not (= (mod |old(~__CS_ret~0)| 256) 0))) [2022-01-10 01:50:59,002 INFO L858 garLoopResultBuilder]: For program point L739-1(lines 722 753) no Hoare annotation was computed. [2022-01-10 01:50:59,002 INFO L854 garLoopResultBuilder]: At program point L740(line 740) the Hoare annotation is: (or (not (= ~__CS_ret_PREEMPTED~0 1)) (and (= (mod ~__CS_ret~0 256) 0) (not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset| 0))) (not (= (mod |old(~__CS_ret~0)| 256) 0))) [2022-01-10 01:50:59,002 INFO L858 garLoopResultBuilder]: For program point L740-1(line 740) no Hoare annotation was computed. [2022-01-10 01:50:59,002 INFO L854 garLoopResultBuilder]: At program point L707(line 707) the Hoare annotation is: (or (and (= |old(#length)| |#length|) (= |old(~__CS_thread~0.offset)| ~__CS_thread~0.offset) (= |#memory_int| |old(#memory_int)|) (= ~__CS_error~0 |old(~__CS_error~0)|) (= ~__CS_thread~0.base |old(~__CS_thread~0.base)|) (= |old(~__CS_round~0)| ~__CS_round~0) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |#funAddr~thread2.offset| |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset|) (= |old(~__CS_ret~0)| ~__CS_ret~0) (= |old(#valid)| |#valid|) (= ~__CS_thread_index~0 |old(~__CS_thread_index~0)|)) (not (= ~__CS_ret_PREEMPTED~0 1)) (not (= (mod |old(~__CS_ret~0)| 256) 0))) [2022-01-10 01:50:59,002 INFO L858 garLoopResultBuilder]: For program point L707-1(lines 706 720) no Hoare annotation was computed. [2022-01-10 01:50:59,002 INFO L854 garLoopResultBuilder]: At program point L691(line 691) the Hoare annotation is: (or (not (= ~__CS_ret_PREEMPTED~0 1)) (and (= |old(#length)| |#length|) (= |old(~__CS_thread~0.offset)| ~__CS_thread~0.offset) (= |#memory_int| |old(#memory_int)|) (= ~__CS_error~0 |old(~__CS_error~0)|) (= ~__CS_thread~0.base |old(~__CS_thread~0.base)|) (= |old(~__CS_round~0)| ~__CS_round~0) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~__CS_ret~0)| ~__CS_ret~0) (= |old(#valid)| |#valid|) (= ~__CS_thread_index~0 |old(~__CS_thread_index~0)|)) (not (= (mod |old(~__CS_ret~0)| 256) 0))) [2022-01-10 01:50:59,002 INFO L858 garLoopResultBuilder]: For program point L691-1(lines 690 704) no Hoare annotation was computed. [2022-01-10 01:50:59,003 INFO L854 garLoopResultBuilder]: At program point L741(line 741) the Hoare annotation is: (or (not (= ~__CS_ret_PREEMPTED~0 1)) (not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset| 0)) (not (= (mod |old(~__CS_ret~0)| 256) 0))) [2022-01-10 01:50:59,003 INFO L858 garLoopResultBuilder]: For program point L741-1(lines 722 753) no Hoare annotation was computed. [2022-01-10 01:50:59,003 INFO L854 garLoopResultBuilder]: At program point L708(line 708) the Hoare annotation is: (let ((.cse0 (not (= ~__CS_ret_PREEMPTED~0 1))) (.cse1 (not (= (mod |old(~__CS_ret~0)| 256) 0)))) (and (or .cse0 (and (= (mod ~__CS_ret~0 256) 0) (= |old(~__CS_thread~0.offset)| ~__CS_thread~0.offset) (= |#funAddr~thread2.offset| |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset|)) .cse1) (or (not (= 0 |old(~__CS_error~0)|)) (= ~__CS_error~0 0) .cse0 .cse1))) [2022-01-10 01:50:59,003 INFO L858 garLoopResultBuilder]: For program point L708-1(line 708) no Hoare annotation was computed. [2022-01-10 01:50:59,003 INFO L854 garLoopResultBuilder]: At program point L725(line 725) the Hoare annotation is: (or (not (= ~__CS_ret_PREEMPTED~0 1)) (and (= |old(~__CS_thread~0.offset)| ~__CS_thread~0.offset) (= |#memory_int| |old(#memory_int)|) (= ~__CS_error~0 |old(~__CS_error~0)|) (= |old(~__CS_round~0)| ~__CS_round~0) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~__CS_ret~0)| ~__CS_ret~0) (not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset| 0))) (not (= (mod |old(~__CS_ret~0)| 256) 0))) [2022-01-10 01:50:59,003 INFO L858 garLoopResultBuilder]: For program point L725-1(lines 722 753) no Hoare annotation was computed. [2022-01-10 01:50:59,003 INFO L854 garLoopResultBuilder]: At program point L692(line 692) the Hoare annotation is: (let ((.cse0 (not (= ~__CS_ret_PREEMPTED~0 1))) (.cse1 (not (= (mod |old(~__CS_ret~0)| 256) 0)))) (and (or (and (= (mod ~__CS_ret~0 256) 0) (= |old(~__CS_thread~0.offset)| ~__CS_thread~0.offset)) .cse0 .cse1) (or (not (= 0 |old(~__CS_error~0)|)) (= ~__CS_error~0 0) .cse0 .cse1))) [2022-01-10 01:50:59,003 INFO L858 garLoopResultBuilder]: For program point L692-1(line 692) no Hoare annotation was computed. [2022-01-10 01:50:59,003 INFO L858 garLoopResultBuilder]: For program point L742(line 742) no Hoare annotation was computed. [2022-01-10 01:50:59,003 INFO L854 garLoopResultBuilder]: At program point L709(line 709) the Hoare annotation is: (let ((.cse0 (not (= ~__CS_ret_PREEMPTED~0 1))) (.cse1 (not (= (mod |old(~__CS_ret~0)| 256) 0)))) (and (or (not (= 0 |old(~__CS_error~0)|)) (= ~__CS_error~0 0) .cse0 .cse1) (let ((.cse2 (= |old(~__CS_thread~0.offset)| ~__CS_thread~0.offset)) (.cse4 (= |#funAddr~thread2.offset| |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset|))) (or (let ((.cse3 (+ ~__CS_ret~0 (* (div ~__CS_ret_PREEMPTED~0 256) 256)))) (and .cse2 (<= .cse3 ~__CS_ret_PREEMPTED~0) .cse4 (<= ~__CS_ret_PREEMPTED~0 .cse3))) .cse0 (and (= (mod ~__CS_ret~0 256) 0) .cse2 .cse4) .cse1)))) [2022-01-10 01:50:59,003 INFO L858 garLoopResultBuilder]: For program point L742-2(lines 742 751) no Hoare annotation was computed. [2022-01-10 01:50:59,003 INFO L858 garLoopResultBuilder]: For program point L709-1(lines 706 720) no Hoare annotation was computed. [2022-01-10 01:50:59,003 INFO L854 garLoopResultBuilder]: At program point L742-4(lines 742 751) the Hoare annotation is: (or (not (= ~__CS_ret_PREEMPTED~0 1)) (and (= (mod ~__CS_ret~0 256) 0) (not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset| 0))) (not (= (mod |old(~__CS_ret~0)| 256) 0))) [2022-01-10 01:50:59,003 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-01-10 01:50:59,003 INFO L858 garLoopResultBuilder]: For program point L-1-2(line -1) no Hoare annotation was computed. [2022-01-10 01:50:59,003 INFO L858 garLoopResultBuilder]: For program point L-1-4(line -1) no Hoare annotation was computed. [2022-01-10 01:50:59,003 INFO L854 garLoopResultBuilder]: At program point L726(line 726) the Hoare annotation is: (let ((.cse0 (not (= ~__CS_ret_PREEMPTED~0 1))) (.cse1 (not (= (mod |old(~__CS_ret~0)| 256) 0)))) (and (or (and (= (mod ~__CS_ret~0 256) 0) (= |old(~__CS_thread~0.offset)| ~__CS_thread~0.offset) (not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset| 0))) .cse0 .cse1) (or (not (= 0 |old(~__CS_error~0)|)) (= ~__CS_error~0 0) .cse0 .cse1))) [2022-01-10 01:50:59,004 INFO L858 garLoopResultBuilder]: For program point L726-1(line 726) no Hoare annotation was computed. [2022-01-10 01:50:59,004 INFO L854 garLoopResultBuilder]: At program point L693(line 693) the Hoare annotation is: (let ((.cse1 (not (= ~__CS_ret_PREEMPTED~0 1))) (.cse2 (not (= (mod |old(~__CS_ret~0)| 256) 0)))) (and (let ((.cse0 (= |old(~__CS_thread~0.offset)| ~__CS_thread~0.offset))) (or (and (= (mod ~__CS_ret~0 256) 0) .cse0) .cse1 .cse2 (let ((.cse3 (+ ~__CS_ret~0 (* (div ~__CS_ret_PREEMPTED~0 256) 256)))) (and .cse0 (<= .cse3 ~__CS_ret_PREEMPTED~0) (<= ~__CS_ret_PREEMPTED~0 .cse3))))) (or (not (= 0 |old(~__CS_error~0)|)) (= ~__CS_error~0 0) .cse1 .cse2))) [2022-01-10 01:50:59,004 INFO L858 garLoopResultBuilder]: For program point L693-1(lines 690 704) no Hoare annotation was computed. [2022-01-10 01:50:59,004 INFO L854 garLoopResultBuilder]: At program point L727(line 727) the Hoare annotation is: (let ((.cse0 (not (= ~__CS_ret_PREEMPTED~0 1))) (.cse1 (not (= (mod |old(~__CS_ret~0)| 256) 0)))) (and (or (and (= (mod ~__CS_ret~0 256) 0) (= |old(~__CS_thread~0.offset)| ~__CS_thread~0.offset) (not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset| 0))) .cse0 .cse1) (or (not (= 0 |old(~__CS_error~0)|)) (= ~__CS_error~0 0) .cse0 .cse1))) [2022-01-10 01:50:59,004 INFO L858 garLoopResultBuilder]: For program point L727-1(lines 722 753) no Hoare annotation was computed. [2022-01-10 01:50:59,004 INFO L854 garLoopResultBuilder]: At program point L744(line 744) the Hoare annotation is: (or (not (= ~__CS_ret_PREEMPTED~0 1)) (and (= (mod ~__CS_ret~0 256) 0) (not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset| 0))) (not (= (mod |old(~__CS_ret~0)| 256) 0))) [2022-01-10 01:50:59,004 INFO L858 garLoopResultBuilder]: For program point L744-1(lines 743 751) no Hoare annotation was computed. [2022-01-10 01:50:59,004 INFO L854 garLoopResultBuilder]: At program point L711(line 711) the Hoare annotation is: (let ((.cse0 (not (= ~__CS_ret_PREEMPTED~0 1))) (.cse1 (not (= (mod |old(~__CS_ret~0)| 256) 0)))) (and (or .cse0 (and (= (mod ~__CS_ret~0 256) 0) (= |old(~__CS_thread~0.offset)| ~__CS_thread~0.offset) (= |#funAddr~thread2.offset| |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset|)) .cse1) (or (not (= 0 |old(~__CS_error~0)|)) (= ~__CS_error~0 0) .cse0 .cse1))) [2022-01-10 01:50:59,004 INFO L858 garLoopResultBuilder]: For program point L711-1(lines 706 720) no Hoare annotation was computed. [2022-01-10 01:50:59,004 INFO L854 garLoopResultBuilder]: At program point L728(line 728) the Hoare annotation is: (let ((.cse0 (not (= ~__CS_ret_PREEMPTED~0 1))) (.cse1 (not (= (mod |old(~__CS_ret~0)| 256) 0)))) (and (or (and (= (mod ~__CS_ret~0 256) 0) (= |old(~__CS_thread~0.offset)| ~__CS_thread~0.offset) (not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset| 0))) .cse0 .cse1) (or (not (= 0 |old(~__CS_error~0)|)) (= ~__CS_error~0 0) .cse0 .cse1))) [2022-01-10 01:50:59,004 INFO L858 garLoopResultBuilder]: For program point L728-1(line 728) no Hoare annotation was computed. [2022-01-10 01:50:59,004 INFO L854 garLoopResultBuilder]: At program point L695(line 695) the Hoare annotation is: (let ((.cse0 (not (= ~__CS_ret_PREEMPTED~0 1))) (.cse1 (not (= (mod |old(~__CS_ret~0)| 256) 0)))) (and (or (and (= (mod ~__CS_ret~0 256) 0) (= |old(~__CS_thread~0.offset)| ~__CS_thread~0.offset)) .cse0 .cse1) (or (not (= 0 |old(~__CS_error~0)|)) (= ~__CS_error~0 0) .cse0 .cse1))) [2022-01-10 01:50:59,004 INFO L858 garLoopResultBuilder]: For program point L695-1(lines 690 704) no Hoare annotation was computed. [2022-01-10 01:50:59,004 INFO L854 garLoopResultBuilder]: At program point L712(line 712) the Hoare annotation is: (let ((.cse0 (not (= ~__CS_ret_PREEMPTED~0 1))) (.cse1 (not (= (mod |old(~__CS_ret~0)| 256) 0)))) (and (or .cse0 (and (= (mod ~__CS_ret~0 256) 0) (= |old(~__CS_thread~0.offset)| ~__CS_thread~0.offset) (= |#funAddr~thread2.offset| |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset|)) .cse1) (or (not (= 0 |old(~__CS_error~0)|)) (= ~__CS_error~0 0) .cse0 .cse1))) [2022-01-10 01:50:59,004 INFO L858 garLoopResultBuilder]: For program point L712-1(line 712) no Hoare annotation was computed. [2022-01-10 01:50:59,004 INFO L854 garLoopResultBuilder]: At program point __CS_pthread_mutex_unlockENTRY(lines 588 596) the Hoare annotation is: (or (not (= ~__CS_ret_PREEMPTED~0 1)) (and (= |#memory_int| |old(#memory_int)|) (= ~__CS_error~0 |old(~__CS_error~0)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~__CS_ret~0)| ~__CS_ret~0)) (not (= (mod |old(~__CS_ret~0)| 256) 0))) [2022-01-10 01:50:59,004 INFO L858 garLoopResultBuilder]: For program point L590(lines 590 594) no Hoare annotation was computed. [2022-01-10 01:50:59,005 INFO L858 garLoopResultBuilder]: For program point __CS_pthread_mutex_unlockFINAL(lines 588 596) no Hoare annotation was computed. [2022-01-10 01:50:59,005 INFO L858 garLoopResultBuilder]: For program point __CS_pthread_mutex_unlockEXIT(lines 588 596) no Hoare annotation was computed. [2022-01-10 01:50:59,005 INFO L858 garLoopResultBuilder]: For program point __CS_pthread_createFINAL(lines 664 677) no Hoare annotation was computed. [2022-01-10 01:50:59,005 INFO L858 garLoopResultBuilder]: For program point L666(lines 666 669) no Hoare annotation was computed. [2022-01-10 01:50:59,005 INFO L858 garLoopResultBuilder]: For program point __CS_pthread_createEXIT(lines 664 677) no Hoare annotation was computed. [2022-01-10 01:50:59,005 INFO L854 garLoopResultBuilder]: At program point __CS_pthread_createENTRY(lines 664 677) the Hoare annotation is: (or (not (= (mod ~__CS_ret~0 256) 0)) (and (= |old(~__CS_thread~0.offset)| ~__CS_thread~0.offset) (= |#memory_int| |old(#memory_int)|) (= ~__CS_thread~0.base |old(~__CS_thread~0.base)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= ~__CS_thread_index~0 |old(~__CS_thread_index~0)|)) (not (= ~__CS_ret_PREEMPTED~0 1))) [2022-01-10 01:50:59,005 INFO L858 garLoopResultBuilder]: For program point L795(lines 795 800) no Hoare annotation was computed. [2022-01-10 01:50:59,005 INFO L858 garLoopResultBuilder]: For program point L795-1(lines 795 800) no Hoare annotation was computed. [2022-01-10 01:50:59,005 INFO L858 garLoopResultBuilder]: For program point L754(lines 754 818) no Hoare annotation was computed. [2022-01-10 01:50:59,005 INFO L854 garLoopResultBuilder]: At program point L812(line 812) the Hoare annotation is: (or (= ~__CS_ret_PREEMPTED~0 1) (= ~__CS_error~0 0)) [2022-01-10 01:50:59,005 INFO L858 garLoopResultBuilder]: For program point L812-1(line 812) no Hoare annotation was computed. [2022-01-10 01:50:59,005 INFO L854 garLoopResultBuilder]: At program point L804(line 804) the Hoare annotation is: (and (= (mod ~__CS_ret~0 256) 0) (= ~__CS_ret_PREEMPTED~0 1)) [2022-01-10 01:50:59,005 INFO L858 garLoopResultBuilder]: For program point L804-1(line 804) no Hoare annotation was computed. [2022-01-10 01:50:59,005 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-01-10 01:50:59,005 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-01-10 01:50:59,005 INFO L858 garLoopResultBuilder]: For program point L763-2(lines 763 772) no Hoare annotation was computed. [2022-01-10 01:50:59,005 INFO L854 garLoopResultBuilder]: At program point L763-3(lines 763 772) the Hoare annotation is: (and (= (mod ~__CS_ret~0 256) 0) (= ~__CS_ret_PREEMPTED~0 1) (= ~__CS_error~0 0) (= (select ~__CS_thread~0.offset 2) 0)) [2022-01-10 01:50:59,005 INFO L858 garLoopResultBuilder]: For program point L763-4(lines 763 772) no Hoare annotation was computed. [2022-01-10 01:50:59,005 INFO L854 garLoopResultBuilder]: At program point L813(line 813) the Hoare annotation is: (or (= ~__CS_ret_PREEMPTED~0 1) (= ~__CS_error~0 0)) [2022-01-10 01:50:59,006 INFO L858 garLoopResultBuilder]: For program point L813-1(line 813) no Hoare annotation was computed. [2022-01-10 01:50:59,006 INFO L858 garLoopResultBuilder]: For program point L805(line 805) no Hoare annotation was computed. [2022-01-10 01:50:59,006 INFO L858 garLoopResultBuilder]: For program point L541(lines 541 543) no Hoare annotation was computed. [2022-01-10 01:50:59,006 INFO L861 garLoopResultBuilder]: At program point L541-2(lines 540 545) the Hoare annotation is: true [2022-01-10 01:50:59,006 INFO L858 garLoopResultBuilder]: For program point L789(lines 789 794) no Hoare annotation was computed. [2022-01-10 01:50:59,006 INFO L858 garLoopResultBuilder]: For program point L789-1(lines 789 794) no Hoare annotation was computed. [2022-01-10 01:50:59,006 INFO L854 garLoopResultBuilder]: At program point L814(line 814) the Hoare annotation is: (or (= ~__CS_ret_PREEMPTED~0 1) (= ~__CS_error~0 0)) [2022-01-10 01:50:59,006 INFO L858 garLoopResultBuilder]: For program point L814-1(line 814) no Hoare annotation was computed. [2022-01-10 01:50:59,006 INFO L854 garLoopResultBuilder]: At program point L798(line 798) the Hoare annotation is: (and (= (mod ~__CS_ret~0 256) 0) (= ~__CS_ret_PREEMPTED~0 1)) [2022-01-10 01:50:59,006 INFO L858 garLoopResultBuilder]: For program point L542(line 542) no Hoare annotation was computed. [2022-01-10 01:50:59,006 INFO L858 garLoopResultBuilder]: For program point L798-1(line 798) no Hoare annotation was computed. [2022-01-10 01:50:59,006 INFO L854 garLoopResultBuilder]: At program point L815(line 815) the Hoare annotation is: (or (= ~__CS_ret_PREEMPTED~0 1) (= ~__CS_error~0 0)) [2022-01-10 01:50:59,006 INFO L858 garLoopResultBuilder]: For program point L815-1(line 815) no Hoare annotation was computed. [2022-01-10 01:50:59,006 INFO L854 garLoopResultBuilder]: At program point L807(line 807) the Hoare annotation is: (or (= ~__CS_ret_PREEMPTED~0 1) (= ~__CS_error~0 0)) [2022-01-10 01:50:59,006 INFO L858 garLoopResultBuilder]: For program point L807-1(line 807) no Hoare annotation was computed. [2022-01-10 01:50:59,006 INFO L858 garLoopResultBuilder]: For program point L799(line 799) no Hoare annotation was computed. [2022-01-10 01:50:59,006 INFO L854 garLoopResultBuilder]: At program point L816(line 816) the Hoare annotation is: (or (= ~__CS_ret_PREEMPTED~0 1) (= ~__CS_error~0 0)) [2022-01-10 01:50:59,006 INFO L858 garLoopResultBuilder]: For program point L816-1(line 816) no Hoare annotation was computed. [2022-01-10 01:50:59,006 INFO L854 garLoopResultBuilder]: At program point L808(line 808) the Hoare annotation is: (or (= ~__CS_ret_PREEMPTED~0 1) (= ~__CS_error~0 0)) [2022-01-10 01:50:59,007 INFO L858 garLoopResultBuilder]: For program point L808-1(line 808) no Hoare annotation was computed. [2022-01-10 01:50:59,007 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-01-10 01:50:59,007 INFO L854 garLoopResultBuilder]: At program point L792(line 792) the Hoare annotation is: (and (= (mod ~__CS_ret~0 256) 0) (= ~__CS_error~0 0) (= (+ (- 1) ~__CS_ret_PREEMPTED~0) 0) (= (select ~__CS_thread~0.offset 2) 0)) [2022-01-10 01:50:59,007 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 542) no Hoare annotation was computed. [2022-01-10 01:50:59,007 INFO L858 garLoopResultBuilder]: For program point L792-1(line 792) no Hoare annotation was computed. [2022-01-10 01:50:59,007 INFO L854 garLoopResultBuilder]: At program point L809(line 809) the Hoare annotation is: (or (= ~__CS_ret_PREEMPTED~0 1) (= ~__CS_error~0 0)) [2022-01-10 01:50:59,007 INFO L858 garLoopResultBuilder]: For program point L809-1(line 809) no Hoare annotation was computed. [2022-01-10 01:50:59,007 INFO L858 garLoopResultBuilder]: For program point L801(lines 801 806) no Hoare annotation was computed. [2022-01-10 01:50:59,007 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-01-10 01:50:59,007 INFO L858 garLoopResultBuilder]: For program point L801-1(lines 801 806) no Hoare annotation was computed. [2022-01-10 01:50:59,007 INFO L858 garLoopResultBuilder]: For program point L768-2(lines 768 771) no Hoare annotation was computed. [2022-01-10 01:50:59,007 INFO L854 garLoopResultBuilder]: At program point L768-3(lines 768 771) the Hoare annotation is: (and (= (mod ~__CS_ret~0 256) 0) (= ~__CS_ret_PREEMPTED~0 1) (= ~__CS_error~0 0) (<= |ULTIMATE.start_main_~i~0#1| 1) (= (select ~__CS_thread~0.offset 2) 0)) [2022-01-10 01:50:59,007 INFO L858 garLoopResultBuilder]: For program point L793(line 793) no Hoare annotation was computed. [2022-01-10 01:50:59,007 INFO L854 garLoopResultBuilder]: At program point L810(line 810) the Hoare annotation is: (or (= ~__CS_ret_PREEMPTED~0 1) (= ~__CS_error~0 0)) [2022-01-10 01:50:59,007 INFO L858 garLoopResultBuilder]: For program point L810-1(line 810) no Hoare annotation was computed. [2022-01-10 01:50:59,007 INFO L854 garLoopResultBuilder]: At program point L811(line 811) the Hoare annotation is: (or (= ~__CS_ret_PREEMPTED~0 1) (= ~__CS_error~0 0)) [2022-01-10 01:50:59,007 INFO L858 garLoopResultBuilder]: For program point L811-1(line 811) no Hoare annotation was computed. [2022-01-10 01:50:59,008 INFO L858 garLoopResultBuilder]: For program point __CS_csEXIT(lines 562 568) no Hoare annotation was computed. [2022-01-10 01:50:59,008 INFO L854 garLoopResultBuilder]: At program point __CS_csENTRY(lines 562 568) the Hoare annotation is: (or (not (= ~__CS_ret_PREEMPTED~0 1)) (and (= |old(~__CS_round~0)| ~__CS_round~0) (= |old(~__CS_ret~0)| ~__CS_ret~0))) [2022-01-10 01:50:59,008 INFO L858 garLoopResultBuilder]: For program point __CS_csFINAL(lines 562 568) no Hoare annotation was computed. [2022-01-10 01:50:59,008 INFO L858 garLoopResultBuilder]: For program point L567(line 567) no Hoare annotation was computed. [2022-01-10 01:50:59,008 INFO L854 garLoopResultBuilder]: At program point L565(line 565) the Hoare annotation is: (or (not (= ~__CS_ret_PREEMPTED~0 1)) (and (= |old(~__CS_round~0)| ~__CS_round~0) (= |old(~__CS_ret~0)| ~__CS_ret~0))) [2022-01-10 01:50:59,008 INFO L858 garLoopResultBuilder]: For program point L567-2(line 567) no Hoare annotation was computed. [2022-01-10 01:50:59,008 INFO L858 garLoopResultBuilder]: For program point L565-1(line 565) no Hoare annotation was computed. [2022-01-10 01:50:59,010 INFO L732 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1] [2022-01-10 01:50:59,011 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2022-01-10 01:50:59,035 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.offset [2022-01-10 01:50:59,035 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.offset [2022-01-10 01:50:59,037 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.offset [2022-01-10 01:50:59,038 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.offset [2022-01-10 01:50:59,039 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.offset [2022-01-10 01:50:59,040 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.offset [2022-01-10 01:50:59,040 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.offset [2022-01-10 01:50:59,041 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.offset [2022-01-10 01:50:59,041 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.offset [2022-01-10 01:50:59,041 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.offset [2022-01-10 01:50:59,041 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~thread2.offset [2022-01-10 01:50:59,042 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.offset [2022-01-10 01:50:59,042 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.offset [2022-01-10 01:50:59,043 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~thread2.offset [2022-01-10 01:50:59,048 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 01:50:59 BoogieIcfgContainer [2022-01-10 01:50:59,048 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-10 01:50:59,048 INFO L158 Benchmark]: Toolchain (without parser) took 57738.30ms. Allocated memory was 181.4MB in the beginning and 886.0MB in the end (delta: 704.6MB). Free memory was 124.0MB in the beginning and 301.3MB in the end (delta: -177.3MB). Peak memory consumption was 526.9MB. Max. memory is 8.0GB. [2022-01-10 01:50:59,061 INFO L158 Benchmark]: CDTParser took 0.08ms. Allocated memory is still 181.4MB. Free memory is still 142.2MB. There was no memory consumed. Max. memory is 8.0GB. [2022-01-10 01:50:59,061 INFO L158 Benchmark]: CACSL2BoogieTranslator took 437.00ms. Allocated memory was 181.4MB in the beginning and 263.2MB in the end (delta: 81.8MB). Free memory was 123.7MB in the beginning and 219.0MB in the end (delta: -95.3MB). Peak memory consumption was 9.6MB. Max. memory is 8.0GB. [2022-01-10 01:50:59,062 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.92ms. Allocated memory is still 263.2MB. Free memory was 219.0MB in the beginning and 214.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2022-01-10 01:50:59,062 INFO L158 Benchmark]: Boogie Preprocessor took 67.48ms. Allocated memory is still 263.2MB. Free memory was 214.8MB in the beginning and 211.3MB in the end (delta: 3.5MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-01-10 01:50:59,062 INFO L158 Benchmark]: RCFGBuilder took 2664.66ms. Allocated memory is still 263.2MB. Free memory was 211.3MB in the beginning and 205.0MB in the end (delta: 6.3MB). Peak memory consumption was 38.0MB. Max. memory is 8.0GB. [2022-01-10 01:50:59,063 INFO L158 Benchmark]: TraceAbstraction took 54514.41ms. Allocated memory was 263.2MB in the beginning and 886.0MB in the end (delta: 622.9MB). Free memory was 205.0MB in the beginning and 301.3MB in the end (delta: -96.3MB). Peak memory consumption was 526.5MB. Max. memory is 8.0GB. [2022-01-10 01:50:59,065 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.08ms. Allocated memory is still 181.4MB. Free memory is still 142.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 437.00ms. Allocated memory was 181.4MB in the beginning and 263.2MB in the end (delta: 81.8MB). Free memory was 123.7MB in the beginning and 219.0MB in the end (delta: -95.3MB). Peak memory consumption was 9.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 48.92ms. Allocated memory is still 263.2MB. Free memory was 219.0MB in the beginning and 214.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 67.48ms. Allocated memory is still 263.2MB. Free memory was 214.8MB in the beginning and 211.3MB in the end (delta: 3.5MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 2664.66ms. Allocated memory is still 263.2MB. Free memory was 211.3MB in the beginning and 205.0MB in the end (delta: 6.3MB). Peak memory consumption was 38.0MB. Max. memory is 8.0GB. * TraceAbstraction took 54514.41ms. Allocated memory was 263.2MB in the beginning and 886.0MB in the end (delta: 622.9MB). Free memory was 205.0MB in the beginning and 301.3MB in the end (delta: -96.3MB). Peak memory consumption was 526.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~thread2.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~thread2.offset * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 542]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 175 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 54.4s, OverallIterations: 9, TraceHistogramMax: 15, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 17.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 2.8s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 6 mSolverCounterUnknown, 1885 SdHoareTripleChecker+Valid, 16.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1835 mSDsluCounter, 6026 SdHoareTripleChecker+Invalid, 15.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3597 mSDsCounter, 1840 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4582 IncrementalHoareTripleChecker+Invalid, 6428 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1840 mSolverCounterUnsat, 2429 mSDtfsCounter, 4582 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1824 GetRequests, 1731 SyntacticMatches, 4 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 459 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=680occurred in iteration=8, InterpolantAutomatonStates: 67, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 9 MinimizatonAttempts, 48 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 69 LocationsWithAnnotation, 3070 PreInvPairs, 4306 NumberOfFragments, 1739 HoareAnnotationTreeSize, 3070 FomulaSimplifications, 4562 FormulaSimplificationTreeSizeReduction, 0.4s HoareSimplificationTime, 69 FomulaSimplificationsInter, 17331 FormulaSimplificationTreeSizeReductionInter, 2.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.6s SsaConstructionTime, 24.0s SatisfiabilityAnalysisTime, 4.8s InterpolantComputationTime, 1919 NumberOfCodeBlocks, 1715 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 2505 ConstructedInterpolants, 0 QuantifiedInterpolants, 5201 SizeOfPredicates, 16 NumberOfNonLiveVariables, 11899 ConjunctsInSsa, 38 ConjunctsInUnsatCore, 19 InterpolantComputations, 5 PerfectInterpolantSequences, 6711/6885 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 721]: Loop Invariant Derived loop invariant: (!(__CS_ret_PREEMPTED == 1) || !(#fp == 0)) || !(\old(__CS_ret) % 256 == 0) - InvariantResult [Line: 689]: Loop Invariant [2022-01-10 01:50:59,075 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.offset [2022-01-10 01:50:59,075 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.offset [2022-01-10 01:50:59,075 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.offset [2022-01-10 01:50:59,075 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.offset Derived loop invariant: (\old(__CS_thread) == __CS_thread || !(__CS_ret_PREEMPTED == 1)) || !(\old(__CS_ret) % 256 == 0) - InvariantResult [Line: 768]: Loop Invariant [2022-01-10 01:50:59,075 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.offset [2022-01-10 01:50:59,075 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.offset Derived loop invariant: (((__CS_ret % 256 == 0 && __CS_ret_PREEMPTED == 1) && __CS_error == 0) && i <= 1) && __CS_thread[2] == 0 - InvariantResult [Line: 763]: Loop Invariant [2022-01-10 01:50:59,075 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.offset [2022-01-10 01:50:59,076 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.offset Derived loop invariant: ((__CS_ret % 256 == 0 && __CS_ret_PREEMPTED == 1) && __CS_error == 0) && __CS_thread[2] == 0 - InvariantResult [Line: 705]: Loop Invariant [2022-01-10 01:50:59,076 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.offset [2022-01-10 01:50:59,076 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.offset [2022-01-10 01:50:59,076 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~thread2.offset [2022-01-10 01:50:59,076 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.offset [2022-01-10 01:50:59,076 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.offset [2022-01-10 01:50:59,076 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~thread2.offset Derived loop invariant: (!(__CS_ret_PREEMPTED == 1) || (\old(__CS_thread) == __CS_thread && #funAddr~thread2.offset == #fp)) || !(\old(__CS_ret) % 256 == 0) - InvariantResult [Line: 743]: Loop Invariant Derived loop invariant: (!(__CS_ret_PREEMPTED == 1) || (__CS_ret % 256 == 0 && !(#fp == 0))) || !(\old(__CS_ret) % 256 == 0) - InvariantResult [Line: 540]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2022-01-10 01:50:59,102 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...