./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 791161d1 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-?-791161d [2022-07-22 18:59:05,371 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-22 18:59:05,373 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-22 18:59:05,413 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-22 18:59:05,413 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-22 18:59:05,415 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-22 18:59:05,417 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-22 18:59:05,419 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-22 18:59:05,420 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-22 18:59:05,424 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-22 18:59:05,425 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-22 18:59:05,427 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-22 18:59:05,427 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-22 18:59:05,429 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-22 18:59:05,430 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-22 18:59:05,433 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-22 18:59:05,433 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-22 18:59:05,435 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-22 18:59:05,436 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-22 18:59:05,441 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-22 18:59:05,443 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-22 18:59:05,444 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-22 18:59:05,445 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-22 18:59:05,445 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-22 18:59:05,447 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-22 18:59:05,453 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-22 18:59:05,453 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-22 18:59:05,453 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-22 18:59:05,454 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-22 18:59:05,455 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-22 18:59:05,456 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-22 18:59:05,456 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-22 18:59:05,457 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-22 18:59:05,458 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-22 18:59:05,458 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-22 18:59:05,459 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-22 18:59:05,460 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-22 18:59:05,461 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-22 18:59:05,461 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-22 18:59:05,461 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-22 18:59:05,462 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-22 18:59:05,463 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-22 18:59:05,465 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-22 18:59:05,493 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-22 18:59:05,493 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-22 18:59:05,494 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-22 18:59:05,494 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-22 18:59:05,494 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-22 18:59:05,495 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-22 18:59:05,495 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-22 18:59:05,495 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-22 18:59:05,496 INFO L138 SettingsManager]: * Use SBE=true [2022-07-22 18:59:05,496 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-22 18:59:05,497 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-22 18:59:05,497 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-22 18:59:05,497 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-22 18:59:05,497 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-22 18:59:05,497 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-22 18:59:05,498 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-22 18:59:05,498 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-22 18:59:05,498 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-22 18:59:05,498 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-22 18:59:05,498 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-22 18:59:05,500 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-22 18:59:05,500 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-22 18:59:05,500 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-22 18:59:05,501 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-22 18:59:05,501 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 18:59:05,501 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-22 18:59:05,501 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-22 18:59:05,501 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-22 18:59:05,502 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-22 18:59:05,502 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-22 18:59:05,502 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-22 18:59:05,502 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-22 18:59:05,503 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-22 18:59:05,503 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-22 18:59:05,702 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-22 18:59:05,727 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-22 18:59:05,729 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-22 18:59:05,730 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-22 18:59:05,730 INFO L275 PluginConnector]: CDTParser initialized [2022-07-22 18:59:05,731 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-22 18:59:05,806 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a22cdfe06/5ef6f5abd93e48feb7a36dba6ef0c366/FLAG2df167165 [2022-07-22 18:59:06,308 INFO L306 CDTParser]: Found 1 translation units. [2022-07-22 18:59:06,309 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-pthread/cs_stateful-2.i [2022-07-22 18:59:06,319 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a22cdfe06/5ef6f5abd93e48feb7a36dba6ef0c366/FLAG2df167165 [2022-07-22 18:59:06,813 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a22cdfe06/5ef6f5abd93e48feb7a36dba6ef0c366 [2022-07-22 18:59:06,815 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-22 18:59:06,816 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-22 18:59:06,825 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-22 18:59:06,825 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-22 18:59:06,827 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-22 18:59:06,828 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 06:59:06" (1/1) ... [2022-07-22 18:59:06,828 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49f19e4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 06:59:06, skipping insertion in model container [2022-07-22 18:59:06,829 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 06:59:06" (1/1) ... [2022-07-22 18:59:06,833 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-22 18:59:06,890 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 18:59:07,144 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-22 18:59:07,244 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 18:59:07,261 INFO L203 MainTranslator]: Completed pre-run [2022-07-22 18:59:07,281 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-22 18:59:07,338 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 18:59:07,360 INFO L208 MainTranslator]: Completed translation [2022-07-22 18:59:07,360 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 06:59:07 WrapperNode [2022-07-22 18:59:07,360 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-22 18:59:07,361 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-22 18:59:07,361 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-22 18:59:07,361 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-22 18:59:07,367 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 06:59:07" (1/1) ... [2022-07-22 18:59:07,392 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 06:59:07" (1/1) ... [2022-07-22 18:59:07,430 INFO L137 Inliner]: procedures = 145, calls = 245, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 539 [2022-07-22 18:59:07,431 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-22 18:59:07,432 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-22 18:59:07,432 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-22 18:59:07,432 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-22 18:59:07,439 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 06:59:07" (1/1) ... [2022-07-22 18:59:07,439 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 06:59:07" (1/1) ... [2022-07-22 18:59:07,446 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 06:59:07" (1/1) ... [2022-07-22 18:59:07,446 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 06:59:07" (1/1) ... [2022-07-22 18:59:07,475 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 06:59:07" (1/1) ... [2022-07-22 18:59:07,491 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 06:59:07" (1/1) ... [2022-07-22 18:59:07,494 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 06:59:07" (1/1) ... [2022-07-22 18:59:07,498 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-22 18:59:07,499 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-22 18:59:07,499 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-22 18:59:07,499 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-22 18:59:07,503 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 06:59:07" (1/1) ... [2022-07-22 18:59:07,509 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 18:59:07,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 18:59:07,531 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-22 18:59:07,533 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-22 18:59:07,570 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-22 18:59:07,570 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-22 18:59:07,570 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-07-22 18:59:07,570 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-07-22 18:59:07,570 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-22 18:59:07,570 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-22 18:59:07,570 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-22 18:59:07,571 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_mutex_init [2022-07-22 18:59:07,571 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_mutex_init [2022-07-22 18:59:07,571 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_mutex_lock [2022-07-22 18:59:07,571 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_mutex_lock [2022-07-22 18:59:07,571 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_create [2022-07-22 18:59:07,571 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_create [2022-07-22 18:59:07,572 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-22 18:59:07,572 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_join [2022-07-22 18:59:07,572 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_join [2022-07-22 18:59:07,572 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~$Pointer$ [2022-07-22 18:59:07,572 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~$Pointer$ [2022-07-22 18:59:07,572 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-22 18:59:07,572 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-22 18:59:07,573 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_cs [2022-07-22 18:59:07,573 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_cs [2022-07-22 18:59:07,573 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-22 18:59:07,573 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_mutex_unlock [2022-07-22 18:59:07,573 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_mutex_unlock [2022-07-22 18:59:07,573 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-22 18:59:07,573 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-22 18:59:07,693 INFO L234 CfgBuilder]: Building ICFG [2022-07-22 18:59:07,695 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-22 18:59:08,055 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L750: SUMMARY for call __CS_cs(); srcloc: null [2022-07-22 18:59:08,056 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-22 18:59:08,056 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L750-1: assume !(0 != ~__CS_ret~0 % 256); [2022-07-22 18:59:08,056 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##31: assume !(0 != ~__CS_ret~0 % 256); [2022-07-22 18:59:08,056 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-22 18:59:08,056 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##29: assume !(0 != ~__CS_ret~0 % 256); [2022-07-22 18:59:08,056 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-22 18:59:09,433 INFO L275 CfgBuilder]: Performing block encoding [2022-07-22 18:59:09,442 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-22 18:59:09,442 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-22 18:59:09,445 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 06:59:09 BoogieIcfgContainer [2022-07-22 18:59:09,445 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-22 18:59:09,447 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-22 18:59:09,447 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-22 18:59:09,453 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-22 18:59:09,453 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.07 06:59:06" (1/3) ... [2022-07-22 18:59:09,454 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@338a3c5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 06:59:09, skipping insertion in model container [2022-07-22 18:59:09,454 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 06:59:07" (2/3) ... [2022-07-22 18:59:09,454 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@338a3c5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 06:59:09, skipping insertion in model container [2022-07-22 18:59:09,455 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 06:59:09" (3/3) ... [2022-07-22 18:59:09,456 INFO L111 eAbstractionObserver]: Analyzing ICFG cs_stateful-2.i [2022-07-22 18:59:09,468 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-22 18:59:09,468 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-22 18:59:09,525 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-22 18:59:09,539 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@48b9f181, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@7d9f5a5a [2022-07-22 18:59:09,539 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-22 18:59:09,544 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-22 18:59:09,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-07-22 18:59:09,564 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 18:59:09,564 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-22 18:59:09,565 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 18:59:09,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 18:59:09,568 INFO L85 PathProgramCache]: Analyzing trace with hash 246520095, now seen corresponding path program 1 times [2022-07-22 18:59:09,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 18:59:09,574 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668691122] [2022-07-22 18:59:09,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 18:59:09,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 18:59:09,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:09,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-22 18:59:09,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:09,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-22 18:59:09,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:09,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-22 18:59:10,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:10,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-22 18:59:10,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:10,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-22 18:59:10,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:10,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-22 18:59:10,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:10,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-22 18:59:10,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:10,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-22 18:59:10,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:10,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-22 18:59:10,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:10,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-22 18:59:10,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:10,079 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-22 18:59:10,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 18:59:10,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668691122] [2022-07-22 18:59:10,083 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668691122] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 18:59:10,083 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 18:59:10,083 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-22 18:59:10,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175927096] [2022-07-22 18:59:10,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 18:59:10,090 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-22 18:59:10,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 18:59:10,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-22 18:59:10,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-22 18:59:10,123 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-22 18:59:10,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 18:59:10,169 INFO L93 Difference]: Finished difference Result 348 states and 578 transitions. [2022-07-22 18:59:10,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-22 18:59:10,171 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-22 18:59:10,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 18:59:10,180 INFO L225 Difference]: With dead ends: 348 [2022-07-22 18:59:10,180 INFO L226 Difference]: Without dead ends: 171 [2022-07-22 18:59:10,187 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-22 18:59:10,190 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-22 18:59:10,191 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-22 18:59:10,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2022-07-22 18:59:10,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2022-07-22 18:59:10,235 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-22 18:59:10,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 261 transitions. [2022-07-22 18:59:10,239 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 261 transitions. Word has length 72 [2022-07-22 18:59:10,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 18:59:10,240 INFO L495 AbstractCegarLoop]: Abstraction has 171 states and 261 transitions. [2022-07-22 18:59:10,240 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-22 18:59:10,240 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 261 transitions. [2022-07-22 18:59:10,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-07-22 18:59:10,245 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 18:59:10,245 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-22 18:59:10,245 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-22 18:59:10,245 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 18:59:10,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 18:59:10,246 INFO L85 PathProgramCache]: Analyzing trace with hash 1330951645, now seen corresponding path program 1 times [2022-07-22 18:59:10,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 18:59:10,247 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802078631] [2022-07-22 18:59:10,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 18:59:10,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 18:59:10,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:10,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-22 18:59:10,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:10,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-22 18:59:10,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:10,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-22 18:59:10,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:10,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-22 18:59:10,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:10,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-22 18:59:10,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:10,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-22 18:59:10,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:10,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-22 18:59:10,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:10,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-22 18:59:10,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:10,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-22 18:59:10,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:10,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-22 18:59:10,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:10,555 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-22 18:59:10,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 18:59:10,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802078631] [2022-07-22 18:59:10,556 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1802078631] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 18:59:10,556 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 18:59:10,556 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 18:59:10,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905490926] [2022-07-22 18:59:10,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 18:59:10,558 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 18:59:10,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 18:59:10,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 18:59:10,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 18:59:10,560 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-22 18:59:10,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 18:59:10,646 INFO L93 Difference]: Finished difference Result 340 states and 520 transitions. [2022-07-22 18:59:10,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 18:59:10,647 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-22 18:59:10,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 18:59:10,650 INFO L225 Difference]: With dead ends: 340 [2022-07-22 18:59:10,651 INFO L226 Difference]: Without dead ends: 175 [2022-07-22 18:59:10,655 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-22 18:59:10,656 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-22 18:59:10,658 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-22 18:59:10,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2022-07-22 18:59:10,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 172. [2022-07-22 18:59:10,682 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-22 18:59:10,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 262 transitions. [2022-07-22 18:59:10,685 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 262 transitions. Word has length 72 [2022-07-22 18:59:10,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 18:59:10,686 INFO L495 AbstractCegarLoop]: Abstraction has 172 states and 262 transitions. [2022-07-22 18:59:10,686 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-22 18:59:10,686 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 262 transitions. [2022-07-22 18:59:10,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-07-22 18:59:10,691 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 18:59:10,692 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-22 18:59:10,692 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-22 18:59:10,692 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 18:59:10,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 18:59:10,693 INFO L85 PathProgramCache]: Analyzing trace with hash 1826847327, now seen corresponding path program 1 times [2022-07-22 18:59:10,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 18:59:10,694 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142065394] [2022-07-22 18:59:10,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 18:59:10,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 18:59:10,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:10,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-22 18:59:10,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:10,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-22 18:59:10,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:10,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-22 18:59:10,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:10,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-22 18:59:10,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:10,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-22 18:59:10,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:10,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-22 18:59:10,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:10,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-22 18:59:10,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:10,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-22 18:59:10,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:10,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-22 18:59:10,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:10,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-22 18:59:10,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:10,901 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-22 18:59:10,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 18:59:10,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142065394] [2022-07-22 18:59:10,901 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142065394] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 18:59:10,902 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 18:59:10,902 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 18:59:10,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963158837] [2022-07-22 18:59:10,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 18:59:10,903 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 18:59:10,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 18:59:10,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 18:59:10,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 18:59:10,904 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-22 18:59:10,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 18:59:10,938 INFO L93 Difference]: Finished difference Result 343 states and 524 transitions. [2022-07-22 18:59:10,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 18:59:10,939 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-22 18:59:10,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 18:59:10,942 INFO L225 Difference]: With dead ends: 343 [2022-07-22 18:59:10,942 INFO L226 Difference]: Without dead ends: 174 [2022-07-22 18:59:10,943 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-22 18:59:10,944 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-22 18:59:10,944 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-22 18:59:10,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2022-07-22 18:59:10,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 173. [2022-07-22 18:59:10,958 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-22 18:59:10,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 263 transitions. [2022-07-22 18:59:10,960 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 263 transitions. Word has length 75 [2022-07-22 18:59:10,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 18:59:10,960 INFO L495 AbstractCegarLoop]: Abstraction has 173 states and 263 transitions. [2022-07-22 18:59:10,960 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-22 18:59:10,960 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 263 transitions. [2022-07-22 18:59:10,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-07-22 18:59:10,962 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 18:59:10,962 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-22 18:59:10,962 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-22 18:59:10,962 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 18:59:10,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 18:59:10,963 INFO L85 PathProgramCache]: Analyzing trace with hash -541531615, now seen corresponding path program 1 times [2022-07-22 18:59:10,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 18:59:10,963 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279983046] [2022-07-22 18:59:10,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 18:59:10,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 18:59:11,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:11,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-22 18:59:11,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:11,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-22 18:59:11,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:11,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-22 18:59:11,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:11,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-22 18:59:11,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:11,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-22 18:59:11,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:11,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-22 18:59:11,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:11,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-22 18:59:11,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:11,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-22 18:59:11,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:11,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-22 18:59:11,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:11,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-22 18:59:11,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:11,158 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-22 18:59:11,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 18:59:11,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279983046] [2022-07-22 18:59:11,159 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279983046] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 18:59:11,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [917761359] [2022-07-22 18:59:11,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 18:59:11,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 18:59:11,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 18:59:11,167 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-22 18:59:11,194 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-22 18:59:11,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:11,820 INFO L263 TraceCheckSpWp]: Trace formula consists of 1765 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-22 18:59:11,830 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 18:59:11,891 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-22 18:59:11,892 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 18:59:11,939 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-22 18:59:11,939 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [917761359] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 18:59:11,939 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 18:59:11,940 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2022-07-22 18:59:11,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839521066] [2022-07-22 18:59:11,940 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 18:59:11,941 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-22 18:59:11,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 18:59:11,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-22 18:59:11,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-07-22 18:59:11,942 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-22 18:59:11,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 18:59:11,975 INFO L93 Difference]: Finished difference Result 347 states and 529 transitions. [2022-07-22 18:59:11,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-22 18:59:11,976 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-22 18:59:11,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 18:59:11,978 INFO L225 Difference]: With dead ends: 347 [2022-07-22 18:59:11,978 INFO L226 Difference]: Without dead ends: 177 [2022-07-22 18:59:11,979 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 171 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-07-22 18:59:11,980 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-22 18:59:11,980 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-22 18:59:11,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2022-07-22 18:59:11,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2022-07-22 18:59:11,997 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-22 18:59:11,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 267 transitions. [2022-07-22 18:59:11,999 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 267 transitions. Word has length 77 [2022-07-22 18:59:11,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 18:59:11,999 INFO L495 AbstractCegarLoop]: Abstraction has 177 states and 267 transitions. [2022-07-22 18:59:11,999 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-22 18:59:12,000 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 267 transitions. [2022-07-22 18:59:12,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-07-22 18:59:12,001 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 18:59:12,001 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-22 18:59:12,031 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-22 18:59:12,219 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-22 18:59:12,220 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 18:59:12,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 18:59:12,220 INFO L85 PathProgramCache]: Analyzing trace with hash -1454696411, now seen corresponding path program 2 times [2022-07-22 18:59:12,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 18:59:12,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111631654] [2022-07-22 18:59:12,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 18:59:12,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 18:59:12,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:12,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-22 18:59:12,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:12,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-22 18:59:12,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:12,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-22 18:59:12,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:12,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-22 18:59:12,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:12,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-22 18:59:12,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:12,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-22 18:59:12,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:12,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-22 18:59:12,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:12,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-22 18:59:12,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:12,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-22 18:59:12,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:12,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-22 18:59:12,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:12,483 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-22 18:59:12,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 18:59:12,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111631654] [2022-07-22 18:59:12,484 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2111631654] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 18:59:12,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1265162586] [2022-07-22 18:59:12,484 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-22 18:59:12,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 18:59:12,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 18:59:12,486 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-22 18:59:12,488 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-22 18:59:13,294 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-22 18:59:13,294 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 18:59:13,301 INFO L263 TraceCheckSpWp]: Trace formula consists of 1519 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-22 18:59:13,305 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 18:59:13,412 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-22 18:59:13,412 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 18:59:13,412 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1265162586] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 18:59:13,412 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-22 18:59:13,413 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2022-07-22 18:59:13,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349336312] [2022-07-22 18:59:13,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 18:59:13,413 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 18:59:13,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 18:59:13,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 18:59:13,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-22 18:59:13,414 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-22 18:59:13,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 18:59:13,445 INFO L93 Difference]: Finished difference Result 339 states and 524 transitions. [2022-07-22 18:59:13,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 18:59:13,445 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-22 18:59:13,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 18:59:13,449 INFO L225 Difference]: With dead ends: 339 [2022-07-22 18:59:13,449 INFO L226 Difference]: Without dead ends: 313 [2022-07-22 18:59:13,450 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-22 18:59:13,451 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-22 18:59:13,451 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-22 18:59:13,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2022-07-22 18:59:13,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 312. [2022-07-22 18:59:13,477 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-22 18:59:13,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 485 transitions. [2022-07-22 18:59:13,499 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 485 transitions. Word has length 81 [2022-07-22 18:59:13,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 18:59:13,499 INFO L495 AbstractCegarLoop]: Abstraction has 312 states and 485 transitions. [2022-07-22 18:59:13,500 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-22 18:59:13,500 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 485 transitions. [2022-07-22 18:59:13,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2022-07-22 18:59:13,507 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 18:59:13,507 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-22 18:59:13,531 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-22 18:59:13,719 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-22 18:59:13,720 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 18:59:13,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 18:59:13,720 INFO L85 PathProgramCache]: Analyzing trace with hash -613977023, now seen corresponding path program 1 times [2022-07-22 18:59:13,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 18:59:13,721 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500097654] [2022-07-22 18:59:13,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 18:59:13,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 18:59:13,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:13,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-22 18:59:13,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:13,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 18:59:13,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:13,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 18:59:13,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:13,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-22 18:59:13,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:13,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-22 18:59:13,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:13,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 18:59:13,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:13,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-22 18:59:13,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:13,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 18:59:14,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:14,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-22 18:59:14,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:14,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-22 18:59:14,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:14,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 18:59:14,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:14,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-22 18:59:14,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:14,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-22 18:59:14,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:14,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-22 18:59:14,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:14,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-22 18:59:14,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:14,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-22 18:59:14,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:14,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-22 18:59:14,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:14,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-22 18:59:14,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:14,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-22 18:59:14,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:14,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-22 18:59:14,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:14,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-22 18:59:14,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:14,052 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-22 18:59:14,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 18:59:14,052 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500097654] [2022-07-22 18:59:14,053 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500097654] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 18:59:14,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1388250234] [2022-07-22 18:59:14,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 18:59:14,053 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 18:59:14,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 18:59:14,054 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-22 18:59:14,056 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-22 18:59:14,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:14,870 INFO L263 TraceCheckSpWp]: Trace formula consists of 2132 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-22 18:59:14,875 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 18:59:14,903 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-22 18:59:14,904 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 18:59:15,015 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-22 18:59:15,015 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1388250234] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 18:59:15,016 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 18:59:15,016 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 4, 4] total 9 [2022-07-22 18:59:15,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338753032] [2022-07-22 18:59:15,016 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 18:59:15,017 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-22 18:59:15,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 18:59:15,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-22 18:59:15,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-07-22 18:59:15,018 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-22 18:59:17,074 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 18:59:19,089 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-22 18:59:19,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 18:59:19,546 INFO L93 Difference]: Finished difference Result 631 states and 988 transitions. [2022-07-22 18:59:19,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-22 18:59:19,547 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-22 18:59:19,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 18:59:19,549 INFO L225 Difference]: With dead ends: 631 [2022-07-22 18:59:19,550 INFO L226 Difference]: Without dead ends: 331 [2022-07-22 18:59:19,551 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-22 18:59:19,552 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-22 18:59:19,552 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-22 18:59:19,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2022-07-22 18:59:19,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 325. [2022-07-22 18:59:19,583 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-22 18:59:19,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 503 transitions. [2022-07-22 18:59:19,586 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 503 transitions. Word has length 155 [2022-07-22 18:59:19,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 18:59:19,586 INFO L495 AbstractCegarLoop]: Abstraction has 325 states and 503 transitions. [2022-07-22 18:59:19,586 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-22 18:59:19,587 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 503 transitions. [2022-07-22 18:59:19,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2022-07-22 18:59:19,590 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 18:59:19,590 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-22 18:59:19,621 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-22 18:59:19,815 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-22 18:59:19,815 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 18:59:19,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 18:59:19,816 INFO L85 PathProgramCache]: Analyzing trace with hash -1817944839, now seen corresponding path program 2 times [2022-07-22 18:59:19,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 18:59:19,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012435893] [2022-07-22 18:59:19,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 18:59:19,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 18:59:30,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:30,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-22 18:59:30,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:30,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 18:59:30,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:30,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 18:59:30,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:30,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-22 18:59:30,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:30,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-22 18:59:30,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:30,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 18:59:30,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:30,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-22 18:59:30,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:30,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 18:59:30,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:30,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-22 18:59:30,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:30,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-22 18:59:30,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:30,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 18:59:30,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:30,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-22 18:59:30,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:30,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-22 18:59:30,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:30,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-07-22 18:59:30,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:30,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-07-22 18:59:30,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:30,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-07-22 18:59:30,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:30,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-07-22 18:59:30,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:30,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-07-22 18:59:30,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:30,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-07-22 18:59:30,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:30,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-07-22 18:59:30,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:30,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-07-22 18:59:30,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:30,627 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-22 18:59:30,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 18:59:30,628 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012435893] [2022-07-22 18:59:30,628 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1012435893] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 18:59:30,628 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1325542233] [2022-07-22 18:59:30,628 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-22 18:59:30,628 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 18:59:30,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 18:59:30,629 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-22 18:59:30,631 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-22 18:59:31,563 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-22 18:59:31,563 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 18:59:31,573 INFO L263 TraceCheckSpWp]: Trace formula consists of 1583 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-22 18:59:31,580 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 18:59:31,620 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-22 18:59:31,621 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 18:59:31,621 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1325542233] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 18:59:31,621 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-22 18:59:31,621 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [12] total 13 [2022-07-22 18:59:31,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025060388] [2022-07-22 18:59:31,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 18:59:31,622 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 18:59:31,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 18:59:31,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 18:59:31,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2022-07-22 18:59:31,623 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-22 18:59:31,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 18:59:31,646 INFO L93 Difference]: Finished difference Result 619 states and 965 transitions. [2022-07-22 18:59:31,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 18:59:31,647 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-22 18:59:31,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 18:59:31,649 INFO L225 Difference]: With dead ends: 619 [2022-07-22 18:59:31,649 INFO L226 Difference]: Without dead ends: 325 [2022-07-22 18:59:31,651 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-22 18:59:31,652 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-22 18:59:31,652 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-22 18:59:31,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2022-07-22 18:59:31,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 325. [2022-07-22 18:59:31,671 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-22 18:59:31,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 502 transitions. [2022-07-22 18:59:31,674 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 502 transitions. Word has length 164 [2022-07-22 18:59:31,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 18:59:31,675 INFO L495 AbstractCegarLoop]: Abstraction has 325 states and 502 transitions. [2022-07-22 18:59:31,675 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-22 18:59:31,675 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 502 transitions. [2022-07-22 18:59:31,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2022-07-22 18:59:31,679 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 18:59:31,679 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-22 18:59:31,710 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-22 18:59:31,902 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-22 18:59:31,902 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 18:59:31,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 18:59:31,902 INFO L85 PathProgramCache]: Analyzing trace with hash 755632713, now seen corresponding path program 1 times [2022-07-22 18:59:31,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 18:59:31,903 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600520858] [2022-07-22 18:59:31,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 18:59:31,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 18:59:32,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:32,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-22 18:59:32,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:32,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 18:59:32,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:32,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 18:59:32,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:32,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-22 18:59:32,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:32,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 18:59:32,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:32,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 18:59:32,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:32,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-22 18:59:32,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:32,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-22 18:59:32,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:32,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 18:59:32,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:32,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-22 18:59:32,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:32,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 18:59:32,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:32,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-22 18:59:32,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:32,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-22 18:59:32,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:32,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 18:59:32,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:32,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-22 18:59:32,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:32,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-22 18:59:32,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:32,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-07-22 18:59:32,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:32,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-07-22 18:59:32,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:32,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-07-22 18:59:32,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:32,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2022-07-22 18:59:32,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:32,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2022-07-22 18:59:32,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:32,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2022-07-22 18:59:32,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:32,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2022-07-22 18:59:32,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:32,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2022-07-22 18:59:32,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:32,361 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-22 18:59:32,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 18:59:32,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600520858] [2022-07-22 18:59:32,361 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [600520858] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 18:59:32,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1186447771] [2022-07-22 18:59:32,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 18:59:32,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 18:59:32,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 18:59:32,363 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-22 18:59:32,364 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-22 18:59:33,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:33,420 INFO L263 TraceCheckSpWp]: Trace formula consists of 2467 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-22 18:59:33,426 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 18:59:33,455 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-22 18:59:33,506 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-22 18:59:33,587 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-22 18:59:33,592 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-22 18:59:33,592 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 18:59:33,667 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-22 18:59:33,811 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-22 18:59:33,812 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1186447771] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 18:59:33,812 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 18:59:33,812 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 5] total 14 [2022-07-22 18:59:33,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020822364] [2022-07-22 18:59:33,812 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 18:59:33,813 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-22 18:59:33,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 18:59:33,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-22 18:59:33,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2022-07-22 18:59:33,813 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-22 18:59:35,850 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 18:59:37,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 18:59:37,751 INFO L93 Difference]: Finished difference Result 747 states and 1193 transitions. [2022-07-22 18:59:37,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-22 18:59:37,754 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-22 18:59:37,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 18:59:37,758 INFO L225 Difference]: With dead ends: 747 [2022-07-22 18:59:37,759 INFO L226 Difference]: Without dead ends: 717 [2022-07-22 18:59:37,760 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 448 GetRequests, 420 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=247, Invalid=623, Unknown=0, NotChecked=0, Total=870 [2022-07-22 18:59:37,760 INFO L413 NwaCegarLoop]: 255 mSDtfsCounter, 1061 mSDsluCounter, 881 mSDsCounter, 0 mSdLazyCounter, 1566 mSolverCounterSat, 1040 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1073 SdHoareTripleChecker+Valid, 1136 SdHoareTripleChecker+Invalid, 2607 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1040 IncrementalHoareTripleChecker+Valid, 1566 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2022-07-22 18:59:37,761 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1073 Valid, 1136 Invalid, 2607 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1040 Valid, 1566 Invalid, 1 Unknown, 0 Unchecked, 3.6s Time] [2022-07-22 18:59:37,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2022-07-22 18:59:37,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 680. [2022-07-22 18:59:37,794 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-22 18:59:37,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 680 states to 680 states and 1086 transitions. [2022-07-22 18:59:37,799 INFO L78 Accepts]: Start accepts. Automaton has 680 states and 1086 transitions. Word has length 186 [2022-07-22 18:59:37,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 18:59:37,799 INFO L495 AbstractCegarLoop]: Abstraction has 680 states and 1086 transitions. [2022-07-22 18:59:37,800 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-22 18:59:37,800 INFO L276 IsEmpty]: Start isEmpty. Operand 680 states and 1086 transitions. [2022-07-22 18:59:37,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2022-07-22 18:59:37,804 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 18:59:37,804 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 6, 6, 5, 5, 5, 5, 5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 18:59:37,833 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-07-22 18:59:38,027 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-22 18:59:38,028 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 18:59:38,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 18:59:38,028 INFO L85 PathProgramCache]: Analyzing trace with hash 998047407, now seen corresponding path program 1 times [2022-07-22 18:59:38,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 18:59:38,028 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744553828] [2022-07-22 18:59:38,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 18:59:38,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 18:59:38,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:38,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-22 18:59:38,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:38,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 18:59:38,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:38,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 18:59:38,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:38,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-22 18:59:38,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:38,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 18:59:38,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:38,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 18:59:38,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:38,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-22 18:59:38,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:38,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-22 18:59:38,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:38,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 18:59:38,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:38,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-22 18:59:38,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:38,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 18:59:38,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:38,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-22 18:59:38,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:38,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-22 18:59:38,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:38,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 18:59:38,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:38,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-07-22 18:59:38,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:38,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-07-22 18:59:38,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:38,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-22 18:59:38,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:38,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-07-22 18:59:38,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:38,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2022-07-22 18:59:38,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:38,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-07-22 18:59:38,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:38,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2022-07-22 18:59:38,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:38,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-07-22 18:59:38,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:38,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-07-22 18:59:38,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:38,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2022-07-22 18:59:38,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:38,504 INFO L134 CoverageAnalysis]: Checked inductivity of 543 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 540 trivial. 0 not checked. [2022-07-22 18:59:38,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 18:59:38,504 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744553828] [2022-07-22 18:59:38,505 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1744553828] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 18:59:38,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1217990303] [2022-07-22 18:59:38,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 18:59:38,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 18:59:38,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 18:59:38,506 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-22 18:59:38,508 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-22 18:59:39,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:39,637 INFO L263 TraceCheckSpWp]: Trace formula consists of 2436 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-22 18:59:39,641 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 18:59:39,655 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-22 18:59:39,664 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 5 treesize of output 3 [2022-07-22 18:59:39,678 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-22 18:59:39,685 INFO L134 CoverageAnalysis]: Checked inductivity of 543 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 453 trivial. 0 not checked. [2022-07-22 18:59:39,685 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 18:59:39,685 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1217990303] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 18:59:39,685 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-22 18:59:39,686 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 9 [2022-07-22 18:59:39,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47373295] [2022-07-22 18:59:39,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 18:59:39,686 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 18:59:39,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 18:59:39,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 18:59:39,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-07-22 18:59:39,687 INFO L87 Difference]: Start difference. First operand 680 states and 1086 transitions. Second operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 4 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (21), 3 states have call predecessors, (21), 4 states have call successors, (21) [2022-07-22 18:59:39,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 18:59:39,807 INFO L93 Difference]: Finished difference Result 1342 states and 2141 transitions. [2022-07-22 18:59:39,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-22 18:59:39,808 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 4 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (21), 3 states have call predecessors, (21), 4 states have call successors, (21) Word has length 187 [2022-07-22 18:59:39,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 18:59:39,813 INFO L225 Difference]: With dead ends: 1342 [2022-07-22 18:59:39,813 INFO L226 Difference]: Without dead ends: 696 [2022-07-22 18:59:39,817 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 231 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-07-22 18:59:39,819 INFO L413 NwaCegarLoop]: 342 mSDtfsCounter, 272 mSDsluCounter, 562 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 282 SdHoareTripleChecker+Valid, 904 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 18:59:39,819 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [282 Valid, 904 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 18:59:39,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 696 states. [2022-07-22 18:59:39,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 696 to 686. [2022-07-22 18:59:39,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 686 states, 431 states have (on average 1.4245939675174013) internal successors, (614), 440 states have internal predecessors, (614), 211 states have call successors, (211), 32 states have call predecessors, (211), 43 states have return successors, (268), 213 states have call predecessors, (268), 211 states have call successors, (268) [2022-07-22 18:59:39,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 686 states to 686 states and 1093 transitions. [2022-07-22 18:59:39,868 INFO L78 Accepts]: Start accepts. Automaton has 686 states and 1093 transitions. Word has length 187 [2022-07-22 18:59:39,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 18:59:39,868 INFO L495 AbstractCegarLoop]: Abstraction has 686 states and 1093 transitions. [2022-07-22 18:59:39,868 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 4 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (21), 3 states have call predecessors, (21), 4 states have call successors, (21) [2022-07-22 18:59:39,868 INFO L276 IsEmpty]: Start isEmpty. Operand 686 states and 1093 transitions. [2022-07-22 18:59:39,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2022-07-22 18:59:39,872 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 18:59:39,873 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-22 18:59:39,905 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-22 18:59:40,095 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-22 18:59:40,095 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 18:59:40,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 18:59:40,096 INFO L85 PathProgramCache]: Analyzing trace with hash 1865108637, now seen corresponding path program 1 times [2022-07-22 18:59:40,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 18:59:40,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363400507] [2022-07-22 18:59:40,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 18:59:40,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 18:59:48,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:48,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-22 18:59:48,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:48,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 18:59:48,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:48,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 18:59:48,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:48,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-22 18:59:48,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:48,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 18:59:48,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:48,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 18:59:48,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:48,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-22 18:59:48,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:48,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-22 18:59:48,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:48,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 18:59:48,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:48,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-22 18:59:48,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:48,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 18:59:48,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:48,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-22 18:59:48,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:48,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-22 18:59:48,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:48,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 18:59:48,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:48,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-22 18:59:48,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:48,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-22 18:59:48,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:48,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-07-22 18:59:48,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:48,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-07-22 18:59:48,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:48,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-07-22 18:59:48,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:48,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2022-07-22 18:59:48,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:48,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2022-07-22 18:59:48,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:48,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2022-07-22 18:59:48,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:48,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2022-07-22 18:59:48,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:48,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2022-07-22 18:59:48,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:48,891 INFO L134 CoverageAnalysis]: Checked inductivity of 542 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 527 trivial. 0 not checked. [2022-07-22 18:59:48,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 18:59:48,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363400507] [2022-07-22 18:59:48,891 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363400507] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 18:59:48,892 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [919496140] [2022-07-22 18:59:48,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 18:59:48,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 18:59:48,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 18:59:48,896 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 18:59:48,897 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-22 18:59:49,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 18:59:50,000 INFO L263 TraceCheckSpWp]: Trace formula consists of 2464 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-22 18:59:50,006 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 18:59:50,281 INFO L134 CoverageAnalysis]: Checked inductivity of 542 backedges. 72 proven. 126 refuted. 0 times theorem prover too weak. 344 trivial. 0 not checked. [2022-07-22 18:59:50,282 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 18:59:50,552 INFO L134 CoverageAnalysis]: Checked inductivity of 542 backedges. 15 proven. 9 refuted. 0 times theorem prover too weak. 518 trivial. 0 not checked. [2022-07-22 18:59:50,552 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [919496140] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 18:59:50,552 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 18:59:50,553 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7, 8] total 22 [2022-07-22 18:59:50,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844924885] [2022-07-22 18:59:50,553 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 18:59:50,554 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-07-22 18:59:50,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 18:59:50,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-07-22 18:59:50,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=388, Unknown=0, NotChecked=0, Total=462 [2022-07-22 18:59:50,555 INFO L87 Difference]: Start difference. First operand 686 states and 1093 transitions. Second operand has 22 states, 21 states have (on average 6.714285714285714) internal successors, (141), 16 states have internal predecessors, (141), 7 states have call successors, (45), 6 states have call predecessors, (45), 9 states have return successors, (46), 11 states have call predecessors, (46), 7 states have call successors, (46) [2022-07-22 18:59:52,591 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 18:59:55,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 18:59:55,082 INFO L93 Difference]: Finished difference Result 1956 states and 3237 transitions. [2022-07-22 18:59:55,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-22 18:59:55,083 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 6.714285714285714) internal successors, (141), 16 states have internal predecessors, (141), 7 states have call successors, (45), 6 states have call predecessors, (45), 9 states have return successors, (46), 11 states have call predecessors, (46), 7 states have call successors, (46) Word has length 186 [2022-07-22 18:59:55,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 18:59:55,084 INFO L225 Difference]: With dead ends: 1956 [2022-07-22 18:59:55,084 INFO L226 Difference]: Without dead ends: 0 [2022-07-22 18:59:55,094 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 451 GetRequests, 415 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=244, Invalid=1088, Unknown=0, NotChecked=0, Total=1332 [2022-07-22 18:59:55,094 INFO L413 NwaCegarLoop]: 240 mSDtfsCounter, 1027 mSDsluCounter, 1027 mSDsCounter, 0 mSdLazyCounter, 2729 mSolverCounterSat, 1123 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1043 SdHoareTripleChecker+Valid, 1267 SdHoareTripleChecker+Invalid, 3853 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1123 IncrementalHoareTripleChecker+Valid, 2729 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2022-07-22 18:59:55,095 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1043 Valid, 1267 Invalid, 3853 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1123 Valid, 2729 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2022-07-22 18:59:55,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-07-22 18:59:55,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-07-22 18:59:55,095 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-22 18:59:55,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-07-22 18:59:55,096 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 186 [2022-07-22 18:59:55,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 18:59:55,096 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-22 18:59:55,096 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 6.714285714285714) internal successors, (141), 16 states have internal predecessors, (141), 7 states have call successors, (45), 6 states have call predecessors, (45), 9 states have return successors, (46), 11 states have call predecessors, (46), 7 states have call successors, (46) [2022-07-22 18:59:55,097 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-07-22 18:59:55,097 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-07-22 18:59:55,099 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-22 18:59:55,131 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-22 18:59:55,312 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 18:59:55,314 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-07-22 18:59:59,530 INFO L902 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 5 7) the Hoare annotation is: true [2022-07-22 18:59:59,530 INFO L899 garLoopResultBuilder]: For program point L6(line 6) no Hoare annotation was computed. [2022-07-22 18:59:59,530 INFO L899 garLoopResultBuilder]: For program point L6-2(lines 5 7) no Hoare annotation was computed. [2022-07-22 18:59:59,530 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 5 7) no Hoare annotation was computed. [2022-07-22 18:59:59,530 INFO L899 garLoopResultBuilder]: For program point __CS_pthread_mutex_initEXIT(lines 569 572) no Hoare annotation was computed. [2022-07-22 18:59:59,530 INFO L902 garLoopResultBuilder]: At program point __CS_pthread_mutex_initENTRY(lines 569 572) the Hoare annotation is: true [2022-07-22 18:59:59,530 INFO L899 garLoopResultBuilder]: For program point __CS_pthread_mutex_initFINAL(lines 569 572) no Hoare annotation was computed. [2022-07-22 18:59:59,531 INFO L899 garLoopResultBuilder]: For program point __CS_pthread_joinEXIT(lines 642 663) no Hoare annotation was computed. [2022-07-22 18:59:59,531 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-22 18:59:59,531 INFO L899 garLoopResultBuilder]: For program point __CS_pthread_joinFINAL(lines 642 663) no Hoare annotation was computed. [2022-07-22 18:59:59,531 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-22 18:59:59,531 INFO L899 garLoopResultBuilder]: For program point L661-1(line 661) no Hoare annotation was computed. [2022-07-22 18:59:59,531 INFO L899 garLoopResultBuilder]: For program point L655(lines 655 660) no Hoare annotation was computed. [2022-07-22 18:59:59,531 INFO L899 garLoopResultBuilder]: For program point L650(line 650) no Hoare annotation was computed. [2022-07-22 18:59:59,531 INFO L899 garLoopResultBuilder]: For program point L650-2(lines 650 654) no Hoare annotation was computed. [2022-07-22 18:59:59,532 INFO L899 garLoopResultBuilder]: For program point L644(lines 644 649) no Hoare annotation was computed. [2022-07-22 18:59:59,532 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-22 18:59:59,532 INFO L899 garLoopResultBuilder]: For program point L584(lines 584 585) no Hoare annotation was computed. [2022-07-22 18:59:59,532 INFO L899 garLoopResultBuilder]: For program point L584-1(lines 584 585) no Hoare annotation was computed. [2022-07-22 18:59:59,532 INFO L899 garLoopResultBuilder]: For program point __CS_pthread_mutex_lockEXIT(lines 582 587) no Hoare annotation was computed. [2022-07-22 18:59:59,532 INFO L899 garLoopResultBuilder]: For program point __CS_pthread_mutex_lockFINAL(lines 582 587) no Hoare annotation was computed. [2022-07-22 18:59:59,532 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-22 18:59:59,533 INFO L899 garLoopResultBuilder]: For program point L729-1(lines 722 753) no Hoare annotation was computed. [2022-07-22 18:59:59,533 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-22 18:59:59,533 INFO L899 garLoopResultBuilder]: For program point L696-1(line 696) no Hoare annotation was computed. [2022-07-22 18:59:59,533 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-22 18:59:59,533 INFO L899 garLoopResultBuilder]: For program point L713-1(lines 706 720) no Hoare annotation was computed. [2022-07-22 18:59:59,533 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-22 18:59:59,533 INFO L899 garLoopResultBuilder]: For program point L697-1(lines 690 704) no Hoare annotation was computed. [2022-07-22 18:59:59,534 INFO L899 garLoopResultBuilder]: For program point ##fun~$Pointer$~TO~$Pointer$FINAL(line -1) no Hoare annotation was computed. [2022-07-22 18:59:59,534 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-22 18:59:59,534 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-22 18:59:59,534 INFO L899 garLoopResultBuilder]: For program point L714-1(line 714) no Hoare annotation was computed. [2022-07-22 18:59:59,534 INFO L899 garLoopResultBuilder]: For program point ##fun~$Pointer$~TO~$Pointer$EXIT(line -1) no Hoare annotation was computed. [2022-07-22 18:59:59,534 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-22 18:59:59,534 INFO L899 garLoopResultBuilder]: For program point L731-1(lines 722 753) no Hoare annotation was computed. [2022-07-22 18:59:59,535 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-22 18:59:59,535 INFO L899 garLoopResultBuilder]: For program point L698-1(line 698) no Hoare annotation was computed. [2022-07-22 18:59:59,535 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-22 18:59:59,535 INFO L899 garLoopResultBuilder]: For program point L715-1(lines 706 720) no Hoare annotation was computed. [2022-07-22 18:59:59,535 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-22 18:59:59,535 INFO L899 garLoopResultBuilder]: For program point L699-1(lines 690 704) no Hoare annotation was computed. [2022-07-22 18:59:59,535 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-22 18:59:59,536 INFO L899 garLoopResultBuilder]: For program point L733-1(lines 722 753) no Hoare annotation was computed. [2022-07-22 18:59:59,536 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-22 18:59:59,536 INFO L899 garLoopResultBuilder]: For program point L717-1(lines 706 720) no Hoare annotation was computed. [2022-07-22 18:59:59,536 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-22 18:59:59,536 INFO L899 garLoopResultBuilder]: For program point L734-1(line 734) no Hoare annotation was computed. [2022-07-22 18:59:59,536 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-22 18:59:59,536 INFO L899 garLoopResultBuilder]: For program point L701-1(lines 690 704) no Hoare annotation was computed. [2022-07-22 18:59:59,537 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-22 18:59:59,537 INFO L899 garLoopResultBuilder]: For program point L718-1(line 718) no Hoare annotation was computed. [2022-07-22 18:59:59,537 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-22 18:59:59,537 INFO L899 garLoopResultBuilder]: For program point L735-1(lines 722 753) no Hoare annotation was computed. [2022-07-22 18:59:59,537 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-22 18:59:59,537 INFO L899 garLoopResultBuilder]: For program point L702-1(line 702) no Hoare annotation was computed. [2022-07-22 18:59:59,537 INFO L899 garLoopResultBuilder]: For program point L752(lines 722 753) no Hoare annotation was computed. [2022-07-22 18:59:59,538 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-22 18:59:59,538 INFO L899 garLoopResultBuilder]: For program point L719-1(lines 706 720) no Hoare annotation was computed. [2022-07-22 18:59:59,538 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-22 18:59:59,538 INFO L899 garLoopResultBuilder]: For program point L736-1(line 736) no Hoare annotation was computed. [2022-07-22 18:59:59,538 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-22 18:59:59,538 INFO L899 garLoopResultBuilder]: For program point L703-1(lines 690 704) no Hoare annotation was computed. [2022-07-22 18:59:59,538 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-22 18:59:59,539 INFO L899 garLoopResultBuilder]: For program point L737-1(lines 722 753) no Hoare annotation was computed. [2022-07-22 18:59:59,539 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-22 18:59:59,539 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-22 18:59:59,539 INFO L899 garLoopResultBuilder]: For program point L738-1(line 738) no Hoare annotation was computed. [2022-07-22 18:59:59,539 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-22 18:59:59,539 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-22 18:59:59,539 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-22 18:59:59,540 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-22 18:59:59,540 INFO L899 garLoopResultBuilder]: For program point L739-1(lines 722 753) no Hoare annotation was computed. [2022-07-22 18:59:59,540 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-22 18:59:59,540 INFO L899 garLoopResultBuilder]: For program point L740-1(line 740) no Hoare annotation was computed. [2022-07-22 18:59:59,540 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-22 18:59:59,540 INFO L899 garLoopResultBuilder]: For program point L707-1(lines 706 720) no Hoare annotation was computed. [2022-07-22 18:59:59,540 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-22 18:59:59,540 INFO L899 garLoopResultBuilder]: For program point L691-1(lines 690 704) no Hoare annotation was computed. [2022-07-22 18:59:59,541 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-22 18:59:59,541 INFO L899 garLoopResultBuilder]: For program point L741-1(lines 722 753) no Hoare annotation was computed. [2022-07-22 18:59:59,541 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-22 18:59:59,541 INFO L899 garLoopResultBuilder]: For program point L708-1(line 708) no Hoare annotation was computed. [2022-07-22 18:59:59,541 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-22 18:59:59,541 INFO L899 garLoopResultBuilder]: For program point L725-1(lines 722 753) no Hoare annotation was computed. [2022-07-22 18:59:59,541 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-22 18:59:59,542 INFO L899 garLoopResultBuilder]: For program point L692-1(line 692) no Hoare annotation was computed. [2022-07-22 18:59:59,542 INFO L899 garLoopResultBuilder]: For program point L742(line 742) no Hoare annotation was computed. [2022-07-22 18:59:59,542 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-22 18:59:59,542 INFO L899 garLoopResultBuilder]: For program point L742-2(lines 742 751) no Hoare annotation was computed. [2022-07-22 18:59:59,542 INFO L899 garLoopResultBuilder]: For program point L709-1(lines 706 720) no Hoare annotation was computed. [2022-07-22 18:59:59,542 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-22 18:59:59,542 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-07-22 18:59:59,543 INFO L899 garLoopResultBuilder]: For program point L-1-2(line -1) no Hoare annotation was computed. [2022-07-22 18:59:59,543 INFO L899 garLoopResultBuilder]: For program point L-1-4(line -1) no Hoare annotation was computed. [2022-07-22 18:59:59,543 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-22 18:59:59,543 INFO L899 garLoopResultBuilder]: For program point L726-1(line 726) no Hoare annotation was computed. [2022-07-22 18:59:59,543 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-22 18:59:59,543 INFO L899 garLoopResultBuilder]: For program point L693-1(lines 690 704) no Hoare annotation was computed. [2022-07-22 18:59:59,543 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-22 18:59:59,544 INFO L899 garLoopResultBuilder]: For program point L727-1(lines 722 753) no Hoare annotation was computed. [2022-07-22 18:59:59,544 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-22 18:59:59,544 INFO L899 garLoopResultBuilder]: For program point L744-1(lines 743 751) no Hoare annotation was computed. [2022-07-22 18:59:59,544 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-22 18:59:59,544 INFO L899 garLoopResultBuilder]: For program point L711-1(lines 706 720) no Hoare annotation was computed. [2022-07-22 18:59:59,544 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-22 18:59:59,544 INFO L899 garLoopResultBuilder]: For program point L728-1(line 728) no Hoare annotation was computed. [2022-07-22 18:59:59,544 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-22 18:59:59,545 INFO L899 garLoopResultBuilder]: For program point L695-1(lines 690 704) no Hoare annotation was computed. [2022-07-22 18:59:59,545 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-22 18:59:59,545 INFO L899 garLoopResultBuilder]: For program point L712-1(line 712) no Hoare annotation was computed. [2022-07-22 18:59:59,545 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-22 18:59:59,545 INFO L899 garLoopResultBuilder]: For program point L590(lines 590 594) no Hoare annotation was computed. [2022-07-22 18:59:59,545 INFO L899 garLoopResultBuilder]: For program point __CS_pthread_mutex_unlockFINAL(lines 588 596) no Hoare annotation was computed. [2022-07-22 18:59:59,545 INFO L899 garLoopResultBuilder]: For program point __CS_pthread_mutex_unlockEXIT(lines 588 596) no Hoare annotation was computed. [2022-07-22 18:59:59,546 INFO L899 garLoopResultBuilder]: For program point __CS_pthread_createFINAL(lines 664 677) no Hoare annotation was computed. [2022-07-22 18:59:59,546 INFO L899 garLoopResultBuilder]: For program point L666(lines 666 669) no Hoare annotation was computed. [2022-07-22 18:59:59,546 INFO L899 garLoopResultBuilder]: For program point __CS_pthread_createEXIT(lines 664 677) no Hoare annotation was computed. [2022-07-22 18:59:59,546 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-22 18:59:59,546 INFO L899 garLoopResultBuilder]: For program point L795(lines 795 800) no Hoare annotation was computed. [2022-07-22 18:59:59,546 INFO L899 garLoopResultBuilder]: For program point L795-1(lines 795 800) no Hoare annotation was computed. [2022-07-22 18:59:59,546 INFO L899 garLoopResultBuilder]: For program point L754(lines 754 818) no Hoare annotation was computed. [2022-07-22 18:59:59,547 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-22 18:59:59,547 INFO L899 garLoopResultBuilder]: For program point L812-1(line 812) no Hoare annotation was computed. [2022-07-22 18:59:59,547 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-22 18:59:59,547 INFO L899 garLoopResultBuilder]: For program point L804-1(line 804) no Hoare annotation was computed. [2022-07-22 18:59:59,547 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-07-22 18:59:59,547 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-07-22 18:59:59,547 INFO L899 garLoopResultBuilder]: For program point L763-2(lines 763 772) no Hoare annotation was computed. [2022-07-22 18:59:59,547 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-22 18:59:59,548 INFO L899 garLoopResultBuilder]: For program point L763-4(lines 763 772) no Hoare annotation was computed. [2022-07-22 18:59:59,548 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-22 18:59:59,548 INFO L899 garLoopResultBuilder]: For program point L813-1(line 813) no Hoare annotation was computed. [2022-07-22 18:59:59,548 INFO L899 garLoopResultBuilder]: For program point L805(line 805) no Hoare annotation was computed. [2022-07-22 18:59:59,548 INFO L899 garLoopResultBuilder]: For program point L541(lines 541 543) no Hoare annotation was computed. [2022-07-22 18:59:59,549 INFO L902 garLoopResultBuilder]: At program point L541-2(lines 540 545) the Hoare annotation is: true [2022-07-22 18:59:59,549 INFO L899 garLoopResultBuilder]: For program point L789(lines 789 794) no Hoare annotation was computed. [2022-07-22 18:59:59,549 INFO L899 garLoopResultBuilder]: For program point L789-1(lines 789 794) no Hoare annotation was computed. [2022-07-22 18:59:59,549 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-22 18:59:59,549 INFO L899 garLoopResultBuilder]: For program point L814-1(line 814) no Hoare annotation was computed. [2022-07-22 18:59:59,549 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-22 18:59:59,549 INFO L899 garLoopResultBuilder]: For program point L542(line 542) no Hoare annotation was computed. [2022-07-22 18:59:59,549 INFO L899 garLoopResultBuilder]: For program point L798-1(line 798) no Hoare annotation was computed. [2022-07-22 18:59:59,550 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-22 18:59:59,550 INFO L899 garLoopResultBuilder]: For program point L815-1(line 815) no Hoare annotation was computed. [2022-07-22 18:59:59,550 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-22 18:59:59,550 INFO L899 garLoopResultBuilder]: For program point L807-1(line 807) no Hoare annotation was computed. [2022-07-22 18:59:59,550 INFO L899 garLoopResultBuilder]: For program point L799(line 799) no Hoare annotation was computed. [2022-07-22 18:59:59,550 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-22 18:59:59,550 INFO L899 garLoopResultBuilder]: For program point L816-1(line 816) no Hoare annotation was computed. [2022-07-22 18:59:59,550 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-22 18:59:59,551 INFO L899 garLoopResultBuilder]: For program point L808-1(line 808) no Hoare annotation was computed. [2022-07-22 18:59:59,551 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-07-22 18:59:59,551 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)) (= |#funAddr~main_thread.offset| (select ~__CS_thread~0.offset 0)) (= (select ~__CS_thread~0.offset 2) 0)) [2022-07-22 18:59:59,551 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 542) no Hoare annotation was computed. [2022-07-22 18:59:59,551 INFO L899 garLoopResultBuilder]: For program point L792-1(line 792) no Hoare annotation was computed. [2022-07-22 18:59:59,552 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-22 18:59:59,552 INFO L899 garLoopResultBuilder]: For program point L809-1(line 809) no Hoare annotation was computed. [2022-07-22 18:59:59,552 INFO L899 garLoopResultBuilder]: For program point L801(lines 801 806) no Hoare annotation was computed. [2022-07-22 18:59:59,552 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-07-22 18:59:59,552 INFO L899 garLoopResultBuilder]: For program point L801-1(lines 801 806) no Hoare annotation was computed. [2022-07-22 18:59:59,552 INFO L899 garLoopResultBuilder]: For program point L768-2(lines 768 771) no Hoare annotation was computed. [2022-07-22 18:59:59,552 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-22 18:59:59,552 INFO L899 garLoopResultBuilder]: For program point L793(line 793) no Hoare annotation was computed. [2022-07-22 18:59:59,553 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-22 18:59:59,553 INFO L899 garLoopResultBuilder]: For program point L810-1(line 810) no Hoare annotation was computed. [2022-07-22 18:59:59,553 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-22 18:59:59,553 INFO L899 garLoopResultBuilder]: For program point L811-1(line 811) no Hoare annotation was computed. [2022-07-22 18:59:59,553 INFO L899 garLoopResultBuilder]: For program point __CS_csEXIT(lines 562 568) no Hoare annotation was computed. [2022-07-22 18:59:59,553 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-22 18:59:59,553 INFO L899 garLoopResultBuilder]: For program point __CS_csFINAL(lines 562 568) no Hoare annotation was computed. [2022-07-22 18:59:59,553 INFO L899 garLoopResultBuilder]: For program point L567(line 567) no Hoare annotation was computed. [2022-07-22 18:59:59,554 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-22 18:59:59,554 INFO L899 garLoopResultBuilder]: For program point L567-2(line 567) no Hoare annotation was computed. [2022-07-22 18:59:59,554 INFO L899 garLoopResultBuilder]: For program point L565-1(line 565) no Hoare annotation was computed. [2022-07-22 18:59:59,563 INFO L356 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1] [2022-07-22 18:59:59,565 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-22 18:59:59,575 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.offset [2022-07-22 18:59:59,575 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.offset [2022-07-22 18:59:59,576 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.base [2022-07-22 18:59:59,576 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.base [2022-07-22 18:59:59,577 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.offset [2022-07-22 18:59:59,577 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.offset [2022-07-22 18:59:59,577 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.base [2022-07-22 18:59:59,578 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.base [2022-07-22 18:59:59,583 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.base [2022-07-22 18:59:59,583 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.offset [2022-07-22 18:59:59,583 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.base [2022-07-22 18:59:59,583 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.offset [2022-07-22 18:59:59,585 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.base [2022-07-22 18:59:59,585 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.offset [2022-07-22 18:59:59,587 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.base [2022-07-22 18:59:59,587 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.offset [2022-07-22 18:59:59,588 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.offset [2022-07-22 18:59:59,588 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.offset [2022-07-22 18:59:59,592 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.base [2022-07-22 18:59:59,592 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.base [2022-07-22 18:59:59,592 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~thread2.offset [2022-07-22 18:59:59,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-22 18:59:59,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-22 18:59:59,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-22 18:59:59,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-22 18:59:59,594 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~thread2.offset [2022-07-22 18:59:59,596 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.07 06:59:59 BoogieIcfgContainer [2022-07-22 18:59:59,601 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-22 18:59:59,601 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-22 18:59:59,601 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-22 18:59:59,602 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-22 18:59:59,602 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 06:59:09" (3/4) ... [2022-07-22 18:59:59,605 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-07-22 18:59:59,609 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __CS_pthread_join [2022-07-22 18:59:59,610 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __CS_pthread_mutex_lock [2022-07-22 18:59:59,610 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ##fun~$Pointer$~TO~$Pointer$ [2022-07-22 18:59:59,610 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __CS_pthread_mutex_unlock [2022-07-22 18:59:59,610 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __CS_pthread_create [2022-07-22 18:59:59,611 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2022-07-22 18:59:59,611 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __CS_cs [2022-07-22 18:59:59,611 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __CS_pthread_mutex_init [2022-07-22 18:59:59,626 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 49 nodes and edges [2022-07-22 18:59:59,628 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 21 nodes and edges [2022-07-22 18:59:59,628 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2022-07-22 18:59:59,629 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2022-07-22 18:59:59,648 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-22 18:59:59,648 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-22 18:59:59,650 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-22 18:59:59,650 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (!(__CS_ret_PREEMPTED == 1) || !(#fp == 0)) || !(\old(__CS_ret) % 256 == 0) [2022-07-22 18:59:59,694 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-22 18:59:59,695 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-22 18:59:59,695 INFO L158 Benchmark]: Toolchain (without parser) took 52879.15ms. Allocated memory was 75.5MB in the beginning and 635.4MB in the end (delta: 559.9MB). Free memory was 40.3MB in the beginning and 211.5MB in the end (delta: -171.2MB). Peak memory consumption was 387.7MB. Max. memory is 16.1GB. [2022-07-22 18:59:59,695 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 75.5MB. Free memory was 54.9MB in the beginning and 54.9MB in the end (delta: 24.6kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-22 18:59:59,696 INFO L158 Benchmark]: CACSL2BoogieTranslator took 535.36ms. Allocated memory was 75.5MB in the beginning and 92.3MB in the end (delta: 16.8MB). Free memory was 40.1MB in the beginning and 54.2MB in the end (delta: -14.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-22 18:59:59,696 INFO L158 Benchmark]: Boogie Procedure Inliner took 70.02ms. Allocated memory is still 92.3MB. Free memory was 54.2MB in the beginning and 50.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-22 18:59:59,696 INFO L158 Benchmark]: Boogie Preprocessor took 66.81ms. Allocated memory is still 92.3MB. Free memory was 50.0MB in the beginning and 46.1MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-22 18:59:59,696 INFO L158 Benchmark]: RCFGBuilder took 1946.01ms. Allocated memory is still 92.3MB. Free memory was 46.1MB in the beginning and 52.1MB in the end (delta: -6.0MB). Peak memory consumption was 23.2MB. Max. memory is 16.1GB. [2022-07-22 18:59:59,697 INFO L158 Benchmark]: TraceAbstraction took 50153.70ms. Allocated memory was 92.3MB in the beginning and 635.4MB in the end (delta: 543.2MB). Free memory was 51.6MB in the beginning and 220.9MB in the end (delta: -169.3MB). Peak memory consumption was 467.2MB. Max. memory is 16.1GB. [2022-07-22 18:59:59,697 INFO L158 Benchmark]: Witness Printer took 93.47ms. Allocated memory is still 635.4MB. Free memory was 220.9MB in the beginning and 211.5MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-22 18:59:59,698 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.10ms. Allocated memory is still 75.5MB. Free memory was 54.9MB in the beginning and 54.9MB in the end (delta: 24.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 535.36ms. Allocated memory was 75.5MB in the beginning and 92.3MB in the end (delta: 16.8MB). Free memory was 40.1MB in the beginning and 54.2MB in the end (delta: -14.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 70.02ms. Allocated memory is still 92.3MB. Free memory was 54.2MB in the beginning and 50.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 66.81ms. Allocated memory is still 92.3MB. Free memory was 50.0MB in the beginning and 46.1MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1946.01ms. Allocated memory is still 92.3MB. Free memory was 46.1MB in the beginning and 52.1MB in the end (delta: -6.0MB). Peak memory consumption was 23.2MB. Max. memory is 16.1GB. * TraceAbstraction took 50153.70ms. Allocated memory was 92.3MB in the beginning and 635.4MB in the end (delta: 543.2MB). Free memory was 51.6MB in the beginning and 220.9MB in the end (delta: -169.3MB). Peak memory consumption was 467.2MB. Max. memory is 16.1GB. * Witness Printer took 93.47ms. Allocated memory is still 635.4MB. Free memory was 220.9MB in the beginning and 211.5MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. 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: 50.1s, OverallIterations: 10, TraceHistogramMax: 15, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 13.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 4.2s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 4 mSolverCounterUnknown, 2716 SdHoareTripleChecker+Valid, 12.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2676 mSDsluCounter, 7244 SdHoareTripleChecker+Invalid, 11.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4478 mSDsCounter, 2413 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4674 IncrementalHoareTripleChecker+Invalid, 7091 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2413 mSolverCounterUnsat, 2766 mSDtfsCounter, 4674 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2065 GetRequests, 1961 SyntacticMatches, 3 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 479 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=686occurred in iteration=9, InterpolantAutomatonStates: 72, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 10 MinimizatonAttempts, 58 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 69 LocationsWithAnnotation, 3660 PreInvPairs, 5194 NumberOfFragments, 1920 HoareAnnotationTreeSize, 3660 FomulaSimplifications, 8468 FormulaSimplificationTreeSizeReduction, 0.7s HoareSimplificationTime, 69 FomulaSimplificationsInter, 27766 FormulaSimplificationTreeSizeReductionInter, 3.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.7s SsaConstructionTime, 21.2s SatisfiabilityAnalysisTime, 3.6s InterpolantComputationTime, 2291 NumberOfCodeBlocks, 2087 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 2874 ConstructedInterpolants, 0 QuantifiedInterpolants, 5735 SizeOfPredicates, 16 NumberOfNonLiveVariables, 14366 ConjunctsInSsa, 45 ConjunctsInUnsatCore, 21 InterpolantComputations, 6 PerfectInterpolantSequences, 7782/7959 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 721]: Loop Invariant Derived loop invariant: (!(__CS_ret_PREEMPTED == 1) || !(#fp == 0)) || !(\old(__CS_ret) % 256 == 0) - InvariantResult [Line: 689]: Loop Invariant [2022-07-22 18:59:59,708 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.offset [2022-07-22 18:59:59,708 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.offset [2022-07-22 18:59:59,708 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.base [2022-07-22 18:59:59,708 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.base [2022-07-22 18:59:59,708 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.offset [2022-07-22 18:59:59,709 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.offset [2022-07-22 18:59:59,709 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.base [2022-07-22 18:59:59,709 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-22 18:59:59,709 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.base [2022-07-22 18:59:59,709 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.offset [2022-07-22 18:59:59,710 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.base [2022-07-22 18:59:59,710 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-22 18:59:59,710 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.base [2022-07-22 18:59:59,710 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.offset [2022-07-22 18:59:59,710 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.base [2022-07-22 18:59:59,710 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-22 18:59:59,710 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.offset [2022-07-22 18:59:59,711 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.offset [2022-07-22 18:59:59,711 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.base [2022-07-22 18:59:59,711 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.base [2022-07-22 18:59:59,711 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~thread2.offset [2022-07-22 18:59:59,711 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.offset [2022-07-22 18:59:59,711 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.offset [2022-07-22 18:59:59,711 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.base [2022-07-22 18:59:59,711 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~__CS_thread~0 : [int]$Pointer$; and expression ~__CS_thread~0.base [2022-07-22 18:59:59,711 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-22 18:59:59,727 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