./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/seq-pthread/cs_lazy.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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_lazy.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b26873cfd586f35040b8fa56225beaa479db089ab89500d17d6395862bf9072f --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 12:20:10,385 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 12:20:10,444 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-11-09 12:20:10,451 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 12:20:10,451 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 12:20:10,493 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 12:20:10,494 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 12:20:10,495 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 12:20:10,495 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 12:20:10,496 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 12:20:10,496 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 12:20:10,507 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 12:20:10,507 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 12:20:10,510 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 12:20:10,510 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 12:20:10,510 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 12:20:10,510 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 12:20:10,511 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 12:20:10,511 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 12:20:10,511 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 12:20:10,511 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 12:20:10,512 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 12:20:10,512 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 12:20:10,512 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 12:20:10,513 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 12:20:10,513 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-09 12:20:10,513 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 12:20:10,513 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 12:20:10,513 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 12:20:10,514 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 12:20:10,514 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 12:20:10,514 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 12:20:10,515 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 12:20:10,515 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 12:20:10,515 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 12:20:10,515 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 12:20:10,516 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 12:20:10,516 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 12:20:10,516 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 12:20:10,516 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 12:20:10,516 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 12:20:10,517 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 12:20:10,517 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 12:20:10,517 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 12:20:10,517 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 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 ! overflow) ) 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 -> b26873cfd586f35040b8fa56225beaa479db089ab89500d17d6395862bf9072f [2024-11-09 12:20:10,754 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 12:20:10,774 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 12:20:10,776 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 12:20:10,777 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 12:20:10,778 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 12:20:10,779 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-pthread/cs_lazy.i [2024-11-09 12:20:12,365 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 12:20:12,830 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 12:20:12,834 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-pthread/cs_lazy.i [2024-11-09 12:20:12,866 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/488af44ba/7a337e27f810452a81c21f098f77e70e/FLAG9014c3544 [2024-11-09 12:20:12,898 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/488af44ba/7a337e27f810452a81c21f098f77e70e [2024-11-09 12:20:12,901 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 12:20:12,906 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 12:20:12,907 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 12:20:12,908 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 12:20:12,920 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 12:20:12,922 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:20:12" (1/1) ... [2024-11-09 12:20:12,923 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56e6ac23 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:20:12, skipping insertion in model container [2024-11-09 12:20:12,924 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:20:12" (1/1) ... [2024-11-09 12:20:13,006 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 12:20:13,620 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 12:20:13,676 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 12:20:13,789 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 12:20:13,825 INFO L204 MainTranslator]: Completed translation [2024-11-09 12:20:13,826 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:20:13 WrapperNode [2024-11-09 12:20:13,826 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 12:20:13,827 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 12:20:13,827 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 12:20:13,827 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 12:20:13,834 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:20:13" (1/1) ... [2024-11-09 12:20:13,864 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:20:13" (1/1) ... [2024-11-09 12:20:13,903 INFO L138 Inliner]: procedures = 145, calls = 224, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 539 [2024-11-09 12:20:13,904 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 12:20:13,905 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 12:20:13,905 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 12:20:13,905 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 12:20:13,914 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:20:13" (1/1) ... [2024-11-09 12:20:13,915 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:20:13" (1/1) ... [2024-11-09 12:20:13,925 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:20:13" (1/1) ... [2024-11-09 12:20:13,949 INFO L175 MemorySlicer]: Split 119 memory accesses to 14 slices as follows [2, 10, 10, 10, 25, 16, 9, 5, 3, 0, 3, 9, 9, 8]. 21 percent of accesses are in the largest equivalence class. The 34 initializations are split as follows [2, 4, 4, 4, 8, 8, 2, 0, 0, 0, 0, 0, 0, 2]. The 32 writes are split as follows [0, 2, 2, 2, 10, 4, 3, 2, 1, 0, 1, 1, 1, 3]. [2024-11-09 12:20:13,950 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:20:13" (1/1) ... [2024-11-09 12:20:13,950 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:20:13" (1/1) ... [2024-11-09 12:20:13,969 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:20:13" (1/1) ... [2024-11-09 12:20:13,974 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:20:13" (1/1) ... [2024-11-09 12:20:13,978 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:20:13" (1/1) ... [2024-11-09 12:20:13,982 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:20:13" (1/1) ... [2024-11-09 12:20:13,989 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 12:20:13,990 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 12:20:13,990 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 12:20:13,990 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 12:20:13,991 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:20:13" (1/1) ... [2024-11-09 12:20:14,002 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 12:20:14,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 12:20:14,037 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 12:20:14,043 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 12:20:14,086 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-09 12:20:14,086 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-09 12:20:14,087 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-09 12:20:14,087 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-09 12:20:14,087 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-09 12:20:14,087 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-11-09 12:20:14,087 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-11-09 12:20:14,087 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2024-11-09 12:20:14,087 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2024-11-09 12:20:14,089 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2024-11-09 12:20:14,089 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2024-11-09 12:20:14,089 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2024-11-09 12:20:14,089 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2024-11-09 12:20:14,089 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2024-11-09 12:20:14,089 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-09 12:20:14,089 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-09 12:20:14,089 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-09 12:20:14,089 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-09 12:20:14,089 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-09 12:20:14,089 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-11-09 12:20:14,089 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2024-11-09 12:20:14,089 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2024-11-09 12:20:14,090 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2024-11-09 12:20:14,090 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2024-11-09 12:20:14,090 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2024-11-09 12:20:14,090 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2024-11-09 12:20:14,090 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2024-11-09 12:20:14,090 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2024-11-09 12:20:14,090 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 12:20:14,090 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-09 12:20:14,090 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-09 12:20:14,090 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-09 12:20:14,090 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-09 12:20:14,090 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-11-09 12:20:14,090 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2024-11-09 12:20:14,090 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2024-11-09 12:20:14,090 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2024-11-09 12:20:14,090 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2024-11-09 12:20:14,091 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2024-11-09 12:20:14,091 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2024-11-09 12:20:14,091 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2024-11-09 12:20:14,091 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2024-11-09 12:20:14,091 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2024-11-09 12:20:14,091 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2024-11-09 12:20:14,091 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_mutex_lock [2024-11-09 12:20:14,091 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_mutex_lock [2024-11-09 12:20:14,091 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_create [2024-11-09 12:20:14,091 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_create [2024-11-09 12:20:14,091 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-09 12:20:14,091 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-09 12:20:14,091 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-09 12:20:14,091 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-11-09 12:20:14,091 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2024-11-09 12:20:14,092 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2024-11-09 12:20:14,092 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2024-11-09 12:20:14,092 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2024-11-09 12:20:14,092 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2024-11-09 12:20:14,092 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2024-11-09 12:20:14,092 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2024-11-09 12:20:14,092 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2024-11-09 12:20:14,092 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2024-11-09 12:20:14,092 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2024-11-09 12:20:14,094 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_join [2024-11-09 12:20:14,095 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_join [2024-11-09 12:20:14,095 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~$Pointer$ [2024-11-09 12:20:14,095 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~$Pointer$ [2024-11-09 12:20:14,095 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 12:20:14,095 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-09 12:20:14,095 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-09 12:20:14,095 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-09 12:20:14,096 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2024-11-09 12:20:14,096 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2024-11-09 12:20:14,096 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2024-11-09 12:20:14,096 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2024-11-09 12:20:14,096 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2024-11-09 12:20:14,096 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2024-11-09 12:20:14,096 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2024-11-09 12:20:14,096 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#10 [2024-11-09 12:20:14,097 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#11 [2024-11-09 12:20:14,097 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#12 [2024-11-09 12:20:14,097 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#13 [2024-11-09 12:20:14,097 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_cs [2024-11-09 12:20:14,097 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_cs [2024-11-09 12:20:14,097 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 12:20:14,097 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-09 12:20:14,097 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-09 12:20:14,098 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-09 12:20:14,098 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-09 12:20:14,098 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-11-09 12:20:14,099 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-11-09 12:20:14,099 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2024-11-09 12:20:14,099 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2024-11-09 12:20:14,099 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2024-11-09 12:20:14,099 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2024-11-09 12:20:14,099 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2024-11-09 12:20:14,099 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2024-11-09 12:20:14,099 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2024-11-09 12:20:14,100 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_mutex_unlock [2024-11-09 12:20:14,100 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_mutex_unlock [2024-11-09 12:20:14,100 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 12:20:14,100 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 12:20:14,307 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 12:20:14,309 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 12:20:14,641 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##32: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);thread3_#res#1.base, thread3_#res#1.offset := 0, 0; [2024-11-09 12:20:14,641 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##31: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2024-11-09 12:20:14,641 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##30: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);thread3_#res#1.base, thread3_#res#1.offset := 0, 0; [2024-11-09 12:20:14,641 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##33: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2024-11-09 12:20:14,641 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint L714: SUMMARY for call __CS_cs(); srcloc: null [2024-11-09 12:20:14,641 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint L714-1: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);thread3_#res#1.base, thread3_#res#1.offset := 0, 0; [2024-11-09 12:20:14,642 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint L714-1: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2024-11-09 12:20:15,002 INFO L? ?]: Removed 100 outVars from TransFormulas that were not future-live. [2024-11-09 12:20:15,005 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 12:20:15,023 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 12:20:15,023 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-09 12:20:15,024 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:20:15 BoogieIcfgContainer [2024-11-09 12:20:15,025 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 12:20:15,026 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 12:20:15,026 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 12:20:15,030 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 12:20:15,030 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 12:20:12" (1/3) ... [2024-11-09 12:20:15,031 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a2d6d9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 12:20:15, skipping insertion in model container [2024-11-09 12:20:15,031 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:20:13" (2/3) ... [2024-11-09 12:20:15,032 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a2d6d9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 12:20:15, skipping insertion in model container [2024-11-09 12:20:15,032 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:20:15" (3/3) ... [2024-11-09 12:20:15,034 INFO L112 eAbstractionObserver]: Analyzing ICFG cs_lazy.i [2024-11-09 12:20:15,048 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 12:20:15,049 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 16 error locations. [2024-11-09 12:20:15,108 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 12:20:15,113 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@5e733d0d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 12:20:15,114 INFO L334 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2024-11-09 12:20:15,118 INFO L276 IsEmpty]: Start isEmpty. Operand has 192 states, 132 states have (on average 1.5606060606060606) internal successors, (206), 148 states have internal predecessors, (206), 37 states have call successors, (37), 6 states have call predecessors, (37), 6 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2024-11-09 12:20:15,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-09 12:20:15,122 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 12:20:15,123 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-09 12:20:15,123 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [__CS_pthread_mutex_lockErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __CS_pthread_mutex_lockErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2024-11-09 12:20:15,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 12:20:15,127 INFO L85 PathProgramCache]: Analyzing trace with hash 295904321, now seen corresponding path program 1 times [2024-11-09 12:20:15,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 12:20:15,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107657227] [2024-11-09 12:20:15,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:20:15,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 12:20:15,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:20:15,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 12:20:15,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 12:20:15,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107657227] [2024-11-09 12:20:15,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2107657227] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 12:20:15,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 12:20:15,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 12:20:15,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889270589] [2024-11-09 12:20:15,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 12:20:15,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 12:20:15,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 12:20:15,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 12:20:15,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 12:20:15,472 INFO L87 Difference]: Start difference. First operand has 192 states, 132 states have (on average 1.5606060606060606) internal successors, (206), 148 states have internal predecessors, (206), 37 states have call successors, (37), 6 states have call predecessors, (37), 6 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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) [2024-11-09 12:20:15,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 12:20:15,537 INFO L93 Difference]: Finished difference Result 376 states and 592 transitions. [2024-11-09 12:20:15,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 12:20:15,540 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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) Word has length 5 [2024-11-09 12:20:15,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 12:20:15,552 INFO L225 Difference]: With dead ends: 376 [2024-11-09 12:20:15,552 INFO L226 Difference]: Without dead ends: 156 [2024-11-09 12:20:15,562 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 12:20:15,567 INFO L432 NwaCegarLoop]: 252 mSDtfsCounter, 1 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 497 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 12:20:15,568 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 497 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 12:20:15,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2024-11-09 12:20:15,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 156. [2024-11-09 12:20:15,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 105 states have (on average 1.457142857142857) internal successors, (153), 113 states have internal predecessors, (153), 37 states have call successors, (37), 6 states have call predecessors, (37), 6 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-09 12:20:15,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 226 transitions. [2024-11-09 12:20:15,618 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 226 transitions. Word has length 5 [2024-11-09 12:20:15,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 12:20:15,618 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 226 transitions. [2024-11-09 12:20:15,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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) [2024-11-09 12:20:15,618 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 226 transitions. [2024-11-09 12:20:15,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-09 12:20:15,623 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 12:20:15,623 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2024-11-09 12:20:15,626 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 12:20:15,627 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [__CS_pthread_mutex_lockErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __CS_pthread_mutex_lockErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2024-11-09 12:20:15,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 12:20:15,627 INFO L85 PathProgramCache]: Analyzing trace with hash 2013066031, now seen corresponding path program 1 times [2024-11-09 12:20:15,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 12:20:15,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236647463] [2024-11-09 12:20:15,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:20:15,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 12:20:15,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:20:15,790 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 12:20:15,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 12:20:15,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236647463] [2024-11-09 12:20:15,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [236647463] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 12:20:15,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [837325787] [2024-11-09 12:20:15,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:20:15,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 12:20:15,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 12:20:15,796 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) [2024-11-09 12:20:15,803 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 12:20:16,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:20:16,024 INFO L255 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 12:20:16,028 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 12:20:16,051 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 12:20:16,051 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 12:20:16,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [837325787] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 12:20:16,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 12:20:16,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2024-11-09 12:20:16,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215979093] [2024-11-09 12:20:16,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 12:20:16,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 12:20:16,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 12:20:16,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 12:20:16,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 12:20:16,054 INFO L87 Difference]: Start difference. First operand 156 states and 226 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 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) [2024-11-09 12:20:16,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 12:20:16,094 INFO L93 Difference]: Finished difference Result 156 states and 226 transitions. [2024-11-09 12:20:16,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 12:20:16,095 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 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) Word has length 8 [2024-11-09 12:20:16,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 12:20:16,097 INFO L225 Difference]: With dead ends: 156 [2024-11-09 12:20:16,097 INFO L226 Difference]: Without dead ends: 155 [2024-11-09 12:20:16,098 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 12:20:16,099 INFO L432 NwaCegarLoop]: 217 mSDtfsCounter, 1 mSDsluCounter, 428 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 645 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 12:20:16,099 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 645 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 12:20:16,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2024-11-09 12:20:16,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2024-11-09 12:20:16,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 105 states have (on average 1.4476190476190476) internal successors, (152), 112 states have internal predecessors, (152), 37 states have call successors, (37), 6 states have call predecessors, (37), 6 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-09 12:20:16,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 225 transitions. [2024-11-09 12:20:16,116 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 225 transitions. Word has length 8 [2024-11-09 12:20:16,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 12:20:16,117 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 225 transitions. [2024-11-09 12:20:16,117 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 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) [2024-11-09 12:20:16,117 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 225 transitions. [2024-11-09 12:20:16,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-09 12:20:16,117 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 12:20:16,118 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 12:20:16,135 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-09 12:20:16,321 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 12:20:16,322 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [__CS_pthread_mutex_lockErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __CS_pthread_mutex_lockErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2024-11-09 12:20:16,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 12:20:16,323 INFO L85 PathProgramCache]: Analyzing trace with hash -2019463875, now seen corresponding path program 1 times [2024-11-09 12:20:16,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 12:20:16,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187830077] [2024-11-09 12:20:16,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:20:16,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 12:20:16,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:20:16,421 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 12:20:16,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 12:20:16,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187830077] [2024-11-09 12:20:16,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [187830077] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 12:20:16,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [933283022] [2024-11-09 12:20:16,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:20:16,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 12:20:16,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 12:20:16,425 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) [2024-11-09 12:20:16,433 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 12:20:16,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:20:16,622 INFO L255 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 12:20:16,623 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 12:20:16,661 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 12:20:16,665 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 12:20:16,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [933283022] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 12:20:16,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 12:20:16,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2024-11-09 12:20:16,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541031965] [2024-11-09 12:20:16,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 12:20:16,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 12:20:16,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 12:20:16,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 12:20:16,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 12:20:16,667 INFO L87 Difference]: Start difference. First operand 155 states and 225 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 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) [2024-11-09 12:20:16,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 12:20:16,785 INFO L93 Difference]: Finished difference Result 155 states and 225 transitions. [2024-11-09 12:20:16,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 12:20:16,789 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 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) Word has length 9 [2024-11-09 12:20:16,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 12:20:16,791 INFO L225 Difference]: With dead ends: 155 [2024-11-09 12:20:16,791 INFO L226 Difference]: Without dead ends: 154 [2024-11-09 12:20:16,791 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 12:20:16,792 INFO L432 NwaCegarLoop]: 214 mSDtfsCounter, 2 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 422 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 12:20:16,792 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 422 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 12:20:16,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2024-11-09 12:20:16,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2024-11-09 12:20:16,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 105 states have (on average 1.438095238095238) internal successors, (151), 111 states have internal predecessors, (151), 37 states have call successors, (37), 6 states have call predecessors, (37), 6 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-09 12:20:16,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 224 transitions. [2024-11-09 12:20:16,803 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 224 transitions. Word has length 9 [2024-11-09 12:20:16,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 12:20:16,803 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 224 transitions. [2024-11-09 12:20:16,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 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) [2024-11-09 12:20:16,803 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 224 transitions. [2024-11-09 12:20:16,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-09 12:20:16,804 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 12:20:16,804 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1] [2024-11-09 12:20:16,818 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-09 12:20:17,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2024-11-09 12:20:17,008 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [__CS_pthread_mutex_lockErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __CS_pthread_mutex_lockErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2024-11-09 12:20:17,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 12:20:17,009 INFO L85 PathProgramCache]: Analyzing trace with hash -2019462146, now seen corresponding path program 1 times [2024-11-09 12:20:17,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 12:20:17,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277122832] [2024-11-09 12:20:17,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:20:17,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 12:20:17,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:20:17,052 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 12:20:17,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 12:20:17,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277122832] [2024-11-09 12:20:17,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277122832] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 12:20:17,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 12:20:17,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 12:20:17,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756341822] [2024-11-09 12:20:17,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 12:20:17,054 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 12:20:17,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 12:20:17,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 12:20:17,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 12:20:17,055 INFO L87 Difference]: Start difference. First operand 154 states and 224 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 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) [2024-11-09 12:20:17,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 12:20:17,072 INFO L93 Difference]: Finished difference Result 154 states and 224 transitions. [2024-11-09 12:20:17,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 12:20:17,079 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 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) Word has length 9 [2024-11-09 12:20:17,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 12:20:17,081 INFO L225 Difference]: With dead ends: 154 [2024-11-09 12:20:17,081 INFO L226 Difference]: Without dead ends: 153 [2024-11-09 12:20:17,082 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 12:20:17,082 INFO L432 NwaCegarLoop]: 217 mSDtfsCounter, 0 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 12:20:17,083 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 430 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 12:20:17,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2024-11-09 12:20:17,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 151. [2024-11-09 12:20:17,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 103 states have (on average 1.4368932038834952) internal successors, (148), 108 states have internal predecessors, (148), 37 states have call successors, (37), 6 states have call predecessors, (37), 6 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-09 12:20:17,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 221 transitions. [2024-11-09 12:20:17,091 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 221 transitions. Word has length 9 [2024-11-09 12:20:17,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 12:20:17,092 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 221 transitions. [2024-11-09 12:20:17,092 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 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) [2024-11-09 12:20:17,092 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 221 transitions. [2024-11-09 12:20:17,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-09 12:20:17,092 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 12:20:17,093 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 12:20:17,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 12:20:17,093 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [__CS_pthread_mutex_lockErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __CS_pthread_mutex_lockErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2024-11-09 12:20:17,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 12:20:17,093 INFO L85 PathProgramCache]: Analyzing trace with hash 1821129657, now seen corresponding path program 1 times [2024-11-09 12:20:17,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 12:20:17,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043519533] [2024-11-09 12:20:17,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:20:17,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 12:20:17,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:20:17,168 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 12:20:17,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 12:20:17,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043519533] [2024-11-09 12:20:17,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043519533] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 12:20:17,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1248776074] [2024-11-09 12:20:17,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:20:17,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 12:20:17,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 12:20:17,171 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) [2024-11-09 12:20:17,172 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-09 12:20:17,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:20:17,331 INFO L255 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 12:20:17,332 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 12:20:17,384 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 12:20:17,384 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 12:20:17,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1248776074] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 12:20:17,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 12:20:17,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2024-11-09 12:20:17,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936703784] [2024-11-09 12:20:17,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 12:20:17,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 12:20:17,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 12:20:17,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 12:20:17,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 12:20:17,389 INFO L87 Difference]: Start difference. First operand 151 states and 221 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 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) [2024-11-09 12:20:17,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 12:20:17,494 INFO L93 Difference]: Finished difference Result 300 states and 440 transitions. [2024-11-09 12:20:17,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 12:20:17,498 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 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) Word has length 10 [2024-11-09 12:20:17,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 12:20:17,504 INFO L225 Difference]: With dead ends: 300 [2024-11-09 12:20:17,508 INFO L226 Difference]: Without dead ends: 159 [2024-11-09 12:20:17,509 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 12:20:17,511 INFO L432 NwaCegarLoop]: 215 mSDtfsCounter, 0 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 12:20:17,513 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 426 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 12:20:17,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2024-11-09 12:20:17,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2024-11-09 12:20:17,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 111 states have (on average 1.4144144144144144) internal successors, (157), 116 states have internal predecessors, (157), 37 states have call successors, (37), 6 states have call predecessors, (37), 6 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-09 12:20:17,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 230 transitions. [2024-11-09 12:20:17,548 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 230 transitions. Word has length 10 [2024-11-09 12:20:17,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 12:20:17,549 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 230 transitions. [2024-11-09 12:20:17,549 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 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) [2024-11-09 12:20:17,549 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 230 transitions. [2024-11-09 12:20:17,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-09 12:20:17,549 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 12:20:17,550 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2024-11-09 12:20:17,564 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-09 12:20:17,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 12:20:17,751 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [__CS_pthread_mutex_lockErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __CS_pthread_mutex_lockErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2024-11-09 12:20:17,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 12:20:17,753 INFO L85 PathProgramCache]: Analyzing trace with hash -204772944, now seen corresponding path program 1 times [2024-11-09 12:20:17,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 12:20:17,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168286649] [2024-11-09 12:20:17,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:20:17,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 12:20:17,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:20:17,840 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 12:20:17,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 12:20:17,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168286649] [2024-11-09 12:20:17,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1168286649] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 12:20:17,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [406073065] [2024-11-09 12:20:17,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:20:17,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 12:20:17,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 12:20:17,843 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) [2024-11-09 12:20:17,844 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-09 12:20:18,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:20:18,019 INFO L255 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 12:20:18,023 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 12:20:18,047 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-09 12:20:18,048 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 12:20:18,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [406073065] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 12:20:18,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 12:20:18,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2024-11-09 12:20:18,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390177332] [2024-11-09 12:20:18,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 12:20:18,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 12:20:18,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 12:20:18,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 12:20:18,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 12:20:18,050 INFO L87 Difference]: Start difference. First operand 159 states and 230 transitions. Second operand has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 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) [2024-11-09 12:20:22,069 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 12:20:22,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 12:20:22,076 INFO L93 Difference]: Finished difference Result 159 states and 230 transitions. [2024-11-09 12:20:22,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 12:20:22,084 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 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) Word has length 18 [2024-11-09 12:20:22,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 12:20:22,085 INFO L225 Difference]: With dead ends: 159 [2024-11-09 12:20:22,086 INFO L226 Difference]: Without dead ends: 158 [2024-11-09 12:20:22,086 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 12:20:22,087 INFO L432 NwaCegarLoop]: 214 mSDtfsCounter, 0 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 422 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2024-11-09 12:20:22,087 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 422 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 1 Unknown, 0 Unchecked, 4.0s Time] [2024-11-09 12:20:22,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2024-11-09 12:20:22,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 151. [2024-11-09 12:20:22,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 104 states have (on average 1.4230769230769231) internal successors, (148), 108 states have internal predecessors, (148), 37 states have call successors, (37), 6 states have call predecessors, (37), 6 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-09 12:20:22,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 221 transitions. [2024-11-09 12:20:22,099 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 221 transitions. Word has length 18 [2024-11-09 12:20:22,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 12:20:22,099 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 221 transitions. [2024-11-09 12:20:22,099 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 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) [2024-11-09 12:20:22,099 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 221 transitions. [2024-11-09 12:20:22,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-09 12:20:22,102 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 12:20:22,102 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-09 12:20:22,117 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-09 12:20:22,302 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 12:20:22,303 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ##fun~$Pointer$~TO~$Pointer$Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [__CS_pthread_mutex_lockErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __CS_pthread_mutex_lockErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2024-11-09 12:20:22,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 12:20:22,304 INFO L85 PathProgramCache]: Analyzing trace with hash -1170227925, now seen corresponding path program 1 times [2024-11-09 12:20:22,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 12:20:22,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850736034] [2024-11-09 12:20:22,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:20:22,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 12:20:22,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:20:22,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-09 12:20:22,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:20:22,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-09 12:20:22,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:20:22,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-09 12:20:22,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:20:22,510 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-09 12:20:22,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 12:20:22,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850736034] [2024-11-09 12:20:22,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850736034] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 12:20:22,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1987673291] [2024-11-09 12:20:22,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:20:22,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 12:20:22,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 12:20:22,513 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) [2024-11-09 12:20:22,514 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-09 12:20:22,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:20:22,740 INFO L255 TraceCheckSpWp]: Trace formula consists of 641 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 12:20:22,742 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 12:20:22,763 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-09 12:20:22,763 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 12:20:22,804 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-09 12:20:22,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1987673291] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 12:20:22,804 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 12:20:22,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 9 [2024-11-09 12:20:22,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11688551] [2024-11-09 12:20:22,805 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 12:20:22,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 12:20:22,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 12:20:22,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 12:20:22,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-09 12:20:22,807 INFO L87 Difference]: Start difference. First operand 151 states and 221 transitions. Second operand has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 7 states have internal predecessors, (58), 1 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-09 12:20:23,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 12:20:23,280 INFO L93 Difference]: Finished difference Result 314 states and 463 transitions. [2024-11-09 12:20:23,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 12:20:23,281 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 7 states have internal predecessors, (58), 1 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 51 [2024-11-09 12:20:23,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 12:20:23,283 INFO L225 Difference]: With dead ends: 314 [2024-11-09 12:20:23,283 INFO L226 Difference]: Without dead ends: 166 [2024-11-09 12:20:23,284 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-11-09 12:20:23,285 INFO L432 NwaCegarLoop]: 187 mSDtfsCounter, 71 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 279 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 513 SdHoareTripleChecker+Invalid, 355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 12:20:23,285 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 513 Invalid, 355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 279 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 12:20:23,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2024-11-09 12:20:23,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 160. [2024-11-09 12:20:23,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 113 states have (on average 1.3893805309734513) internal successors, (157), 117 states have internal predecessors, (157), 37 states have call successors, (37), 6 states have call predecessors, (37), 6 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-09 12:20:23,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 230 transitions. [2024-11-09 12:20:23,296 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 230 transitions. Word has length 51 [2024-11-09 12:20:23,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 12:20:23,300 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 230 transitions. [2024-11-09 12:20:23,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 7 states have internal predecessors, (58), 1 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-09 12:20:23,301 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 230 transitions. [2024-11-09 12:20:23,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-09 12:20:23,303 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 12:20:23,303 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 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] [2024-11-09 12:20:23,322 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-09 12:20:23,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 12:20:23,504 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ##fun~$Pointer$~TO~$Pointer$Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [__CS_pthread_mutex_lockErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __CS_pthread_mutex_lockErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2024-11-09 12:20:23,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 12:20:23,505 INFO L85 PathProgramCache]: Analyzing trace with hash 1553781337, now seen corresponding path program 2 times [2024-11-09 12:20:23,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 12:20:23,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978856330] [2024-11-09 12:20:23,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:20:23,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 12:20:23,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:20:23,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-09 12:20:23,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:20:23,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-09 12:20:23,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:20:23,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-09 12:20:23,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:20:23,846 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-09 12:20:23,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 12:20:23,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978856330] [2024-11-09 12:20:23,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978856330] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 12:20:23,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [716704144] [2024-11-09 12:20:23,851 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 12:20:23,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 12:20:23,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 12:20:23,860 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) [2024-11-09 12:20:23,868 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-09 12:20:24,129 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-09 12:20:24,130 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 12:20:24,133 INFO L255 TraceCheckSpWp]: Trace formula consists of 524 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-09 12:20:24,136 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 12:20:24,208 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 25 treesize of output 13 [2024-11-09 12:20:24,243 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-11-09 12:20:24,243 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 12:20:24,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [716704144] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 12:20:24,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 12:20:24,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2024-11-09 12:20:24,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973650100] [2024-11-09 12:20:24,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 12:20:24,244 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 12:20:24,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 12:20:24,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 12:20:24,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-09 12:20:24,245 INFO L87 Difference]: Start difference. First operand 160 states and 230 transitions. Second operand has 5 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 12:20:28,650 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 12:20:28,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 12:20:28,817 INFO L93 Difference]: Finished difference Result 422 states and 622 transitions. [2024-11-09 12:20:28,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 12:20:28,818 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 60 [2024-11-09 12:20:28,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 12:20:28,820 INFO L225 Difference]: With dead ends: 422 [2024-11-09 12:20:28,821 INFO L226 Difference]: Without dead ends: 311 [2024-11-09 12:20:28,821 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-11-09 12:20:28,822 INFO L432 NwaCegarLoop]: 275 mSDtfsCounter, 231 mSDsluCounter, 731 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 13 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 1006 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2024-11-09 12:20:28,822 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [231 Valid, 1006 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 56 Invalid, 1 Unknown, 0 Unchecked, 4.5s Time] [2024-11-09 12:20:28,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2024-11-09 12:20:28,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 305. [2024-11-09 12:20:28,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 213 states have (on average 1.403755868544601) internal successors, (299), 216 states have internal predecessors, (299), 76 states have call successors, (76), 13 states have call predecessors, (76), 12 states have return successors, (80), 75 states have call predecessors, (80), 74 states have call successors, (80) [2024-11-09 12:20:28,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 455 transitions. [2024-11-09 12:20:28,841 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 455 transitions. Word has length 60 [2024-11-09 12:20:28,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 12:20:28,842 INFO L471 AbstractCegarLoop]: Abstraction has 305 states and 455 transitions. [2024-11-09 12:20:28,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 12:20:28,842 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 455 transitions. [2024-11-09 12:20:28,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-09 12:20:28,843 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 12:20:28,843 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 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] [2024-11-09 12:20:28,870 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-09 12:20:29,044 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 12:20:29,045 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ##fun~$Pointer$~TO~$Pointer$Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [__CS_pthread_mutex_lockErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __CS_pthread_mutex_lockErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2024-11-09 12:20:29,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 12:20:29,045 INFO L85 PathProgramCache]: Analyzing trace with hash 1238860846, now seen corresponding path program 1 times [2024-11-09 12:20:29,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 12:20:29,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83770302] [2024-11-09 12:20:29,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:20:29,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 12:20:29,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:20:29,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-09 12:20:29,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:20:29,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 12:20:29,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:20:29,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 12:20:29,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:20:29,250 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-09 12:20:29,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 12:20:29,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83770302] [2024-11-09 12:20:29,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83770302] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 12:20:29,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [315807017] [2024-11-09 12:20:29,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:20:29,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 12:20:29,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 12:20:29,254 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) [2024-11-09 12:20:29,258 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-09 12:20:29,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:20:29,511 INFO L255 TraceCheckSpWp]: Trace formula consists of 725 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 12:20:29,513 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 12:20:29,547 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-09 12:20:29,547 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 12:20:29,595 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-09 12:20:29,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [315807017] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 12:20:29,596 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 12:20:29,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 7 [2024-11-09 12:20:29,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666319396] [2024-11-09 12:20:29,596 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 12:20:29,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 12:20:29,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 12:20:29,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 12:20:29,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-09 12:20:29,598 INFO L87 Difference]: Start difference. First operand 305 states and 455 transitions. Second operand has 7 states, 7 states have (on average 8.0) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-09 12:20:33,648 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 12:20:34,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 12:20:34,544 INFO L93 Difference]: Finished difference Result 619 states and 932 transitions. [2024-11-09 12:20:34,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 12:20:34,545 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 58 [2024-11-09 12:20:34,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 12:20:34,547 INFO L225 Difference]: With dead ends: 619 [2024-11-09 12:20:34,548 INFO L226 Difference]: Without dead ends: 334 [2024-11-09 12:20:34,549 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 118 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-09 12:20:34,549 INFO L432 NwaCegarLoop]: 185 mSDtfsCounter, 74 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 276 mSolverCounterSat, 75 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 506 SdHoareTripleChecker+Invalid, 352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 276 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2024-11-09 12:20:34,550 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 506 Invalid, 352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 276 Invalid, 1 Unknown, 0 Unchecked, 4.9s Time] [2024-11-09 12:20:34,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2024-11-09 12:20:34,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 322. [2024-11-09 12:20:34,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 322 states, 230 states have (on average 1.3782608695652174) internal successors, (317), 233 states have internal predecessors, (317), 76 states have call successors, (76), 13 states have call predecessors, (76), 12 states have return successors, (80), 75 states have call predecessors, (80), 74 states have call successors, (80) [2024-11-09 12:20:34,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 473 transitions. [2024-11-09 12:20:34,569 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 473 transitions. Word has length 58 [2024-11-09 12:20:34,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 12:20:34,569 INFO L471 AbstractCegarLoop]: Abstraction has 322 states and 473 transitions. [2024-11-09 12:20:34,569 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-09 12:20:34,570 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 473 transitions. [2024-11-09 12:20:34,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-09 12:20:34,571 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 12:20:34,571 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 12:20:34,589 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-09 12:20:34,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 12:20:34,772 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ##fun~$Pointer$~TO~$Pointer$Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [__CS_pthread_mutex_lockErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __CS_pthread_mutex_lockErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2024-11-09 12:20:34,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 12:20:34,773 INFO L85 PathProgramCache]: Analyzing trace with hash -236048063, now seen corresponding path program 1 times [2024-11-09 12:20:34,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 12:20:34,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107932582] [2024-11-09 12:20:34,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:20:34,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 12:20:34,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:20:35,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-09 12:20:35,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:20:35,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-09 12:20:35,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:20:35,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-09 12:20:35,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:20:35,221 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2024-11-09 12:20:35,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 12:20:35,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107932582] [2024-11-09 12:20:35,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2107932582] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 12:20:35,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 12:20:35,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 12:20:35,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112790276] [2024-11-09 12:20:35,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 12:20:35,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 12:20:35,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 12:20:35,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 12:20:35,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 12:20:35,223 INFO L87 Difference]: Start difference. First operand 322 states and 473 transitions. Second operand has 7 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 12:20:39,235 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 12:20:40,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 12:20:40,109 INFO L93 Difference]: Finished difference Result 642 states and 962 transitions. [2024-11-09 12:20:40,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 12:20:40,109 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 71 [2024-11-09 12:20:40,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 12:20:40,112 INFO L225 Difference]: With dead ends: 642 [2024-11-09 12:20:40,112 INFO L226 Difference]: Without dead ends: 365 [2024-11-09 12:20:40,113 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2024-11-09 12:20:40,114 INFO L432 NwaCegarLoop]: 204 mSDtfsCounter, 384 mSDsluCounter, 659 mSDsCounter, 0 mSdLazyCounter, 569 mSolverCounterSat, 181 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 397 SdHoareTripleChecker+Valid, 863 SdHoareTripleChecker+Invalid, 751 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 181 IncrementalHoareTripleChecker+Valid, 569 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2024-11-09 12:20:40,114 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [397 Valid, 863 Invalid, 751 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [181 Valid, 569 Invalid, 1 Unknown, 0 Unchecked, 4.8s Time] [2024-11-09 12:20:40,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2024-11-09 12:20:40,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 347. [2024-11-09 12:20:40,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 347 states, 247 states have (on average 1.3805668016194332) internal successors, (341), 251 states have internal predecessors, (341), 82 states have call successors, (82), 14 states have call predecessors, (82), 14 states have return successors, (90), 81 states have call predecessors, (90), 80 states have call successors, (90) [2024-11-09 12:20:40,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 513 transitions. [2024-11-09 12:20:40,133 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 513 transitions. Word has length 71 [2024-11-09 12:20:40,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 12:20:40,134 INFO L471 AbstractCegarLoop]: Abstraction has 347 states and 513 transitions. [2024-11-09 12:20:40,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 12:20:40,134 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 513 transitions. [2024-11-09 12:20:40,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-09 12:20:40,135 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 12:20:40,136 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 12:20:40,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 12:20:40,136 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ##fun~$Pointer$~TO~$Pointer$Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [__CS_pthread_mutex_lockErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __CS_pthread_mutex_lockErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2024-11-09 12:20:40,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 12:20:40,137 INFO L85 PathProgramCache]: Analyzing trace with hash -848367843, now seen corresponding path program 1 times [2024-11-09 12:20:40,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 12:20:40,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808408390] [2024-11-09 12:20:40,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:20:40,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 12:20:40,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:20:40,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-09 12:20:40,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:20:40,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-09 12:20:40,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:20:40,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-09 12:20:40,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:20:40,693 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2024-11-09 12:20:40,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 12:20:40,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808408390] [2024-11-09 12:20:40,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [808408390] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 12:20:40,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 12:20:40,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 12:20:40,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871472156] [2024-11-09 12:20:40,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 12:20:40,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 12:20:40,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 12:20:40,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 12:20:40,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 12:20:40,696 INFO L87 Difference]: Start difference. First operand 347 states and 513 transitions. Second operand has 7 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 12:20:42,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 12:20:42,346 INFO L93 Difference]: Finished difference Result 646 states and 965 transitions. [2024-11-09 12:20:42,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 12:20:42,346 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 71 [2024-11-09 12:20:42,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 12:20:42,351 INFO L225 Difference]: With dead ends: 646 [2024-11-09 12:20:42,351 INFO L226 Difference]: Without dead ends: 346 [2024-11-09 12:20:42,353 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2024-11-09 12:20:42,354 INFO L432 NwaCegarLoop]: 208 mSDtfsCounter, 341 mSDsluCounter, 561 mSDsCounter, 0 mSdLazyCounter, 652 mSolverCounterSat, 156 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 354 SdHoareTripleChecker+Valid, 769 SdHoareTripleChecker+Invalid, 808 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 156 IncrementalHoareTripleChecker+Valid, 652 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-09 12:20:42,355 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [354 Valid, 769 Invalid, 808 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [156 Valid, 652 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-09 12:20:42,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2024-11-09 12:20:42,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 330. [2024-11-09 12:20:42,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 330 states, 236 states have (on average 1.36864406779661) internal successors, (323), 240 states have internal predecessors, (323), 76 states have call successors, (76), 14 states have call predecessors, (76), 14 states have return successors, (84), 75 states have call predecessors, (84), 74 states have call successors, (84) [2024-11-09 12:20:42,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 483 transitions. [2024-11-09 12:20:42,382 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 483 transitions. Word has length 71 [2024-11-09 12:20:42,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 12:20:42,382 INFO L471 AbstractCegarLoop]: Abstraction has 330 states and 483 transitions. [2024-11-09 12:20:42,382 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 12:20:42,382 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 483 transitions. [2024-11-09 12:20:42,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-09 12:20:42,383 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 12:20:42,383 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 12:20:42,383 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 12:20:42,383 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ##fun~$Pointer$~TO~$Pointer$Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [__CS_pthread_mutex_lockErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __CS_pthread_mutex_lockErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2024-11-09 12:20:42,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 12:20:42,384 INFO L85 PathProgramCache]: Analyzing trace with hash 1148818412, now seen corresponding path program 1 times [2024-11-09 12:20:42,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 12:20:42,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702397262] [2024-11-09 12:20:42,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:20:42,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 12:20:42,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:20:42,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-09 12:20:42,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:20:42,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 12:20:42,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:20:42,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 12:20:42,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:20:42,910 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2024-11-09 12:20:42,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 12:20:42,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702397262] [2024-11-09 12:20:42,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702397262] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 12:20:42,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 12:20:42,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 12:20:42,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952389828] [2024-11-09 12:20:42,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 12:20:42,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 12:20:42,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 12:20:42,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 12:20:42,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 12:20:42,912 INFO L87 Difference]: Start difference. First operand 330 states and 483 transitions. Second operand has 7 states, 6 states have (on average 5.5) internal successors, (33), 5 states have internal predecessors, (33), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 12:20:44,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 12:20:44,540 INFO L93 Difference]: Finished difference Result 648 states and 963 transitions. [2024-11-09 12:20:44,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 12:20:44,541 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.5) internal successors, (33), 5 states have internal predecessors, (33), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 73 [2024-11-09 12:20:44,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 12:20:44,544 INFO L225 Difference]: With dead ends: 648 [2024-11-09 12:20:44,545 INFO L226 Difference]: Without dead ends: 370 [2024-11-09 12:20:44,546 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2024-11-09 12:20:44,547 INFO L432 NwaCegarLoop]: 236 mSDtfsCounter, 345 mSDsluCounter, 782 mSDsCounter, 0 mSdLazyCounter, 540 mSolverCounterSat, 154 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 345 SdHoareTripleChecker+Valid, 1018 SdHoareTripleChecker+Invalid, 694 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 154 IncrementalHoareTripleChecker+Valid, 540 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-09 12:20:44,547 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [345 Valid, 1018 Invalid, 694 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [154 Valid, 540 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-09 12:20:44,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2024-11-09 12:20:44,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 352. [2024-11-09 12:20:44,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 352 states, 251 states have (on average 1.3705179282868525) internal successors, (344), 255 states have internal predecessors, (344), 82 states have call successors, (82), 15 states have call predecessors, (82), 15 states have return successors, (88), 81 states have call predecessors, (88), 80 states have call successors, (88) [2024-11-09 12:20:44,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 514 transitions. [2024-11-09 12:20:44,574 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 514 transitions. Word has length 73 [2024-11-09 12:20:44,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 12:20:44,574 INFO L471 AbstractCegarLoop]: Abstraction has 352 states and 514 transitions. [2024-11-09 12:20:44,574 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.5) internal successors, (33), 5 states have internal predecessors, (33), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 12:20:44,574 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 514 transitions. [2024-11-09 12:20:44,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-09 12:20:44,576 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 12:20:44,576 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 12:20:44,577 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 12:20:44,577 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ##fun~$Pointer$~TO~$Pointer$Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [__CS_pthread_mutex_lockErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __CS_pthread_mutex_lockErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2024-11-09 12:20:44,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 12:20:44,578 INFO L85 PathProgramCache]: Analyzing trace with hash 536498632, now seen corresponding path program 1 times [2024-11-09 12:20:44,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 12:20:44,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467065330] [2024-11-09 12:20:44,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:20:44,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 12:20:44,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:20:44,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-09 12:20:44,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:20:45,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 12:20:45,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:20:45,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 12:20:45,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:20:45,018 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2024-11-09 12:20:45,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 12:20:45,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467065330] [2024-11-09 12:20:45,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467065330] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 12:20:45,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 12:20:45,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 12:20:45,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736354047] [2024-11-09 12:20:45,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 12:20:45,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 12:20:45,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 12:20:45,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 12:20:45,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 12:20:45,021 INFO L87 Difference]: Start difference. First operand 352 states and 514 transitions. Second operand has 6 states, 6 states have (on average 5.5) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 12:20:49,176 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 12:20:53,188 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 12:20:53,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 12:20:53,743 INFO L93 Difference]: Finished difference Result 639 states and 943 transitions. [2024-11-09 12:20:53,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 12:20:53,743 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 73 [2024-11-09 12:20:53,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 12:20:53,746 INFO L225 Difference]: With dead ends: 639 [2024-11-09 12:20:53,746 INFO L226 Difference]: Without dead ends: 343 [2024-11-09 12:20:53,747 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-11-09 12:20:53,748 INFO L432 NwaCegarLoop]: 228 mSDtfsCounter, 306 mSDsluCounter, 553 mSDsCounter, 0 mSdLazyCounter, 416 mSolverCounterSat, 129 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 306 SdHoareTripleChecker+Valid, 781 SdHoareTripleChecker+Invalid, 547 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 129 IncrementalHoareTripleChecker+Valid, 416 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.6s IncrementalHoareTripleChecker+Time [2024-11-09 12:20:53,748 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [306 Valid, 781 Invalid, 547 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [129 Valid, 416 Invalid, 2 Unknown, 0 Unchecked, 8.6s Time] [2024-11-09 12:20:53,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2024-11-09 12:20:53,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 327. [2024-11-09 12:20:53,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 234 states have (on average 1.3632478632478633) internal successors, (319), 238 states have internal predecessors, (319), 75 states have call successors, (75), 14 states have call predecessors, (75), 14 states have return successors, (81), 74 states have call predecessors, (81), 73 states have call successors, (81) [2024-11-09 12:20:53,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 475 transitions. [2024-11-09 12:20:53,769 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 475 transitions. Word has length 73 [2024-11-09 12:20:53,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 12:20:53,770 INFO L471 AbstractCegarLoop]: Abstraction has 327 states and 475 transitions. [2024-11-09 12:20:53,771 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 12:20:53,771 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 475 transitions. [2024-11-09 12:20:53,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-09 12:20:53,771 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 12:20:53,772 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 12:20:53,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-09 12:20:53,772 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ##fun~$Pointer$~TO~$Pointer$Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [__CS_pthread_mutex_lockErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __CS_pthread_mutex_lockErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2024-11-09 12:20:53,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 12:20:53,773 INFO L85 PathProgramCache]: Analyzing trace with hash -1403489993, now seen corresponding path program 2 times [2024-11-09 12:20:53,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 12:20:53,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408644689] [2024-11-09 12:20:53,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:20:53,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 12:20:53,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:20:54,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-09 12:20:54,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:20:54,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-11-09 12:20:54,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:20:54,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-09 12:20:54,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:20:54,165 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2024-11-09 12:20:54,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 12:20:54,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408644689] [2024-11-09 12:20:54,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [408644689] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 12:20:54,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 12:20:54,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 12:20:54,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72560264] [2024-11-09 12:20:54,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 12:20:54,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 12:20:54,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 12:20:54,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 12:20:54,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 12:20:54,169 INFO L87 Difference]: Start difference. First operand 327 states and 475 transitions. Second operand has 7 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 12:20:56,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 12:20:56,659 INFO L93 Difference]: Finished difference Result 560 states and 803 transitions. [2024-11-09 12:20:56,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 12:20:56,659 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 75 [2024-11-09 12:20:56,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 12:20:56,661 INFO L225 Difference]: With dead ends: 560 [2024-11-09 12:20:56,662 INFO L226 Difference]: Without dead ends: 311 [2024-11-09 12:20:56,663 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2024-11-09 12:20:56,663 INFO L432 NwaCegarLoop]: 230 mSDtfsCounter, 268 mSDsluCounter, 771 mSDsCounter, 0 mSdLazyCounter, 519 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 268 SdHoareTripleChecker+Valid, 1001 SdHoareTripleChecker+Invalid, 643 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 519 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-09 12:20:56,663 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [268 Valid, 1001 Invalid, 643 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 519 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-09 12:20:56,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2024-11-09 12:20:56,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 295. [2024-11-09 12:20:56,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 215 states have (on average 1.3255813953488371) internal successors, (285), 219 states have internal predecessors, (285), 62 states have call successors, (62), 14 states have call predecessors, (62), 14 states have return successors, (66), 61 states have call predecessors, (66), 60 states have call successors, (66) [2024-11-09 12:20:56,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 413 transitions. [2024-11-09 12:20:56,684 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 413 transitions. Word has length 75 [2024-11-09 12:20:56,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 12:20:56,684 INFO L471 AbstractCegarLoop]: Abstraction has 295 states and 413 transitions. [2024-11-09 12:20:56,684 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 12:20:56,684 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 413 transitions. [2024-11-09 12:20:56,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-09 12:20:56,686 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 12:20:56,687 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 12:20:56,687 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-09 12:20:56,687 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ##fun~$Pointer$~TO~$Pointer$Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [__CS_pthread_mutex_lockErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __CS_pthread_mutex_lockErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2024-11-09 12:20:56,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 12:20:56,687 INFO L85 PathProgramCache]: Analyzing trace with hash -2015809773, now seen corresponding path program 1 times [2024-11-09 12:20:56,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 12:20:56,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828679622] [2024-11-09 12:20:56,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:20:56,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 12:20:56,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:20:56,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-09 12:20:57,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:20:57,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-11-09 12:20:57,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:20:57,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-09 12:20:57,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:20:57,026 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2024-11-09 12:20:57,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 12:20:57,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828679622] [2024-11-09 12:20:57,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [828679622] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 12:20:57,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 12:20:57,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 12:20:57,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516092195] [2024-11-09 12:20:57,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 12:20:57,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 12:20:57,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 12:20:57,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 12:20:57,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 12:20:57,028 INFO L87 Difference]: Start difference. First operand 295 states and 413 transitions. Second operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 12:20:59,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 12:20:59,294 INFO L93 Difference]: Finished difference Result 339 states and 464 transitions. [2024-11-09 12:20:59,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 12:20:59,294 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 75 [2024-11-09 12:20:59,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 12:20:59,296 INFO L225 Difference]: With dead ends: 339 [2024-11-09 12:20:59,296 INFO L226 Difference]: Without dead ends: 276 [2024-11-09 12:20:59,297 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-11-09 12:20:59,297 INFO L432 NwaCegarLoop]: 230 mSDtfsCounter, 208 mSDsluCounter, 556 mSDsCounter, 0 mSdLazyCounter, 413 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 786 SdHoareTripleChecker+Invalid, 506 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-09 12:20:59,297 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 786 Invalid, 506 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 413 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-09 12:20:59,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2024-11-09 12:20:59,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 264. [2024-11-09 12:20:59,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 193 states have (on average 1.3160621761658031) internal successors, (254), 197 states have internal predecessors, (254), 55 states have call successors, (55), 12 states have call predecessors, (55), 12 states have return successors, (59), 54 states have call predecessors, (59), 53 states have call successors, (59) [2024-11-09 12:20:59,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 368 transitions. [2024-11-09 12:20:59,312 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 368 transitions. Word has length 75 [2024-11-09 12:20:59,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 12:20:59,312 INFO L471 AbstractCegarLoop]: Abstraction has 264 states and 368 transitions. [2024-11-09 12:20:59,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 12:20:59,312 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 368 transitions. [2024-11-09 12:20:59,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-09 12:20:59,313 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 12:20:59,313 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 12:20:59,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-09 12:20:59,313 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ##fun~$Pointer$~TO~$Pointer$Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [__CS_pthread_mutex_lockErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __CS_pthread_mutex_lockErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2024-11-09 12:20:59,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 12:20:59,314 INFO L85 PathProgramCache]: Analyzing trace with hash -32022786, now seen corresponding path program 1 times [2024-11-09 12:20:59,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 12:20:59,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605416168] [2024-11-09 12:20:59,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:20:59,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 12:20:59,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:20:59,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 12:20:59,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:20:59,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-09 12:20:59,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:20:59,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-09 12:20:59,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:20:59,634 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2024-11-09 12:20:59,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 12:20:59,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605416168] [2024-11-09 12:20:59,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605416168] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 12:20:59,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 12:20:59,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 12:20:59,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660216725] [2024-11-09 12:20:59,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 12:20:59,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 12:20:59,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 12:20:59,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 12:20:59,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 12:20:59,637 INFO L87 Difference]: Start difference. First operand 264 states and 368 transitions. Second operand has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 12:21:03,695 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 12:21:05,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 12:21:05,044 INFO L93 Difference]: Finished difference Result 282 states and 391 transitions. [2024-11-09 12:21:05,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 12:21:05,045 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 77 [2024-11-09 12:21:05,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 12:21:05,047 INFO L225 Difference]: With dead ends: 282 [2024-11-09 12:21:05,047 INFO L226 Difference]: Without dead ends: 214 [2024-11-09 12:21:05,047 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-11-09 12:21:05,048 INFO L432 NwaCegarLoop]: 232 mSDtfsCounter, 168 mSDsluCounter, 560 mSDsCounter, 0 mSdLazyCounter, 406 mSolverCounterSat, 84 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 792 SdHoareTripleChecker+Invalid, 491 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 406 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2024-11-09 12:21:05,048 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 792 Invalid, 491 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 406 Invalid, 1 Unknown, 0 Unchecked, 5.3s Time] [2024-11-09 12:21:05,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2024-11-09 12:21:05,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 208. [2024-11-09 12:21:05,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 151 states have (on average 1.2980132450331126) internal successors, (196), 156 states have internal predecessors, (196), 44 states have call successors, (44), 9 states have call predecessors, (44), 9 states have return successors, (47), 42 states have call predecessors, (47), 43 states have call successors, (47) [2024-11-09 12:21:05,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 287 transitions. [2024-11-09 12:21:05,096 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 287 transitions. Word has length 77 [2024-11-09 12:21:05,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 12:21:05,096 INFO L471 AbstractCegarLoop]: Abstraction has 208 states and 287 transitions. [2024-11-09 12:21:05,096 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 12:21:05,097 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 287 transitions. [2024-11-09 12:21:05,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-09 12:21:05,102 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 12:21:05,102 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 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] [2024-11-09 12:21:05,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-09 12:21:05,102 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ##fun~$Pointer$~TO~$Pointer$Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [__CS_pthread_mutex_lockErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __CS_pthread_mutex_lockErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2024-11-09 12:21:05,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 12:21:05,103 INFO L85 PathProgramCache]: Analyzing trace with hash 1256412407, now seen corresponding path program 1 times [2024-11-09 12:21:05,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 12:21:05,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012215078] [2024-11-09 12:21:05,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:21:05,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 12:21:05,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:21:06,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-09 12:21:06,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:21:06,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 12:21:06,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:21:06,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-09 12:21:06,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:21:06,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 12:21:06,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:21:06,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 12:21:06,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:21:06,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-09 12:21:06,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:21:06,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-09 12:21:06,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:21:06,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-09 12:21:06,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:21:06,994 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2024-11-09 12:21:06,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 12:21:06,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012215078] [2024-11-09 12:21:06,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012215078] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 12:21:06,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [742733554] [2024-11-09 12:21:06,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:21:06,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 12:21:06,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 12:21:06,997 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 12:21:06,998 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-09 12:21:07,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:21:07,452 INFO L255 TraceCheckSpWp]: Trace formula consists of 1271 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-11-09 12:21:07,460 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 12:21:07,539 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 21 treesize of output 20 [2024-11-09 12:21:07,614 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 12:21:07,615 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 7 [2024-11-09 12:21:07,705 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 27 treesize of output 1 [2024-11-09 12:21:07,737 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 12:21:07,738 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 23 [2024-11-09 12:21:07,786 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 12:21:07,787 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 7 [2024-11-09 12:21:07,819 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 48 proven. 2 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2024-11-09 12:21:07,819 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 12:21:08,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [742733554] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 12:21:08,068 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 12:21:08,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10] total 21 [2024-11-09 12:21:08,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120641259] [2024-11-09 12:21:08,069 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 12:21:08,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-09 12:21:08,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 12:21:08,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-09 12:21:08,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=434, Unknown=0, NotChecked=0, Total=506 [2024-11-09 12:21:08,074 INFO L87 Difference]: Start difference. First operand 208 states and 287 transitions. Second operand has 21 states, 18 states have (on average 5.0) internal successors, (90), 17 states have internal predecessors, (90), 9 states have call successors, (18), 9 states have call predecessors, (18), 5 states have return successors, (16), 7 states have call predecessors, (16), 7 states have call successors, (16) [2024-11-09 12:21:11,462 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 12:21:13,252 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.74s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 12:21:14,839 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 12:21:24,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 12:21:24,652 INFO L93 Difference]: Finished difference Result 1092 states and 1677 transitions. [2024-11-09 12:21:24,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2024-11-09 12:21:24,653 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 18 states have (on average 5.0) internal successors, (90), 17 states have internal predecessors, (90), 9 states have call successors, (18), 9 states have call predecessors, (18), 5 states have return successors, (16), 7 states have call predecessors, (16), 7 states have call successors, (16) Word has length 123 [2024-11-09 12:21:24,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 12:21:24,659 INFO L225 Difference]: With dead ends: 1092 [2024-11-09 12:21:24,659 INFO L226 Difference]: Without dead ends: 905 [2024-11-09 12:21:24,661 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 178 SyntacticMatches, 1 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2100 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=1141, Invalid=5501, Unknown=0, NotChecked=0, Total=6642 [2024-11-09 12:21:24,662 INFO L432 NwaCegarLoop]: 239 mSDtfsCounter, 1677 mSDsluCounter, 2613 mSDsCounter, 0 mSdLazyCounter, 3442 mSolverCounterSat, 1115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1697 SdHoareTripleChecker+Valid, 2852 SdHoareTripleChecker+Invalid, 4557 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1115 IncrementalHoareTripleChecker+Valid, 3442 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.7s IncrementalHoareTripleChecker+Time [2024-11-09 12:21:24,662 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1697 Valid, 2852 Invalid, 4557 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1115 Valid, 3442 Invalid, 0 Unknown, 0 Unchecked, 11.7s Time] [2024-11-09 12:21:24,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 905 states. [2024-11-09 12:21:24,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 905 to 813. [2024-11-09 12:21:24,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 813 states, 550 states have (on average 1.3818181818181818) internal successors, (760), 554 states have internal predecessors, (760), 221 states have call successors, (221), 34 states have call predecessors, (221), 38 states have return successors, (270), 224 states have call predecessors, (270), 217 states have call successors, (270) [2024-11-09 12:21:24,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 813 states to 813 states and 1251 transitions. [2024-11-09 12:21:24,728 INFO L78 Accepts]: Start accepts. Automaton has 813 states and 1251 transitions. Word has length 123 [2024-11-09 12:21:24,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 12:21:24,728 INFO L471 AbstractCegarLoop]: Abstraction has 813 states and 1251 transitions. [2024-11-09 12:21:24,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 18 states have (on average 5.0) internal successors, (90), 17 states have internal predecessors, (90), 9 states have call successors, (18), 9 states have call predecessors, (18), 5 states have return successors, (16), 7 states have call predecessors, (16), 7 states have call successors, (16) [2024-11-09 12:21:24,728 INFO L276 IsEmpty]: Start isEmpty. Operand 813 states and 1251 transitions. [2024-11-09 12:21:24,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-09 12:21:24,730 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 12:21:24,730 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 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] [2024-11-09 12:21:24,752 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-09 12:21:24,934 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-09 12:21:24,935 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ##fun~$Pointer$~TO~$Pointer$Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [__CS_pthread_mutex_lockErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __CS_pthread_mutex_lockErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2024-11-09 12:21:24,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 12:21:24,936 INFO L85 PathProgramCache]: Analyzing trace with hash -696641972, now seen corresponding path program 1 times [2024-11-09 12:21:24,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 12:21:24,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485314426] [2024-11-09 12:21:24,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:21:24,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 12:21:25,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:21:25,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-09 12:21:25,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:21:26,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 12:21:26,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:21:26,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-09 12:21:26,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:21:26,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 12:21:26,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:21:26,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 12:21:26,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:21:26,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-09 12:21:26,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:21:26,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-09 12:21:26,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:21:26,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-09 12:21:26,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:21:26,220 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2024-11-09 12:21:26,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 12:21:26,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485314426] [2024-11-09 12:21:26,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485314426] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 12:21:26,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 12:21:26,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-09 12:21:26,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219141927] [2024-11-09 12:21:26,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 12:21:26,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-09 12:21:26,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 12:21:26,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-09 12:21:26,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2024-11-09 12:21:26,223 INFO L87 Difference]: Start difference. First operand 813 states and 1251 transitions. Second operand has 13 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 9 states have internal predecessors, (50), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-09 12:21:27,274 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 12:21:28,903 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.63s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 12:21:33,013 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 12:21:36,827 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.76s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 12:21:39,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 12:21:39,363 INFO L93 Difference]: Finished difference Result 1423 states and 2176 transitions. [2024-11-09 12:21:39,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-09 12:21:39,364 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 9 states have internal predecessors, (50), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 121 [2024-11-09 12:21:39,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 12:21:39,382 INFO L225 Difference]: With dead ends: 1423 [2024-11-09 12:21:39,386 INFO L226 Difference]: Without dead ends: 859 [2024-11-09 12:21:39,392 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=156, Invalid=494, Unknown=0, NotChecked=0, Total=650 [2024-11-09 12:21:39,397 INFO L432 NwaCegarLoop]: 212 mSDtfsCounter, 760 mSDsluCounter, 879 mSDsCounter, 0 mSdLazyCounter, 1461 mSolverCounterSat, 430 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 795 SdHoareTripleChecker+Valid, 1091 SdHoareTripleChecker+Invalid, 1892 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 430 IncrementalHoareTripleChecker+Valid, 1461 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.4s IncrementalHoareTripleChecker+Time [2024-11-09 12:21:39,398 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [795 Valid, 1091 Invalid, 1892 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [430 Valid, 1461 Invalid, 1 Unknown, 0 Unchecked, 12.4s Time] [2024-11-09 12:21:39,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 859 states. [2024-11-09 12:21:39,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 859 to 810. [2024-11-09 12:21:39,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 810 states, 548 states have (on average 1.3795620437956204) internal successors, (756), 552 states have internal predecessors, (756), 220 states have call successors, (220), 34 states have call predecessors, (220), 38 states have return successors, (264), 223 states have call predecessors, (264), 216 states have call successors, (264) [2024-11-09 12:21:39,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 810 states to 810 states and 1240 transitions. [2024-11-09 12:21:39,563 INFO L78 Accepts]: Start accepts. Automaton has 810 states and 1240 transitions. Word has length 121 [2024-11-09 12:21:39,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 12:21:39,568 INFO L471 AbstractCegarLoop]: Abstraction has 810 states and 1240 transitions. [2024-11-09 12:21:39,568 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 9 states have internal predecessors, (50), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-09 12:21:39,568 INFO L276 IsEmpty]: Start isEmpty. Operand 810 states and 1240 transitions. [2024-11-09 12:21:39,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-09 12:21:39,570 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 12:21:39,570 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 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] [2024-11-09 12:21:39,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-09 12:21:39,572 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ##fun~$Pointer$~TO~$Pointer$Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [__CS_pthread_mutex_lockErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __CS_pthread_mutex_lockErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2024-11-09 12:21:39,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 12:21:39,572 INFO L85 PathProgramCache]: Analyzing trace with hash 662403649, now seen corresponding path program 1 times [2024-11-09 12:21:39,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 12:21:39,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052710558] [2024-11-09 12:21:39,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:21:39,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 12:21:39,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:21:40,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-09 12:21:40,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:21:41,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 12:21:41,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:21:41,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-09 12:21:41,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:21:41,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 12:21:41,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:21:41,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 12:21:41,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:21:41,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 12:21:41,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:21:41,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-09 12:21:41,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:21:41,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-09 12:21:41,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:21:41,294 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2024-11-09 12:21:41,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 12:21:41,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052710558] [2024-11-09 12:21:41,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052710558] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 12:21:41,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1240870153] [2024-11-09 12:21:41,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 12:21:41,295 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 12:21:41,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 12:21:41,299 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 12:21:41,301 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-09 12:21:41,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 12:21:41,862 INFO L255 TraceCheckSpWp]: Trace formula consists of 1265 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-09 12:21:41,866 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 12:21:42,014 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 27 treesize of output 1 [2024-11-09 12:21:42,150 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 19 treesize of output 7 [2024-11-09 12:21:42,194 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 64 proven. 2 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2024-11-09 12:21:42,194 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 12:21:42,354 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 22 treesize of output 20 [2024-11-09 12:21:42,358 INFO L378 Elim1Store]: Elim1 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 32 treesize of output 28 [2024-11-09 12:21:42,511 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 22 treesize of output 20 [2024-11-09 12:21:42,514 INFO L378 Elim1Store]: Elim1 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 32 treesize of output 28 [2024-11-09 12:21:42,600 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 22 treesize of output 20 [2024-11-09 12:21:42,604 INFO L378 Elim1Store]: Elim1 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 32 treesize of output 28 [2024-11-09 12:21:42,766 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2024-11-09 12:21:42,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1240870153] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 12:21:42,767 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 12:21:42,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12, 12] total 32 [2024-11-09 12:21:42,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539029530] [2024-11-09 12:21:42,767 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 12:21:42,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-11-09 12:21:42,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 12:21:42,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-11-09 12:21:42,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=890, Unknown=0, NotChecked=0, Total=992 [2024-11-09 12:21:42,769 INFO L87 Difference]: Start difference. First operand 810 states and 1240 transitions. Second operand has 32 states, 28 states have (on average 4.142857142857143) internal successors, (116), 27 states have internal predecessors, (116), 12 states have call successors, (26), 12 states have call predecessors, (26), 9 states have return successors, (21), 9 states have call predecessors, (21), 10 states have call successors, (21) [2024-11-09 12:21:45,439 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.41s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers []