./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 eb692b52 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-?-eb692b5 [2022-07-19 18:44:21,482 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-19 18:44:21,508 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-19 18:44:21,561 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-19 18:44:21,562 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-19 18:44:21,563 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-19 18:44:21,565 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-19 18:44:21,567 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-19 18:44:21,568 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-19 18:44:21,572 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-19 18:44:21,573 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-19 18:44:21,575 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-19 18:44:21,575 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-19 18:44:21,577 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-19 18:44:21,578 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-19 18:44:21,581 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-19 18:44:21,582 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-19 18:44:21,583 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-19 18:44:21,584 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-19 18:44:21,589 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-19 18:44:21,591 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-19 18:44:21,592 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-19 18:44:21,593 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-19 18:44:21,594 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-19 18:44:21,595 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-19 18:44:21,601 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-19 18:44:21,602 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-19 18:44:21,602 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-19 18:44:21,603 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-19 18:44:21,604 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-19 18:44:21,605 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-19 18:44:21,605 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-19 18:44:21,606 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-19 18:44:21,607 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-19 18:44:21,607 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-19 18:44:21,608 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-19 18:44:21,608 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-19 18:44:21,609 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-19 18:44:21,609 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-19 18:44:21,610 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-19 18:44:21,611 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-19 18:44:21,613 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-19 18:44:21,614 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-19 18:44:21,641 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-19 18:44:21,641 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-19 18:44:21,642 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-19 18:44:21,642 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-19 18:44:21,643 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-19 18:44:21,643 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-19 18:44:21,644 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-19 18:44:21,644 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-19 18:44:21,644 INFO L138 SettingsManager]: * Use SBE=true [2022-07-19 18:44:21,645 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-19 18:44:21,645 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-19 18:44:21,645 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-19 18:44:21,645 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-19 18:44:21,646 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-19 18:44:21,646 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-19 18:44:21,646 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-19 18:44:21,646 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-19 18:44:21,647 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-19 18:44:21,647 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-19 18:44:21,648 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-19 18:44:21,648 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-19 18:44:21,649 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-19 18:44:21,649 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-19 18:44:21,649 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-19 18:44:21,649 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 18:44:21,649 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-19 18:44:21,650 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-19 18:44:21,650 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-19 18:44:21,650 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-19 18:44:21,650 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-19 18:44:21,651 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-19 18:44:21,651 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-19 18:44:21,651 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-19 18:44:21,651 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 [2022-07-19 18:44:21,888 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-19 18:44:21,909 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-19 18:44:21,911 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-19 18:44:21,912 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-19 18:44:21,913 INFO L275 PluginConnector]: CDTParser initialized [2022-07-19 18:44:21,914 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 [2022-07-19 18:44:21,973 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ced304bb6/164f0cc268934e4fbe6d8a121c0c0ad8/FLAG0128848e1 [2022-07-19 18:44:22,442 INFO L306 CDTParser]: Found 1 translation units. [2022-07-19 18:44:22,445 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-pthread/cs_stateful-2.i [2022-07-19 18:44:22,465 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ced304bb6/164f0cc268934e4fbe6d8a121c0c0ad8/FLAG0128848e1 [2022-07-19 18:44:22,751 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ced304bb6/164f0cc268934e4fbe6d8a121c0c0ad8 [2022-07-19 18:44:22,753 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-19 18:44:22,754 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-19 18:44:22,759 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-19 18:44:22,759 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-19 18:44:22,762 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-19 18:44:22,762 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 06:44:22" (1/1) ... [2022-07-19 18:44:22,763 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c4a343b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 06:44:22, skipping insertion in model container [2022-07-19 18:44:22,764 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 06:44:22" (1/1) ... [2022-07-19 18:44:22,769 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-19 18:44:22,799 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-19 18:44:23,057 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] [2022-07-19 18:44:23,181 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 18:44:23,193 INFO L203 MainTranslator]: Completed pre-run [2022-07-19 18:44:23,238 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] [2022-07-19 18:44:23,274 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 18:44:23,304 INFO L208 MainTranslator]: Completed translation [2022-07-19 18:44:23,305 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 06:44:23 WrapperNode [2022-07-19 18:44:23,305 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-19 18:44:23,306 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-19 18:44:23,306 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-19 18:44:23,307 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-19 18:44:23,313 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 06:44:23" (1/1) ... [2022-07-19 18:44:23,344 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 06:44:23" (1/1) ... [2022-07-19 18:44:23,378 INFO L137 Inliner]: procedures = 145, calls = 245, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 539 [2022-07-19 18:44:23,379 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-19 18:44:23,380 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-19 18:44:23,380 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-19 18:44:23,380 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-19 18:44:23,387 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 06:44:23" (1/1) ... [2022-07-19 18:44:23,387 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 06:44:23" (1/1) ... [2022-07-19 18:44:23,393 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 06:44:23" (1/1) ... [2022-07-19 18:44:23,393 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 06:44:23" (1/1) ... [2022-07-19 18:44:23,409 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 06:44:23" (1/1) ... [2022-07-19 18:44:23,414 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 06:44:23" (1/1) ... [2022-07-19 18:44:23,424 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 06:44:23" (1/1) ... [2022-07-19 18:44:23,429 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-19 18:44:23,430 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-19 18:44:23,430 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-19 18:44:23,430 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-19 18:44:23,431 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 06:44:23" (1/1) ... [2022-07-19 18:44:23,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 18:44:23,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 18:44:23,496 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-19 18:44:23,522 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-19 18:44:23,538 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-19 18:44:23,538 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-19 18:44:23,539 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-07-19 18:44:23,539 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-07-19 18:44:23,539 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-19 18:44:23,539 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-19 18:44:23,540 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-19 18:44:23,540 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_mutex_init [2022-07-19 18:44:23,541 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_mutex_init [2022-07-19 18:44:23,541 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_mutex_lock [2022-07-19 18:44:23,541 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_mutex_lock [2022-07-19 18:44:23,541 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_create [2022-07-19 18:44:23,542 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_create [2022-07-19 18:44:23,542 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-19 18:44:23,542 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_join [2022-07-19 18:44:23,542 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_join [2022-07-19 18:44:23,542 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~$Pointer$ [2022-07-19 18:44:23,542 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~$Pointer$ [2022-07-19 18:44:23,542 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-19 18:44:23,543 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-19 18:44:23,543 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_cs [2022-07-19 18:44:23,543 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_cs [2022-07-19 18:44:23,543 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-19 18:44:23,543 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_mutex_unlock [2022-07-19 18:44:23,543 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_mutex_unlock [2022-07-19 18:44:23,543 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-19 18:44:23,544 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-19 18:44:23,695 INFO L234 CfgBuilder]: Building ICFG [2022-07-19 18:44:23,697 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-19 18:44:24,085 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L750: SUMMARY for call __CS_cs(); srcloc: null [2022-07-19 18:44:24,085 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L750-1: assume 0 != ~__CS_ret~0 % 256;main_thread_#res#1.base, main_thread_#res#1.offset := 0, 0;call ULTIMATE.dealloc(main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset);havoc main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset;call ULTIMATE.dealloc(main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset);havoc main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset; [2022-07-19 18:44:24,086 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L750-1: assume !(0 != ~__CS_ret~0 % 256); [2022-07-19 18:44:24,086 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##31: assume !(0 != ~__CS_ret~0 % 256); [2022-07-19 18:44:24,086 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##30: assume 0 != ~__CS_ret~0 % 256;main_thread_#res#1.base, main_thread_#res#1.offset := 0, 0;call ULTIMATE.dealloc(main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset);havoc main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset;call ULTIMATE.dealloc(main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset);havoc main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset; [2022-07-19 18:44:24,086 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##29: assume !(0 != ~__CS_ret~0 % 256); [2022-07-19 18:44:24,086 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##28: assume 0 != ~__CS_ret~0 % 256;main_thread_#res#1.base, main_thread_#res#1.offset := 0, 0;call ULTIMATE.dealloc(main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset);havoc main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset;call ULTIMATE.dealloc(main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset);havoc main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset; [2022-07-19 18:44:25,505 INFO L275 CfgBuilder]: Performing block encoding [2022-07-19 18:44:25,511 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-19 18:44:25,511 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-19 18:44:25,513 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 06:44:25 BoogieIcfgContainer [2022-07-19 18:44:25,513 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-19 18:44:25,515 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-19 18:44:25,515 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-19 18:44:25,518 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-19 18:44:25,518 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.07 06:44:22" (1/3) ... [2022-07-19 18:44:25,519 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@459b4e25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 06:44:25, skipping insertion in model container [2022-07-19 18:44:25,519 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 06:44:23" (2/3) ... [2022-07-19 18:44:25,519 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@459b4e25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 06:44:25, skipping insertion in model container [2022-07-19 18:44:25,519 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 06:44:25" (3/3) ... [2022-07-19 18:44:25,520 INFO L111 eAbstractionObserver]: Analyzing ICFG cs_stateful-2.i [2022-07-19 18:44:25,533 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-19 18:44:25,533 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-19 18:44:25,599 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-19 18:44:25,605 INFO L357 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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@22c6cf57, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@750806a7 [2022-07-19 18:44:25,605 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-19 18:44:25,610 INFO L276 IsEmpty]: Start isEmpty. Operand has 175 states, 111 states have (on average 1.4504504504504505) internal successors, (161), 112 states have internal predecessors, (161), 54 states have call successors, (54), 8 states have call predecessors, (54), 8 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2022-07-19 18:44:25,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-07-19 18:44:25,626 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 18:44:25,627 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 18:44:25,628 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 18:44:25,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 18:44:25,632 INFO L85 PathProgramCache]: Analyzing trace with hash 246520095, now seen corresponding path program 1 times [2022-07-19 18:44:25,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 18:44:25,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226666728] [2022-07-19 18:44:25,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 18:44:25,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 18:44:25,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:26,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 18:44:26,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:26,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 18:44:26,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:26,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-19 18:44:26,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:26,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-19 18:44:26,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:26,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-19 18:44:26,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:26,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-19 18:44:26,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:26,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-19 18:44:26,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:26,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-19 18:44:26,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:26,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-19 18:44:26,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:26,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-19 18:44:26,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:26,110 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2022-07-19 18:44:26,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 18:44:26,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226666728] [2022-07-19 18:44:26,113 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1226666728] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 18:44:26,113 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 18:44:26,113 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-19 18:44:26,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273268383] [2022-07-19 18:44:26,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 18:44:26,124 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-19 18:44:26,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 18:44:26,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-19 18:44:26,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-19 18:44:26,155 INFO L87 Difference]: Start difference. First operand has 175 states, 111 states have (on average 1.4504504504504505) internal successors, (161), 112 states have internal predecessors, (161), 54 states have call successors, (54), 8 states have call predecessors, (54), 8 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) Second operand has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2022-07-19 18:44:26,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 18:44:26,240 INFO L93 Difference]: Finished difference Result 348 states and 578 transitions. [2022-07-19 18:44:26,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-19 18:44:26,242 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 72 [2022-07-19 18:44:26,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 18:44:26,254 INFO L225 Difference]: With dead ends: 348 [2022-07-19 18:44:26,255 INFO L226 Difference]: Without dead ends: 171 [2022-07-19 18:44:26,265 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-19 18:44:26,273 INFO L413 NwaCegarLoop]: 265 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 18:44:26,274 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 18:44:26,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2022-07-19 18:44:26,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2022-07-19 18:44:26,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 108 states have (on average 1.4166666666666667) internal successors, (153), 108 states have internal predecessors, (153), 54 states have call successors, (54), 8 states have call predecessors, (54), 8 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2022-07-19 18:44:26,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 261 transitions. [2022-07-19 18:44:26,328 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 261 transitions. Word has length 72 [2022-07-19 18:44:26,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 18:44:26,331 INFO L495 AbstractCegarLoop]: Abstraction has 171 states and 261 transitions. [2022-07-19 18:44:26,332 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2022-07-19 18:44:26,333 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 261 transitions. [2022-07-19 18:44:26,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-07-19 18:44:26,344 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 18:44:26,344 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 18:44:26,345 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-19 18:44:26,345 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 18:44:26,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 18:44:26,346 INFO L85 PathProgramCache]: Analyzing trace with hash 1330951645, now seen corresponding path program 1 times [2022-07-19 18:44:26,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 18:44:26,347 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259600214] [2022-07-19 18:44:26,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 18:44:26,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 18:44:26,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:26,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 18:44:26,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:26,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 18:44:26,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:26,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-19 18:44:26,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:26,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-19 18:44:26,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:26,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-19 18:44:26,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:26,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-19 18:44:26,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:26,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-19 18:44:26,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:26,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-19 18:44:26,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:26,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-19 18:44:26,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:26,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-19 18:44:26,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:26,723 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2022-07-19 18:44:26,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 18:44:26,724 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259600214] [2022-07-19 18:44:26,724 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259600214] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 18:44:26,724 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 18:44:26,725 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 18:44:26,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569274036] [2022-07-19 18:44:26,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 18:44:26,726 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 18:44:26,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 18:44:26,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 18:44:26,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 18:44:26,728 INFO L87 Difference]: Start difference. First operand 171 states and 261 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2022-07-19 18:44:26,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 18:44:26,798 INFO L93 Difference]: Finished difference Result 340 states and 520 transitions. [2022-07-19 18:44:26,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 18:44:26,801 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 72 [2022-07-19 18:44:26,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 18:44:26,803 INFO L225 Difference]: With dead ends: 340 [2022-07-19 18:44:26,806 INFO L226 Difference]: Without dead ends: 175 [2022-07-19 18:44:26,807 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 18:44:26,808 INFO L413 NwaCegarLoop]: 258 mSDtfsCounter, 4 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 514 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 18:44:26,810 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 514 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 18:44:26,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2022-07-19 18:44:26,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 172. [2022-07-19 18:44:26,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 109 states have (on average 1.4128440366972477) internal successors, (154), 109 states have internal predecessors, (154), 54 states have call successors, (54), 8 states have call predecessors, (54), 8 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2022-07-19 18:44:26,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 262 transitions. [2022-07-19 18:44:26,832 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 262 transitions. Word has length 72 [2022-07-19 18:44:26,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 18:44:26,833 INFO L495 AbstractCegarLoop]: Abstraction has 172 states and 262 transitions. [2022-07-19 18:44:26,834 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2022-07-19 18:44:26,834 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 262 transitions. [2022-07-19 18:44:26,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-07-19 18:44:26,839 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 18:44:26,839 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 18:44:26,840 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-19 18:44:26,840 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 18:44:26,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 18:44:26,841 INFO L85 PathProgramCache]: Analyzing trace with hash 1826847327, now seen corresponding path program 1 times [2022-07-19 18:44:26,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 18:44:26,843 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073328964] [2022-07-19 18:44:26,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 18:44:26,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 18:44:26,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:27,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-19 18:44:27,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:27,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-19 18:44:27,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:27,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-19 18:44:27,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:27,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-19 18:44:27,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:27,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-19 18:44:27,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:27,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-19 18:44:27,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:27,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-19 18:44:27,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:27,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-19 18:44:27,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:27,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-19 18:44:27,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:27,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-19 18:44:27,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:27,087 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2022-07-19 18:44:27,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 18:44:27,087 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073328964] [2022-07-19 18:44:27,087 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073328964] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 18:44:27,088 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 18:44:27,088 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 18:44:27,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604492275] [2022-07-19 18:44:27,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 18:44:27,088 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 18:44:27,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 18:44:27,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 18:44:27,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 18:44:27,089 INFO L87 Difference]: Start difference. First operand 172 states and 262 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2022-07-19 18:44:27,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 18:44:27,113 INFO L93 Difference]: Finished difference Result 343 states and 524 transitions. [2022-07-19 18:44:27,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 18:44:27,116 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 75 [2022-07-19 18:44:27,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 18:44:27,120 INFO L225 Difference]: With dead ends: 343 [2022-07-19 18:44:27,120 INFO L226 Difference]: Without dead ends: 174 [2022-07-19 18:44:27,121 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 18:44:27,125 INFO L413 NwaCegarLoop]: 259 mSDtfsCounter, 1 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 515 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 18:44:27,125 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 515 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 18:44:27,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2022-07-19 18:44:27,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 173. [2022-07-19 18:44:27,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 110 states have (on average 1.4090909090909092) internal successors, (155), 110 states have internal predecessors, (155), 54 states have call successors, (54), 8 states have call predecessors, (54), 8 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2022-07-19 18:44:27,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 263 transitions. [2022-07-19 18:44:27,151 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 263 transitions. Word has length 75 [2022-07-19 18:44:27,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 18:44:27,152 INFO L495 AbstractCegarLoop]: Abstraction has 173 states and 263 transitions. [2022-07-19 18:44:27,152 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2022-07-19 18:44:27,153 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 263 transitions. [2022-07-19 18:44:27,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-07-19 18:44:27,154 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 18:44:27,154 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 18:44:27,154 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-19 18:44:27,155 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 18:44:27,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 18:44:27,155 INFO L85 PathProgramCache]: Analyzing trace with hash -541531615, now seen corresponding path program 1 times [2022-07-19 18:44:27,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 18:44:27,155 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340651266] [2022-07-19 18:44:27,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 18:44:27,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 18:44:27,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:27,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-19 18:44:27,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:27,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-19 18:44:27,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:27,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-19 18:44:27,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:27,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-19 18:44:27,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:27,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-19 18:44:27,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:27,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-19 18:44:27,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:27,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-19 18:44:27,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:27,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-19 18:44:27,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:27,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-19 18:44:27,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:27,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-19 18:44:27,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:27,308 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2022-07-19 18:44:27,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 18:44:27,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340651266] [2022-07-19 18:44:27,309 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340651266] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 18:44:27,309 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [440240958] [2022-07-19 18:44:27,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 18:44:27,309 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 18:44:27,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 18:44:27,315 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 18:44:27,346 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-19 18:44:27,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:27,955 INFO L263 TraceCheckSpWp]: Trace formula consists of 1765 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-19 18:44:27,963 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 18:44:28,013 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2022-07-19 18:44:28,013 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 18:44:28,091 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2022-07-19 18:44:28,091 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [440240958] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 18:44:28,092 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 18:44:28,092 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2022-07-19 18:44:28,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105041806] [2022-07-19 18:44:28,092 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 18:44:28,093 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-19 18:44:28,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 18:44:28,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-19 18:44:28,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-07-19 18:44:28,094 INFO L87 Difference]: Start difference. First operand 173 states and 263 transitions. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 1 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2022-07-19 18:44:28,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 18:44:28,128 INFO L93 Difference]: Finished difference Result 347 states and 529 transitions. [2022-07-19 18:44:28,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-19 18:44:28,129 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 1 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 77 [2022-07-19 18:44:28,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 18:44:28,130 INFO L225 Difference]: With dead ends: 347 [2022-07-19 18:44:28,130 INFO L226 Difference]: Without dead ends: 177 [2022-07-19 18:44:28,131 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 171 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-07-19 18:44:28,132 INFO L413 NwaCegarLoop]: 259 mSDtfsCounter, 3 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 515 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 18:44:28,132 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 515 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 18:44:28,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2022-07-19 18:44:28,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2022-07-19 18:44:28,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 114 states have (on average 1.394736842105263) internal successors, (159), 114 states have internal predecessors, (159), 54 states have call successors, (54), 8 states have call predecessors, (54), 8 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2022-07-19 18:44:28,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 267 transitions. [2022-07-19 18:44:28,144 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 267 transitions. Word has length 77 [2022-07-19 18:44:28,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 18:44:28,144 INFO L495 AbstractCegarLoop]: Abstraction has 177 states and 267 transitions. [2022-07-19 18:44:28,145 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 1 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2022-07-19 18:44:28,145 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 267 transitions. [2022-07-19 18:44:28,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-07-19 18:44:28,146 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 18:44:28,146 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 18:44:28,178 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-19 18:44:28,359 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 18:44:28,360 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 18:44:28,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 18:44:28,360 INFO L85 PathProgramCache]: Analyzing trace with hash -1454696411, now seen corresponding path program 2 times [2022-07-19 18:44:28,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 18:44:28,361 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62440946] [2022-07-19 18:44:28,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 18:44:28,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 18:44:28,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:28,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-19 18:44:28,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:28,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-19 18:44:28,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:28,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-19 18:44:28,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:28,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-19 18:44:28,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:28,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-19 18:44:28,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:28,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-19 18:44:28,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:28,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-19 18:44:28,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:28,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-19 18:44:28,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:28,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-19 18:44:28,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:28,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-19 18:44:28,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:28,612 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 189 trivial. 0 not checked. [2022-07-19 18:44:28,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 18:44:28,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62440946] [2022-07-19 18:44:28,612 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [62440946] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 18:44:28,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1214074023] [2022-07-19 18:44:28,613 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-19 18:44:28,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 18:44:28,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 18:44:28,614 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 18:44:28,617 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-19 18:44:29,475 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-19 18:44:29,475 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 18:44:29,484 INFO L263 TraceCheckSpWp]: Trace formula consists of 1519 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-19 18:44:29,488 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 18:44:29,636 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2022-07-19 18:44:29,636 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 18:44:29,636 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1214074023] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 18:44:29,636 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 18:44:29,637 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2022-07-19 18:44:29,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532184467] [2022-07-19 18:44:29,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 18:44:29,637 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 18:44:29,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 18:44:29,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 18:44:29,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-19 18:44:29,638 INFO L87 Difference]: Start difference. First operand 177 states and 267 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2022-07-19 18:44:29,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 18:44:29,677 INFO L93 Difference]: Finished difference Result 339 states and 524 transitions. [2022-07-19 18:44:29,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 18:44:29,678 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 81 [2022-07-19 18:44:29,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 18:44:29,681 INFO L225 Difference]: With dead ends: 339 [2022-07-19 18:44:29,684 INFO L226 Difference]: Without dead ends: 313 [2022-07-19 18:44:29,685 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-07-19 18:44:29,685 INFO L413 NwaCegarLoop]: 375 mSDtfsCounter, 208 mSDsluCounter, 626 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 1001 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 18:44:29,686 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 1001 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 18:44:29,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2022-07-19 18:44:29,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 312. [2022-07-19 18:44:29,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 312 states, 198 states have (on average 1.4292929292929293) internal successors, (283), 198 states have internal predecessors, (283), 97 states have call successors, (97), 16 states have call predecessors, (97), 16 states have return successors, (105), 97 states have call predecessors, (105), 97 states have call successors, (105) [2022-07-19 18:44:29,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 485 transitions. [2022-07-19 18:44:29,722 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 485 transitions. Word has length 81 [2022-07-19 18:44:29,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 18:44:29,723 INFO L495 AbstractCegarLoop]: Abstraction has 312 states and 485 transitions. [2022-07-19 18:44:29,723 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2022-07-19 18:44:29,723 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 485 transitions. [2022-07-19 18:44:29,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2022-07-19 18:44:29,731 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 18:44:29,732 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 4, 4, 4, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 18:44:29,761 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-19 18:44:29,946 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 18:44:29,946 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 18:44:29,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 18:44:29,947 INFO L85 PathProgramCache]: Analyzing trace with hash -613977023, now seen corresponding path program 1 times [2022-07-19 18:44:29,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 18:44:29,947 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074491597] [2022-07-19 18:44:29,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 18:44:29,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 18:44:30,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:30,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-19 18:44:30,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:30,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 18:44:30,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:30,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 18:44:30,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:30,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 18:44:30,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:30,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-19 18:44:30,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:30,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 18:44:30,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:30,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-19 18:44:30,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:30,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 18:44:30,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:30,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-19 18:44:30,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:30,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-19 18:44:30,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:30,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 18:44:30,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:30,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-19 18:44:30,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:30,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-19 18:44:30,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:30,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-19 18:44:30,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:30,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-19 18:44:30,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:30,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-19 18:44:30,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:30,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-19 18:44:30,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:30,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-19 18:44:30,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:30,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-19 18:44:30,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:30,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-19 18:44:30,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:30,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-19 18:44:30,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:30,284 INFO L134 CoverageAnalysis]: Checked inductivity of 416 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 415 trivial. 0 not checked. [2022-07-19 18:44:30,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 18:44:30,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074491597] [2022-07-19 18:44:30,285 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074491597] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 18:44:30,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1560229021] [2022-07-19 18:44:30,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 18:44:30,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 18:44:30,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 18:44:30,287 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 18:44:30,291 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-19 18:44:31,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:31,147 INFO L263 TraceCheckSpWp]: Trace formula consists of 2132 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-19 18:44:31,152 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 18:44:31,180 INFO L134 CoverageAnalysis]: Checked inductivity of 416 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 415 trivial. 0 not checked. [2022-07-19 18:44:31,180 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 18:44:31,305 INFO L134 CoverageAnalysis]: Checked inductivity of 416 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 415 trivial. 0 not checked. [2022-07-19 18:44:31,305 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1560229021] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 18:44:31,306 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 18:44:31,306 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 4, 4] total 9 [2022-07-19 18:44:31,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855197216] [2022-07-19 18:44:31,306 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 18:44:31,308 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-19 18:44:31,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 18:44:31,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-19 18:44:31,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-07-19 18:44:31,311 INFO L87 Difference]: Start difference. First operand 312 states and 485 transitions. Second operand has 9 states, 9 states have (on average 10.11111111111111) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (43), 6 states have call predecessors, (43), 2 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) [2022-07-19 18:44:33,359 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 18:44:35,376 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 18:44:35,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 18:44:35,861 INFO L93 Difference]: Finished difference Result 631 states and 988 transitions. [2022-07-19 18:44:35,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-19 18:44:35,861 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.11111111111111) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (43), 6 states have call predecessors, (43), 2 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) Word has length 155 [2022-07-19 18:44:35,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 18:44:35,864 INFO L225 Difference]: With dead ends: 631 [2022-07-19 18:44:35,864 INFO L226 Difference]: Without dead ends: 331 [2022-07-19 18:44:35,866 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 355 GetRequests, 346 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-07-19 18:44:35,867 INFO L413 NwaCegarLoop]: 254 mSDtfsCounter, 100 mSDsluCounter, 357 mSDsCounter, 0 mSdLazyCounter, 314 mSolverCounterSat, 227 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 611 SdHoareTripleChecker+Invalid, 543 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 227 IncrementalHoareTripleChecker+Valid, 314 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2022-07-19 18:44:35,867 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 611 Invalid, 543 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [227 Valid, 314 Invalid, 2 Unknown, 0 Unchecked, 4.5s Time] [2022-07-19 18:44:35,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2022-07-19 18:44:35,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 325. [2022-07-19 18:44:35,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 209 states have (on average 1.4114832535885167) internal successors, (295), 211 states have internal predecessors, (295), 97 states have call successors, (97), 16 states have call predecessors, (97), 18 states have return successors, (111), 97 states have call predecessors, (111), 97 states have call successors, (111) [2022-07-19 18:44:35,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 503 transitions. [2022-07-19 18:44:35,891 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 503 transitions. Word has length 155 [2022-07-19 18:44:35,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 18:44:35,891 INFO L495 AbstractCegarLoop]: Abstraction has 325 states and 503 transitions. [2022-07-19 18:44:35,892 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.11111111111111) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (43), 6 states have call predecessors, (43), 2 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) [2022-07-19 18:44:35,892 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 503 transitions. [2022-07-19 18:44:35,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2022-07-19 18:44:35,895 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 18:44:35,896 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 6, 6, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 18:44:35,927 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-07-19 18:44:36,111 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 18:44:36,112 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 18:44:36,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 18:44:36,112 INFO L85 PathProgramCache]: Analyzing trace with hash -1817944839, now seen corresponding path program 2 times [2022-07-19 18:44:36,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 18:44:36,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453300595] [2022-07-19 18:44:36,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 18:44:36,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 18:44:46,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:46,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-19 18:44:47,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:47,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 18:44:47,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:47,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 18:44:47,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:47,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 18:44:47,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:47,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-19 18:44:47,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:47,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 18:44:47,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:47,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-19 18:44:47,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:47,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 18:44:47,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:47,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-19 18:44:47,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:47,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-19 18:44:47,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:47,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 18:44:47,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:47,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-19 18:44:47,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:47,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-19 18:44:47,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:47,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-07-19 18:44:47,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:47,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-07-19 18:44:47,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:47,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-07-19 18:44:47,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:47,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-07-19 18:44:47,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:47,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-07-19 18:44:47,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:47,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-07-19 18:44:47,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:47,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-07-19 18:44:47,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:47,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-07-19 18:44:47,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:47,233 INFO L134 CoverageAnalysis]: Checked inductivity of 453 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 444 trivial. 0 not checked. [2022-07-19 18:44:47,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 18:44:47,233 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453300595] [2022-07-19 18:44:47,234 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453300595] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 18:44:47,234 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [370664040] [2022-07-19 18:44:47,234 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-19 18:44:47,234 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 18:44:47,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 18:44:47,236 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 18:44:47,240 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-19 18:44:48,190 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-19 18:44:48,190 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 18:44:48,198 INFO L263 TraceCheckSpWp]: Trace formula consists of 1583 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-19 18:44:48,207 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 18:44:48,244 INFO L134 CoverageAnalysis]: Checked inductivity of 453 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 453 trivial. 0 not checked. [2022-07-19 18:44:48,245 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 18:44:48,245 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [370664040] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 18:44:48,245 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 18:44:48,245 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [12] total 13 [2022-07-19 18:44:48,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113176184] [2022-07-19 18:44:48,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 18:44:48,246 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 18:44:48,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 18:44:48,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 18:44:48,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2022-07-19 18:44:48,248 INFO L87 Difference]: Start difference. First operand 325 states and 503 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2022-07-19 18:44:48,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 18:44:48,271 INFO L93 Difference]: Finished difference Result 619 states and 965 transitions. [2022-07-19 18:44:48,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 18:44:48,272 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 164 [2022-07-19 18:44:48,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 18:44:48,275 INFO L225 Difference]: With dead ends: 619 [2022-07-19 18:44:48,276 INFO L226 Difference]: Without dead ends: 325 [2022-07-19 18:44:48,277 INFO L412 NwaCegarLoop]: 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 [2022-07-19 18:44:48,278 INFO L413 NwaCegarLoop]: 259 mSDtfsCounter, 0 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 516 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 18:44:48,278 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 516 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 18:44:48,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2022-07-19 18:44:48,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 325. [2022-07-19 18:44:48,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 209 states have (on average 1.4066985645933014) internal successors, (294), 211 states have internal predecessors, (294), 97 states have call successors, (97), 16 states have call predecessors, (97), 18 states have return successors, (111), 97 states have call predecessors, (111), 97 states have call successors, (111) [2022-07-19 18:44:48,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 502 transitions. [2022-07-19 18:44:48,312 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 502 transitions. Word has length 164 [2022-07-19 18:44:48,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 18:44:48,312 INFO L495 AbstractCegarLoop]: Abstraction has 325 states and 502 transitions. [2022-07-19 18:44:48,312 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2022-07-19 18:44:48,313 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 502 transitions. [2022-07-19 18:44:48,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2022-07-19 18:44:48,316 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 18:44:48,316 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 6, 6, 5, 5, 5, 5, 5, 5, 5, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 18:44:48,349 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-19 18:44:48,531 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 18:44:48,531 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 18:44:48,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 18:44:48,532 INFO L85 PathProgramCache]: Analyzing trace with hash 755632713, now seen corresponding path program 1 times [2022-07-19 18:44:48,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 18:44:48,532 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190640295] [2022-07-19 18:44:48,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 18:44:48,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 18:44:48,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:48,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 18:44:48,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:48,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 18:44:48,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:48,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 18:44:48,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:48,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-19 18:44:48,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:48,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 18:44:48,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:48,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 18:44:48,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:48,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 18:44:48,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:48,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-19 18:44:48,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:48,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 18:44:48,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:48,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-19 18:44:48,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:48,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 18:44:48,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:49,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-19 18:44:49,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:49,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-19 18:44:49,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:49,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 18:44:49,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:49,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-19 18:44:49,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:49,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-19 18:44:49,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:49,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-07-19 18:44:49,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:49,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-07-19 18:44:49,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:49,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-07-19 18:44:49,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:49,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2022-07-19 18:44:49,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:49,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2022-07-19 18:44:49,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:49,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2022-07-19 18:44:49,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:49,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2022-07-19 18:44:49,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:49,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2022-07-19 18:44:49,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:49,028 INFO L134 CoverageAnalysis]: Checked inductivity of 542 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 538 trivial. 0 not checked. [2022-07-19 18:44:49,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 18:44:49,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190640295] [2022-07-19 18:44:49,028 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190640295] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 18:44:49,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [448038337] [2022-07-19 18:44:49,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 18:44:49,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 18:44:49,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 18:44:49,030 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 18:44:49,031 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-19 18:44:50,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:44:50,183 INFO L263 TraceCheckSpWp]: Trace formula consists of 2467 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-19 18:44:50,189 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 18:44:50,212 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 16 [2022-07-19 18:44:50,248 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-19 18:44:50,321 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-19 18:44:50,327 INFO L134 CoverageAnalysis]: Checked inductivity of 542 backedges. 200 proven. 5 refuted. 0 times theorem prover too weak. 337 trivial. 0 not checked. [2022-07-19 18:44:50,327 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 18:44:50,392 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2022-07-19 18:44:50,548 INFO L134 CoverageAnalysis]: Checked inductivity of 542 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 537 trivial. 0 not checked. [2022-07-19 18:44:50,548 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [448038337] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 18:44:50,548 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 18:44:50,548 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 5] total 14 [2022-07-19 18:44:50,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24628521] [2022-07-19 18:44:50,549 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 18:44:50,549 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-19 18:44:50,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 18:44:50,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-19 18:44:50,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2022-07-19 18:44:50,550 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) [2022-07-19 18:44:52,229 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.64s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 18:44:54,408 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 18:44:56,879 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 18:44:58,897 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 18:45:01,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 18:45:01,870 INFO L93 Difference]: Finished difference Result 747 states and 1193 transitions. [2022-07-19 18:45:01,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-19 18:45:01,870 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 [2022-07-19 18:45:01,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 18:45:01,875 INFO L225 Difference]: With dead ends: 747 [2022-07-19 18:45:01,875 INFO L226 Difference]: Without dead ends: 717 [2022-07-19 18:45:01,877 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 447 GetRequests, 419 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=247, Invalid=623, Unknown=0, NotChecked=0, Total=870 [2022-07-19 18:45:01,877 INFO L413 NwaCegarLoop]: 257 mSDtfsCounter, 1055 mSDsluCounter, 883 mSDsCounter, 0 mSdLazyCounter, 1559 mSolverCounterSat, 1040 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1067 SdHoareTripleChecker+Valid, 1140 SdHoareTripleChecker+Invalid, 2602 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1040 IncrementalHoareTripleChecker+Valid, 1559 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.0s IncrementalHoareTripleChecker+Time [2022-07-19 18:45:01,877 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1067 Valid, 1140 Invalid, 2602 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1040 Valid, 1559 Invalid, 3 Unknown, 0 Unchecked, 11.0s Time] [2022-07-19 18:45:01,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2022-07-19 18:45:01,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 680. [2022-07-19 18:45:01,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 680 states, 427 states have (on average 1.4285714285714286) internal successors, (610), 434 states have internal predecessors, (610), 211 states have call successors, (211), 32 states have call predecessors, (211), 41 states have return successors, (265), 213 states have call predecessors, (265), 211 states have call successors, (265) [2022-07-19 18:45:01,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 680 states to 680 states and 1086 transitions. [2022-07-19 18:45:01,922 INFO L78 Accepts]: Start accepts. Automaton has 680 states and 1086 transitions. Word has length 186 [2022-07-19 18:45:01,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 18:45:01,923 INFO L495 AbstractCegarLoop]: Abstraction has 680 states and 1086 transitions. [2022-07-19 18:45:01,923 INFO L496 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) [2022-07-19 18:45:01,923 INFO L276 IsEmpty]: Start isEmpty. Operand 680 states and 1086 transitions. [2022-07-19 18:45:01,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2022-07-19 18:45:01,928 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 18:45:01,928 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 6, 6, 5, 5, 5, 5, 5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 18:45:01,963 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-19 18:45:02,155 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 18:45:02,156 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 18:45:02,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 18:45:02,156 INFO L85 PathProgramCache]: Analyzing trace with hash -2108443675, now seen corresponding path program 1 times [2022-07-19 18:45:02,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 18:45:02,156 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246947544] [2022-07-19 18:45:02,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 18:45:02,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 18:45:14,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:14,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 18:45:14,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:14,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 18:45:14,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:14,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 18:45:14,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:14,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-19 18:45:14,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:14,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 18:45:14,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:14,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 18:45:14,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:14,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 18:45:14,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:14,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-19 18:45:14,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:14,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 18:45:14,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:14,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-19 18:45:14,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:14,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 18:45:14,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:14,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-19 18:45:14,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:14,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-19 18:45:14,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:14,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 18:45:14,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:14,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-07-19 18:45:14,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:14,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-07-19 18:45:14,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:14,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-19 18:45:14,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:14,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-07-19 18:45:14,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:14,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2022-07-19 18:45:14,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:14,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-07-19 18:45:14,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:14,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2022-07-19 18:45:14,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:14,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-07-19 18:45:14,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:14,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-07-19 18:45:14,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:14,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2022-07-19 18:45:14,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:14,972 INFO L134 CoverageAnalysis]: Checked inductivity of 546 backedges. 8 proven. 9 refuted. 0 times theorem prover too weak. 529 trivial. 0 not checked. [2022-07-19 18:45:14,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 18:45:14,972 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246947544] [2022-07-19 18:45:14,972 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246947544] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 18:45:14,972 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1279822686] [2022-07-19 18:45:14,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 18:45:14,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 18:45:14,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 18:45:14,974 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 18:45:14,976 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-19 18:45:16,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 18:45:16,068 INFO L263 TraceCheckSpWp]: Trace formula consists of 2433 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-19 18:45:16,073 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 18:45:16,350 INFO L134 CoverageAnalysis]: Checked inductivity of 546 backedges. 74 proven. 126 refuted. 0 times theorem prover too weak. 346 trivial. 0 not checked. [2022-07-19 18:45:16,351 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 18:45:16,630 INFO L134 CoverageAnalysis]: Checked inductivity of 546 backedges. 17 proven. 9 refuted. 0 times theorem prover too weak. 520 trivial. 0 not checked. [2022-07-19 18:45:16,630 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1279822686] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 18:45:16,630 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 18:45:16,631 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7, 8] total 22 [2022-07-19 18:45:16,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096883852] [2022-07-19 18:45:16,631 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 18:45:16,632 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-07-19 18:45:16,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 18:45:16,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-07-19 18:45:16,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=388, Unknown=0, NotChecked=0, Total=462 [2022-07-19 18:45:16,633 INFO L87 Difference]: Start difference. First operand 680 states and 1086 transitions. Second operand has 22 states, 21 states have (on average 6.666666666666667) internal successors, (140), 16 states have internal predecessors, (140), 7 states have call successors, (43), 6 states have call predecessors, (43), 9 states have return successors, (46), 11 states have call predecessors, (46), 7 states have call successors, (46) [2022-07-19 18:45:17,698 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 18:45:19,948 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 18:45:22,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 18:45:22,344 INFO L93 Difference]: Finished difference Result 1932 states and 3206 transitions. [2022-07-19 18:45:22,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-19 18:45:22,345 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 6.666666666666667) internal successors, (140), 16 states have internal predecessors, (140), 7 states have call successors, (43), 6 states have call predecessors, (43), 9 states have return successors, (46), 11 states have call predecessors, (46), 7 states have call successors, (46) Word has length 187 [2022-07-19 18:45:22,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 18:45:22,346 INFO L225 Difference]: With dead ends: 1932 [2022-07-19 18:45:22,346 INFO L226 Difference]: Without dead ends: 0 [2022-07-19 18:45:22,355 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 453 GetRequests, 417 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=244, Invalid=1088, Unknown=0, NotChecked=0, Total=1332 [2022-07-19 18:45:22,356 INFO L413 NwaCegarLoop]: 241 mSDtfsCounter, 700 mSDsluCounter, 782 mSDsCounter, 0 mSdLazyCounter, 2233 mSolverCounterSat, 854 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 716 SdHoareTripleChecker+Valid, 1023 SdHoareTripleChecker+Invalid, 3088 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 854 IncrementalHoareTripleChecker+Valid, 2233 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2022-07-19 18:45:22,356 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [716 Valid, 1023 Invalid, 3088 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [854 Valid, 2233 Invalid, 1 Unknown, 0 Unchecked, 5.3s Time] [2022-07-19 18:45:22,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-07-19 18:45:22,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-07-19 18:45:22,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 18:45:22,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-07-19 18:45:22,358 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 187 [2022-07-19 18:45:22,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 18:45:22,358 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-19 18:45:22,358 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 6.666666666666667) internal successors, (140), 16 states have internal predecessors, (140), 7 states have call successors, (43), 6 states have call predecessors, (43), 9 states have return successors, (46), 11 states have call predecessors, (46), 7 states have call successors, (46) [2022-07-19 18:45:22,358 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-07-19 18:45:22,359 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-07-19 18:45:22,361 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-19 18:45:22,393 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-19 18:45:22,583 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 18:45:22,585 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-07-19 18:45:26,554 INFO L902 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 5 7) the Hoare annotation is: true [2022-07-19 18:45:26,554 INFO L899 garLoopResultBuilder]: For program point L6(line 6) no Hoare annotation was computed. [2022-07-19 18:45:26,554 INFO L899 garLoopResultBuilder]: For program point L6-2(lines 5 7) no Hoare annotation was computed. [2022-07-19 18:45:26,554 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 5 7) no Hoare annotation was computed. [2022-07-19 18:45:26,554 INFO L899 garLoopResultBuilder]: For program point __CS_pthread_mutex_initEXIT(lines 569 572) no Hoare annotation was computed. [2022-07-19 18:45:26,554 INFO L902 garLoopResultBuilder]: At program point __CS_pthread_mutex_initENTRY(lines 569 572) the Hoare annotation is: true [2022-07-19 18:45:26,554 INFO L899 garLoopResultBuilder]: For program point __CS_pthread_mutex_initFINAL(lines 569 572) no Hoare annotation was computed. [2022-07-19 18:45:26,555 INFO L899 garLoopResultBuilder]: For program point __CS_pthread_joinEXIT(lines 642 663) no Hoare annotation was computed. [2022-07-19 18:45:26,555 INFO L895 garLoopResultBuilder]: At program point __CS_pthread_joinENTRY(lines 642 663) the Hoare annotation is: (or (not (= ~__CS_ret_PREEMPTED~0 1)) (and (= ~__CS_error~0 |old(~__CS_error~0)|) (= |old(~__CS_ret~0)| ~__CS_ret~0)) (not (= (mod |old(~__CS_ret~0)| 256) 0))) [2022-07-19 18:45:26,555 INFO L899 garLoopResultBuilder]: For program point __CS_pthread_joinFINAL(lines 642 663) no Hoare annotation was computed. [2022-07-19 18:45:26,555 INFO L895 garLoopResultBuilder]: At program point L661(line 661) the Hoare annotation is: (or (not (= ~__CS_ret_PREEMPTED~0 1)) (and (= ~__CS_error~0 |old(~__CS_error~0)|) (= |old(~__CS_ret~0)| ~__CS_ret~0)) (not (= (mod |old(~__CS_ret~0)| 256) 0))) [2022-07-19 18:45:26,555 INFO L899 garLoopResultBuilder]: For program point L661-1(line 661) no Hoare annotation was computed. [2022-07-19 18:45:26,555 INFO L899 garLoopResultBuilder]: For program point L655(lines 655 660) no Hoare annotation was computed. [2022-07-19 18:45:26,555 INFO L899 garLoopResultBuilder]: For program point L650(line 650) no Hoare annotation was computed. [2022-07-19 18:45:26,555 INFO L899 garLoopResultBuilder]: For program point L650-2(lines 650 654) no Hoare annotation was computed. [2022-07-19 18:45:26,556 INFO L899 garLoopResultBuilder]: For program point L644(lines 644 649) no Hoare annotation was computed. [2022-07-19 18:45:26,556 INFO L895 garLoopResultBuilder]: At program point __CS_pthread_mutex_lockENTRY(lines 582 587) the Hoare annotation is: (or (and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~__CS_ret~0)| ~__CS_ret~0)) (not (= ~__CS_ret_PREEMPTED~0 1)) (not (= (mod |old(~__CS_ret~0)| 256) 0))) [2022-07-19 18:45:26,556 INFO L899 garLoopResultBuilder]: For program point L584(lines 584 585) no Hoare annotation was computed. [2022-07-19 18:45:26,556 INFO L899 garLoopResultBuilder]: For program point L584-1(lines 584 585) no Hoare annotation was computed. [2022-07-19 18:45:26,556 INFO L899 garLoopResultBuilder]: For program point __CS_pthread_mutex_lockEXIT(lines 582 587) no Hoare annotation was computed. [2022-07-19 18:45:26,556 INFO L899 garLoopResultBuilder]: For program point __CS_pthread_mutex_lockFINAL(lines 582 587) no Hoare annotation was computed. [2022-07-19 18:45:26,556 INFO L895 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))) [2022-07-19 18:45:26,556 INFO L899 garLoopResultBuilder]: For program point L729-1(lines 722 753) no Hoare annotation was computed. [2022-07-19 18:45:26,557 INFO L895 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))) [2022-07-19 18:45:26,557 INFO L899 garLoopResultBuilder]: For program point L696-1(line 696) no Hoare annotation was computed. [2022-07-19 18:45:26,557 INFO L895 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))) [2022-07-19 18:45:26,557 INFO L899 garLoopResultBuilder]: For program point L713-1(lines 706 720) no Hoare annotation was computed. [2022-07-19 18:45:26,557 INFO L895 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)|))) [2022-07-19 18:45:26,557 INFO L899 garLoopResultBuilder]: For program point L697-1(lines 690 704) no Hoare annotation was computed. [2022-07-19 18:45:26,558 INFO L899 garLoopResultBuilder]: For program point ##fun~$Pointer$~TO~$Pointer$FINAL(line -1) no Hoare annotation was computed. [2022-07-19 18:45:26,558 INFO L895 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))) [2022-07-19 18:45:26,558 INFO L895 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))) [2022-07-19 18:45:26,558 INFO L899 garLoopResultBuilder]: For program point L714-1(line 714) no Hoare annotation was computed. [2022-07-19 18:45:26,558 INFO L899 garLoopResultBuilder]: For program point ##fun~$Pointer$~TO~$Pointer$EXIT(line -1) no Hoare annotation was computed. [2022-07-19 18:45:26,558 INFO L895 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))) [2022-07-19 18:45:26,558 INFO L899 garLoopResultBuilder]: For program point L731-1(lines 722 753) no Hoare annotation was computed. [2022-07-19 18:45:26,559 INFO L895 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))) [2022-07-19 18:45:26,559 INFO L899 garLoopResultBuilder]: For program point L698-1(line 698) no Hoare annotation was computed. [2022-07-19 18:45:26,559 INFO L895 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))))) [2022-07-19 18:45:26,559 INFO L899 garLoopResultBuilder]: For program point L715-1(lines 706 720) no Hoare annotation was computed. [2022-07-19 18:45:26,559 INFO L895 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)))) [2022-07-19 18:45:26,559 INFO L899 garLoopResultBuilder]: For program point L699-1(lines 690 704) no Hoare annotation was computed. [2022-07-19 18:45:26,559 INFO L895 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))) [2022-07-19 18:45:26,559 INFO L899 garLoopResultBuilder]: For program point L733-1(lines 722 753) no Hoare annotation was computed. [2022-07-19 18:45:26,560 INFO L895 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))) [2022-07-19 18:45:26,560 INFO L899 garLoopResultBuilder]: For program point L717-1(lines 706 720) no Hoare annotation was computed. [2022-07-19 18:45:26,560 INFO L895 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))) [2022-07-19 18:45:26,560 INFO L899 garLoopResultBuilder]: For program point L734-1(line 734) no Hoare annotation was computed. [2022-07-19 18:45:26,560 INFO L895 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))) [2022-07-19 18:45:26,560 INFO L899 garLoopResultBuilder]: For program point L701-1(lines 690 704) no Hoare annotation was computed. [2022-07-19 18:45:26,560 INFO L895 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))) [2022-07-19 18:45:26,560 INFO L899 garLoopResultBuilder]: For program point L718-1(line 718) no Hoare annotation was computed. [2022-07-19 18:45:26,560 INFO L895 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))) [2022-07-19 18:45:26,561 INFO L899 garLoopResultBuilder]: For program point L735-1(lines 722 753) no Hoare annotation was computed. [2022-07-19 18:45:26,561 INFO L895 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))) [2022-07-19 18:45:26,561 INFO L899 garLoopResultBuilder]: For program point L702-1(line 702) no Hoare annotation was computed. [2022-07-19 18:45:26,561 INFO L899 garLoopResultBuilder]: For program point L752(lines 722 753) no Hoare annotation was computed. [2022-07-19 18:45:26,561 INFO L895 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))) [2022-07-19 18:45:26,561 INFO L899 garLoopResultBuilder]: For program point L719-1(lines 706 720) no Hoare annotation was computed. [2022-07-19 18:45:26,561 INFO L895 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))) [2022-07-19 18:45:26,562 INFO L899 garLoopResultBuilder]: For program point L736-1(line 736) no Hoare annotation was computed. [2022-07-19 18:45:26,562 INFO L895 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)|))) [2022-07-19 18:45:26,562 INFO L899 garLoopResultBuilder]: For program point L703-1(lines 690 704) no Hoare annotation was computed. [2022-07-19 18:45:26,562 INFO L895 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))) [2022-07-19 18:45:26,562 INFO L899 garLoopResultBuilder]: For program point L737-1(lines 722 753) no Hoare annotation was computed. [2022-07-19 18:45:26,562 INFO L895 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))) [2022-07-19 18:45:26,562 INFO L895 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))) [2022-07-19 18:45:26,563 INFO L899 garLoopResultBuilder]: For program point L738-1(line 738) no Hoare annotation was computed. [2022-07-19 18:45:26,563 INFO L895 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))) [2022-07-19 18:45:26,563 INFO L895 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)|))) [2022-07-19 18:45:26,563 INFO L895 garLoopResultBuilder]: At program point ##fun~$Pointer$~TO~$Pointer$ENTRY(line -1) the Hoare annotation is: (or (not (= ~__CS_ret_PREEMPTED~0 1)) (and (= |old(#length)| |#length|) (= |old(~__CS_thread~0.offset)| ~__CS_thread~0.offset) (= |#memory_int| |old(#memory_int)|) (= ~__CS_error~0 |old(~__CS_error~0)|) (= ~__CS_thread~0.base |old(~__CS_thread~0.base)|) (= |old(~__CS_round~0)| ~__CS_round~0) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~__CS_ret~0)| ~__CS_ret~0) (= |old(#valid)| |#valid|) (= ~__CS_thread_index~0 |old(~__CS_thread_index~0)|)) (not (= (mod |old(~__CS_ret~0)| 256) 0))) [2022-07-19 18:45:26,563 INFO L895 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))) [2022-07-19 18:45:26,563 INFO L899 garLoopResultBuilder]: For program point L739-1(lines 722 753) no Hoare annotation was computed. [2022-07-19 18:45:26,563 INFO L895 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))) [2022-07-19 18:45:26,564 INFO L899 garLoopResultBuilder]: For program point L740-1(line 740) no Hoare annotation was computed. [2022-07-19 18:45:26,564 INFO L895 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))) [2022-07-19 18:45:26,564 INFO L899 garLoopResultBuilder]: For program point L707-1(lines 706 720) no Hoare annotation was computed. [2022-07-19 18:45:26,564 INFO L895 garLoopResultBuilder]: At program point L691(line 691) the Hoare annotation is: (or (not (= ~__CS_ret_PREEMPTED~0 1)) (and (= |old(#length)| |#length|) (= |old(~__CS_thread~0.offset)| ~__CS_thread~0.offset) (= |#memory_int| |old(#memory_int)|) (= ~__CS_error~0 |old(~__CS_error~0)|) (= ~__CS_thread~0.base |old(~__CS_thread~0.base)|) (= |old(~__CS_round~0)| ~__CS_round~0) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~__CS_ret~0)| ~__CS_ret~0) (= |old(#valid)| |#valid|) (= ~__CS_thread_index~0 |old(~__CS_thread_index~0)|)) (not (= (mod |old(~__CS_ret~0)| 256) 0))) [2022-07-19 18:45:26,564 INFO L899 garLoopResultBuilder]: For program point L691-1(lines 690 704) no Hoare annotation was computed. [2022-07-19 18:45:26,564 INFO L895 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))) [2022-07-19 18:45:26,564 INFO L899 garLoopResultBuilder]: For program point L741-1(lines 722 753) no Hoare annotation was computed. [2022-07-19 18:45:26,565 INFO L895 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))) [2022-07-19 18:45:26,565 INFO L899 garLoopResultBuilder]: For program point L708-1(line 708) no Hoare annotation was computed. [2022-07-19 18:45:26,565 INFO L895 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))) [2022-07-19 18:45:26,565 INFO L899 garLoopResultBuilder]: For program point L725-1(lines 722 753) no Hoare annotation was computed. [2022-07-19 18:45:26,565 INFO L895 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))) [2022-07-19 18:45:26,565 INFO L899 garLoopResultBuilder]: For program point L692-1(line 692) no Hoare annotation was computed. [2022-07-19 18:45:26,566 INFO L899 garLoopResultBuilder]: For program point L742(line 742) no Hoare annotation was computed. [2022-07-19 18:45:26,566 INFO L895 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))))))) [2022-07-19 18:45:26,566 INFO L899 garLoopResultBuilder]: For program point L742-2(lines 742 751) no Hoare annotation was computed. [2022-07-19 18:45:26,566 INFO L899 garLoopResultBuilder]: For program point L709-1(lines 706 720) no Hoare annotation was computed. [2022-07-19 18:45:26,566 INFO L895 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))) [2022-07-19 18:45:26,566 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-07-19 18:45:26,566 INFO L899 garLoopResultBuilder]: For program point L-1-2(line -1) no Hoare annotation was computed. [2022-07-19 18:45:26,567 INFO L899 garLoopResultBuilder]: For program point L-1-4(line -1) no Hoare annotation was computed. [2022-07-19 18:45:26,567 INFO L895 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))) [2022-07-19 18:45:26,567 INFO L899 garLoopResultBuilder]: For program point L726-1(line 726) no Hoare annotation was computed. [2022-07-19 18:45:26,567 INFO L895 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)))) [2022-07-19 18:45:26,567 INFO L899 garLoopResultBuilder]: For program point L693-1(lines 690 704) no Hoare annotation was computed. [2022-07-19 18:45:26,567 INFO L895 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))) [2022-07-19 18:45:26,567 INFO L899 garLoopResultBuilder]: For program point L727-1(lines 722 753) no Hoare annotation was computed. [2022-07-19 18:45:26,568 INFO L895 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))) [2022-07-19 18:45:26,568 INFO L899 garLoopResultBuilder]: For program point L744-1(lines 743 751) no Hoare annotation was computed. [2022-07-19 18:45:26,568 INFO L895 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))) [2022-07-19 18:45:26,568 INFO L899 garLoopResultBuilder]: For program point L711-1(lines 706 720) no Hoare annotation was computed. [2022-07-19 18:45:26,568 INFO L895 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))) [2022-07-19 18:45:26,568 INFO L899 garLoopResultBuilder]: For program point L728-1(line 728) no Hoare annotation was computed. [2022-07-19 18:45:26,568 INFO L895 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))) [2022-07-19 18:45:26,569 INFO L899 garLoopResultBuilder]: For program point L695-1(lines 690 704) no Hoare annotation was computed. [2022-07-19 18:45:26,569 INFO L895 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))) [2022-07-19 18:45:26,569 INFO L899 garLoopResultBuilder]: For program point L712-1(line 712) no Hoare annotation was computed. [2022-07-19 18:45:26,569 INFO L895 garLoopResultBuilder]: At program point __CS_pthread_mutex_unlockENTRY(lines 588 596) the Hoare annotation is: (or (not (= ~__CS_ret_PREEMPTED~0 1)) (and (= |#memory_int| |old(#memory_int)|) (= ~__CS_error~0 |old(~__CS_error~0)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~__CS_ret~0)| ~__CS_ret~0)) (not (= (mod |old(~__CS_ret~0)| 256) 0))) [2022-07-19 18:45:26,569 INFO L899 garLoopResultBuilder]: For program point L590(lines 590 594) no Hoare annotation was computed. [2022-07-19 18:45:26,569 INFO L899 garLoopResultBuilder]: For program point __CS_pthread_mutex_unlockFINAL(lines 588 596) no Hoare annotation was computed. [2022-07-19 18:45:26,569 INFO L899 garLoopResultBuilder]: For program point __CS_pthread_mutex_unlockEXIT(lines 588 596) no Hoare annotation was computed. [2022-07-19 18:45:26,570 INFO L899 garLoopResultBuilder]: For program point __CS_pthread_createFINAL(lines 664 677) no Hoare annotation was computed. [2022-07-19 18:45:26,570 INFO L899 garLoopResultBuilder]: For program point L666(lines 666 669) no Hoare annotation was computed. [2022-07-19 18:45:26,570 INFO L899 garLoopResultBuilder]: For program point __CS_pthread_createEXIT(lines 664 677) no Hoare annotation was computed. [2022-07-19 18:45:26,570 INFO L895 garLoopResultBuilder]: At program point __CS_pthread_createENTRY(lines 664 677) the Hoare annotation is: (or (not (= (mod ~__CS_ret~0 256) 0)) (and (= |old(~__CS_thread~0.offset)| ~__CS_thread~0.offset) (= |#memory_int| |old(#memory_int)|) (= ~__CS_thread~0.base |old(~__CS_thread~0.base)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= ~__CS_thread_index~0 |old(~__CS_thread_index~0)|)) (not (= ~__CS_ret_PREEMPTED~0 1))) [2022-07-19 18:45:26,570 INFO L899 garLoopResultBuilder]: For program point L795(lines 795 800) no Hoare annotation was computed. [2022-07-19 18:45:26,570 INFO L899 garLoopResultBuilder]: For program point L795-1(lines 795 800) no Hoare annotation was computed. [2022-07-19 18:45:26,570 INFO L899 garLoopResultBuilder]: For program point L754(lines 754 818) no Hoare annotation was computed. [2022-07-19 18:45:26,571 INFO L895 garLoopResultBuilder]: At program point L812(line 812) the Hoare annotation is: (or (= ~__CS_ret_PREEMPTED~0 1) (= ~__CS_error~0 0)) [2022-07-19 18:45:26,571 INFO L899 garLoopResultBuilder]: For program point L812-1(line 812) no Hoare annotation was computed. [2022-07-19 18:45:26,571 INFO L895 garLoopResultBuilder]: At program point L804(line 804) the Hoare annotation is: (and (= (mod ~__CS_ret~0 256) 0) (= ~__CS_ret_PREEMPTED~0 1)) [2022-07-19 18:45:26,571 INFO L899 garLoopResultBuilder]: For program point L804-1(line 804) no Hoare annotation was computed. [2022-07-19 18:45:26,571 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-07-19 18:45:26,571 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-07-19 18:45:26,571 INFO L899 garLoopResultBuilder]: For program point L763-2(lines 763 772) no Hoare annotation was computed. [2022-07-19 18:45:26,572 INFO L895 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)) [2022-07-19 18:45:26,572 INFO L899 garLoopResultBuilder]: For program point L763-4(lines 763 772) no Hoare annotation was computed. [2022-07-19 18:45:26,572 INFO L895 garLoopResultBuilder]: At program point L813(line 813) the Hoare annotation is: (or (= ~__CS_ret_PREEMPTED~0 1) (= ~__CS_error~0 0)) [2022-07-19 18:45:26,572 INFO L899 garLoopResultBuilder]: For program point L813-1(line 813) no Hoare annotation was computed. [2022-07-19 18:45:26,572 INFO L899 garLoopResultBuilder]: For program point L805(line 805) no Hoare annotation was computed. [2022-07-19 18:45:26,572 INFO L899 garLoopResultBuilder]: For program point L541(lines 541 543) no Hoare annotation was computed. [2022-07-19 18:45:26,572 INFO L902 garLoopResultBuilder]: At program point L541-2(lines 540 545) the Hoare annotation is: true [2022-07-19 18:45:26,573 INFO L899 garLoopResultBuilder]: For program point L789(lines 789 794) no Hoare annotation was computed. [2022-07-19 18:45:26,573 INFO L899 garLoopResultBuilder]: For program point L789-1(lines 789 794) no Hoare annotation was computed. [2022-07-19 18:45:26,573 INFO L895 garLoopResultBuilder]: At program point L814(line 814) the Hoare annotation is: (or (= ~__CS_ret_PREEMPTED~0 1) (= ~__CS_error~0 0)) [2022-07-19 18:45:26,573 INFO L899 garLoopResultBuilder]: For program point L814-1(line 814) no Hoare annotation was computed. [2022-07-19 18:45:26,573 INFO L895 garLoopResultBuilder]: At program point L798(line 798) the Hoare annotation is: (and (= (mod ~__CS_ret~0 256) 0) (= ~__CS_ret_PREEMPTED~0 1)) [2022-07-19 18:45:26,573 INFO L899 garLoopResultBuilder]: For program point L542(line 542) no Hoare annotation was computed. [2022-07-19 18:45:26,573 INFO L899 garLoopResultBuilder]: For program point L798-1(line 798) no Hoare annotation was computed. [2022-07-19 18:45:26,573 INFO L895 garLoopResultBuilder]: At program point L815(line 815) the Hoare annotation is: (or (= ~__CS_ret_PREEMPTED~0 1) (= ~__CS_error~0 0)) [2022-07-19 18:45:26,574 INFO L899 garLoopResultBuilder]: For program point L815-1(line 815) no Hoare annotation was computed. [2022-07-19 18:45:26,574 INFO L895 garLoopResultBuilder]: At program point L807(line 807) the Hoare annotation is: (or (= ~__CS_ret_PREEMPTED~0 1) (= ~__CS_error~0 0)) [2022-07-19 18:45:26,574 INFO L899 garLoopResultBuilder]: For program point L807-1(line 807) no Hoare annotation was computed. [2022-07-19 18:45:26,574 INFO L899 garLoopResultBuilder]: For program point L799(line 799) no Hoare annotation was computed. [2022-07-19 18:45:26,574 INFO L895 garLoopResultBuilder]: At program point L816(line 816) the Hoare annotation is: (or (= ~__CS_ret_PREEMPTED~0 1) (= ~__CS_error~0 0)) [2022-07-19 18:45:26,574 INFO L899 garLoopResultBuilder]: For program point L816-1(line 816) no Hoare annotation was computed. [2022-07-19 18:45:26,574 INFO L895 garLoopResultBuilder]: At program point L808(line 808) the Hoare annotation is: (or (= ~__CS_ret_PREEMPTED~0 1) (= ~__CS_error~0 0)) [2022-07-19 18:45:26,575 INFO L899 garLoopResultBuilder]: For program point L808-1(line 808) no Hoare annotation was computed. [2022-07-19 18:45:26,575 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-07-19 18:45:26,575 INFO L895 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)) (= (select ~__CS_thread~0.offset 2) 0)) [2022-07-19 18:45:26,575 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 542) no Hoare annotation was computed. [2022-07-19 18:45:26,575 INFO L899 garLoopResultBuilder]: For program point L792-1(line 792) no Hoare annotation was computed. [2022-07-19 18:45:26,575 INFO L895 garLoopResultBuilder]: At program point L809(line 809) the Hoare annotation is: (or (= ~__CS_ret_PREEMPTED~0 1) (= ~__CS_error~0 0)) [2022-07-19 18:45:26,575 INFO L899 garLoopResultBuilder]: For program point L809-1(line 809) no Hoare annotation was computed. [2022-07-19 18:45:26,576 INFO L899 garLoopResultBuilder]: For program point L801(lines 801 806) no Hoare annotation was computed. [2022-07-19 18:45:26,576 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-07-19 18:45:26,576 INFO L899 garLoopResultBuilder]: For program point L801-1(lines 801 806) no Hoare annotation was computed. [2022-07-19 18:45:26,576 INFO L899 garLoopResultBuilder]: For program point L768-2(lines 768 771) no Hoare annotation was computed. [2022-07-19 18:45:26,576 INFO L895 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)) [2022-07-19 18:45:26,576 INFO L899 garLoopResultBuilder]: For program point L793(line 793) no Hoare annotation was computed. [2022-07-19 18:45:26,576 INFO L895 garLoopResultBuilder]: At program point L810(line 810) the Hoare annotation is: (or (= ~__CS_ret_PREEMPTED~0 1) (= ~__CS_error~0 0)) [2022-07-19 18:45:26,577 INFO L899 garLoopResultBuilder]: For program point L810-1(line 810) no Hoare annotation was computed. [2022-07-19 18:45:26,577 INFO L895 garLoopResultBuilder]: At program point L811(line 811) the Hoare annotation is: (or (= ~__CS_ret_PREEMPTED~0 1) (= ~__CS_error~0 0)) [2022-07-19 18:45:26,577 INFO L899 garLoopResultBuilder]: For program point L811-1(line 811) no Hoare annotation was computed. [2022-07-19 18:45:26,577 INFO L899 garLoopResultBuilder]: For program point __CS_csEXIT(lines 562 568) no Hoare annotation was computed. [2022-07-19 18:45:26,577 INFO L895 garLoopResultBuilder]: At program point __CS_csENTRY(lines 562 568) the Hoare annotation is: (or (not (= ~__CS_ret_PREEMPTED~0 1)) (and (= |old(~__CS_round~0)| ~__CS_round~0) (= |old(~__CS_ret~0)| ~__CS_ret~0))) [2022-07-19 18:45:26,577 INFO L899 garLoopResultBuilder]: For program point __CS_csFINAL(lines 562 568) no Hoare annotation was computed. [2022-07-19 18:45:26,577 INFO L899 garLoopResultBuilder]: For program point L567(line 567) no Hoare annotation was computed. [2022-07-19 18:45:26,577 INFO L895 garLoopResultBuilder]: At program point L565(line 565) the Hoare annotation is: (or (not (= ~__CS_ret_PREEMPTED~0 1)) (and (= |old(~__CS_round~0)| ~__CS_round~0) (= |old(~__CS_ret~0)| ~__CS_ret~0))) [2022-07-19 18:45:26,578 INFO L899 garLoopResultBuilder]: For program point L567-2(line 567) no Hoare annotation was computed. [2022-07-19 18:45:26,578 INFO L899 garLoopResultBuilder]: For program point L565-1(line 565) no Hoare annotation was computed. [2022-07-19 18:45:26,581 INFO L356 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1] [2022-07-19 18:45:26,582 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-19 18:45:26,592 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.offset [2022-07-19 18:45:26,593 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.offset [2022-07-19 18:45:26,593 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.base [2022-07-19 18:45:26,593 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.base [2022-07-19 18:45:26,593 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.offset [2022-07-19 18:45:26,593 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.offset [2022-07-19 18:45:26,594 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.base [2022-07-19 18:45:26,594 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.base [2022-07-19 18:45:26,594 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.base [2022-07-19 18:45:26,595 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.offset [2022-07-19 18:45:26,595 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.base [2022-07-19 18:45:26,595 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.offset [2022-07-19 18:45:26,596 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.base [2022-07-19 18:45:26,596 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.offset [2022-07-19 18:45:26,596 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.base [2022-07-19 18:45:26,596 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.offset [2022-07-19 18:45:26,597 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.offset [2022-07-19 18:45:26,597 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.offset [2022-07-19 18:45:26,597 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.base [2022-07-19 18:45:26,597 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.base [2022-07-19 18:45:26,597 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~thread2.offset [2022-07-19 18:45:26,598 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.offset [2022-07-19 18:45:26,598 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.offset [2022-07-19 18:45:26,598 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.base [2022-07-19 18:45:26,598 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.base [2022-07-19 18:45:26,599 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~thread2.offset [2022-07-19 18:45:26,600 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.07 06:45:26 BoogieIcfgContainer [2022-07-19 18:45:26,600 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-19 18:45:26,600 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-19 18:45:26,601 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-19 18:45:26,601 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-19 18:45:26,601 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 06:44:25" (3/4) ... [2022-07-19 18:45:26,603 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-07-19 18:45:26,608 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __CS_pthread_join [2022-07-19 18:45:26,608 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __CS_pthread_mutex_lock [2022-07-19 18:45:26,608 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ##fun~$Pointer$~TO~$Pointer$ [2022-07-19 18:45:26,608 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __CS_pthread_mutex_unlock [2022-07-19 18:45:26,608 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __CS_pthread_create [2022-07-19 18:45:26,609 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2022-07-19 18:45:26,609 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __CS_cs [2022-07-19 18:45:26,609 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __CS_pthread_mutex_init [2022-07-19 18:45:26,619 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 49 nodes and edges [2022-07-19 18:45:26,620 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 21 nodes and edges [2022-07-19 18:45:26,620 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2022-07-19 18:45:26,621 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2022-07-19 18:45:26,641 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) [2022-07-19 18:45:26,642 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)) [2022-07-19 18:45:26,644 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) [2022-07-19 18:45:26,644 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (!(__CS_ret_PREEMPTED == 1) || !(#fp == 0)) || !(\old(__CS_ret) % 256 == 0) [2022-07-19 18:45:26,683 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-19 18:45:26,683 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-19 18:45:26,684 INFO L158 Benchmark]: Toolchain (without parser) took 63929.67ms. Allocated memory was 88.1MB in the beginning and 515.9MB in the end (delta: 427.8MB). Free memory was 56.7MB in the beginning and 97.3MB in the end (delta: -40.6MB). Peak memory consumption was 387.1MB. Max. memory is 16.1GB. [2022-07-19 18:45:26,684 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 88.1MB. Free memory is still 42.9MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-19 18:45:26,684 INFO L158 Benchmark]: CACSL2BoogieTranslator took 546.40ms. Allocated memory was 88.1MB in the beginning and 109.1MB in the end (delta: 21.0MB). Free memory was 56.5MB in the beginning and 70.7MB in the end (delta: -14.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-19 18:45:26,685 INFO L158 Benchmark]: Boogie Procedure Inliner took 72.63ms. Allocated memory is still 109.1MB. Free memory was 70.7MB in the beginning and 66.5MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-19 18:45:26,685 INFO L158 Benchmark]: Boogie Preprocessor took 49.69ms. Allocated memory is still 109.1MB. Free memory was 66.5MB in the beginning and 62.9MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-19 18:45:26,685 INFO L158 Benchmark]: RCFGBuilder took 2083.63ms. Allocated memory is still 109.1MB. Free memory was 62.9MB in the beginning and 44.5MB in the end (delta: 18.4MB). Peak memory consumption was 26.0MB. Max. memory is 16.1GB. [2022-07-19 18:45:26,686 INFO L158 Benchmark]: TraceAbstraction took 61085.02ms. Allocated memory was 109.1MB in the beginning and 515.9MB in the end (delta: 406.8MB). Free memory was 43.7MB in the beginning and 106.8MB in the end (delta: -63.1MB). Peak memory consumption was 367.7MB. Max. memory is 16.1GB. [2022-07-19 18:45:26,686 INFO L158 Benchmark]: Witness Printer took 82.96ms. Allocated memory is still 515.9MB. Free memory was 106.8MB in the beginning and 97.3MB in the end (delta: 9.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-19 18:45:26,687 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.18ms. Allocated memory is still 88.1MB. Free memory is still 42.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 546.40ms. Allocated memory was 88.1MB in the beginning and 109.1MB in the end (delta: 21.0MB). Free memory was 56.5MB in the beginning and 70.7MB in the end (delta: -14.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 72.63ms. Allocated memory is still 109.1MB. Free memory was 70.7MB in the beginning and 66.5MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 49.69ms. Allocated memory is still 109.1MB. Free memory was 66.5MB in the beginning and 62.9MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 2083.63ms. Allocated memory is still 109.1MB. Free memory was 62.9MB in the beginning and 44.5MB in the end (delta: 18.4MB). Peak memory consumption was 26.0MB. Max. memory is 16.1GB. * TraceAbstraction took 61085.02ms. Allocated memory was 109.1MB in the beginning and 515.9MB in the end (delta: 406.8MB). Free memory was 43.7MB in the beginning and 106.8MB in the end (delta: -63.1MB). Peak memory consumption was 367.7MB. Max. memory is 16.1GB. * Witness Printer took 82.96ms. Allocated memory is still 515.9MB. Free memory was 106.8MB in the beginning and 97.3MB in the end (delta: 9.4MB). Peak memory consumption was 10.5MB. 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: 61.0s, OverallIterations: 9, TraceHistogramMax: 15, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 22.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 4.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 6 mSolverCounterUnknown, 2101 SdHoareTripleChecker+Valid, 20.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2071 mSDsluCounter, 6100 SdHoareTripleChecker+Invalid, 20.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3673 mSDsCounter, 2123 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4142 IncrementalHoareTripleChecker+Invalid, 6271 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2123 mSolverCounterUnsat, 2427 mSDtfsCounter, 4142 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1827 GetRequests, 1731 SyntacticMatches, 3 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 475 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=680occurred in iteration=8, InterpolantAutomatonStates: 67, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 9 MinimizatonAttempts, 48 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 69 LocationsWithAnnotation, 3070 PreInvPairs, 4306 NumberOfFragments, 1915 HoareAnnotationTreeSize, 3070 FomulaSimplifications, 5730 FormulaSimplificationTreeSizeReduction, 0.6s HoareSimplificationTime, 69 FomulaSimplificationsInter, 21704 FormulaSimplificationTreeSizeReductionInter, 3.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.7s SsaConstructionTime, 25.4s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 1919 NumberOfCodeBlocks, 1715 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 2505 ConstructedInterpolants, 0 QuantifiedInterpolants, 5201 SizeOfPredicates, 16 NumberOfNonLiveVariables, 11899 ConjunctsInSsa, 38 ConjunctsInUnsatCore, 19 InterpolantComputations, 5 PerfectInterpolantSequences, 6711/6885 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 721]: Loop Invariant Derived loop invariant: (!(__CS_ret_PREEMPTED == 1) || !(#fp == 0)) || !(\old(__CS_ret) % 256 == 0) - InvariantResult [Line: 689]: Loop Invariant [2022-07-19 18:45:26,696 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.offset [2022-07-19 18:45:26,696 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.offset [2022-07-19 18:45:26,696 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.base [2022-07-19 18:45:26,696 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.base [2022-07-19 18:45:26,697 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.offset [2022-07-19 18:45:26,697 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.offset [2022-07-19 18:45:26,697 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.base [2022-07-19 18:45:26,697 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 [2022-07-19 18:45:26,698 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.base [2022-07-19 18:45:26,698 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.offset [2022-07-19 18:45:26,698 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.base [2022-07-19 18:45:26,698 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 [2022-07-19 18:45:26,699 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.base [2022-07-19 18:45:26,699 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.offset [2022-07-19 18:45:26,699 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.base [2022-07-19 18:45:26,699 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 [2022-07-19 18:45:26,700 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.offset [2022-07-19 18:45:26,700 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.offset [2022-07-19 18:45:26,700 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.base [2022-07-19 18:45:26,700 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.base [2022-07-19 18:45:26,700 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~thread2.offset [2022-07-19 18:45:26,701 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.offset [2022-07-19 18:45:26,701 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.offset [2022-07-19 18:45:26,701 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.base [2022-07-19 18:45:26,701 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.base [2022-07-19 18:45:26,701 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! [2022-07-19 18:45:26,719 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