./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-pthread/cs_stateful-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e19ca921 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-pthread/cs_stateful-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c1d6cba599289c2637bd3d8da41e464d318a32e6ae6e6e0e391ff437e6ce1fcc --- Real Ultimate output --- This is Ultimate 0.2.2-dev-e19ca92 [2021-12-22 12:20:31,053 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-22 12:20:31,055 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-22 12:20:31,131 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-22 12:20:31,132 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-22 12:20:31,134 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-22 12:20:31,135 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-22 12:20:31,138 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-22 12:20:31,140 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-22 12:20:31,143 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-22 12:20:31,144 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-22 12:20:31,145 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-22 12:20:31,146 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-22 12:20:31,148 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-22 12:20:31,149 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-22 12:20:31,152 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-22 12:20:31,152 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-22 12:20:31,153 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-22 12:20:31,155 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-22 12:20:31,159 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-22 12:20:31,164 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-22 12:20:31,165 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-22 12:20:31,166 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-22 12:20:31,167 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-22 12:20:31,173 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-22 12:20:31,173 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-22 12:20:31,173 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-22 12:20:31,175 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-22 12:20:31,175 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-22 12:20:31,176 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-22 12:20:31,176 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-22 12:20:31,177 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-22 12:20:31,178 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-22 12:20:31,179 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-22 12:20:31,180 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-22 12:20:31,180 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-22 12:20:31,181 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-22 12:20:31,181 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-22 12:20:31,181 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-22 12:20:31,182 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-22 12:20:31,183 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-22 12:20:31,183 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-22 12:20:31,214 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-22 12:20:31,215 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-22 12:20:31,215 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-22 12:20:31,215 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-22 12:20:31,216 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-22 12:20:31,216 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-22 12:20:31,217 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-22 12:20:31,217 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-22 12:20:31,217 INFO L138 SettingsManager]: * Use SBE=true [2021-12-22 12:20:31,217 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-22 12:20:31,218 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-22 12:20:31,219 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-22 12:20:31,219 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-22 12:20:31,219 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-22 12:20:31,219 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-22 12:20:31,219 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-22 12:20:31,219 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-22 12:20:31,220 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-22 12:20:31,220 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-22 12:20:31,220 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-22 12:20:31,220 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-22 12:20:31,220 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-22 12:20:31,221 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-22 12:20:31,221 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-22 12:20:31,221 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-22 12:20:31,221 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-22 12:20:31,221 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-22 12:20:31,223 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-22 12:20:31,223 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-22 12:20:31,223 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-22 12:20:31,223 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-22 12:20:31,223 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-22 12:20:31,224 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-22 12:20:31,224 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-22 12:20:31,224 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.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c1d6cba599289c2637bd3d8da41e464d318a32e6ae6e6e0e391ff437e6ce1fcc [2021-12-22 12:20:31,445 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-22 12:20:31,478 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-22 12:20:31,480 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-22 12:20:31,481 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-22 12:20:31,482 INFO L275 PluginConnector]: CDTParser initialized [2021-12-22 12:20:31,483 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-pthread/cs_stateful-2.i [2021-12-22 12:20:31,546 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f849b8a3c/52b0df6e66164c1fb43d10b8328555eb/FLAG64054f2dc [2021-12-22 12:20:31,996 INFO L306 CDTParser]: Found 1 translation units. [2021-12-22 12:20:31,996 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-pthread/cs_stateful-2.i [2021-12-22 12:20:32,012 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f849b8a3c/52b0df6e66164c1fb43d10b8328555eb/FLAG64054f2dc [2021-12-22 12:20:32,025 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f849b8a3c/52b0df6e66164c1fb43d10b8328555eb [2021-12-22 12:20:32,027 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-22 12:20:32,028 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-22 12:20:32,029 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-22 12:20:32,029 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-22 12:20:32,033 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-22 12:20:32,035 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.12 12:20:32" (1/1) ... [2021-12-22 12:20:32,036 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33a0e9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 12:20:32, skipping insertion in model container [2021-12-22 12:20:32,036 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.12 12:20:32" (1/1) ... [2021-12-22 12:20:32,041 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-22 12:20:32,081 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-22 12:20:32,301 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-pthread/cs_stateful-2.i[23607,23620] [2021-12-22 12:20:32,404 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-22 12:20:32,413 INFO L203 MainTranslator]: Completed pre-run [2021-12-22 12:20:32,442 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-pthread/cs_stateful-2.i[23607,23620] [2021-12-22 12:20:32,479 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-22 12:20:32,507 INFO L208 MainTranslator]: Completed translation [2021-12-22 12:20:32,508 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 12:20:32 WrapperNode [2021-12-22 12:20:32,508 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-22 12:20:32,509 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-22 12:20:32,509 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-22 12:20:32,509 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-22 12:20:32,516 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 12:20:32" (1/1) ... [2021-12-22 12:20:32,534 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 12:20:32" (1/1) ... [2021-12-22 12:20:32,585 INFO L137 Inliner]: procedures = 145, calls = 245, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 539 [2021-12-22 12:20:32,585 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-22 12:20:32,586 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-22 12:20:32,586 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-22 12:20:32,586 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-22 12:20:32,594 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 12:20:32" (1/1) ... [2021-12-22 12:20:32,595 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 12:20:32" (1/1) ... [2021-12-22 12:20:32,601 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 12:20:32" (1/1) ... [2021-12-22 12:20:32,602 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 12:20:32" (1/1) ... [2021-12-22 12:20:32,619 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 12:20:32" (1/1) ... [2021-12-22 12:20:32,624 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 12:20:32" (1/1) ... [2021-12-22 12:20:32,628 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 12:20:32" (1/1) ... [2021-12-22 12:20:32,633 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-22 12:20:32,634 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-22 12:20:32,635 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-22 12:20:32,635 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-22 12:20:32,636 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 12:20:32" (1/1) ... [2021-12-22 12:20:32,641 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-22 12:20:32,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 12:20:32,696 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) [2021-12-22 12:20:32,701 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 [2021-12-22 12:20:32,736 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-22 12:20:32,736 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-22 12:20:32,737 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2021-12-22 12:20:32,737 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2021-12-22 12:20:32,737 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-22 12:20:32,737 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-22 12:20:32,737 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-22 12:20:32,737 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_mutex_init [2021-12-22 12:20:32,738 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_mutex_init [2021-12-22 12:20:32,738 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_mutex_lock [2021-12-22 12:20:32,738 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_mutex_lock [2021-12-22 12:20:32,738 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_create [2021-12-22 12:20:32,738 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_create [2021-12-22 12:20:32,738 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-22 12:20:32,739 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_join [2021-12-22 12:20:32,739 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_join [2021-12-22 12:20:32,739 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~$Pointer$ [2021-12-22 12:20:32,739 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~$Pointer$ [2021-12-22 12:20:32,739 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-22 12:20:32,739 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-12-22 12:20:32,739 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_cs [2021-12-22 12:20:32,740 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_cs [2021-12-22 12:20:32,740 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-22 12:20:32,740 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_mutex_unlock [2021-12-22 12:20:32,740 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_mutex_unlock [2021-12-22 12:20:32,740 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-22 12:20:32,740 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-22 12:20:32,912 INFO L234 CfgBuilder]: Building ICFG [2021-12-22 12:20:32,914 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-22 12:20:33,223 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L750: SUMMARY for call __CS_cs(); srcloc: null [2021-12-22 12:20:33,223 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; [2021-12-22 12:20:33,223 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L750-1: assume !(0 != ~__CS_ret~0 % 256); [2021-12-22 12:20:33,224 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##31: assume !(0 != ~__CS_ret~0 % 256); [2021-12-22 12:20:33,224 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; [2021-12-22 12:20:33,224 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##29: assume !(0 != ~__CS_ret~0 % 256); [2021-12-22 12:20:33,224 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; [2021-12-22 12:20:34,682 INFO L275 CfgBuilder]: Performing block encoding [2021-12-22 12:20:34,689 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-22 12:20:34,690 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2021-12-22 12:20:34,692 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 12:20:34 BoogieIcfgContainer [2021-12-22 12:20:34,692 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-22 12:20:34,694 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-22 12:20:34,694 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-22 12:20:34,697 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-22 12:20:34,697 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.12 12:20:32" (1/3) ... [2021-12-22 12:20:34,698 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64f1500d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.12 12:20:34, skipping insertion in model container [2021-12-22 12:20:34,698 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 12:20:32" (2/3) ... [2021-12-22 12:20:34,698 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64f1500d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.12 12:20:34, skipping insertion in model container [2021-12-22 12:20:34,698 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 12:20:34" (3/3) ... [2021-12-22 12:20:34,700 INFO L111 eAbstractionObserver]: Analyzing ICFG cs_stateful-2.i [2021-12-22 12:20:34,704 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-22 12:20:34,705 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-22 12:20:34,752 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-22 12:20:34,762 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 [2021-12-22 12:20:34,763 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-22 12:20:34,802 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) [2021-12-22 12:20:34,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-12-22 12:20:34,825 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 12:20:34,826 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] [2021-12-22 12:20:34,826 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 12:20:34,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 12:20:34,832 INFO L85 PathProgramCache]: Analyzing trace with hash 246520095, now seen corresponding path program 1 times [2021-12-22 12:20:34,839 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 12:20:34,840 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601074756] [2021-12-22 12:20:34,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 12:20:34,841 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 12:20:35,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:20:35,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-22 12:20:35,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:20:35,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-22 12:20:35,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:20:35,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-22 12:20:35,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:20:35,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2021-12-22 12:20:35,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:20:35,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-22 12:20:35,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:20:35,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-22 12:20:35,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:20:35,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-12-22 12:20:35,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:20:35,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-12-22 12:20:35,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:20:35,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2021-12-22 12:20:35,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:20:35,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-22 12:20:35,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:20:35,331 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2021-12-22 12:20:35,332 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 12:20:35,332 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601074756] [2021-12-22 12:20:35,333 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601074756] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 12:20:35,333 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 12:20:35,333 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-22 12:20:35,335 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206800478] [2021-12-22 12:20:35,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 12:20:35,338 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-12-22 12:20:35,339 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 12:20:35,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-22 12:20:35,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-22 12:20:35,367 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) [2021-12-22 12:20:35,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 12:20:35,442 INFO L93 Difference]: Finished difference Result 348 states and 578 transitions. [2021-12-22 12:20:35,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-22 12:20:35,444 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 [2021-12-22 12:20:35,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 12:20:35,453 INFO L225 Difference]: With dead ends: 348 [2021-12-22 12:20:35,453 INFO L226 Difference]: Without dead ends: 171 [2021-12-22 12:20:35,462 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 [2021-12-22 12:20:35,467 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 [2021-12-22 12:20:35,468 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] [2021-12-22 12:20:35,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2021-12-22 12:20:35,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2021-12-22 12:20:35,524 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) [2021-12-22 12:20:35,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 261 transitions. [2021-12-22 12:20:35,528 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 261 transitions. Word has length 72 [2021-12-22 12:20:35,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 12:20:35,528 INFO L470 AbstractCegarLoop]: Abstraction has 171 states and 261 transitions. [2021-12-22 12:20:35,529 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) [2021-12-22 12:20:35,529 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 261 transitions. [2021-12-22 12:20:35,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-12-22 12:20:35,532 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 12:20:35,533 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] [2021-12-22 12:20:35,533 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-22 12:20:35,533 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 12:20:35,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 12:20:35,534 INFO L85 PathProgramCache]: Analyzing trace with hash 1330951645, now seen corresponding path program 1 times [2021-12-22 12:20:35,534 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 12:20:35,534 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521592197] [2021-12-22 12:20:35,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 12:20:35,534 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 12:20:35,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:20:35,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-22 12:20:35,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:20:35,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-22 12:20:35,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:20:35,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-22 12:20:35,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:20:35,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2021-12-22 12:20:35,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:20:35,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-22 12:20:35,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:20:35,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-22 12:20:35,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:20:35,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-12-22 12:20:35,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:20:35,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-12-22 12:20:35,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:20:35,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2021-12-22 12:20:35,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:20:35,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-22 12:20:35,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:20:35,887 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2021-12-22 12:20:35,887 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 12:20:35,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521592197] [2021-12-22 12:20:35,888 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [521592197] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 12:20:35,889 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 12:20:35,889 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-22 12:20:35,889 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490669445] [2021-12-22 12:20:35,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 12:20:35,891 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-22 12:20:35,891 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 12:20:35,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-22 12:20:35,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-22 12:20:35,893 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) [2021-12-22 12:20:35,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 12:20:35,951 INFO L93 Difference]: Finished difference Result 340 states and 520 transitions. [2021-12-22 12:20:35,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-22 12:20:35,952 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 [2021-12-22 12:20:35,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 12:20:35,955 INFO L225 Difference]: With dead ends: 340 [2021-12-22 12:20:35,955 INFO L226 Difference]: Without dead ends: 175 [2021-12-22 12:20:35,956 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 [2021-12-22 12:20:35,957 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 [2021-12-22 12:20:35,957 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] [2021-12-22 12:20:35,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2021-12-22 12:20:35,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 172. [2021-12-22 12:20:35,970 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) [2021-12-22 12:20:35,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 262 transitions. [2021-12-22 12:20:35,972 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 262 transitions. Word has length 72 [2021-12-22 12:20:35,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 12:20:35,972 INFO L470 AbstractCegarLoop]: Abstraction has 172 states and 262 transitions. [2021-12-22 12:20:35,973 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) [2021-12-22 12:20:35,973 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 262 transitions. [2021-12-22 12:20:35,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-12-22 12:20:35,975 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 12:20:35,976 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] [2021-12-22 12:20:35,976 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-22 12:20:35,976 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 12:20:35,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 12:20:35,977 INFO L85 PathProgramCache]: Analyzing trace with hash 1826847327, now seen corresponding path program 1 times [2021-12-22 12:20:35,977 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 12:20:35,977 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990727600] [2021-12-22 12:20:35,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 12:20:35,977 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 12:20:36,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:20:36,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-22 12:20:36,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:20:36,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-12-22 12:20:36,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:20:36,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-22 12:20:36,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:20:36,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2021-12-22 12:20:36,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:20:36,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-22 12:20:36,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:20:36,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-22 12:20:36,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:20:36,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-12-22 12:20:36,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:20:36,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-12-22 12:20:36,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:20:36,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-12-22 12:20:36,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:20:36,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-12-22 12:20:36,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:20:36,216 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2021-12-22 12:20:36,217 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 12:20:36,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990727600] [2021-12-22 12:20:36,217 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1990727600] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 12:20:36,218 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 12:20:36,218 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-22 12:20:36,218 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304012661] [2021-12-22 12:20:36,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 12:20:36,219 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-22 12:20:36,219 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 12:20:36,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-22 12:20:36,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-22 12:20:36,220 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) [2021-12-22 12:20:36,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 12:20:36,265 INFO L93 Difference]: Finished difference Result 343 states and 524 transitions. [2021-12-22 12:20:36,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-22 12:20:36,266 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 [2021-12-22 12:20:36,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 12:20:36,271 INFO L225 Difference]: With dead ends: 343 [2021-12-22 12:20:36,271 INFO L226 Difference]: Without dead ends: 174 [2021-12-22 12:20:36,272 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 [2021-12-22 12:20:36,274 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 [2021-12-22 12:20:36,274 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] [2021-12-22 12:20:36,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2021-12-22 12:20:36,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 173. [2021-12-22 12:20:36,287 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) [2021-12-22 12:20:36,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 263 transitions. [2021-12-22 12:20:36,289 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 263 transitions. Word has length 75 [2021-12-22 12:20:36,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 12:20:36,290 INFO L470 AbstractCegarLoop]: Abstraction has 173 states and 263 transitions. [2021-12-22 12:20:36,290 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) [2021-12-22 12:20:36,290 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 263 transitions. [2021-12-22 12:20:36,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-12-22 12:20:36,296 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 12:20:36,297 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] [2021-12-22 12:20:36,297 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-22 12:20:36,297 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 12:20:36,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 12:20:36,301 INFO L85 PathProgramCache]: Analyzing trace with hash -541531615, now seen corresponding path program 1 times [2021-12-22 12:20:36,302 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 12:20:36,302 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533031908] [2021-12-22 12:20:36,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 12:20:36,302 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 12:20:36,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:20:36,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-12-22 12:20:36,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:20:36,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-22 12:20:36,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:20:36,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-12-22 12:20:36,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:20:36,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-22 12:20:36,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:20:36,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-12-22 12:20:36,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:20:36,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2021-12-22 12:20:36,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:20:36,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-22 12:20:36,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:20:36,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2021-12-22 12:20:36,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:20:36,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2021-12-22 12:20:36,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:20:36,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2021-12-22 12:20:36,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:20:36,518 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2021-12-22 12:20:36,518 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 12:20:36,518 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533031908] [2021-12-22 12:20:36,518 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533031908] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-22 12:20:36,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1630881378] [2021-12-22 12:20:36,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 12:20:36,519 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 12:20:36,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 12:20:36,526 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) [2021-12-22 12:20:36,527 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-22 12:20:37,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:20:37,176 INFO L263 TraceCheckSpWp]: Trace formula consists of 1765 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-22 12:20:37,182 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 12:20:37,335 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2021-12-22 12:20:37,335 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-22 12:20:37,525 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2021-12-22 12:20:37,525 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1630881378] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-22 12:20:37,526 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-22 12:20:37,526 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2021-12-22 12:20:37,526 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583037979] [2021-12-22 12:20:37,526 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-22 12:20:37,527 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-22 12:20:37,527 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 12:20:37,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-22 12:20:37,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-12-22 12:20:37,528 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) [2021-12-22 12:20:37,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 12:20:37,561 INFO L93 Difference]: Finished difference Result 347 states and 529 transitions. [2021-12-22 12:20:37,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-22 12:20:37,562 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 [2021-12-22 12:20:37,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 12:20:37,564 INFO L225 Difference]: With dead ends: 347 [2021-12-22 12:20:37,564 INFO L226 Difference]: Without dead ends: 177 [2021-12-22 12:20:37,584 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 [2021-12-22 12:20:37,585 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 [2021-12-22 12:20:37,585 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] [2021-12-22 12:20:37,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2021-12-22 12:20:37,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2021-12-22 12:20:37,599 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) [2021-12-22 12:20:37,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 267 transitions. [2021-12-22 12:20:37,601 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 267 transitions. Word has length 77 [2021-12-22 12:20:37,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 12:20:37,602 INFO L470 AbstractCegarLoop]: Abstraction has 177 states and 267 transitions. [2021-12-22 12:20:37,602 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) [2021-12-22 12:20:37,602 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 267 transitions. [2021-12-22 12:20:37,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2021-12-22 12:20:37,603 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 12:20:37,604 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] [2021-12-22 12:20:37,635 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-12-22 12:20:37,831 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 [2021-12-22 12:20:37,832 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 12:20:37,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 12:20:37,832 INFO L85 PathProgramCache]: Analyzing trace with hash -1454696411, now seen corresponding path program 2 times [2021-12-22 12:20:37,833 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 12:20:37,833 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968762975] [2021-12-22 12:20:37,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 12:20:37,833 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 12:20:37,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:20:38,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-12-22 12:20:38,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:20:38,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-22 12:20:38,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:20:38,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2021-12-22 12:20:38,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:20:38,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-22 12:20:38,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:20:38,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-22 12:20:38,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:20:38,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-12-22 12:20:38,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:20:38,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-12-22 12:20:38,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:20:38,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-12-22 12:20:38,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:20:38,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-12-22 12:20:38,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:20:38,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-22 12:20:38,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:20:38,069 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 189 trivial. 0 not checked. [2021-12-22 12:20:38,069 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 12:20:38,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968762975] [2021-12-22 12:20:38,069 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968762975] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-22 12:20:38,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1155078407] [2021-12-22 12:20:38,070 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-22 12:20:38,070 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 12:20:38,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 12:20:38,071 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) [2021-12-22 12:20:38,097 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-22 12:20:38,914 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-12-22 12:20:38,914 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-22 12:20:38,923 INFO L263 TraceCheckSpWp]: Trace formula consists of 1519 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-22 12:20:38,927 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 12:20:39,127 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2021-12-22 12:20:39,127 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-22 12:20:39,127 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1155078407] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 12:20:39,128 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-22 12:20:39,128 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2021-12-22 12:20:39,128 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173771892] [2021-12-22 12:20:39,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 12:20:39,129 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-22 12:20:39,129 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 12:20:39,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-22 12:20:39,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-22 12:20:39,130 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) [2021-12-22 12:20:39,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 12:20:39,159 INFO L93 Difference]: Finished difference Result 339 states and 524 transitions. [2021-12-22 12:20:39,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-22 12:20:39,160 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 [2021-12-22 12:20:39,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 12:20:39,163 INFO L225 Difference]: With dead ends: 339 [2021-12-22 12:20:39,164 INFO L226 Difference]: Without dead ends: 313 [2021-12-22 12:20:39,164 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 [2021-12-22 12:20:39,165 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 [2021-12-22 12:20:39,165 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] [2021-12-22 12:20:39,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2021-12-22 12:20:39,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 312. [2021-12-22 12:20:39,183 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) [2021-12-22 12:20:39,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 485 transitions. [2021-12-22 12:20:39,186 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 485 transitions. Word has length 81 [2021-12-22 12:20:39,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 12:20:39,186 INFO L470 AbstractCegarLoop]: Abstraction has 312 states and 485 transitions. [2021-12-22 12:20:39,186 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) [2021-12-22 12:20:39,187 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 485 transitions. [2021-12-22 12:20:39,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2021-12-22 12:20:39,190 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 12:20:39,190 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] [2021-12-22 12:20:39,229 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-12-22 12:20:39,403 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 [2021-12-22 12:20:39,404 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 12:20:39,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 12:20:39,404 INFO L85 PathProgramCache]: Analyzing trace with hash -613977023, now seen corresponding path program 1 times [2021-12-22 12:20:39,404 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 12:20:39,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630256020] [2021-12-22 12:20:39,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 12:20:39,404 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 12:20:39,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:20:39,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-22 12:20:39,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:20:39,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 12:20:39,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:20:39,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-22 12:20:39,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:20:39,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-22 12:20:39,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:20:39,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-22 12:20:39,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:20:39,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-22 12:20:39,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:20:39,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-22 12:20:39,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:20:39,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-22 12:20:39,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:20:39,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2021-12-22 12:20:39,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:20:39,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-22 12:20:39,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:20:39,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-22 12:20:39,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:20:39,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2021-12-22 12:20:39,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:20:39,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2021-12-22 12:20:39,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:20:39,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-12-22 12:20:39,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:20:39,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2021-12-22 12:20:39,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:20:39,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2021-12-22 12:20:39,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:20:39,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2021-12-22 12:20:39,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:20:39,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2021-12-22 12:20:39,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:20:39,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2021-12-22 12:20:39,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:20:39,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2021-12-22 12:20:39,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:20:39,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2021-12-22 12:20:39,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:20:39,723 INFO L134 CoverageAnalysis]: Checked inductivity of 416 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 415 trivial. 0 not checked. [2021-12-22 12:20:39,723 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 12:20:39,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630256020] [2021-12-22 12:20:39,723 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630256020] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-22 12:20:39,724 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [502818050] [2021-12-22 12:20:39,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 12:20:39,724 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 12:20:39,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 12:20:39,725 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) [2021-12-22 12:20:39,751 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-12-22 12:20:40,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:20:40,570 INFO L263 TraceCheckSpWp]: Trace formula consists of 2132 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-22 12:20:40,577 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 12:20:40,826 INFO L134 CoverageAnalysis]: Checked inductivity of 416 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 415 trivial. 0 not checked. [2021-12-22 12:20:40,827 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-22 12:20:41,124 INFO L134 CoverageAnalysis]: Checked inductivity of 416 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 415 trivial. 0 not checked. [2021-12-22 12:20:41,125 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [502818050] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-22 12:20:41,125 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-22 12:20:41,125 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 4, 4] total 9 [2021-12-22 12:20:41,126 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510193792] [2021-12-22 12:20:41,126 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-22 12:20:41,127 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-22 12:20:41,127 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 12:20:41,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-22 12:20:41,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2021-12-22 12:20:41,128 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) [2021-12-22 12:20:43,181 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 [] [2021-12-22 12:20:45,199 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 [] [2021-12-22 12:20:45,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 12:20:45,719 INFO L93 Difference]: Finished difference Result 631 states and 988 transitions. [2021-12-22 12:20:45,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-22 12:20:45,720 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 [2021-12-22 12:20:45,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 12:20:45,723 INFO L225 Difference]: With dead ends: 631 [2021-12-22 12:20:45,723 INFO L226 Difference]: Without dead ends: 331 [2021-12-22 12:20:45,725 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 [2021-12-22 12:20:45,725 INFO L933 BasicCegarLoop]: 254 mSDtfsCounter, 100 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 288 mSolverCounterSat, 227 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 637 SdHoareTripleChecker+Invalid, 517 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 227 IncrementalHoareTripleChecker+Valid, 288 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2021-12-22 12:20:45,725 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [102 Valid, 637 Invalid, 517 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [227 Valid, 288 Invalid, 2 Unknown, 0 Unchecked, 4.5s Time] [2021-12-22 12:20:45,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2021-12-22 12:20:45,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 325. [2021-12-22 12:20:45,743 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) [2021-12-22 12:20:45,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 503 transitions. [2021-12-22 12:20:45,746 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 503 transitions. Word has length 155 [2021-12-22 12:20:45,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 12:20:45,747 INFO L470 AbstractCegarLoop]: Abstraction has 325 states and 503 transitions. [2021-12-22 12:20:45,747 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) [2021-12-22 12:20:45,747 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 503 transitions. [2021-12-22 12:20:45,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2021-12-22 12:20:45,750 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 12:20:45,751 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] [2021-12-22 12:20:45,782 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-12-22 12:20:45,975 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 [2021-12-22 12:20:45,976 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 12:20:45,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 12:20:45,976 INFO L85 PathProgramCache]: Analyzing trace with hash -1817944839, now seen corresponding path program 2 times [2021-12-22 12:20:45,976 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 12:20:45,976 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749089749] [2021-12-22 12:20:45,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 12:20:45,976 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 12:20:57,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:20:58,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-12-22 12:20:58,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:20:58,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 12:20:58,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:20:58,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-22 12:20:58,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:20:58,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-22 12:20:58,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:20:58,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-22 12:20:58,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:20:58,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-22 12:20:58,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:20:58,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-22 12:20:58,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:20:58,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-22 12:20:58,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:20:58,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2021-12-22 12:20:58,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:20:58,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-22 12:20:58,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:20:58,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-22 12:20:58,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:20:58,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2021-12-22 12:20:58,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:20:58,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2021-12-22 12:20:58,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:20:58,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2021-12-22 12:20:58,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:20:58,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2021-12-22 12:20:58,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:20:58,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2021-12-22 12:20:58,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:20:58,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2021-12-22 12:20:58,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:20:58,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2021-12-22 12:20:58,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:20:58,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2021-12-22 12:20:58,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:20:58,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2021-12-22 12:20:58,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:20:58,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2021-12-22 12:20:58,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:20:58,367 INFO L134 CoverageAnalysis]: Checked inductivity of 453 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 444 trivial. 0 not checked. [2021-12-22 12:20:58,367 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 12:20:58,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749089749] [2021-12-22 12:20:58,368 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749089749] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-22 12:20:58,368 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1889018997] [2021-12-22 12:20:58,368 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-22 12:20:58,368 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 12:20:58,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 12:20:58,369 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) [2021-12-22 12:20:58,371 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-12-22 12:20:59,375 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-12-22 12:20:59,376 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-22 12:20:59,388 INFO L263 TraceCheckSpWp]: Trace formula consists of 1583 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-22 12:20:59,396 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 12:20:59,668 INFO L134 CoverageAnalysis]: Checked inductivity of 453 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 453 trivial. 0 not checked. [2021-12-22 12:20:59,668 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-22 12:20:59,669 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1889018997] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 12:20:59,669 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-22 12:20:59,669 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [12] total 13 [2021-12-22 12:20:59,669 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200729565] [2021-12-22 12:20:59,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 12:20:59,669 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-22 12:20:59,669 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 12:20:59,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-22 12:20:59,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2021-12-22 12:20:59,670 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) [2021-12-22 12:20:59,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 12:20:59,691 INFO L93 Difference]: Finished difference Result 619 states and 965 transitions. [2021-12-22 12:20:59,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-22 12:20:59,692 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 [2021-12-22 12:20:59,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 12:20:59,695 INFO L225 Difference]: With dead ends: 619 [2021-12-22 12:20:59,695 INFO L226 Difference]: Without dead ends: 325 [2021-12-22 12:20:59,697 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 202 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2021-12-22 12:20:59,698 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 [2021-12-22 12:20:59,698 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] [2021-12-22 12:20:59,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2021-12-22 12:20:59,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 325. [2021-12-22 12:20:59,718 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) [2021-12-22 12:20:59,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 502 transitions. [2021-12-22 12:20:59,720 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 502 transitions. Word has length 164 [2021-12-22 12:20:59,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 12:20:59,720 INFO L470 AbstractCegarLoop]: Abstraction has 325 states and 502 transitions. [2021-12-22 12:20:59,721 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) [2021-12-22 12:20:59,721 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 502 transitions. [2021-12-22 12:20:59,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2021-12-22 12:20:59,724 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 12:20:59,724 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] [2021-12-22 12:20:59,758 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-12-22 12:20:59,943 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 [2021-12-22 12:20:59,943 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 12:20:59,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 12:20:59,943 INFO L85 PathProgramCache]: Analyzing trace with hash 755632713, now seen corresponding path program 1 times [2021-12-22 12:20:59,944 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 12:20:59,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741701629] [2021-12-22 12:20:59,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 12:20:59,944 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 12:21:00,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:21:00,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-22 12:21:00,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:21:00,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-22 12:21:00,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:21:00,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-22 12:21:00,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:21:00,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-12-22 12:21:00,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:21:00,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 12:21:00,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:21:00,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-22 12:21:00,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:21:00,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-22 12:21:00,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:21:00,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-22 12:21:00,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:21:00,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-22 12:21:00,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:21:00,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-22 12:21:00,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:21:00,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-22 12:21:00,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:21:00,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2021-12-22 12:21:00,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:21:00,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-22 12:21:00,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:21:00,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-22 12:21:00,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:21:00,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2021-12-22 12:21:00,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:21:00,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2021-12-22 12:21:00,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:21:00,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2021-12-22 12:21:00,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:21:00,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2021-12-22 12:21:00,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:21:00,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2021-12-22 12:21:00,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:21:00,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2021-12-22 12:21:00,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:21:00,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2021-12-22 12:21:00,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:21:00,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2021-12-22 12:21:00,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:21:00,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2021-12-22 12:21:00,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:21:00,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2021-12-22 12:21:00,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:21:00,514 INFO L134 CoverageAnalysis]: Checked inductivity of 542 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 538 trivial. 0 not checked. [2021-12-22 12:21:00,514 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 12:21:00,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741701629] [2021-12-22 12:21:00,515 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [741701629] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-22 12:21:00,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2126423986] [2021-12-22 12:21:00,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 12:21:00,515 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 12:21:00,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 12:21:00,519 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) [2021-12-22 12:21:00,520 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-12-22 12:21:01,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:21:01,590 INFO L263 TraceCheckSpWp]: Trace formula consists of 2467 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-22 12:21:01,598 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 12:21:01,621 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 [2021-12-22 12:21:01,678 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 [2021-12-22 12:21:01,901 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 [2021-12-22 12:21:02,006 INFO L134 CoverageAnalysis]: Checked inductivity of 542 backedges. 200 proven. 5 refuted. 0 times theorem prover too weak. 337 trivial. 0 not checked. [2021-12-22 12:21:02,007 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-22 12:21:02,179 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 [2021-12-22 12:21:02,480 INFO L134 CoverageAnalysis]: Checked inductivity of 542 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 537 trivial. 0 not checked. [2021-12-22 12:21:02,480 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2126423986] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-22 12:21:02,481 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-22 12:21:02,482 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 5] total 14 [2021-12-22 12:21:02,482 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382657576] [2021-12-22 12:21:02,482 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-22 12:21:02,484 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-22 12:21:02,485 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 12:21:02,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-22 12:21:02,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2021-12-22 12:21:02,486 INFO L87 Difference]: Start difference. First operand 325 states and 502 transitions. Second operand has 14 states, 14 states have (on average 8.857142857142858) internal successors, (124), 10 states have internal predecessors, (124), 10 states have call successors, (42), 8 states have call predecessors, (42), 7 states have return successors, (42), 10 states have call predecessors, (42), 10 states have call successors, (42) [2021-12-22 12:21:04,530 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 [] [2021-12-22 12:21:06,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 12:21:06,425 INFO L93 Difference]: Finished difference Result 747 states and 1193 transitions. [2021-12-22 12:21:06,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-12-22 12:21:06,425 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 8.857142857142858) internal successors, (124), 10 states have internal predecessors, (124), 10 states have call successors, (42), 8 states have call predecessors, (42), 7 states have return successors, (42), 10 states have call predecessors, (42), 10 states have call successors, (42) Word has length 186 [2021-12-22 12:21:06,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 12:21:06,432 INFO L225 Difference]: With dead ends: 747 [2021-12-22 12:21:06,432 INFO L226 Difference]: Without dead ends: 717 [2021-12-22 12:21:06,433 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 448 GetRequests, 419 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=247, Invalid=623, Unknown=0, NotChecked=0, Total=870 [2021-12-22 12:21:06,434 INFO L933 BasicCegarLoop]: 255 mSDtfsCounter, 1061 mSDsluCounter, 946 mSDsCounter, 0 mSdLazyCounter, 1501 mSolverCounterSat, 1040 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1073 SdHoareTripleChecker+Valid, 1201 SdHoareTripleChecker+Invalid, 2542 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1040 IncrementalHoareTripleChecker+Valid, 1501 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2021-12-22 12:21:06,434 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1073 Valid, 1201 Invalid, 2542 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1040 Valid, 1501 Invalid, 1 Unknown, 0 Unchecked, 3.6s Time] [2021-12-22 12:21:06,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2021-12-22 12:21:06,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 680. [2021-12-22 12:21:06,486 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) [2021-12-22 12:21:06,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 680 states to 680 states and 1086 transitions. [2021-12-22 12:21:06,491 INFO L78 Accepts]: Start accepts. Automaton has 680 states and 1086 transitions. Word has length 186 [2021-12-22 12:21:06,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 12:21:06,492 INFO L470 AbstractCegarLoop]: Abstraction has 680 states and 1086 transitions. [2021-12-22 12:21:06,492 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 8.857142857142858) internal successors, (124), 10 states have internal predecessors, (124), 10 states have call successors, (42), 8 states have call predecessors, (42), 7 states have return successors, (42), 10 states have call predecessors, (42), 10 states have call successors, (42) [2021-12-22 12:21:06,493 INFO L276 IsEmpty]: Start isEmpty. Operand 680 states and 1086 transitions. [2021-12-22 12:21:06,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2021-12-22 12:21:06,497 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 12:21:06,497 INFO L514 BasicCegarLoop]: trace histogram [15, 15, 15, 6, 6, 5, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 12:21:06,525 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2021-12-22 12:21:06,711 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 [2021-12-22 12:21:06,712 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 12:21:06,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 12:21:06,712 INFO L85 PathProgramCache]: Analyzing trace with hash 998047407, now seen corresponding path program 1 times [2021-12-22 12:21:06,712 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 12:21:06,712 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950315882] [2021-12-22 12:21:06,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 12:21:06,712 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 12:21:06,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:21:07,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-22 12:21:07,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:21:07,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 12:21:07,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:21:07,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-22 12:21:07,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:21:07,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-12-22 12:21:07,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:21:07,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 12:21:07,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:21:07,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-22 12:21:07,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:21:07,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-22 12:21:07,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:21:07,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-22 12:21:07,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:21:07,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-22 12:21:07,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:21:07,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-22 12:21:07,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:21:07,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-22 12:21:07,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:21:07,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2021-12-22 12:21:07,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:21:07,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-22 12:21:07,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:21:07,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-22 12:21:07,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:21:07,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2021-12-22 12:21:07,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:21:07,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2021-12-22 12:21:07,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:21:07,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2021-12-22 12:21:07,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:21:07,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-12-22 12:21:07,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:21:07,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2021-12-22 12:21:07,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:21:07,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2021-12-22 12:21:07,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:21:07,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2021-12-22 12:21:07,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:21:07,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2021-12-22 12:21:07,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:21:07,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2021-12-22 12:21:07,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:21:07,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2021-12-22 12:21:07,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:21:07,171 INFO L134 CoverageAnalysis]: Checked inductivity of 543 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 540 trivial. 0 not checked. [2021-12-22 12:21:07,171 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 12:21:07,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950315882] [2021-12-22 12:21:07,171 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [950315882] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-22 12:21:07,172 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [718133355] [2021-12-22 12:21:07,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 12:21:07,172 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 12:21:07,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 12:21:07,176 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) [2021-12-22 12:21:07,177 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-12-22 12:21:08,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:21:08,363 INFO L263 TraceCheckSpWp]: Trace formula consists of 2436 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-22 12:21:08,367 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 12:21:08,392 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-22 12:21:08,404 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 5 treesize of output 3 [2021-12-22 12:21:08,449 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 [2021-12-22 12:21:08,650 INFO L134 CoverageAnalysis]: Checked inductivity of 543 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 453 trivial. 0 not checked. [2021-12-22 12:21:08,650 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-22 12:21:08,650 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [718133355] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 12:21:08,650 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-22 12:21:08,650 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 9 [2021-12-22 12:21:08,650 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501906162] [2021-12-22 12:21:08,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 12:21:08,651 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-22 12:21:08,651 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 12:21:08,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-22 12:21:08,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2021-12-22 12:21:08,652 INFO L87 Difference]: Start difference. First operand 680 states and 1086 transitions. Second operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 4 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (21), 3 states have call predecessors, (21), 4 states have call successors, (21) [2021-12-22 12:21:08,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 12:21:08,798 INFO L93 Difference]: Finished difference Result 1342 states and 2141 transitions. [2021-12-22 12:21:08,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-22 12:21:08,799 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 4 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (21), 3 states have call predecessors, (21), 4 states have call successors, (21) Word has length 187 [2021-12-22 12:21:08,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 12:21:08,808 INFO L225 Difference]: With dead ends: 1342 [2021-12-22 12:21:08,808 INFO L226 Difference]: Without dead ends: 696 [2021-12-22 12:21:08,815 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 231 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-12-22 12:21:08,817 INFO L933 BasicCegarLoop]: 342 mSDtfsCounter, 272 mSDsluCounter, 562 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 282 SdHoareTripleChecker+Valid, 904 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-22 12:21:08,818 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [282 Valid, 904 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-22 12:21:08,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 696 states. [2021-12-22 12:21:08,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 696 to 686. [2021-12-22 12:21:08,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 686 states, 431 states have (on average 1.4245939675174013) internal successors, (614), 440 states have internal predecessors, (614), 211 states have call successors, (211), 32 states have call predecessors, (211), 43 states have return successors, (268), 213 states have call predecessors, (268), 211 states have call successors, (268) [2021-12-22 12:21:08,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 686 states to 686 states and 1093 transitions. [2021-12-22 12:21:08,865 INFO L78 Accepts]: Start accepts. Automaton has 686 states and 1093 transitions. Word has length 187 [2021-12-22 12:21:08,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 12:21:08,866 INFO L470 AbstractCegarLoop]: Abstraction has 686 states and 1093 transitions. [2021-12-22 12:21:08,866 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 4 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (21), 3 states have call predecessors, (21), 4 states have call successors, (21) [2021-12-22 12:21:08,866 INFO L276 IsEmpty]: Start isEmpty. Operand 686 states and 1093 transitions. [2021-12-22 12:21:08,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2021-12-22 12:21:08,871 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 12:21:08,871 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] [2021-12-22 12:21:08,909 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-12-22 12:21:09,087 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 [2021-12-22 12:21:09,087 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 12:21:09,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 12:21:09,088 INFO L85 PathProgramCache]: Analyzing trace with hash 1865108637, now seen corresponding path program 1 times [2021-12-22 12:21:09,088 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 12:21:09,088 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68632918] [2021-12-22 12:21:09,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 12:21:09,088 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 12:21:16,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:21:16,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-22 12:21:16,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:21:16,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-22 12:21:16,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:21:16,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-22 12:21:16,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:21:16,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-12-22 12:21:16,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:21:16,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 12:21:16,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:21:16,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-22 12:21:16,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:21:16,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-22 12:21:16,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:21:16,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-22 12:21:16,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:21:16,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-22 12:21:16,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:21:16,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-22 12:21:16,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:21:16,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-22 12:21:16,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:21:16,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2021-12-22 12:21:16,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:21:16,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-22 12:21:16,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:21:16,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-22 12:21:16,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:21:16,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2021-12-22 12:21:16,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:21:16,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2021-12-22 12:21:16,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:21:16,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2021-12-22 12:21:16,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:21:16,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2021-12-22 12:21:16,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:21:16,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2021-12-22 12:21:16,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:21:16,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2021-12-22 12:21:16,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:21:16,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2021-12-22 12:21:16,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:21:16,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2021-12-22 12:21:16,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:21:16,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2021-12-22 12:21:16,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:21:16,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2021-12-22 12:21:16,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:21:16,753 INFO L134 CoverageAnalysis]: Checked inductivity of 542 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 527 trivial. 0 not checked. [2021-12-22 12:21:16,753 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 12:21:16,753 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68632918] [2021-12-22 12:21:16,753 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68632918] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-22 12:21:16,753 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [452237818] [2021-12-22 12:21:16,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 12:21:16,754 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 12:21:16,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 12:21:16,756 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-22 12:21:16,781 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-12-22 12:21:17,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 12:21:17,975 INFO L263 TraceCheckSpWp]: Trace formula consists of 2464 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-22 12:21:17,981 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 12:21:18,417 INFO L134 CoverageAnalysis]: Checked inductivity of 542 backedges. 72 proven. 126 refuted. 0 times theorem prover too weak. 344 trivial. 0 not checked. [2021-12-22 12:21:18,418 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-22 12:21:18,929 INFO L134 CoverageAnalysis]: Checked inductivity of 542 backedges. 15 proven. 9 refuted. 0 times theorem prover too weak. 518 trivial. 0 not checked. [2021-12-22 12:21:18,929 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [452237818] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-22 12:21:18,929 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-22 12:21:18,930 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7, 8] total 22 [2021-12-22 12:21:18,930 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853984587] [2021-12-22 12:21:18,930 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-22 12:21:18,931 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2021-12-22 12:21:18,931 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 12:21:18,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-12-22 12:21:18,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=388, Unknown=0, NotChecked=0, Total=462 [2021-12-22 12:21:18,932 INFO L87 Difference]: Start difference. First operand 686 states and 1093 transitions. Second operand has 22 states, 21 states have (on average 6.714285714285714) internal successors, (141), 16 states have internal predecessors, (141), 7 states have call successors, (45), 6 states have call predecessors, (45), 9 states have return successors, (46), 11 states have call predecessors, (46), 7 states have call successors, (46) [2021-12-22 12:21:20,970 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 [] [2021-12-22 12:21:23,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 12:21:23,619 INFO L93 Difference]: Finished difference Result 1956 states and 3237 transitions. [2021-12-22 12:21:23,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-12-22 12:21:23,620 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 6.714285714285714) internal successors, (141), 16 states have internal predecessors, (141), 7 states have call successors, (45), 6 states have call predecessors, (45), 9 states have return successors, (46), 11 states have call predecessors, (46), 7 states have call successors, (46) Word has length 186 [2021-12-22 12:21:23,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 12:21:23,621 INFO L225 Difference]: With dead ends: 1956 [2021-12-22 12:21:23,621 INFO L226 Difference]: Without dead ends: 0 [2021-12-22 12:21:23,631 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 451 GetRequests, 415 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=244, Invalid=1088, Unknown=0, NotChecked=0, Total=1332 [2021-12-22 12:21:23,632 INFO L933 BasicCegarLoop]: 240 mSDtfsCounter, 1027 mSDsluCounter, 1027 mSDsCounter, 0 mSdLazyCounter, 2729 mSolverCounterSat, 1123 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1043 SdHoareTripleChecker+Valid, 1267 SdHoareTripleChecker+Invalid, 3853 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1123 IncrementalHoareTripleChecker+Valid, 2729 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2021-12-22 12:21:23,632 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1043 Valid, 1267 Invalid, 3853 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1123 Valid, 2729 Invalid, 1 Unknown, 0 Unchecked, 4.2s Time] [2021-12-22 12:21:23,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-12-22 12:21:23,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-12-22 12:21:23,633 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) [2021-12-22 12:21:23,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-12-22 12:21:23,633 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 186 [2021-12-22 12:21:23,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 12:21:23,634 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-12-22 12:21:23,634 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 6.714285714285714) internal successors, (141), 16 states have internal predecessors, (141), 7 states have call successors, (45), 6 states have call predecessors, (45), 9 states have return successors, (46), 11 states have call predecessors, (46), 7 states have call successors, (46) [2021-12-22 12:21:23,634 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-12-22 12:21:23,634 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-12-22 12:21:23,636 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-12-22 12:21:23,673 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-12-22 12:21:23,859 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 12:21:23,861 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-12-22 12:21:28,281 INFO L861 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 5 7) the Hoare annotation is: true [2021-12-22 12:21:28,282 INFO L858 garLoopResultBuilder]: For program point L6(line 6) no Hoare annotation was computed. [2021-12-22 12:21:28,282 INFO L858 garLoopResultBuilder]: For program point L6-2(lines 5 7) no Hoare annotation was computed. [2021-12-22 12:21:28,282 INFO L858 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 5 7) no Hoare annotation was computed. [2021-12-22 12:21:28,282 INFO L858 garLoopResultBuilder]: For program point __CS_pthread_mutex_initEXIT(lines 569 572) no Hoare annotation was computed. [2021-12-22 12:21:28,282 INFO L861 garLoopResultBuilder]: At program point __CS_pthread_mutex_initENTRY(lines 569 572) the Hoare annotation is: true [2021-12-22 12:21:28,282 INFO L858 garLoopResultBuilder]: For program point __CS_pthread_mutex_initFINAL(lines 569 572) no Hoare annotation was computed. [2021-12-22 12:21:28,282 INFO L858 garLoopResultBuilder]: For program point __CS_pthread_joinEXIT(lines 642 663) no Hoare annotation was computed. [2021-12-22 12:21:28,282 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))) [2021-12-22 12:21:28,282 INFO L858 garLoopResultBuilder]: For program point __CS_pthread_joinFINAL(lines 642 663) no Hoare annotation was computed. [2021-12-22 12:21:28,283 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))) [2021-12-22 12:21:28,283 INFO L858 garLoopResultBuilder]: For program point L661-1(line 661) no Hoare annotation was computed. [2021-12-22 12:21:28,283 INFO L858 garLoopResultBuilder]: For program point L655(lines 655 660) no Hoare annotation was computed. [2021-12-22 12:21:28,283 INFO L858 garLoopResultBuilder]: For program point L650(line 650) no Hoare annotation was computed. [2021-12-22 12:21:28,283 INFO L858 garLoopResultBuilder]: For program point L650-2(lines 650 654) no Hoare annotation was computed. [2021-12-22 12:21:28,283 INFO L858 garLoopResultBuilder]: For program point L644(lines 644 649) no Hoare annotation was computed. [2021-12-22 12:21:28,283 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))) [2021-12-22 12:21:28,283 INFO L858 garLoopResultBuilder]: For program point L584(lines 584 585) no Hoare annotation was computed. [2021-12-22 12:21:28,284 INFO L858 garLoopResultBuilder]: For program point L584-1(lines 584 585) no Hoare annotation was computed. [2021-12-22 12:21:28,284 INFO L858 garLoopResultBuilder]: For program point __CS_pthread_mutex_lockEXIT(lines 582 587) no Hoare annotation was computed. [2021-12-22 12:21:28,284 INFO L858 garLoopResultBuilder]: For program point __CS_pthread_mutex_lockFINAL(lines 582 587) no Hoare annotation was computed. [2021-12-22 12:21:28,284 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 .cse0 (and (= (mod ~__CS_ret~0 256) 0) (= |old(~__CS_thread~0.offset)| ~__CS_thread~0.offset) (= ~__CS_thread~0.base |old(~__CS_thread~0.base)|) (not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.base| 0))) .cse1) (or (not (= 0 |old(~__CS_error~0)|)) (= ~__CS_error~0 0) .cse0 .cse1))) [2021-12-22 12:21:28,284 INFO L858 garLoopResultBuilder]: For program point L729-1(lines 722 753) no Hoare annotation was computed. [2021-12-22 12:21:28,284 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 (not (= 0 |old(~__CS_error~0)|)) (= ~__CS_error~0 0) .cse0 .cse1) (or (and (= (mod ~__CS_ret~0 256) 0) (= |old(~__CS_thread~0.offset)| ~__CS_thread~0.offset) (= ~__CS_thread~0.base |old(~__CS_thread~0.base)|)) .cse0 .cse1))) [2021-12-22 12:21:28,285 INFO L858 garLoopResultBuilder]: For program point L696-1(line 696) no Hoare annotation was computed. [2021-12-22 12:21:28,285 INFO L854 garLoopResultBuilder]: At program point L713(line 713) the Hoare annotation is: (or (and (= |old(~__CS_thread~0.offset)| ~__CS_thread~0.offset) (= ~__CS_thread~0.base |old(~__CS_thread~0.base)|) (= |#funAddr~thread2.offset| |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset|) (not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.base| 0))) (not (= ~__CS_ret_PREEMPTED~0 1)) (not (= (mod |old(~__CS_ret~0)| 256) 0))) [2021-12-22 12:21:28,285 INFO L858 garLoopResultBuilder]: For program point L713-1(lines 706 720) no Hoare annotation was computed. [2021-12-22 12:21:28,285 INFO L854 garLoopResultBuilder]: At program point L697(line 697) the Hoare annotation is: (or (not (= ~__CS_ret_PREEMPTED~0 1)) (not (= (mod |old(~__CS_ret~0)| 256) 0)) (and (= |old(~__CS_thread~0.offset)| ~__CS_thread~0.offset) (= ~__CS_thread~0.base |old(~__CS_thread~0.base)|))) [2021-12-22 12:21:28,285 INFO L858 garLoopResultBuilder]: For program point L697-1(lines 690 704) no Hoare annotation was computed. [2021-12-22 12:21:28,285 INFO L858 garLoopResultBuilder]: For program point ##fun~$Pointer$~TO~$Pointer$FINAL(line -1) no Hoare annotation was computed. [2021-12-22 12:21:28,285 INFO L854 garLoopResultBuilder]: At program point L747(lines 743 751) the Hoare annotation is: (or (and (= (mod ~__CS_ret~0 256) 0) (not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.base| 0))) (not (= ~__CS_ret_PREEMPTED~0 1)) (not (= (mod |old(~__CS_ret~0)| 256) 0))) [2021-12-22 12:21:28,286 INFO L854 garLoopResultBuilder]: At program point L714(line 714) the Hoare annotation is: (or (and (= (mod ~__CS_ret~0 256) 0) (= |old(~__CS_thread~0.offset)| ~__CS_thread~0.offset) (= ~__CS_thread~0.base |old(~__CS_thread~0.base)|) (= |#funAddr~thread2.offset| |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset|) (not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.base| 0))) (not (= ~__CS_ret_PREEMPTED~0 1)) (not (= (mod |old(~__CS_ret~0)| 256) 0))) [2021-12-22 12:21:28,286 INFO L858 garLoopResultBuilder]: For program point L714-1(line 714) no Hoare annotation was computed. [2021-12-22 12:21:28,286 INFO L858 garLoopResultBuilder]: For program point ##fun~$Pointer$~TO~$Pointer$EXIT(line -1) no Hoare annotation was computed. [2021-12-22 12:21:28,286 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 .cse0 (and (= (mod ~__CS_ret~0 256) 0) (= |old(~__CS_thread~0.offset)| ~__CS_thread~0.offset) (= ~__CS_thread~0.base |old(~__CS_thread~0.base)|) (not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.base| 0))) .cse1) (or (not (= 0 |old(~__CS_error~0)|)) (= ~__CS_error~0 0) .cse0 .cse1))) [2021-12-22 12:21:28,286 INFO L858 garLoopResultBuilder]: For program point L731-1(lines 722 753) no Hoare annotation was computed. [2021-12-22 12:21:28,286 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) (= ~__CS_thread~0.base |old(~__CS_thread~0.base)|)) (not (= ~__CS_ret_PREEMPTED~0 1)) (not (= (mod |old(~__CS_ret~0)| 256) 0))) [2021-12-22 12:21:28,286 INFO L858 garLoopResultBuilder]: For program point L698-1(line 698) no Hoare annotation was computed. [2021-12-22 12:21:28,287 INFO L854 garLoopResultBuilder]: At program point L715(line 715) the Hoare annotation is: (let ((.cse0 (= |old(~__CS_thread~0.offset)| ~__CS_thread~0.offset)) (.cse1 (= ~__CS_thread~0.base |old(~__CS_thread~0.base)|)) (.cse2 (= |#funAddr~thread2.offset| |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset|)) (.cse3 (not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.base| 0)))) (or (and (= (mod ~__CS_ret~0 256) 0) .cse0 .cse1 .cse2 .cse3) (not (= ~__CS_ret_PREEMPTED~0 1)) (not (= (mod |old(~__CS_ret~0)| 256) 0)) (let ((.cse4 (+ ~__CS_ret~0 (* (div ~__CS_ret_PREEMPTED~0 256) 256)))) (and .cse0 .cse1 (<= .cse4 ~__CS_ret_PREEMPTED~0) .cse2 .cse3 (<= ~__CS_ret_PREEMPTED~0 .cse4))))) [2021-12-22 12:21:28,287 INFO L858 garLoopResultBuilder]: For program point L715-1(lines 706 720) no Hoare annotation was computed. [2021-12-22 12:21:28,287 INFO L854 garLoopResultBuilder]: At program point L699(line 699) the Hoare annotation is: (let ((.cse0 (= |old(~__CS_thread~0.offset)| ~__CS_thread~0.offset)) (.cse1 (= ~__CS_thread~0.base |old(~__CS_thread~0.base)|))) (or (and (= (mod ~__CS_ret~0 256) 0) .cse0 .cse1) (not (= ~__CS_ret_PREEMPTED~0 1)) (let ((.cse2 (+ ~__CS_ret~0 (* (div ~__CS_ret_PREEMPTED~0 256) 256)))) (and .cse0 .cse1 (<= .cse2 ~__CS_ret_PREEMPTED~0) (<= ~__CS_ret_PREEMPTED~0 .cse2))) (not (= (mod |old(~__CS_ret~0)| 256) 0)))) [2021-12-22 12:21:28,287 INFO L858 garLoopResultBuilder]: For program point L699-1(lines 690 704) no Hoare annotation was computed. [2021-12-22 12:21:28,287 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 .cse0 (and (= (mod ~__CS_ret~0 256) 0) (= |old(~__CS_thread~0.offset)| ~__CS_thread~0.offset) (= ~__CS_thread~0.base |old(~__CS_thread~0.base)|) (not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.base| 0))) .cse1) (or (not (= 0 |old(~__CS_error~0)|)) (= ~__CS_error~0 0) .cse0 .cse1))) [2021-12-22 12:21:28,287 INFO L858 garLoopResultBuilder]: For program point L733-1(lines 722 753) no Hoare annotation was computed. [2021-12-22 12:21:28,288 INFO L854 garLoopResultBuilder]: At program point L717(line 717) the Hoare annotation is: (or (and (= (mod ~__CS_ret~0 256) 0) (= |old(~__CS_thread~0.offset)| ~__CS_thread~0.offset) (= ~__CS_thread~0.base |old(~__CS_thread~0.base)|) (= |#funAddr~thread2.offset| |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset|) (not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.base| 0))) (not (= ~__CS_ret_PREEMPTED~0 1)) (not (= (mod |old(~__CS_ret~0)| 256) 0))) [2021-12-22 12:21:28,288 INFO L858 garLoopResultBuilder]: For program point L717-1(lines 706 720) no Hoare annotation was computed. [2021-12-22 12:21:28,288 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 .cse0 (and (= (mod ~__CS_ret~0 256) 0) (= |old(~__CS_thread~0.offset)| ~__CS_thread~0.offset) (= ~__CS_thread~0.base |old(~__CS_thread~0.base)|) (not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.base| 0))) .cse1) (or (not (= 0 |old(~__CS_error~0)|)) (= ~__CS_error~0 0) .cse0 .cse1))) [2021-12-22 12:21:28,288 INFO L858 garLoopResultBuilder]: For program point L734-1(line 734) no Hoare annotation was computed. [2021-12-22 12:21:28,288 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) (= ~__CS_thread~0.base |old(~__CS_thread~0.base)|)) (not (= ~__CS_ret_PREEMPTED~0 1)) (not (= (mod |old(~__CS_ret~0)| 256) 0))) [2021-12-22 12:21:28,288 INFO L858 garLoopResultBuilder]: For program point L701-1(lines 690 704) no Hoare annotation was computed. [2021-12-22 12:21:28,288 INFO L854 garLoopResultBuilder]: At program point L718(line 718) the Hoare annotation is: (or (and (= (mod ~__CS_ret~0 256) 0) (= |old(~__CS_thread~0.offset)| ~__CS_thread~0.offset) (= ~__CS_thread~0.base |old(~__CS_thread~0.base)|) (= |#funAddr~thread2.offset| |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset|) (not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.base| 0))) (not (= ~__CS_ret_PREEMPTED~0 1)) (not (= (mod |old(~__CS_ret~0)| 256) 0))) [2021-12-22 12:21:28,289 INFO L858 garLoopResultBuilder]: For program point L718-1(line 718) no Hoare annotation was computed. [2021-12-22 12:21:28,289 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 (not (= 0 |old(~__CS_error~0)|)) (= ~__CS_error~0 0) .cse0 .cse1) (or (and (= (mod ~__CS_ret~0 256) 0) (not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.base| 0))) .cse0 .cse1))) [2021-12-22 12:21:28,289 INFO L858 garLoopResultBuilder]: For program point L735-1(lines 722 753) no Hoare annotation was computed. [2021-12-22 12:21:28,289 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) (= ~__CS_thread~0.base |old(~__CS_thread~0.base)|)) (not (= ~__CS_ret_PREEMPTED~0 1)) (not (= (mod |old(~__CS_ret~0)| 256) 0))) [2021-12-22 12:21:28,289 INFO L858 garLoopResultBuilder]: For program point L702-1(line 702) no Hoare annotation was computed. [2021-12-22 12:21:28,289 INFO L858 garLoopResultBuilder]: For program point L752(lines 722 753) no Hoare annotation was computed. [2021-12-22 12:21:28,290 INFO L854 garLoopResultBuilder]: At program point L719(line 719) the Hoare annotation is: (or (and (= |old(~__CS_thread~0.offset)| ~__CS_thread~0.offset) (= ~__CS_thread~0.base |old(~__CS_thread~0.base)|) (= |#funAddr~thread2.offset| |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset|) (not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.base| 0))) (not (= ~__CS_ret_PREEMPTED~0 1)) (not (= (mod |old(~__CS_ret~0)| 256) 0))) [2021-12-22 12:21:28,290 INFO L858 garLoopResultBuilder]: For program point L719-1(lines 706 720) no Hoare annotation was computed. [2021-12-22 12:21:28,290 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 (not (= 0 |old(~__CS_error~0)|)) (= ~__CS_error~0 0) .cse0 .cse1) (or (and (= (mod ~__CS_ret~0 256) 0) (not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.base| 0))) .cse0 .cse1))) [2021-12-22 12:21:28,290 INFO L858 garLoopResultBuilder]: For program point L736-1(line 736) no Hoare annotation was computed. [2021-12-22 12:21:28,290 INFO L854 garLoopResultBuilder]: At program point L703(line 703) the Hoare annotation is: (or (not (= ~__CS_ret_PREEMPTED~0 1)) (not (= (mod |old(~__CS_ret~0)| 256) 0)) (and (= |old(~__CS_thread~0.offset)| ~__CS_thread~0.offset) (= ~__CS_thread~0.base |old(~__CS_thread~0.base)|))) [2021-12-22 12:21:28,290 INFO L858 garLoopResultBuilder]: For program point L703-1(lines 690 704) no Hoare annotation was computed. [2021-12-22 12:21:28,290 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 (not (= 0 |old(~__CS_error~0)|)) (= ~__CS_error~0 0) .cse0 .cse1) (or (and (= (mod ~__CS_ret~0 256) 0) (not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.base| 0))) .cse0 .cse1))) [2021-12-22 12:21:28,291 INFO L858 garLoopResultBuilder]: For program point L737-1(lines 722 753) no Hoare annotation was computed. [2021-12-22 12:21:28,291 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.base| 0)) (not (= (mod |old(~__CS_ret~0)| 256) 0))) [2021-12-22 12:21:28,291 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 (not (= 0 |old(~__CS_error~0)|)) (= ~__CS_error~0 0) .cse0 .cse1) (or (and (= (mod ~__CS_ret~0 256) 0) (not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.base| 0))) .cse0 .cse1))) [2021-12-22 12:21:28,291 INFO L858 garLoopResultBuilder]: For program point L738-1(line 738) no Hoare annotation was computed. [2021-12-22 12:21:28,291 INFO L854 garLoopResultBuilder]: At program point L705(lines 705 720) the Hoare annotation is: (or (and (= |old(~__CS_thread~0.offset)| ~__CS_thread~0.offset) (= ~__CS_thread~0.base |old(~__CS_thread~0.base)|) (= |#funAddr~thread2.offset| |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset|) (not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.base| 0))) (not (= ~__CS_ret_PREEMPTED~0 1)) (not (= (mod |old(~__CS_ret~0)| 256) 0))) [2021-12-22 12:21:28,291 INFO L854 garLoopResultBuilder]: At program point L689(lines 689 704) the Hoare annotation is: (or (not (= ~__CS_ret_PREEMPTED~0 1)) (not (= (mod |old(~__CS_ret~0)| 256) 0)) (and (= |old(~__CS_thread~0.offset)| ~__CS_thread~0.offset) (= ~__CS_thread~0.base |old(~__CS_thread~0.base)|))) [2021-12-22 12:21:28,291 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))) [2021-12-22 12:21:28,292 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.base| 0)) (not (= (mod |old(~__CS_ret~0)| 256) 0))) [2021-12-22 12:21:28,292 INFO L858 garLoopResultBuilder]: For program point L739-1(lines 722 753) no Hoare annotation was computed. [2021-12-22 12:21:28,292 INFO L854 garLoopResultBuilder]: At program point L740(line 740) the Hoare annotation is: (or (and (= (mod ~__CS_ret~0 256) 0) (not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.base| 0))) (not (= ~__CS_ret_PREEMPTED~0 1)) (not (= (mod |old(~__CS_ret~0)| 256) 0))) [2021-12-22 12:21:28,292 INFO L858 garLoopResultBuilder]: For program point L740-1(line 740) no Hoare annotation was computed. [2021-12-22 12:21:28,292 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) (not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.base| 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))) [2021-12-22 12:21:28,292 INFO L858 garLoopResultBuilder]: For program point L707-1(lines 706 720) no Hoare annotation was computed. [2021-12-22 12:21:28,293 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))) [2021-12-22 12:21:28,293 INFO L858 garLoopResultBuilder]: For program point L691-1(lines 690 704) no Hoare annotation was computed. [2021-12-22 12:21:28,293 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.base| 0)) (not (= (mod |old(~__CS_ret~0)| 256) 0))) [2021-12-22 12:21:28,293 INFO L858 garLoopResultBuilder]: For program point L741-1(lines 722 753) no Hoare annotation was computed. [2021-12-22 12:21:28,293 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 (and (= (mod ~__CS_ret~0 256) 0) (= |old(~__CS_thread~0.offset)| ~__CS_thread~0.offset) (= ~__CS_thread~0.base |old(~__CS_thread~0.base)|) (= |#funAddr~thread2.offset| |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset|) (not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.base| 0))) .cse0 .cse1) (or (not (= 0 |old(~__CS_error~0)|)) (= ~__CS_error~0 0) .cse0 .cse1))) [2021-12-22 12:21:28,293 INFO L858 garLoopResultBuilder]: For program point L708-1(line 708) no Hoare annotation was computed. [2021-12-22 12:21:28,293 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)|) (= ~__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) (not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.base| 0))) (not (= (mod |old(~__CS_ret~0)| 256) 0))) [2021-12-22 12:21:28,294 INFO L858 garLoopResultBuilder]: For program point L725-1(lines 722 753) no Hoare annotation was computed. [2021-12-22 12:21:28,294 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 (not (= 0 |old(~__CS_error~0)|)) (= ~__CS_error~0 0) .cse0 .cse1) (or (and (= (mod ~__CS_ret~0 256) 0) (= |old(~__CS_thread~0.offset)| ~__CS_thread~0.offset) (= ~__CS_thread~0.base |old(~__CS_thread~0.base)|)) .cse0 .cse1))) [2021-12-22 12:21:28,294 INFO L858 garLoopResultBuilder]: For program point L692-1(line 692) no Hoare annotation was computed. [2021-12-22 12:21:28,294 INFO L858 garLoopResultBuilder]: For program point L742(line 742) no Hoare annotation was computed. [2021-12-22 12:21:28,294 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)) (.cse3 (= ~__CS_thread~0.base |old(~__CS_thread~0.base)|)) (.cse4 (= |#funAddr~thread2.offset| |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset|)) (.cse5 (not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.base| 0)))) (or (and (= (mod ~__CS_ret~0 256) 0) .cse2 .cse3 .cse4 .cse5) .cse0 .cse1 (let ((.cse6 (+ ~__CS_ret~0 (* (div ~__CS_ret_PREEMPTED~0 256) 256)))) (and .cse2 .cse3 (<= .cse6 ~__CS_ret_PREEMPTED~0) .cse4 .cse5 (<= ~__CS_ret_PREEMPTED~0 .cse6))))))) [2021-12-22 12:21:28,294 INFO L858 garLoopResultBuilder]: For program point L742-2(lines 742 751) no Hoare annotation was computed. [2021-12-22 12:21:28,294 INFO L858 garLoopResultBuilder]: For program point L709-1(lines 706 720) no Hoare annotation was computed. [2021-12-22 12:21:28,295 INFO L854 garLoopResultBuilder]: At program point L742-4(lines 742 751) the Hoare annotation is: (or (and (= (mod ~__CS_ret~0 256) 0) (not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.base| 0))) (not (= ~__CS_ret_PREEMPTED~0 1)) (not (= (mod |old(~__CS_ret~0)| 256) 0))) [2021-12-22 12:21:28,295 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-12-22 12:21:28,295 INFO L858 garLoopResultBuilder]: For program point L-1-2(line -1) no Hoare annotation was computed. [2021-12-22 12:21:28,295 INFO L858 garLoopResultBuilder]: For program point L-1-4(line -1) no Hoare annotation was computed. [2021-12-22 12:21:28,295 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 .cse0 (and (= (mod ~__CS_ret~0 256) 0) (= |old(~__CS_thread~0.offset)| ~__CS_thread~0.offset) (= ~__CS_thread~0.base |old(~__CS_thread~0.base)|) (not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.base| 0))) .cse1) (or (not (= 0 |old(~__CS_error~0)|)) (= ~__CS_error~0 0) .cse0 .cse1))) [2021-12-22 12:21:28,295 INFO L858 garLoopResultBuilder]: For program point L726-1(line 726) no Hoare annotation was computed. [2021-12-22 12:21:28,295 INFO L854 garLoopResultBuilder]: At program point L693(line 693) 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)) (.cse3 (= ~__CS_thread~0.base |old(~__CS_thread~0.base)|))) (or (and (= (mod ~__CS_ret~0 256) 0) .cse2 .cse3) .cse0 (let ((.cse4 (+ ~__CS_ret~0 (* (div ~__CS_ret_PREEMPTED~0 256) 256)))) (and .cse2 .cse3 (<= .cse4 ~__CS_ret_PREEMPTED~0) (<= ~__CS_ret_PREEMPTED~0 .cse4))) .cse1)))) [2021-12-22 12:21:28,296 INFO L858 garLoopResultBuilder]: For program point L693-1(lines 690 704) no Hoare annotation was computed. [2021-12-22 12:21:28,296 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 .cse0 (and (= (mod ~__CS_ret~0 256) 0) (= |old(~__CS_thread~0.offset)| ~__CS_thread~0.offset) (= ~__CS_thread~0.base |old(~__CS_thread~0.base)|) (not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.base| 0))) .cse1) (or (not (= 0 |old(~__CS_error~0)|)) (= ~__CS_error~0 0) .cse0 .cse1))) [2021-12-22 12:21:28,296 INFO L858 garLoopResultBuilder]: For program point L727-1(lines 722 753) no Hoare annotation was computed. [2021-12-22 12:21:28,296 INFO L854 garLoopResultBuilder]: At program point L744(line 744) the Hoare annotation is: (or (and (= (mod ~__CS_ret~0 256) 0) (not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.base| 0))) (not (= ~__CS_ret_PREEMPTED~0 1)) (not (= (mod |old(~__CS_ret~0)| 256) 0))) [2021-12-22 12:21:28,296 INFO L858 garLoopResultBuilder]: For program point L744-1(lines 743 751) no Hoare annotation was computed. [2021-12-22 12:21:28,296 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 (and (= (mod ~__CS_ret~0 256) 0) (= |old(~__CS_thread~0.offset)| ~__CS_thread~0.offset) (= ~__CS_thread~0.base |old(~__CS_thread~0.base)|) (= |#funAddr~thread2.offset| |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset|) (not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.base| 0))) .cse0 .cse1) (or (not (= 0 |old(~__CS_error~0)|)) (= ~__CS_error~0 0) .cse0 .cse1))) [2021-12-22 12:21:28,297 INFO L858 garLoopResultBuilder]: For program point L711-1(lines 706 720) no Hoare annotation was computed. [2021-12-22 12:21:28,297 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 .cse0 (and (= (mod ~__CS_ret~0 256) 0) (= |old(~__CS_thread~0.offset)| ~__CS_thread~0.offset) (= ~__CS_thread~0.base |old(~__CS_thread~0.base)|) (not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.base| 0))) .cse1) (or (not (= 0 |old(~__CS_error~0)|)) (= ~__CS_error~0 0) .cse0 .cse1))) [2021-12-22 12:21:28,297 INFO L858 garLoopResultBuilder]: For program point L728-1(line 728) no Hoare annotation was computed. [2021-12-22 12:21:28,297 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 (not (= 0 |old(~__CS_error~0)|)) (= ~__CS_error~0 0) .cse0 .cse1) (or (and (= (mod ~__CS_ret~0 256) 0) (= |old(~__CS_thread~0.offset)| ~__CS_thread~0.offset) (= ~__CS_thread~0.base |old(~__CS_thread~0.base)|)) .cse0 .cse1))) [2021-12-22 12:21:28,297 INFO L858 garLoopResultBuilder]: For program point L695-1(lines 690 704) no Hoare annotation was computed. [2021-12-22 12:21:28,297 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 (and (= (mod ~__CS_ret~0 256) 0) (= |old(~__CS_thread~0.offset)| ~__CS_thread~0.offset) (= ~__CS_thread~0.base |old(~__CS_thread~0.base)|) (= |#funAddr~thread2.offset| |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.offset|) (not (= |##fun~$Pointer$~TO~$Pointer$_#in~#fp#1.base| 0))) .cse0 .cse1) (or (not (= 0 |old(~__CS_error~0)|)) (= ~__CS_error~0 0) .cse0 .cse1))) [2021-12-22 12:21:28,297 INFO L858 garLoopResultBuilder]: For program point L712-1(line 712) no Hoare annotation was computed. [2021-12-22 12:21:28,298 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))) [2021-12-22 12:21:28,298 INFO L858 garLoopResultBuilder]: For program point L590(lines 590 594) no Hoare annotation was computed. [2021-12-22 12:21:28,298 INFO L858 garLoopResultBuilder]: For program point __CS_pthread_mutex_unlockFINAL(lines 588 596) no Hoare annotation was computed. [2021-12-22 12:21:28,298 INFO L858 garLoopResultBuilder]: For program point __CS_pthread_mutex_unlockEXIT(lines 588 596) no Hoare annotation was computed. [2021-12-22 12:21:28,298 INFO L858 garLoopResultBuilder]: For program point __CS_pthread_createFINAL(lines 664 677) no Hoare annotation was computed. [2021-12-22 12:21:28,298 INFO L858 garLoopResultBuilder]: For program point L666(lines 666 669) no Hoare annotation was computed. [2021-12-22 12:21:28,298 INFO L858 garLoopResultBuilder]: For program point __CS_pthread_createEXIT(lines 664 677) no Hoare annotation was computed. [2021-12-22 12:21:28,299 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))) [2021-12-22 12:21:28,299 INFO L858 garLoopResultBuilder]: For program point L795(lines 795 800) no Hoare annotation was computed. [2021-12-22 12:21:28,299 INFO L858 garLoopResultBuilder]: For program point L795-1(lines 795 800) no Hoare annotation was computed. [2021-12-22 12:21:28,299 INFO L858 garLoopResultBuilder]: For program point L754(lines 754 818) no Hoare annotation was computed. [2021-12-22 12:21:28,299 INFO L854 garLoopResultBuilder]: At program point L812(line 812) the Hoare annotation is: (or (= ~__CS_ret_PREEMPTED~0 1) (= ~__CS_error~0 0)) [2021-12-22 12:21:28,299 INFO L858 garLoopResultBuilder]: For program point L812-1(line 812) no Hoare annotation was computed. [2021-12-22 12:21:28,299 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)) [2021-12-22 12:21:28,300 INFO L858 garLoopResultBuilder]: For program point L804-1(line 804) no Hoare annotation was computed. [2021-12-22 12:21:28,300 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-12-22 12:21:28,300 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-12-22 12:21:28,300 INFO L858 garLoopResultBuilder]: For program point L763-2(lines 763 772) no Hoare annotation was computed. [2021-12-22 12:21:28,300 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) (= 0 (select ~__CS_thread~0.base 2)) (= (select ~__CS_thread~0.offset 2) 0)) [2021-12-22 12:21:28,300 INFO L858 garLoopResultBuilder]: For program point L763-4(lines 763 772) no Hoare annotation was computed. [2021-12-22 12:21:28,300 INFO L854 garLoopResultBuilder]: At program point L813(line 813) the Hoare annotation is: (or (= ~__CS_ret_PREEMPTED~0 1) (= ~__CS_error~0 0)) [2021-12-22 12:21:28,301 INFO L858 garLoopResultBuilder]: For program point L813-1(line 813) no Hoare annotation was computed. [2021-12-22 12:21:28,301 INFO L858 garLoopResultBuilder]: For program point L805(line 805) no Hoare annotation was computed. [2021-12-22 12:21:28,301 INFO L858 garLoopResultBuilder]: For program point L541(lines 541 543) no Hoare annotation was computed. [2021-12-22 12:21:28,301 INFO L861 garLoopResultBuilder]: At program point L541-2(lines 540 545) the Hoare annotation is: true [2021-12-22 12:21:28,301 INFO L858 garLoopResultBuilder]: For program point L789(lines 789 794) no Hoare annotation was computed. [2021-12-22 12:21:28,301 INFO L858 garLoopResultBuilder]: For program point L789-1(lines 789 794) no Hoare annotation was computed. [2021-12-22 12:21:28,301 INFO L854 garLoopResultBuilder]: At program point L814(line 814) the Hoare annotation is: (or (= ~__CS_ret_PREEMPTED~0 1) (= ~__CS_error~0 0)) [2021-12-22 12:21:28,301 INFO L858 garLoopResultBuilder]: For program point L814-1(line 814) no Hoare annotation was computed. [2021-12-22 12:21:28,302 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)) [2021-12-22 12:21:28,302 INFO L858 garLoopResultBuilder]: For program point L542(line 542) no Hoare annotation was computed. [2021-12-22 12:21:28,302 INFO L858 garLoopResultBuilder]: For program point L798-1(line 798) no Hoare annotation was computed. [2021-12-22 12:21:28,302 INFO L854 garLoopResultBuilder]: At program point L815(line 815) the Hoare annotation is: (or (= ~__CS_ret_PREEMPTED~0 1) (= ~__CS_error~0 0)) [2021-12-22 12:21:28,302 INFO L858 garLoopResultBuilder]: For program point L815-1(line 815) no Hoare annotation was computed. [2021-12-22 12:21:28,302 INFO L854 garLoopResultBuilder]: At program point L807(line 807) the Hoare annotation is: (or (= ~__CS_ret_PREEMPTED~0 1) (= ~__CS_error~0 0)) [2021-12-22 12:21:28,302 INFO L858 garLoopResultBuilder]: For program point L807-1(line 807) no Hoare annotation was computed. [2021-12-22 12:21:28,303 INFO L858 garLoopResultBuilder]: For program point L799(line 799) no Hoare annotation was computed. [2021-12-22 12:21:28,303 INFO L854 garLoopResultBuilder]: At program point L816(line 816) the Hoare annotation is: (or (= ~__CS_ret_PREEMPTED~0 1) (= ~__CS_error~0 0)) [2021-12-22 12:21:28,303 INFO L858 garLoopResultBuilder]: For program point L816-1(line 816) no Hoare annotation was computed. [2021-12-22 12:21:28,303 INFO L854 garLoopResultBuilder]: At program point L808(line 808) the Hoare annotation is: (or (= ~__CS_ret_PREEMPTED~0 1) (= ~__CS_error~0 0)) [2021-12-22 12:21:28,303 INFO L858 garLoopResultBuilder]: For program point L808-1(line 808) no Hoare annotation was computed. [2021-12-22 12:21:28,303 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-12-22 12:21:28,303 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) (= 0 (select ~__CS_thread~0.base 2)) (= |#funAddr~main_thread.offset| (select ~__CS_thread~0.offset 0)) (= (select ~__CS_thread~0.offset 2) 0)) [2021-12-22 12:21:28,304 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 542) no Hoare annotation was computed. [2021-12-22 12:21:28,304 INFO L858 garLoopResultBuilder]: For program point L792-1(line 792) no Hoare annotation was computed. [2021-12-22 12:21:28,304 INFO L854 garLoopResultBuilder]: At program point L809(line 809) the Hoare annotation is: (or (= ~__CS_ret_PREEMPTED~0 1) (= ~__CS_error~0 0)) [2021-12-22 12:21:28,304 INFO L858 garLoopResultBuilder]: For program point L809-1(line 809) no Hoare annotation was computed. [2021-12-22 12:21:28,304 INFO L858 garLoopResultBuilder]: For program point L801(lines 801 806) no Hoare annotation was computed. [2021-12-22 12:21:28,304 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-12-22 12:21:28,304 INFO L858 garLoopResultBuilder]: For program point L801-1(lines 801 806) no Hoare annotation was computed. [2021-12-22 12:21:28,304 INFO L858 garLoopResultBuilder]: For program point L768-2(lines 768 771) no Hoare annotation was computed. [2021-12-22 12:21:28,305 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) (= 0 (select ~__CS_thread~0.base 2)) (= (select ~__CS_thread~0.offset 2) 0)) [2021-12-22 12:21:28,305 INFO L858 garLoopResultBuilder]: For program point L793(line 793) no Hoare annotation was computed. [2021-12-22 12:21:28,305 INFO L854 garLoopResultBuilder]: At program point L810(line 810) the Hoare annotation is: (or (= ~__CS_ret_PREEMPTED~0 1) (= ~__CS_error~0 0)) [2021-12-22 12:21:28,305 INFO L858 garLoopResultBuilder]: For program point L810-1(line 810) no Hoare annotation was computed. [2021-12-22 12:21:28,305 INFO L854 garLoopResultBuilder]: At program point L811(line 811) the Hoare annotation is: (or (= ~__CS_ret_PREEMPTED~0 1) (= ~__CS_error~0 0)) [2021-12-22 12:21:28,305 INFO L858 garLoopResultBuilder]: For program point L811-1(line 811) no Hoare annotation was computed. [2021-12-22 12:21:28,305 INFO L858 garLoopResultBuilder]: For program point __CS_csEXIT(lines 562 568) no Hoare annotation was computed. [2021-12-22 12:21:28,306 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))) [2021-12-22 12:21:28,306 INFO L858 garLoopResultBuilder]: For program point __CS_csFINAL(lines 562 568) no Hoare annotation was computed. [2021-12-22 12:21:28,306 INFO L858 garLoopResultBuilder]: For program point L567(line 567) no Hoare annotation was computed. [2021-12-22 12:21:28,306 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))) [2021-12-22 12:21:28,306 INFO L858 garLoopResultBuilder]: For program point L567-2(line 567) no Hoare annotation was computed. [2021-12-22 12:21:28,306 INFO L858 garLoopResultBuilder]: For program point L565-1(line 565) no Hoare annotation was computed. [2021-12-22 12:21:28,309 INFO L732 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1] [2021-12-22 12:21:28,311 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-22 12:21:28,321 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.offset [2021-12-22 12:21:28,322 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.offset [2021-12-22 12:21:28,322 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.base [2021-12-22 12:21:28,322 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.base [2021-12-22 12:21:28,322 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.offset [2021-12-22 12:21:28,322 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.offset [2021-12-22 12:21:28,322 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.base [2021-12-22 12:21:28,323 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.base [2021-12-22 12:21:28,323 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.base [2021-12-22 12:21:28,323 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.offset [2021-12-22 12:21:28,324 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.base [2021-12-22 12:21:28,324 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.offset [2021-12-22 12:21:28,324 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.base [2021-12-22 12:21:28,324 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.offset [2021-12-22 12:21:28,325 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.base [2021-12-22 12:21:28,325 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.offset [2021-12-22 12:21:28,325 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.offset [2021-12-22 12:21:28,325 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.offset [2021-12-22 12:21:28,326 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.base [2021-12-22 12:21:28,326 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.base [2021-12-22 12:21:28,326 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~thread2.offset [2021-12-22 12:21:28,326 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.offset [2021-12-22 12:21:28,327 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.offset [2021-12-22 12:21:28,327 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.base [2021-12-22 12:21:28,327 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.base [2021-12-22 12:21:28,327 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~thread2.offset [2021-12-22 12:21:28,328 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.12 12:21:28 BoogieIcfgContainer [2021-12-22 12:21:28,328 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-22 12:21:28,329 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-22 12:21:28,329 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-22 12:21:28,329 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-22 12:21:28,329 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 12:20:34" (3/4) ... [2021-12-22 12:21:28,332 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-12-22 12:21:28,337 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __CS_pthread_join [2021-12-22 12:21:28,338 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __CS_pthread_mutex_lock [2021-12-22 12:21:28,338 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ##fun~$Pointer$~TO~$Pointer$ [2021-12-22 12:21:28,338 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __CS_pthread_mutex_unlock [2021-12-22 12:21:28,338 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __CS_pthread_create [2021-12-22 12:21:28,338 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2021-12-22 12:21:28,338 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __CS_cs [2021-12-22 12:21:28,338 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __CS_pthread_mutex_init [2021-12-22 12:21:28,349 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 49 nodes and edges [2021-12-22 12:21:28,350 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 21 nodes and edges [2021-12-22 12:21:28,350 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2021-12-22 12:21:28,351 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2021-12-22 12:21:28,376 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((\old(__CS_thread) == __CS_thread && __CS_thread == \old(__CS_thread)) && #funAddr~thread2.offset == #fp) && !(#fp == 0)) || !(__CS_ret_PREEMPTED == 1)) || !(\old(__CS_ret) % 256 == 0) [2021-12-22 12:21:28,376 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (!(__CS_ret_PREEMPTED == 1) || !(\old(__CS_ret) % 256 == 0)) || (\old(__CS_thread) == __CS_thread && __CS_thread == \old(__CS_thread)) [2021-12-22 12:21:28,378 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((__CS_ret % 256 == 0 && !(#fp == 0)) || !(__CS_ret_PREEMPTED == 1)) || !(\old(__CS_ret) % 256 == 0) [2021-12-22 12:21:28,381 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (!(__CS_ret_PREEMPTED == 1) || !(#fp == 0)) || !(\old(__CS_ret) % 256 == 0) [2021-12-22 12:21:28,454 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-12-22 12:21:28,454 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-22 12:21:28,455 INFO L158 Benchmark]: Toolchain (without parser) took 56426.70ms. Allocated memory was 88.1MB in the beginning and 438.3MB in the end (delta: 350.2MB). Free memory was 55.3MB in the beginning and 184.4MB in the end (delta: -129.1MB). Peak memory consumption was 220.4MB. Max. memory is 16.1GB. [2021-12-22 12:21:28,455 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 88.1MB. Free memory is still 44.8MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-22 12:21:28,455 INFO L158 Benchmark]: CACSL2BoogieTranslator took 479.54ms. Allocated memory is still 88.1MB. Free memory was 55.1MB in the beginning and 49.5MB in the end (delta: 5.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-12-22 12:21:28,455 INFO L158 Benchmark]: Boogie Procedure Inliner took 76.28ms. Allocated memory is still 88.1MB. Free memory was 49.5MB in the beginning and 45.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2021-12-22 12:21:28,456 INFO L158 Benchmark]: Boogie Preprocessor took 47.88ms. Allocated memory is still 88.1MB. Free memory was 45.3MB in the beginning and 41.5MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2021-12-22 12:21:28,456 INFO L158 Benchmark]: RCFGBuilder took 2057.61ms. Allocated memory was 88.1MB in the beginning and 107.0MB in the end (delta: 18.9MB). Free memory was 41.5MB in the beginning and 77.8MB in the end (delta: -36.3MB). Peak memory consumption was 33.1MB. Max. memory is 16.1GB. [2021-12-22 12:21:28,457 INFO L158 Benchmark]: TraceAbstraction took 53634.81ms. Allocated memory was 107.0MB in the beginning and 438.3MB in the end (delta: 331.4MB). Free memory was 77.0MB in the beginning and 197.0MB in the end (delta: -120.0MB). Peak memory consumption was 336.7MB. Max. memory is 16.1GB. [2021-12-22 12:21:28,457 INFO L158 Benchmark]: Witness Printer took 125.21ms. Allocated memory is still 438.3MB. Free memory was 197.0MB in the beginning and 184.4MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2021-12-22 12:21:28,461 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.20ms. Allocated memory is still 88.1MB. Free memory is still 44.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 479.54ms. Allocated memory is still 88.1MB. Free memory was 55.1MB in the beginning and 49.5MB in the end (delta: 5.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 76.28ms. Allocated memory is still 88.1MB. Free memory was 49.5MB in the beginning and 45.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 47.88ms. Allocated memory is still 88.1MB. Free memory was 45.3MB in the beginning and 41.5MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 2057.61ms. Allocated memory was 88.1MB in the beginning and 107.0MB in the end (delta: 18.9MB). Free memory was 41.5MB in the beginning and 77.8MB in the end (delta: -36.3MB). Peak memory consumption was 33.1MB. Max. memory is 16.1GB. * TraceAbstraction took 53634.81ms. Allocated memory was 107.0MB in the beginning and 438.3MB in the end (delta: 331.4MB). Free memory was 77.0MB in the beginning and 197.0MB in the end (delta: -120.0MB). Peak memory consumption was 336.7MB. Max. memory is 16.1GB. * Witness Printer took 125.21ms. Allocated memory is still 438.3MB. Free memory was 197.0MB in the beginning and 184.4MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * 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.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.base - 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.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.base - 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.base - 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.base - 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.base - 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.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.base - 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: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.base - 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: 53.6s, OverallIterations: 10, TraceHistogramMax: 15, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 13.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 4.4s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 4 mSolverCounterUnknown, 2716 SdHoareTripleChecker+Valid, 12.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2676 mSDsluCounter, 7335 SdHoareTripleChecker+Invalid, 11.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4569 mSDsCounter, 2413 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4583 IncrementalHoareTripleChecker+Invalid, 7000 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2413 mSolverCounterUnsat, 2766 mSDtfsCounter, 4583 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2065 GetRequests, 1960 SyntacticMatches, 4 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 487 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=686occurred in iteration=9, InterpolantAutomatonStates: 72, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 10 MinimizatonAttempts, 58 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 69 LocationsWithAnnotation, 3660 PreInvPairs, 5194 NumberOfFragments, 1920 HoareAnnotationTreeSize, 3660 FomulaSimplifications, 8468 FormulaSimplificationTreeSizeReduction, 0.8s HoareSimplificationTime, 69 FomulaSimplificationsInter, 27766 FormulaSimplificationTreeSizeReductionInter, 3.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.8s SsaConstructionTime, 21.6s SatisfiabilityAnalysisTime, 5.9s InterpolantComputationTime, 2291 NumberOfCodeBlocks, 2087 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 2874 ConstructedInterpolants, 0 QuantifiedInterpolants, 5735 SizeOfPredicates, 16 NumberOfNonLiveVariables, 14366 ConjunctsInSsa, 45 ConjunctsInUnsatCore, 21 InterpolantComputations, 6 PerfectInterpolantSequences, 7782/7959 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 [2021-12-22 12:21:28,480 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.offset [2021-12-22 12:21:28,480 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.offset [2021-12-22 12:21:28,480 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.base [2021-12-22 12:21:28,480 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.base [2021-12-22 12:21:28,481 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.offset [2021-12-22 12:21:28,481 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.offset [2021-12-22 12:21:28,481 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.base [2021-12-22 12:21:28,482 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.base Derived loop invariant: (!(__CS_ret_PREEMPTED == 1) || !(\old(__CS_ret) % 256 == 0)) || (\old(__CS_thread) == __CS_thread && __CS_thread == \old(__CS_thread)) - InvariantResult [Line: 768]: Loop Invariant [2021-12-22 12:21:28,482 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.base [2021-12-22 12:21:28,483 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.offset [2021-12-22 12:21:28,487 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.base [2021-12-22 12:21:28,488 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) && 0 == __CS_thread[2]) && __CS_thread[2] == 0 - InvariantResult [Line: 763]: Loop Invariant [2021-12-22 12:21:28,488 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.base [2021-12-22 12:21:28,488 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.offset [2021-12-22 12:21:28,488 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.base [2021-12-22 12:21:28,489 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) && 0 == __CS_thread[2]) && __CS_thread[2] == 0 - InvariantResult [Line: 705]: Loop Invariant [2021-12-22 12:21:28,490 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.offset [2021-12-22 12:21:28,490 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.offset [2021-12-22 12:21:28,490 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.base [2021-12-22 12:21:28,490 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.base [2021-12-22 12:21:28,491 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~thread2.offset [2021-12-22 12:21:28,491 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.offset [2021-12-22 12:21:28,491 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.offset [2021-12-22 12:21:28,492 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.base [2021-12-22 12:21:28,492 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.base [2021-12-22 12:21:28,492 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~thread2.offset Derived loop invariant: ((((\old(__CS_thread) == __CS_thread && __CS_thread == \old(__CS_thread)) && #funAddr~thread2.offset == #fp) && !(#fp == 0)) || !(__CS_ret_PREEMPTED == 1)) || !(\old(__CS_ret) % 256 == 0) - InvariantResult [Line: 743]: Loop Invariant Derived loop invariant: ((__CS_ret % 256 == 0 && !(#fp == 0)) || !(__CS_ret_PREEMPTED == 1)) || !(\old(__CS_ret) % 256 == 0) - InvariantResult [Line: 540]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2021-12-22 12:21:28,515 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... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE