./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-overflow.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ddv-machzwd/ddv_machzwd_inw.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ddv-machzwd/ddv_machzwd_inw.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 6e6f79eda5be95b806b33aaa2a353a360ae33a1e35cc1bf6f128d14768d932de --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 20:26:25,131 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 20:26:25,196 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-10-11 20:26:25,200 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 20:26:25,202 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 20:26:25,241 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 20:26:25,241 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 20:26:25,242 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 20:26:25,242 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 20:26:25,243 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 20:26:25,243 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 20:26:25,244 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 20:26:25,244 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 20:26:25,244 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 20:26:25,245 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 20:26:25,247 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 20:26:25,247 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 20:26:25,247 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 20:26:25,248 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 20:26:25,248 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 20:26:25,248 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 20:26:25,248 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 20:26:25,248 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 20:26:25,249 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 20:26:25,249 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 20:26:25,249 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-11 20:26:25,250 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 20:26:25,250 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 20:26:25,250 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 20:26:25,251 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 20:26:25,251 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 20:26:25,251 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 20:26:25,251 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 20:26:25,251 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 20:26:25,251 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 20:26:25,251 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 20:26:25,252 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 20:26:25,252 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 20:26:25,252 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 20:26:25,252 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 20:26:25,252 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 20:26:25,253 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 20:26:25,253 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 20:26:25,253 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 20:26:25,254 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-clean/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-clean/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 -> 6e6f79eda5be95b806b33aaa2a353a360ae33a1e35cc1bf6f128d14768d932de [2024-10-11 20:26:25,438 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 20:26:25,454 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 20:26:25,455 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 20:26:25,457 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 20:26:25,457 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 20:26:25,458 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ddv-machzwd/ddv_machzwd_inw.i [2024-10-11 20:26:26,705 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 20:26:27,045 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 20:26:27,046 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ddv-machzwd/ddv_machzwd_inw.i [2024-10-11 20:26:27,077 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/cdde04d70/bd4b9760f1994b46b58f976f47c716fc/FLAGc8a6b463e [2024-10-11 20:26:27,299 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/cdde04d70/bd4b9760f1994b46b58f976f47c716fc [2024-10-11 20:26:27,301 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 20:26:27,303 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 20:26:27,304 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 20:26:27,304 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 20:26:27,309 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 20:26:27,309 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 08:26:27" (1/1) ... [2024-10-11 20:26:27,310 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@661cd58f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:26:27, skipping insertion in model container [2024-10-11 20:26:27,310 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 08:26:27" (1/1) ... [2024-10-11 20:26:27,374 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 20:26:28,272 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 20:26:28,301 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 20:26:28,425 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 20:26:28,500 INFO L204 MainTranslator]: Completed translation [2024-10-11 20:26:28,500 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:26:28 WrapperNode [2024-10-11 20:26:28,501 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 20:26:28,501 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 20:26:28,501 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 20:26:28,501 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 20:26:28,509 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:26:28" (1/1) ... [2024-10-11 20:26:28,559 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:26:28" (1/1) ... [2024-10-11 20:26:28,671 INFO L138 Inliner]: procedures = 474, calls = 839, calls flagged for inlining = 55, calls inlined = 39, statements flattened = 1147 [2024-10-11 20:26:28,678 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 20:26:28,678 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 20:26:28,682 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 20:26:28,682 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 20:26:28,697 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:26:28" (1/1) ... [2024-10-11 20:26:28,701 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:26:28" (1/1) ... [2024-10-11 20:26:28,715 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:26:28" (1/1) ... [2024-10-11 20:26:28,802 INFO L175 MemorySlicer]: Split 211 memory accesses to 27 slices as follows [5, 3, 22, 2, 2, 2, 4, 11, 5, 6, 2, 2, 5, 19, 2, 2, 20, 2, 16, 4, 0, 2, 18, 3, 12, 35, 5]. 17 percent of accesses are in the largest equivalence class. The 85 initializations are split as follows [3, 3, 0, 0, 0, 0, 0, 2, 1, 0, 0, 0, 4, 0, 2, 0, 4, 0, 5, 4, 0, 0, 18, 0, 6, 32, 1]. The 61 writes are split as follows [0, 0, 8, 2, 2, 2, 1, 5, 1, 3, 2, 2, 0, 7, 0, 1, 4, 2, 8, 0, 0, 0, 0, 0, 6, 3, 2]. [2024-10-11 20:26:28,802 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:26:28" (1/1) ... [2024-10-11 20:26:28,803 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:26:28" (1/1) ... [2024-10-11 20:26:28,830 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:26:28" (1/1) ... [2024-10-11 20:26:28,835 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:26:28" (1/1) ... [2024-10-11 20:26:28,844 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:26:28" (1/1) ... [2024-10-11 20:26:28,849 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:26:28" (1/1) ... [2024-10-11 20:26:28,876 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 20:26:28,876 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 20:26:28,876 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 20:26:28,876 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 20:26:28,877 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:26:28" (1/1) ... [2024-10-11 20:26:28,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 20:26:28,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:26:28,915 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 20:26:28,918 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 20:26:28,955 INFO L130 BoogieDeclarations]: Found specification of procedure zf_timer_off [2024-10-11 20:26:28,955 INFO L138 BoogieDeclarations]: Found implementation of procedure zf_timer_off [2024-10-11 20:26:28,955 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-10-11 20:26:28,955 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_atomic_begin [2024-10-11 20:26:28,955 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_irqrestore [2024-10-11 20:26:28,955 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_irqrestore [2024-10-11 20:26:28,956 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-11 20:26:28,956 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock [2024-10-11 20:26:28,956 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock [2024-10-11 20:26:28,957 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-10-11 20:26:28,957 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_atomic_end [2024-10-11 20:26:28,957 INFO L130 BoogieDeclarations]: Found specification of procedure zf_get_control [2024-10-11 20:26:28,958 INFO L138 BoogieDeclarations]: Found implementation of procedure zf_get_control [2024-10-11 20:26:28,958 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2024-10-11 20:26:28,958 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2024-10-11 20:26:28,958 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2024-10-11 20:26:28,958 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2024-10-11 20:26:28,958 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2024-10-11 20:26:28,958 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2024-10-11 20:26:28,958 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#6 [2024-10-11 20:26:28,958 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#7 [2024-10-11 20:26:28,959 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#8 [2024-10-11 20:26:28,959 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#9 [2024-10-11 20:26:28,959 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#10 [2024-10-11 20:26:28,959 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#11 [2024-10-11 20:26:28,960 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#12 [2024-10-11 20:26:28,960 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#13 [2024-10-11 20:26:28,960 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#14 [2024-10-11 20:26:28,960 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#15 [2024-10-11 20:26:28,960 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#16 [2024-10-11 20:26:28,960 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#17 [2024-10-11 20:26:28,960 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#18 [2024-10-11 20:26:28,960 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#19 [2024-10-11 20:26:28,961 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#20 [2024-10-11 20:26:28,961 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#21 [2024-10-11 20:26:28,961 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#22 [2024-10-11 20:26:28,961 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#23 [2024-10-11 20:26:28,961 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#24 [2024-10-11 20:26:28,961 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#25 [2024-10-11 20:26:28,962 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#26 [2024-10-11 20:26:28,962 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-11 20:26:28,962 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-11 20:26:28,962 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-11 20:26:28,962 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-10-11 20:26:28,963 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-10-11 20:26:28,963 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-10-11 20:26:28,963 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-10-11 20:26:28,963 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2024-10-11 20:26:28,963 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2024-10-11 20:26:28,963 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2024-10-11 20:26:28,963 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2024-10-11 20:26:28,963 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2024-10-11 20:26:28,964 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2024-10-11 20:26:28,964 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2024-10-11 20:26:28,964 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2024-10-11 20:26:28,964 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2024-10-11 20:26:28,964 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#16 [2024-10-11 20:26:28,964 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#17 [2024-10-11 20:26:28,964 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#18 [2024-10-11 20:26:28,964 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#19 [2024-10-11 20:26:28,964 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#20 [2024-10-11 20:26:28,964 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#21 [2024-10-11 20:26:28,964 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#22 [2024-10-11 20:26:28,964 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#23 [2024-10-11 20:26:28,964 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#24 [2024-10-11 20:26:28,965 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#25 [2024-10-11 20:26:28,965 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#26 [2024-10-11 20:26:28,965 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-11 20:26:28,965 INFO L130 BoogieDeclarations]: Found specification of procedure request_region [2024-10-11 20:26:28,965 INFO L138 BoogieDeclarations]: Found implementation of procedure request_region [2024-10-11 20:26:28,965 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 20:26:28,965 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-11 20:26:28,965 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-11 20:26:28,965 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-11 20:26:28,965 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-10-11 20:26:28,965 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2024-10-11 20:26:28,965 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2024-10-11 20:26:28,965 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2024-10-11 20:26:28,965 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2024-10-11 20:26:28,965 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2024-10-11 20:26:28,965 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2024-10-11 20:26:28,965 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2024-10-11 20:26:28,965 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2024-10-11 20:26:28,965 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2024-10-11 20:26:28,966 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2024-10-11 20:26:28,966 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#14 [2024-10-11 20:26:28,966 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#15 [2024-10-11 20:26:28,966 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#16 [2024-10-11 20:26:28,966 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#17 [2024-10-11 20:26:28,966 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#18 [2024-10-11 20:26:28,966 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#19 [2024-10-11 20:26:28,966 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#20 [2024-10-11 20:26:28,966 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#21 [2024-10-11 20:26:28,966 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#22 [2024-10-11 20:26:28,966 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#23 [2024-10-11 20:26:28,966 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#24 [2024-10-11 20:26:28,966 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#25 [2024-10-11 20:26:28,966 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#26 [2024-10-11 20:26:28,966 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2024-10-11 20:26:28,966 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2024-10-11 20:26:28,966 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock_irqsave [2024-10-11 20:26:28,966 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock_irqsave [2024-10-11 20:26:28,967 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~TO~VOID [2024-10-11 20:26:28,967 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~TO~VOID [2024-10-11 20:26:28,967 INFO L130 BoogieDeclarations]: Found specification of procedure release_region [2024-10-11 20:26:28,967 INFO L138 BoogieDeclarations]: Found implementation of procedure release_region [2024-10-11 20:26:28,967 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 20:26:28,967 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 20:26:28,967 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock_init [2024-10-11 20:26:28,967 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock_init [2024-10-11 20:26:28,967 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2024-10-11 20:26:28,967 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2024-10-11 20:26:28,967 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2024-10-11 20:26:28,967 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2024-10-11 20:26:28,967 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#4 [2024-10-11 20:26:28,967 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#5 [2024-10-11 20:26:28,967 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#6 [2024-10-11 20:26:28,967 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#7 [2024-10-11 20:26:28,967 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#8 [2024-10-11 20:26:28,967 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#9 [2024-10-11 20:26:28,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#10 [2024-10-11 20:26:28,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#11 [2024-10-11 20:26:28,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#12 [2024-10-11 20:26:28,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#13 [2024-10-11 20:26:28,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#14 [2024-10-11 20:26:28,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#15 [2024-10-11 20:26:28,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#16 [2024-10-11 20:26:28,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#17 [2024-10-11 20:26:28,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#18 [2024-10-11 20:26:28,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#19 [2024-10-11 20:26:28,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#20 [2024-10-11 20:26:28,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#21 [2024-10-11 20:26:28,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#22 [2024-10-11 20:26:28,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#23 [2024-10-11 20:26:28,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#24 [2024-10-11 20:26:28,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#25 [2024-10-11 20:26:28,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#26 [2024-10-11 20:26:28,968 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 20:26:28,968 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 20:26:28,969 INFO L130 BoogieDeclarations]: Found specification of procedure del_timer [2024-10-11 20:26:28,969 INFO L138 BoogieDeclarations]: Found implementation of procedure del_timer [2024-10-11 20:26:28,969 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-11 20:26:28,969 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-11 20:26:28,969 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-11 20:26:28,969 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-11 20:26:28,969 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-10-11 20:26:28,969 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2024-10-11 20:26:28,969 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2024-10-11 20:26:28,969 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2024-10-11 20:26:28,969 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2024-10-11 20:26:28,969 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2024-10-11 20:26:28,969 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2024-10-11 20:26:28,969 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2024-10-11 20:26:28,969 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2024-10-11 20:26:28,969 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2024-10-11 20:26:28,969 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2024-10-11 20:26:28,969 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#14 [2024-10-11 20:26:28,969 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#15 [2024-10-11 20:26:28,970 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#16 [2024-10-11 20:26:28,970 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#17 [2024-10-11 20:26:28,970 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#18 [2024-10-11 20:26:28,970 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#19 [2024-10-11 20:26:28,970 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#20 [2024-10-11 20:26:28,970 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#21 [2024-10-11 20:26:28,970 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#22 [2024-10-11 20:26:28,970 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#23 [2024-10-11 20:26:28,970 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#24 [2024-10-11 20:26:28,970 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#25 [2024-10-11 20:26:28,970 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#26 [2024-10-11 20:26:28,970 INFO L130 BoogieDeclarations]: Found specification of procedure add_timer [2024-10-11 20:26:28,970 INFO L138 BoogieDeclarations]: Found implementation of procedure add_timer [2024-10-11 20:26:28,970 INFO L130 BoogieDeclarations]: Found specification of procedure cdev_add [2024-10-11 20:26:28,970 INFO L138 BoogieDeclarations]: Found implementation of procedure cdev_add [2024-10-11 20:26:28,970 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~X~int~X~$Pointer$~TO~int [2024-10-11 20:26:28,970 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~X~int~X~$Pointer$~TO~int [2024-10-11 20:26:28,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-10-11 20:26:28,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-10-11 20:26:28,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-10-11 20:26:28,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2024-10-11 20:26:28,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2024-10-11 20:26:28,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2024-10-11 20:26:28,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2024-10-11 20:26:28,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2024-10-11 20:26:28,972 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2024-10-11 20:26:28,972 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2024-10-11 20:26:28,972 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#10 [2024-10-11 20:26:28,972 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#11 [2024-10-11 20:26:28,972 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#12 [2024-10-11 20:26:28,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#13 [2024-10-11 20:26:28,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#14 [2024-10-11 20:26:28,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#15 [2024-10-11 20:26:28,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#16 [2024-10-11 20:26:28,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#17 [2024-10-11 20:26:28,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#18 [2024-10-11 20:26:28,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#19 [2024-10-11 20:26:28,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#20 [2024-10-11 20:26:28,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#21 [2024-10-11 20:26:28,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#22 [2024-10-11 20:26:28,975 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#23 [2024-10-11 20:26:28,975 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#24 [2024-10-11 20:26:28,975 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#25 [2024-10-11 20:26:28,975 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#26 [2024-10-11 20:26:28,975 INFO L130 BoogieDeclarations]: Found specification of procedure printk [2024-10-11 20:26:28,975 INFO L138 BoogieDeclarations]: Found implementation of procedure printk [2024-10-11 20:26:28,975 INFO L130 BoogieDeclarations]: Found specification of procedure outw [2024-10-11 20:26:28,975 INFO L138 BoogieDeclarations]: Found implementation of procedure outw [2024-10-11 20:26:28,975 INFO L130 BoogieDeclarations]: Found specification of procedure outb [2024-10-11 20:26:28,975 INFO L138 BoogieDeclarations]: Found implementation of procedure outb [2024-10-11 20:26:28,975 INFO L130 BoogieDeclarations]: Found specification of procedure misc_deregister [2024-10-11 20:26:28,976 INFO L138 BoogieDeclarations]: Found implementation of procedure misc_deregister [2024-10-11 20:26:28,976 INFO L130 BoogieDeclarations]: Found specification of procedure assert_context_process [2024-10-11 20:26:28,976 INFO L138 BoogieDeclarations]: Found implementation of procedure assert_context_process [2024-10-11 20:26:28,976 INFO L130 BoogieDeclarations]: Found specification of procedure zf_set_control [2024-10-11 20:26:28,976 INFO L138 BoogieDeclarations]: Found implementation of procedure zf_set_control [2024-10-11 20:26:28,976 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-11 20:26:28,976 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-11 20:26:28,976 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-11 20:26:28,976 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-10-11 20:26:28,976 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-10-11 20:26:28,976 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-10-11 20:26:28,977 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2024-10-11 20:26:28,977 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2024-10-11 20:26:28,977 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2024-10-11 20:26:28,977 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2024-10-11 20:26:28,977 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2024-10-11 20:26:28,977 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2024-10-11 20:26:28,977 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2024-10-11 20:26:28,977 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2024-10-11 20:26:28,977 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2024-10-11 20:26:28,977 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2024-10-11 20:26:28,977 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#16 [2024-10-11 20:26:28,977 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#17 [2024-10-11 20:26:28,978 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#18 [2024-10-11 20:26:28,978 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#19 [2024-10-11 20:26:28,978 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#20 [2024-10-11 20:26:28,979 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#21 [2024-10-11 20:26:28,979 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#22 [2024-10-11 20:26:28,979 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#23 [2024-10-11 20:26:28,980 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#24 [2024-10-11 20:26:28,980 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#25 [2024-10-11 20:26:28,980 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#26 [2024-10-11 20:26:28,980 INFO L130 BoogieDeclarations]: Found specification of procedure zf_readw [2024-10-11 20:26:28,980 INFO L138 BoogieDeclarations]: Found implementation of procedure zf_readw [2024-10-11 20:26:28,980 INFO L130 BoogieDeclarations]: Found specification of procedure zf_ping [2024-10-11 20:26:28,980 INFO L138 BoogieDeclarations]: Found implementation of procedure zf_ping [2024-10-11 20:26:28,981 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~X~int~X~int~TO~int [2024-10-11 20:26:28,981 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~X~int~X~int~TO~int [2024-10-11 20:26:28,981 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock [2024-10-11 20:26:28,981 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock [2024-10-11 20:26:28,981 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~TO~int [2024-10-11 20:26:28,981 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~TO~int [2024-10-11 20:26:28,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 20:26:28,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 20:26:28,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-11 20:26:28,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-11 20:26:28,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-10-11 20:26:28,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-10-11 20:26:28,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-10-11 20:26:28,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2024-10-11 20:26:28,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2024-10-11 20:26:28,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2024-10-11 20:26:28,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2024-10-11 20:26:28,983 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2024-10-11 20:26:28,983 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2024-10-11 20:26:28,983 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2024-10-11 20:26:28,983 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2024-10-11 20:26:28,983 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2024-10-11 20:26:28,983 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2024-10-11 20:26:28,983 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2024-10-11 20:26:28,983 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2024-10-11 20:26:28,983 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2024-10-11 20:26:28,983 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#20 [2024-10-11 20:26:28,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#21 [2024-10-11 20:26:28,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#22 [2024-10-11 20:26:28,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#23 [2024-10-11 20:26:28,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#24 [2024-10-11 20:26:28,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#25 [2024-10-11 20:26:28,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#26 [2024-10-11 20:26:29,337 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 20:26:29,339 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 20:26:30,176 INFO L? ?]: Removed 461 outVars from TransFormulas that were not future-live. [2024-10-11 20:26:30,176 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 20:26:30,298 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 20:26:30,299 INFO L314 CfgBuilder]: Removed 4 assume(true) statements. [2024-10-11 20:26:30,299 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:26:30 BoogieIcfgContainer [2024-10-11 20:26:30,299 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 20:26:30,301 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 20:26:30,301 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 20:26:30,303 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 20:26:30,304 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 08:26:27" (1/3) ... [2024-10-11 20:26:30,304 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78e3486f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 08:26:30, skipping insertion in model container [2024-10-11 20:26:30,304 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:26:28" (2/3) ... [2024-10-11 20:26:30,304 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78e3486f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 08:26:30, skipping insertion in model container [2024-10-11 20:26:30,305 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:26:30" (3/3) ... [2024-10-11 20:26:30,305 INFO L112 eAbstractionObserver]: Analyzing ICFG ddv_machzwd_inw.i [2024-10-11 20:26:30,317 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 20:26:30,317 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 21 error locations. [2024-10-11 20:26:30,408 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 20:26:30,416 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;@215016ae, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 20:26:30,420 INFO L334 AbstractCegarLoop]: Starting to check reachability of 21 error locations. [2024-10-11 20:26:30,431 INFO L276 IsEmpty]: Start isEmpty. Operand has 384 states, 258 states have (on average 1.4883720930232558) internal successors, (384), 285 states have internal predecessors, (384), 78 states have call successors, (78), 26 states have call predecessors, (78), 26 states have return successors, (78), 78 states have call predecessors, (78), 78 states have call successors, (78) [2024-10-11 20:26:30,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-11 20:26:30,440 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:26:30,440 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:26:30,441 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [cdev_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, cdev_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, zf_readwErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2024-10-11 20:26:30,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:26:30,448 INFO L85 PathProgramCache]: Analyzing trace with hash 1515825276, now seen corresponding path program 1 times [2024-10-11 20:26:30,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:26:30,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195539663] [2024-10-11 20:26:30,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:26:30,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:26:30,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:26:30,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:26:30,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:26:30,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:26:30,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:26:30,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195539663] [2024-10-11 20:26:30,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195539663] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:26:30,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:26:30,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 20:26:30,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872019703] [2024-10-11 20:26:30,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:26:30,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 20:26:30,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:26:30,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 20:26:30,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 20:26:30,978 INFO L87 Difference]: Start difference. First operand has 384 states, 258 states have (on average 1.4883720930232558) internal successors, (384), 285 states have internal predecessors, (384), 78 states have call successors, (78), 26 states have call predecessors, (78), 26 states have return successors, (78), 78 states have call predecessors, (78), 78 states have call successors, (78) Second operand has 5 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 20:26:31,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:26:31,548 INFO L93 Difference]: Finished difference Result 772 states and 1113 transitions. [2024-10-11 20:26:31,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 20:26:31,550 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 7 [2024-10-11 20:26:31,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:26:31,559 INFO L225 Difference]: With dead ends: 772 [2024-10-11 20:26:31,560 INFO L226 Difference]: Without dead ends: 388 [2024-10-11 20:26:31,568 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 20:26:31,570 INFO L432 NwaCegarLoop]: 423 mSDtfsCounter, 99 mSDsluCounter, 1026 mSDsCounter, 0 mSdLazyCounter, 489 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 1449 SdHoareTripleChecker+Invalid, 567 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 489 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 20:26:31,572 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 1449 Invalid, 567 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 489 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 20:26:31,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2024-10-11 20:26:31,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 380. [2024-10-11 20:26:31,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 380 states, 259 states have (on average 1.444015444015444) internal successors, (374), 284 states have internal predecessors, (374), 76 states have call successors, (76), 26 states have call predecessors, (76), 26 states have return successors, (75), 75 states have call predecessors, (75), 75 states have call successors, (75) [2024-10-11 20:26:31,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 525 transitions. [2024-10-11 20:26:31,672 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 525 transitions. Word has length 7 [2024-10-11 20:26:31,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:26:31,672 INFO L471 AbstractCegarLoop]: Abstraction has 380 states and 525 transitions. [2024-10-11 20:26:31,672 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 20:26:31,672 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 525 transitions. [2024-10-11 20:26:31,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-11 20:26:31,673 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:26:31,673 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:26:31,673 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 20:26:31,673 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [cdev_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, cdev_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, zf_readwErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2024-10-11 20:26:31,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:26:31,674 INFO L85 PathProgramCache]: Analyzing trace with hash 665144828, now seen corresponding path program 1 times [2024-10-11 20:26:31,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:26:31,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394213868] [2024-10-11 20:26:31,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:26:31,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:26:31,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:26:31,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:26:31,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:26:31,949 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:26:31,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:26:31,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394213868] [2024-10-11 20:26:31,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394213868] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:26:31,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [543412626] [2024-10-11 20:26:31,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:26:31,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:26:31,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:26:31,952 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:26:31,953 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 20:26:32,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:26:32,254 INFO L255 TraceCheckSpWp]: Trace formula consists of 700 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 20:26:32,258 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:26:32,316 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:26:32,316 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 20:26:32,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [543412626] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:26:32,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 20:26:32,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 8 [2024-10-11 20:26:32,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506293659] [2024-10-11 20:26:32,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:26:32,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 20:26:32,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:26:32,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 20:26:32,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-10-11 20:26:32,322 INFO L87 Difference]: Start difference. First operand 380 states and 525 transitions. Second operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 20:26:32,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:26:32,525 INFO L93 Difference]: Finished difference Result 380 states and 525 transitions. [2024-10-11 20:26:32,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 20:26:32,529 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2024-10-11 20:26:32,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:26:32,532 INFO L225 Difference]: With dead ends: 380 [2024-10-11 20:26:32,532 INFO L226 Difference]: Without dead ends: 379 [2024-10-11 20:26:32,532 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-10-11 20:26:32,533 INFO L432 NwaCegarLoop]: 478 mSDtfsCounter, 1 mSDsluCounter, 950 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1428 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 20:26:32,535 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1428 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 20:26:32,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2024-10-11 20:26:32,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 379. [2024-10-11 20:26:32,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 379 states, 259 states have (on average 1.4401544401544402) internal successors, (373), 283 states have internal predecessors, (373), 76 states have call successors, (76), 26 states have call predecessors, (76), 26 states have return successors, (75), 75 states have call predecessors, (75), 75 states have call successors, (75) [2024-10-11 20:26:32,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 524 transitions. [2024-10-11 20:26:32,563 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 524 transitions. Word has length 10 [2024-10-11 20:26:32,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:26:32,563 INFO L471 AbstractCegarLoop]: Abstraction has 379 states and 524 transitions. [2024-10-11 20:26:32,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 20:26:32,564 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 524 transitions. [2024-10-11 20:26:32,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-11 20:26:32,564 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:26:32,564 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:26:32,579 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 20:26:32,765 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:26:32,765 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [cdev_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, cdev_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, zf_readwErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2024-10-11 20:26:32,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:26:32,766 INFO L85 PathProgramCache]: Analyzing trace with hash -855346332, now seen corresponding path program 1 times [2024-10-11 20:26:32,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:26:32,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843320984] [2024-10-11 20:26:32,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:26:32,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:26:32,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:26:32,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:26:32,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:26:32,864 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 20:26:32,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:26:32,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843320984] [2024-10-11 20:26:32,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [843320984] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:26:32,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:26:32,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 20:26:32,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746779958] [2024-10-11 20:26:32,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:26:32,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 20:26:32,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:26:32,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 20:26:32,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:26:32,866 INFO L87 Difference]: Start difference. First operand 379 states and 524 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 20:26:33,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:26:33,235 INFO L93 Difference]: Finished difference Result 387 states and 535 transitions. [2024-10-11 20:26:33,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 20:26:33,236 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2024-10-11 20:26:33,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:26:33,238 INFO L225 Difference]: With dead ends: 387 [2024-10-11 20:26:33,238 INFO L226 Difference]: Without dead ends: 386 [2024-10-11 20:26:33,239 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:26:33,239 INFO L432 NwaCegarLoop]: 415 mSDtfsCounter, 98 mSDsluCounter, 642 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 1057 SdHoareTripleChecker+Invalid, 392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 20:26:33,240 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 1057 Invalid, 392 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 20:26:33,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2024-10-11 20:26:33,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 376. [2024-10-11 20:26:33,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 376 states, 257 states have (on average 1.4396887159533074) internal successors, (370), 280 states have internal predecessors, (370), 76 states have call successors, (76), 26 states have call predecessors, (76), 26 states have return successors, (75), 75 states have call predecessors, (75), 75 states have call successors, (75) [2024-10-11 20:26:33,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 521 transitions. [2024-10-11 20:26:33,252 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 521 transitions. Word has length 11 [2024-10-11 20:26:33,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:26:33,252 INFO L471 AbstractCegarLoop]: Abstraction has 376 states and 521 transitions. [2024-10-11 20:26:33,252 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 20:26:33,252 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 521 transitions. [2024-10-11 20:26:33,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-11 20:26:33,252 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:26:33,253 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:26:33,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 20:26:33,253 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [cdev_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, cdev_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, zf_readwErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2024-10-11 20:26:33,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:26:33,253 INFO L85 PathProgramCache]: Analyzing trace with hash -766341769, now seen corresponding path program 1 times [2024-10-11 20:26:33,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:26:33,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853810094] [2024-10-11 20:26:33,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:26:33,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:26:33,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:26:33,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:26:33,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:26:33,373 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:26:33,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:26:33,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853810094] [2024-10-11 20:26:33,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853810094] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:26:33,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [706624173] [2024-10-11 20:26:33,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:26:33,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:26:33,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:26:33,375 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:26:33,380 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 20:26:33,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:26:33,728 INFO L255 TraceCheckSpWp]: Trace formula consists of 711 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 20:26:33,729 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:26:33,744 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:26:33,744 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:26:33,773 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 20:26:33,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [706624173] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:26:33,774 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:26:33,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 11 [2024-10-11 20:26:33,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078312056] [2024-10-11 20:26:33,774 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:26:33,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 20:26:33,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:26:33,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 20:26:33,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2024-10-11 20:26:33,775 INFO L87 Difference]: Start difference. First operand 376 states and 521 transitions. Second operand has 11 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 10 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 20:26:34,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:26:34,400 INFO L93 Difference]: Finished difference Result 759 states and 1052 transitions. [2024-10-11 20:26:34,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 20:26:34,401 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 10 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2024-10-11 20:26:34,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:26:34,403 INFO L225 Difference]: With dead ends: 759 [2024-10-11 20:26:34,403 INFO L226 Difference]: Without dead ends: 390 [2024-10-11 20:26:34,404 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2024-10-11 20:26:34,405 INFO L432 NwaCegarLoop]: 415 mSDtfsCounter, 98 mSDsluCounter, 2122 mSDsCounter, 0 mSdLazyCounter, 914 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 2537 SdHoareTripleChecker+Invalid, 988 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 914 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 20:26:34,405 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 2537 Invalid, 988 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 914 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 20:26:34,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2024-10-11 20:26:34,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 382. [2024-10-11 20:26:34,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 382 states, 263 states have (on average 1.429657794676806) internal successors, (376), 286 states have internal predecessors, (376), 76 states have call successors, (76), 26 states have call predecessors, (76), 26 states have return successors, (75), 75 states have call predecessors, (75), 75 states have call successors, (75) [2024-10-11 20:26:34,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 527 transitions. [2024-10-11 20:26:34,416 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 527 transitions. Word has length 12 [2024-10-11 20:26:34,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:26:34,417 INFO L471 AbstractCegarLoop]: Abstraction has 382 states and 527 transitions. [2024-10-11 20:26:34,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 10 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 20:26:34,417 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 527 transitions. [2024-10-11 20:26:34,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-11 20:26:34,417 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:26:34,417 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:26:34,438 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-11 20:26:34,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:26:34,619 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [cdev_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, cdev_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, zf_readwErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2024-10-11 20:26:34,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:26:34,619 INFO L85 PathProgramCache]: Analyzing trace with hash -1778352777, now seen corresponding path program 2 times [2024-10-11 20:26:34,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:26:34,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232557535] [2024-10-11 20:26:34,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:26:34,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:26:34,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:26:34,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:26:34,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:26:34,738 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 20:26:34,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:26:34,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232557535] [2024-10-11 20:26:34,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1232557535] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:26:34,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:26:34,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 20:26:34,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085255923] [2024-10-11 20:26:34,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:26:34,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 20:26:34,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:26:34,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 20:26:34,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 20:26:34,740 INFO L87 Difference]: Start difference. First operand 382 states and 527 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 20:26:35,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:26:35,132 INFO L93 Difference]: Finished difference Result 394 states and 542 transitions. [2024-10-11 20:26:35,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 20:26:35,133 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2024-10-11 20:26:35,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:26:35,134 INFO L225 Difference]: With dead ends: 394 [2024-10-11 20:26:35,135 INFO L226 Difference]: Without dead ends: 392 [2024-10-11 20:26:35,135 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 20:26:35,135 INFO L432 NwaCegarLoop]: 415 mSDtfsCounter, 99 mSDsluCounter, 1010 mSDsCounter, 0 mSdLazyCounter, 471 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 1425 SdHoareTripleChecker+Invalid, 545 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 471 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 20:26:35,136 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 1425 Invalid, 545 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 471 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 20:26:35,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2024-10-11 20:26:35,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 384. [2024-10-11 20:26:35,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 384 states, 265 states have (on average 1.4264150943396225) internal successors, (378), 288 states have internal predecessors, (378), 76 states have call successors, (76), 26 states have call predecessors, (76), 26 states have return successors, (75), 75 states have call predecessors, (75), 75 states have call successors, (75) [2024-10-11 20:26:35,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 529 transitions. [2024-10-11 20:26:35,146 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 529 transitions. Word has length 18 [2024-10-11 20:26:35,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:26:35,146 INFO L471 AbstractCegarLoop]: Abstraction has 384 states and 529 transitions. [2024-10-11 20:26:35,147 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 20:26:35,147 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 529 transitions. [2024-10-11 20:26:35,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-11 20:26:35,147 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:26:35,147 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:26:35,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 20:26:35,147 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [cdev_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, cdev_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, zf_readwErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2024-10-11 20:26:35,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:26:35,148 INFO L85 PathProgramCache]: Analyzing trace with hash -485468382, now seen corresponding path program 1 times [2024-10-11 20:26:35,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:26:35,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914402472] [2024-10-11 20:26:35,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:26:35,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:26:35,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:26:35,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:26:35,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:26:35,311 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 20:26:35,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:26:35,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914402472] [2024-10-11 20:26:35,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914402472] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:26:35,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [349163062] [2024-10-11 20:26:35,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:26:35,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:26:35,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:26:35,313 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:26:35,314 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 20:26:35,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:26:35,733 INFO L255 TraceCheckSpWp]: Trace formula consists of 776 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-11 20:26:35,735 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:26:35,794 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 20:26:35,794 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:26:35,883 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 20:26:35,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [349163062] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:26:35,884 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:26:35,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 9] total 20 [2024-10-11 20:26:35,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014783234] [2024-10-11 20:26:35,884 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:26:35,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-10-11 20:26:35,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:26:35,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-10-11 20:26:35,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=292, Unknown=0, NotChecked=0, Total=380 [2024-10-11 20:26:35,886 INFO L87 Difference]: Start difference. First operand 384 states and 529 transitions. Second operand has 20 states, 20 states have (on average 2.0) internal successors, (40), 19 states have internal predecessors, (40), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 20:26:36,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:26:36,859 INFO L93 Difference]: Finished difference Result 771 states and 1066 transitions. [2024-10-11 20:26:36,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-11 20:26:36,859 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.0) internal successors, (40), 19 states have internal predecessors, (40), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2024-10-11 20:26:36,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:26:36,861 INFO L225 Difference]: With dead ends: 771 [2024-10-11 20:26:36,862 INFO L226 Difference]: Without dead ends: 400 [2024-10-11 20:26:36,863 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=98, Invalid=322, Unknown=0, NotChecked=0, Total=420 [2024-10-11 20:26:36,864 INFO L432 NwaCegarLoop]: 410 mSDtfsCounter, 98 mSDsluCounter, 3944 mSDsCounter, 0 mSdLazyCounter, 1663 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 4354 SdHoareTripleChecker+Invalid, 1738 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 1663 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-11 20:26:36,864 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 4354 Invalid, 1738 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 1663 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-11 20:26:36,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2024-10-11 20:26:36,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 392. [2024-10-11 20:26:36,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 275 states have (on average 1.4) internal successors, (385), 296 states have internal predecessors, (385), 76 states have call successors, (76), 26 states have call predecessors, (76), 26 states have return successors, (75), 75 states have call predecessors, (75), 75 states have call successors, (75) [2024-10-11 20:26:36,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 536 transitions. [2024-10-11 20:26:36,876 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 536 transitions. Word has length 21 [2024-10-11 20:26:36,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:26:36,876 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 536 transitions. [2024-10-11 20:26:36,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.0) internal successors, (40), 19 states have internal predecessors, (40), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 20:26:36,877 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 536 transitions. [2024-10-11 20:26:36,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-10-11 20:26:36,877 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:26:36,878 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 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-10-11 20:26:36,894 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-11 20:26:37,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:26:37,079 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting zf_readwErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [cdev_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, cdev_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, zf_readwErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2024-10-11 20:26:37,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:26:37,079 INFO L85 PathProgramCache]: Analyzing trace with hash -1546486035, now seen corresponding path program 1 times [2024-10-11 20:26:37,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:26:37,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047455139] [2024-10-11 20:26:37,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:26:37,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:26:37,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:26:37,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:26:37,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:26:37,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-11 20:26:37,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:26:37,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-11 20:26:37,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:26:37,284 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2024-10-11 20:26:37,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:26:37,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047455139] [2024-10-11 20:26:37,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047455139] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:26:37,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:26:37,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 20:26:37,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867820615] [2024-10-11 20:26:37,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:26:37,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 20:26:37,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:26:37,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 20:26:37,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:26:37,286 INFO L87 Difference]: Start difference. First operand 392 states and 536 transitions. Second operand has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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-10-11 20:26:37,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:26:37,781 INFO L93 Difference]: Finished difference Result 699 states and 967 transitions. [2024-10-11 20:26:37,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 20:26:37,781 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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 45 [2024-10-11 20:26:37,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:26:37,784 INFO L225 Difference]: With dead ends: 699 [2024-10-11 20:26:37,784 INFO L226 Difference]: Without dead ends: 695 [2024-10-11 20:26:37,788 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 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-10-11 20:26:37,789 INFO L432 NwaCegarLoop]: 423 mSDtfsCounter, 575 mSDsluCounter, 594 mSDsCounter, 0 mSdLazyCounter, 312 mSolverCounterSat, 179 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 622 SdHoareTripleChecker+Valid, 1017 SdHoareTripleChecker+Invalid, 491 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 179 IncrementalHoareTripleChecker+Valid, 312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 20:26:37,789 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [622 Valid, 1017 Invalid, 491 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [179 Valid, 312 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 20:26:37,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 695 states. [2024-10-11 20:26:37,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 695 to 673. [2024-10-11 20:26:37,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 673 states, 476 states have (on average 1.4138655462184875) internal successors, (673), 501 states have internal predecessors, (673), 134 states have call successors, (134), 48 states have call predecessors, (134), 48 states have return successors, (133), 133 states have call predecessors, (133), 133 states have call successors, (133) [2024-10-11 20:26:37,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 673 states to 673 states and 940 transitions. [2024-10-11 20:26:37,830 INFO L78 Accepts]: Start accepts. Automaton has 673 states and 940 transitions. Word has length 45 [2024-10-11 20:26:37,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:26:37,830 INFO L471 AbstractCegarLoop]: Abstraction has 673 states and 940 transitions. [2024-10-11 20:26:37,830 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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-10-11 20:26:37,830 INFO L276 IsEmpty]: Start isEmpty. Operand 673 states and 940 transitions. [2024-10-11 20:26:37,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-10-11 20:26:37,831 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:26:37,831 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 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-10-11 20:26:37,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 20:26:37,832 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [cdev_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, cdev_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, zf_readwErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2024-10-11 20:26:37,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:26:37,836 INFO L85 PathProgramCache]: Analyzing trace with hash 1898807483, now seen corresponding path program 1 times [2024-10-11 20:26:37,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:26:37,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295431649] [2024-10-11 20:26:37,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:26:37,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:26:37,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:26:38,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:26:38,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:26:38,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-11 20:26:38,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:26:38,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 20:26:38,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:26:38,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:26:38,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:26:38,138 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2024-10-11 20:26:38,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:26:38,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295431649] [2024-10-11 20:26:38,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295431649] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:26:38,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:26:38,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 20:26:38,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478070524] [2024-10-11 20:26:38,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:26:38,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 20:26:38,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:26:38,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 20:26:38,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:26:38,139 INFO L87 Difference]: Start difference. First operand 673 states and 940 transitions. Second operand has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-11 20:26:38,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:26:38,654 INFO L93 Difference]: Finished difference Result 1319 states and 1851 transitions. [2024-10-11 20:26:38,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 20:26:38,654 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 52 [2024-10-11 20:26:38,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:26:38,657 INFO L225 Difference]: With dead ends: 1319 [2024-10-11 20:26:38,661 INFO L226 Difference]: Without dead ends: 687 [2024-10-11 20:26:38,662 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 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-10-11 20:26:38,663 INFO L432 NwaCegarLoop]: 402 mSDtfsCounter, 520 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 560 SdHoareTripleChecker+Valid, 661 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 20:26:38,667 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [560 Valid, 661 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 20:26:38,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2024-10-11 20:26:38,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 671. [2024-10-11 20:26:38,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 671 states, 475 states have (on average 1.408421052631579) internal successors, (669), 499 states have internal predecessors, (669), 134 states have call successors, (134), 48 states have call predecessors, (134), 48 states have return successors, (133), 133 states have call predecessors, (133), 133 states have call successors, (133) [2024-10-11 20:26:38,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 671 states to 671 states and 936 transitions. [2024-10-11 20:26:38,707 INFO L78 Accepts]: Start accepts. Automaton has 671 states and 936 transitions. Word has length 52 [2024-10-11 20:26:38,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:26:38,707 INFO L471 AbstractCegarLoop]: Abstraction has 671 states and 936 transitions. [2024-10-11 20:26:38,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-11 20:26:38,707 INFO L276 IsEmpty]: Start isEmpty. Operand 671 states and 936 transitions. [2024-10-11 20:26:38,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-10-11 20:26:38,712 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:26:38,712 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 3, 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] [2024-10-11 20:26:38,712 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 20:26:38,712 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [cdev_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, cdev_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, zf_readwErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2024-10-11 20:26:38,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:26:38,713 INFO L85 PathProgramCache]: Analyzing trace with hash -448423358, now seen corresponding path program 1 times [2024-10-11 20:26:38,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:26:38,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485572652] [2024-10-11 20:26:38,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:26:38,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:26:38,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:26:39,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:26:39,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:26:39,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-11 20:26:39,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:26:39,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 20:26:39,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:26:39,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:26:39,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:26:39,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-11 20:26:39,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:26:39,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 20:26:39,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:26:39,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 20:26:39,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:26:39,129 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2024-10-11 20:26:39,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:26:39,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485572652] [2024-10-11 20:26:39,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1485572652] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:26:39,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:26:39,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 20:26:39,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121535349] [2024-10-11 20:26:39,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:26:39,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 20:26:39,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:26:39,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 20:26:39,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 20:26:39,134 INFO L87 Difference]: Start difference. First operand 671 states and 936 transitions. Second operand has 5 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-11 20:26:39,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:26:39,895 INFO L93 Difference]: Finished difference Result 1576 states and 2218 transitions. [2024-10-11 20:26:39,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 20:26:39,896 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 68 [2024-10-11 20:26:39,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:26:39,899 INFO L225 Difference]: With dead ends: 1576 [2024-10-11 20:26:39,900 INFO L226 Difference]: Without dead ends: 975 [2024-10-11 20:26:39,901 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-11 20:26:39,901 INFO L432 NwaCegarLoop]: 416 mSDtfsCounter, 531 mSDsluCounter, 972 mSDsCounter, 0 mSdLazyCounter, 499 mSolverCounterSat, 169 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 574 SdHoareTripleChecker+Valid, 1388 SdHoareTripleChecker+Invalid, 668 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 169 IncrementalHoareTripleChecker+Valid, 499 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 20:26:39,902 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [574 Valid, 1388 Invalid, 668 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [169 Valid, 499 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 20:26:39,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 975 states. [2024-10-11 20:26:39,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 975 to 945. [2024-10-11 20:26:39,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 945 states, 673 states have (on average 1.4130757800891531) internal successors, (951), 700 states have internal predecessors, (951), 191 states have call successors, (191), 69 states have call predecessors, (191), 69 states have return successors, (190), 190 states have call predecessors, (190), 190 states have call successors, (190) [2024-10-11 20:26:39,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 945 states to 945 states and 1332 transitions. [2024-10-11 20:26:39,929 INFO L78 Accepts]: Start accepts. Automaton has 945 states and 1332 transitions. Word has length 68 [2024-10-11 20:26:39,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:26:39,929 INFO L471 AbstractCegarLoop]: Abstraction has 945 states and 1332 transitions. [2024-10-11 20:26:39,930 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-11 20:26:39,930 INFO L276 IsEmpty]: Start isEmpty. Operand 945 states and 1332 transitions. [2024-10-11 20:26:39,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-10-11 20:26:39,931 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:26:39,931 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 3, 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] [2024-10-11 20:26:39,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 20:26:39,931 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting zf_pingErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [cdev_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, cdev_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, zf_readwErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2024-10-11 20:26:39,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:26:39,931 INFO L85 PathProgramCache]: Analyzing trace with hash 264084033, now seen corresponding path program 1 times [2024-10-11 20:26:39,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:26:39,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041953496] [2024-10-11 20:26:39,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:26:39,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:26:39,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:26:40,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:26:40,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:26:40,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-11 20:26:40,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:26:40,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 20:26:40,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:26:40,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:26:40,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:26:40,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 20:26:40,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:26:40,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 20:26:40,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:26:40,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 20:26:40,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:26:40,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 20:26:40,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:26:40,070 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2024-10-11 20:26:40,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:26:40,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041953496] [2024-10-11 20:26:40,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041953496] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:26:40,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:26:40,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 20:26:40,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746900395] [2024-10-11 20:26:40,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:26:40,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 20:26:40,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:26:40,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 20:26:40,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 20:26:40,071 INFO L87 Difference]: Start difference. First operand 945 states and 1332 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-11 20:26:40,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:26:40,493 INFO L93 Difference]: Finished difference Result 981 states and 1367 transitions. [2024-10-11 20:26:40,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 20:26:40,494 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 77 [2024-10-11 20:26:40,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:26:40,498 INFO L225 Difference]: With dead ends: 981 [2024-10-11 20:26:40,498 INFO L226 Difference]: Without dead ends: 697 [2024-10-11 20:26:40,499 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 20:26:40,499 INFO L432 NwaCegarLoop]: 408 mSDtfsCounter, 98 mSDsluCounter, 993 mSDsCounter, 0 mSdLazyCounter, 460 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 1401 SdHoareTripleChecker+Invalid, 532 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 460 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 20:26:40,500 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 1401 Invalid, 532 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 460 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 20:26:40,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 697 states. [2024-10-11 20:26:40,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 697 to 681. [2024-10-11 20:26:40,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 681 states, 484 states have (on average 1.3946280991735538) internal successors, (675), 506 states have internal predecessors, (675), 134 states have call successors, (134), 51 states have call predecessors, (134), 51 states have return successors, (133), 133 states have call predecessors, (133), 133 states have call successors, (133) [2024-10-11 20:26:40,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 681 states to 681 states and 942 transitions. [2024-10-11 20:26:40,519 INFO L78 Accepts]: Start accepts. Automaton has 681 states and 942 transitions. Word has length 77 [2024-10-11 20:26:40,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:26:40,520 INFO L471 AbstractCegarLoop]: Abstraction has 681 states and 942 transitions. [2024-10-11 20:26:40,520 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-11 20:26:40,520 INFO L276 IsEmpty]: Start isEmpty. Operand 681 states and 942 transitions. [2024-10-11 20:26:40,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-11 20:26:40,521 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:26:40,521 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:26:40,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 20:26:40,522 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting cdev_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [cdev_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, cdev_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, zf_readwErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2024-10-11 20:26:40,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:26:40,522 INFO L85 PathProgramCache]: Analyzing trace with hash -1711324840, now seen corresponding path program 1 times [2024-10-11 20:26:40,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:26:40,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370664752] [2024-10-11 20:26:40,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:26:40,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:26:40,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:26:40,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:26:40,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:26:40,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-11 20:26:40,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:26:40,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 20:26:40,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:26:40,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:26:40,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:26:40,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-11 20:26:40,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:26:40,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 20:26:40,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:26:40,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 20:26:40,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:26:40,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 20:26:40,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:26:40,811 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2024-10-11 20:26:40,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:26:40,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370664752] [2024-10-11 20:26:40,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370664752] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:26:40,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:26:40,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 20:26:40,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029232688] [2024-10-11 20:26:40,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:26:40,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 20:26:40,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:26:40,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 20:26:40,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 20:26:40,813 INFO L87 Difference]: Start difference. First operand 681 states and 942 transitions. Second operand has 5 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-11 20:26:41,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:26:41,325 INFO L93 Difference]: Finished difference Result 1576 states and 2163 transitions. [2024-10-11 20:26:41,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 20:26:41,326 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 81 [2024-10-11 20:26:41,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:26:41,329 INFO L225 Difference]: With dead ends: 1576 [2024-10-11 20:26:41,330 INFO L226 Difference]: Without dead ends: 965 [2024-10-11 20:26:41,331 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-11 20:26:41,331 INFO L432 NwaCegarLoop]: 425 mSDtfsCounter, 299 mSDsluCounter, 974 mSDsCounter, 0 mSdLazyCounter, 449 mSolverCounterSat, 133 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 335 SdHoareTripleChecker+Valid, 1399 SdHoareTripleChecker+Invalid, 582 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 133 IncrementalHoareTripleChecker+Valid, 449 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 20:26:41,332 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [335 Valid, 1399 Invalid, 582 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [133 Valid, 449 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 20:26:41,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 965 states. [2024-10-11 20:26:41,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 965 to 935. [2024-10-11 20:26:41,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 935 states, 652 states have (on average 1.357361963190184) internal successors, (885), 675 states have internal predecessors, (885), 190 states have call successors, (190), 83 states have call predecessors, (190), 83 states have return successors, (188), 188 states have call predecessors, (188), 187 states have call successors, (188) [2024-10-11 20:26:41,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 935 states to 935 states and 1263 transitions. [2024-10-11 20:26:41,361 INFO L78 Accepts]: Start accepts. Automaton has 935 states and 1263 transitions. Word has length 81 [2024-10-11 20:26:41,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:26:41,362 INFO L471 AbstractCegarLoop]: Abstraction has 935 states and 1263 transitions. [2024-10-11 20:26:41,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-11 20:26:41,362 INFO L276 IsEmpty]: Start isEmpty. Operand 935 states and 1263 transitions. [2024-10-11 20:26:41,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-10-11 20:26:41,365 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:26:41,366 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:26:41,366 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 20:26:41,366 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [cdev_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, cdev_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, zf_readwErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2024-10-11 20:26:41,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:26:41,366 INFO L85 PathProgramCache]: Analyzing trace with hash 2072453282, now seen corresponding path program 1 times [2024-10-11 20:26:41,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:26:41,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318696339] [2024-10-11 20:26:41,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:26:41,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:26:41,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:26:41,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:26:41,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:26:41,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-11 20:26:41,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:26:41,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 20:26:41,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:26:41,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:26:41,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:26:41,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-11 20:26:41,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:26:41,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 20:26:41,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:26:41,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 20:26:41,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:26:41,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 20:26:41,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:26:41,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:26:41,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:26:41,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 20:26:41,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:26:41,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 20:26:41,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:26:41,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-11 20:26:41,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:26:41,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 20:26:41,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:26:41,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:26:41,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:26:41,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 20:26:41,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:26:41,824 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2024-10-11 20:26:41,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:26:41,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318696339] [2024-10-11 20:26:41,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318696339] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:26:41,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:26:41,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 20:26:41,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807971953] [2024-10-11 20:26:41,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:26:41,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 20:26:41,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:26:41,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 20:26:41,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-11 20:26:41,826 INFO L87 Difference]: Start difference. First operand 935 states and 1263 transitions. Second operand has 8 states, 8 states have (on average 7.0) internal successors, (56), 5 states have internal predecessors, (56), 3 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2024-10-11 20:26:42,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:26:42,989 INFO L93 Difference]: Finished difference Result 1826 states and 2483 transitions. [2024-10-11 20:26:42,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 20:26:42,989 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 5 states have internal predecessors, (56), 3 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) Word has length 110 [2024-10-11 20:26:42,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:26:42,993 INFO L225 Difference]: With dead ends: 1826 [2024-10-11 20:26:42,993 INFO L226 Difference]: Without dead ends: 959 [2024-10-11 20:26:42,995 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2024-10-11 20:26:42,996 INFO L432 NwaCegarLoop]: 220 mSDtfsCounter, 804 mSDsluCounter, 817 mSDsCounter, 0 mSdLazyCounter, 1210 mSolverCounterSat, 431 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 830 SdHoareTripleChecker+Valid, 1037 SdHoareTripleChecker+Invalid, 1641 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 431 IncrementalHoareTripleChecker+Valid, 1210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:26:42,996 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [830 Valid, 1037 Invalid, 1641 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [431 Valid, 1210 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-11 20:26:42,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 959 states. [2024-10-11 20:26:43,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 959 to 935. [2024-10-11 20:26:43,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 935 states, 652 states have (on average 1.3542944785276074) internal successors, (883), 675 states have internal predecessors, (883), 190 states have call successors, (190), 83 states have call predecessors, (190), 83 states have return successors, (188), 188 states have call predecessors, (188), 187 states have call successors, (188) [2024-10-11 20:26:43,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 935 states to 935 states and 1261 transitions. [2024-10-11 20:26:43,068 INFO L78 Accepts]: Start accepts. Automaton has 935 states and 1261 transitions. Word has length 110 [2024-10-11 20:26:43,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:26:43,068 INFO L471 AbstractCegarLoop]: Abstraction has 935 states and 1261 transitions. [2024-10-11 20:26:43,069 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 5 states have internal predecessors, (56), 3 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2024-10-11 20:26:43,069 INFO L276 IsEmpty]: Start isEmpty. Operand 935 states and 1261 transitions. [2024-10-11 20:26:43,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-11 20:26:43,070 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:26:43,070 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:26:43,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 20:26:43,070 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [cdev_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, cdev_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, zf_readwErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2024-10-11 20:26:43,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:26:43,071 INFO L85 PathProgramCache]: Analyzing trace with hash 1944326437, now seen corresponding path program 1 times [2024-10-11 20:26:43,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:26:43,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626682962] [2024-10-11 20:26:43,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:26:43,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:26:43,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:26:43,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:26:43,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:26:43,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-11 20:26:43,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:26:43,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 20:26:43,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:26:43,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:26:43,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:26:43,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-11 20:26:43,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:26:43,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 20:26:43,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:26:43,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 20:26:43,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:26:43,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 20:26:43,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:26:43,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:26:43,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:26:43,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-11 20:26:43,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:26:43,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 20:26:43,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:26:43,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 20:26:43,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:26:43,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-11 20:26:43,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:26:43,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:26:43,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:26:43,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 20:26:43,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:26:43,363 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2024-10-11 20:26:43,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:26:43,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626682962] [2024-10-11 20:26:43,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1626682962] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:26:43,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:26:43,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 20:26:43,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828898384] [2024-10-11 20:26:43,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:26:43,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 20:26:43,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:26:43,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 20:26:43,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 20:26:43,366 INFO L87 Difference]: Start difference. First operand 935 states and 1261 transitions. Second operand has 7 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-11 20:26:44,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:26:44,924 INFO L93 Difference]: Finished difference Result 1771 states and 2405 transitions. [2024-10-11 20:26:44,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 20:26:44,924 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 112 [2024-10-11 20:26:44,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:26:44,929 INFO L225 Difference]: With dead ends: 1771 [2024-10-11 20:26:44,929 INFO L226 Difference]: Without dead ends: 1368 [2024-10-11 20:26:44,930 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2024-10-11 20:26:44,931 INFO L432 NwaCegarLoop]: 219 mSDtfsCounter, 1195 mSDsluCounter, 788 mSDsCounter, 0 mSdLazyCounter, 1134 mSolverCounterSat, 716 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1216 SdHoareTripleChecker+Valid, 1007 SdHoareTripleChecker+Invalid, 1850 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 716 IncrementalHoareTripleChecker+Valid, 1134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-11 20:26:44,931 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1216 Valid, 1007 Invalid, 1850 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [716 Valid, 1134 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-11 20:26:44,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1368 states. [2024-10-11 20:26:44,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1368 to 1324. [2024-10-11 20:26:44,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1324 states, 925 states have (on average 1.3632432432432433) internal successors, (1261), 954 states have internal predecessors, (1261), 273 states have call successors, (273), 119 states have call predecessors, (273), 118 states have return successors, (268), 268 states have call predecessors, (268), 267 states have call successors, (268) [2024-10-11 20:26:44,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1324 states to 1324 states and 1802 transitions. [2024-10-11 20:26:44,996 INFO L78 Accepts]: Start accepts. Automaton has 1324 states and 1802 transitions. Word has length 112 [2024-10-11 20:26:44,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:26:44,997 INFO L471 AbstractCegarLoop]: Abstraction has 1324 states and 1802 transitions. [2024-10-11 20:26:44,997 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-11 20:26:44,997 INFO L276 IsEmpty]: Start isEmpty. Operand 1324 states and 1802 transitions. [2024-10-11 20:26:44,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-10-11 20:26:44,998 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:26:44,998 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:26:44,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 20:26:44,998 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting zf_pingErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [cdev_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, cdev_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, zf_readwErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2024-10-11 20:26:44,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:26:45,000 INFO L85 PathProgramCache]: Analyzing trace with hash 131609961, now seen corresponding path program 1 times [2024-10-11 20:26:45,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:26:45,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576474878] [2024-10-11 20:26:45,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:26:45,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:26:45,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:26:45,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:26:45,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:26:45,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-11 20:26:45,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:26:45,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 20:26:45,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:26:45,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:26:45,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:26:45,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-11 20:26:45,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:26:45,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 20:26:45,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:26:45,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 20:26:45,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:26:45,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 20:26:45,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:26:45,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:26:45,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:26:45,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-11 20:26:45,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:26:45,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 20:26:45,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:26:45,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 20:26:45,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:26:45,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-11 20:26:45,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:26:45,538 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-10-11 20:26:45,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:26:45,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576474878] [2024-10-11 20:26:45,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576474878] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 20:26:45,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [354631518] [2024-10-11 20:26:45,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:26:45,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 20:26:45,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:26:45,541 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 20:26:45,543 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-11 20:26:45,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:26:46,004 INFO L255 TraceCheckSpWp]: Trace formula consists of 1264 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-11 20:26:46,009 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:26:46,070 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 4 proven. 70 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-10-11 20:26:46,071 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 20:26:46,255 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-10-11 20:26:46,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [354631518] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 20:26:46,255 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 20:26:46,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17, 17] total 25 [2024-10-11 20:26:46,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954699034] [2024-10-11 20:26:46,255 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 20:26:46,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-10-11 20:26:46,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:26:46,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-10-11 20:26:46,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=453, Unknown=0, NotChecked=0, Total=600 [2024-10-11 20:26:46,257 INFO L87 Difference]: Start difference. First operand 1324 states and 1802 transitions. Second operand has 25 states, 25 states have (on average 4.32) internal successors, (108), 23 states have internal predecessors, (108), 2 states have call successors, (31), 4 states have call predecessors, (31), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2024-10-11 20:26:47,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:26:47,644 INFO L93 Difference]: Finished difference Result 2668 states and 3637 transitions. [2024-10-11 20:26:47,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-10-11 20:26:47,645 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 4.32) internal successors, (108), 23 states have internal predecessors, (108), 2 states have call successors, (31), 4 states have call predecessors, (31), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 115 [2024-10-11 20:26:47,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:26:47,696 INFO L225 Difference]: With dead ends: 2668 [2024-10-11 20:26:47,696 INFO L226 Difference]: Without dead ends: 1369 [2024-10-11 20:26:47,701 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 238 SyntacticMatches, 11 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 340 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=151, Invalid=499, Unknown=0, NotChecked=0, Total=650 [2024-10-11 20:26:47,701 INFO L432 NwaCegarLoop]: 221 mSDtfsCounter, 286 mSDsluCounter, 1440 mSDsCounter, 0 mSdLazyCounter, 2375 mSolverCounterSat, 164 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 312 SdHoareTripleChecker+Valid, 1661 SdHoareTripleChecker+Invalid, 2539 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 164 IncrementalHoareTripleChecker+Valid, 2375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-11 20:26:47,702 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [312 Valid, 1661 Invalid, 2539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [164 Valid, 2375 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-11 20:26:47,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1369 states. [2024-10-11 20:26:47,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1369 to 1333. [2024-10-11 20:26:47,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1333 states, 934 states have (on average 1.359743040685225) internal successors, (1270), 963 states have internal predecessors, (1270), 273 states have call successors, (273), 119 states have call predecessors, (273), 118 states have return successors, (268), 268 states have call predecessors, (268), 267 states have call successors, (268) [2024-10-11 20:26:47,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1333 states to 1333 states and 1811 transitions. [2024-10-11 20:26:47,817 INFO L78 Accepts]: Start accepts. Automaton has 1333 states and 1811 transitions. Word has length 115 [2024-10-11 20:26:47,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:26:47,818 INFO L471 AbstractCegarLoop]: Abstraction has 1333 states and 1811 transitions. [2024-10-11 20:26:47,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 4.32) internal successors, (108), 23 states have internal predecessors, (108), 2 states have call successors, (31), 4 states have call predecessors, (31), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2024-10-11 20:26:47,819 INFO L276 IsEmpty]: Start isEmpty. Operand 1333 states and 1811 transitions. [2024-10-11 20:26:47,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-10-11 20:26:47,822 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:26:47,823 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:26:47,839 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-11 20:26:48,023 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-10-11 20:26:48,024 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting zf_pingErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [cdev_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, cdev_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, zf_readwErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2024-10-11 20:26:48,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:26:48,024 INFO L85 PathProgramCache]: Analyzing trace with hash 204966633, now seen corresponding path program 2 times [2024-10-11 20:26:48,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:26:48,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422210617] [2024-10-11 20:26:48,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:26:48,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:26:48,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:26:48,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:26:48,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:26:48,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 20:26:48,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:26:48,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 20:26:48,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:26:48,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:26:48,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:26:48,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 20:26:48,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:26:48,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 20:26:48,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:26:48,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 20:26:48,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:26:48,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-11 20:26:48,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:26:48,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:26:48,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:26:48,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 20:26:48,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:26:48,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 20:26:48,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:26:48,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 20:26:48,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:26:48,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-11 20:26:48,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:26:48,499 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2024-10-11 20:26:48,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:26:48,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422210617] [2024-10-11 20:26:48,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422210617] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:26:48,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:26:48,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 20:26:48,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987593187] [2024-10-11 20:26:48,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:26:48,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 20:26:48,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:26:48,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 20:26:48,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 20:26:48,501 INFO L87 Difference]: Start difference. First operand 1333 states and 1811 transitions. Second operand has 5 states, 4 states have (on average 15.0) internal successors, (60), 3 states have internal predecessors, (60), 2 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-11 20:26:49,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:26:49,714 INFO L93 Difference]: Finished difference Result 3505 states and 4879 transitions. [2024-10-11 20:26:49,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 20:26:49,714 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 15.0) internal successors, (60), 3 states have internal predecessors, (60), 2 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 124 [2024-10-11 20:26:49,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:26:49,722 INFO L225 Difference]: With dead ends: 3505 [2024-10-11 20:26:49,723 INFO L226 Difference]: Without dead ends: 2267 [2024-10-11 20:26:49,727 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-10-11 20:26:49,727 INFO L432 NwaCegarLoop]: 225 mSDtfsCounter, 765 mSDsluCounter, 449 mSDsCounter, 0 mSdLazyCounter, 846 mSolverCounterSat, 347 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 806 SdHoareTripleChecker+Valid, 674 SdHoareTripleChecker+Invalid, 1193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 347 IncrementalHoareTripleChecker+Valid, 846 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:26:49,727 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [806 Valid, 674 Invalid, 1193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [347 Valid, 846 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-11 20:26:49,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2267 states. [2024-10-11 20:26:49,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2267 to 2092. [2024-10-11 20:26:49,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2092 states, 1483 states have (on average 1.3910991233985166) internal successors, (2063), 1525 states have internal predecessors, (2063), 420 states have call successors, (420), 187 states have call predecessors, (420), 181 states have return successors, (421), 405 states have call predecessors, (421), 408 states have call successors, (421) [2024-10-11 20:26:49,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2092 states to 2092 states and 2904 transitions. [2024-10-11 20:26:49,850 INFO L78 Accepts]: Start accepts. Automaton has 2092 states and 2904 transitions. Word has length 124 [2024-10-11 20:26:49,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:26:49,850 INFO L471 AbstractCegarLoop]: Abstraction has 2092 states and 2904 transitions. [2024-10-11 20:26:49,850 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 15.0) internal successors, (60), 3 states have internal predecessors, (60), 2 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-11 20:26:49,850 INFO L276 IsEmpty]: Start isEmpty. Operand 2092 states and 2904 transitions. [2024-10-11 20:26:49,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-10-11 20:26:49,852 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:26:49,853 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:26:49,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 20:26:49,853 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting zf_readwErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [cdev_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, cdev_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, zf_readwErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2024-10-11 20:26:49,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:26:49,854 INFO L85 PathProgramCache]: Analyzing trace with hash 399337638, now seen corresponding path program 1 times [2024-10-11 20:26:49,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:26:49,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697505235] [2024-10-11 20:26:49,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:26:49,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:26:49,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:26:50,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:26:50,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:26:50,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 20:26:50,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:26:50,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 20:26:50,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:26:50,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:26:50,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:26:50,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 20:26:50,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:26:50,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 20:26:50,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:26:50,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 20:26:50,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:26:50,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-11 20:26:50,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:26:50,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:26:50,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:26:50,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 20:26:50,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:26:50,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-11 20:26:50,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:26:50,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 20:26:50,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:26:50,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-11 20:26:50,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:26:50,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-11 20:26:50,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:26:50,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-10-11 20:26:50,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:26:50,191 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2024-10-11 20:26:50,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:26:50,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697505235] [2024-10-11 20:26:50,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697505235] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:26:50,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:26:50,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 20:26:50,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790077548] [2024-10-11 20:26:50,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:26:50,195 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 20:26:50,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:26:50,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 20:26:50,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-11 20:26:50,195 INFO L87 Difference]: Start difference. First operand 2092 states and 2904 transitions. Second operand has 8 states, 7 states have (on average 10.428571428571429) internal successors, (73), 3 states have internal predecessors, (73), 2 states have call successors, (18), 6 states have call predecessors, (18), 2 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-11 20:26:51,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:26:51,466 INFO L93 Difference]: Finished difference Result 2264 states and 3110 transitions. [2024-10-11 20:26:51,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 20:26:51,467 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 10.428571428571429) internal successors, (73), 3 states have internal predecessors, (73), 2 states have call successors, (18), 6 states have call predecessors, (18), 2 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) Word has length 138 [2024-10-11 20:26:51,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:26:51,474 INFO L225 Difference]: With dead ends: 2264 [2024-10-11 20:26:51,474 INFO L226 Difference]: Without dead ends: 1532 [2024-10-11 20:26:51,476 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2024-10-11 20:26:51,476 INFO L432 NwaCegarLoop]: 220 mSDtfsCounter, 582 mSDsluCounter, 1008 mSDsCounter, 0 mSdLazyCounter, 1250 mSolverCounterSat, 434 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 582 SdHoareTripleChecker+Valid, 1228 SdHoareTripleChecker+Invalid, 1684 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 434 IncrementalHoareTripleChecker+Valid, 1250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:26:51,476 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [582 Valid, 1228 Invalid, 1684 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [434 Valid, 1250 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-11 20:26:51,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1532 states. [2024-10-11 20:26:51,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1532 to 1502. [2024-10-11 20:26:51,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1502 states, 1061 states have (on average 1.3713477851083884) internal successors, (1455), 1093 states have internal predecessors, (1455), 296 states have call successors, (296), 138 states have call predecessors, (296), 137 states have return successors, (302), 288 states have call predecessors, (302), 289 states have call successors, (302) [2024-10-11 20:26:51,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1502 states to 1502 states and 2053 transitions. [2024-10-11 20:26:51,565 INFO L78 Accepts]: Start accepts. Automaton has 1502 states and 2053 transitions. Word has length 138 [2024-10-11 20:26:51,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:26:51,566 INFO L471 AbstractCegarLoop]: Abstraction has 1502 states and 2053 transitions. [2024-10-11 20:26:51,566 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 10.428571428571429) internal successors, (73), 3 states have internal predecessors, (73), 2 states have call successors, (18), 6 states have call predecessors, (18), 2 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-11 20:26:51,566 INFO L276 IsEmpty]: Start isEmpty. Operand 1502 states and 2053 transitions. [2024-10-11 20:26:51,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-10-11 20:26:51,567 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:26:51,568 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:26:51,568 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-11 20:26:51,568 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ##fun~$Pointer$~X~$Pointer$~TO~intErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [cdev_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, cdev_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, zf_readwErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2024-10-11 20:26:51,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:26:51,568 INFO L85 PathProgramCache]: Analyzing trace with hash -381382565, now seen corresponding path program 1 times [2024-10-11 20:26:51,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:26:51,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415539032] [2024-10-11 20:26:51,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:26:51,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:26:51,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:26:51,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:26:51,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:26:51,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 20:26:51,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:26:51,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 20:26:51,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:26:51,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:26:51,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:26:51,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 20:26:51,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:26:51,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 20:26:51,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:26:51,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 20:26:51,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:26:51,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-11 20:26:51,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:26:51,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:26:51,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:26:51,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-11 20:26:51,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:26:51,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 20:26:51,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:26:51,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 20:26:51,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:26:51,847 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2024-10-11 20:26:51,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:26:51,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415539032] [2024-10-11 20:26:51,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415539032] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:26:51,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:26:51,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 20:26:51,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370518678] [2024-10-11 20:26:51,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:26:51,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 20:26:51,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:26:51,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 20:26:51,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 20:26:51,849 INFO L87 Difference]: Start difference. First operand 1502 states and 2053 transitions. Second operand has 5 states, 4 states have (on average 21.0) internal successors, (84), 3 states have internal predecessors, (84), 1 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-11 20:26:52,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:26:52,639 INFO L93 Difference]: Finished difference Result 1538 states and 2105 transitions. [2024-10-11 20:26:52,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 20:26:52,640 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 21.0) internal successors, (84), 3 states have internal predecessors, (84), 1 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 143 [2024-10-11 20:26:52,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:26:52,654 INFO L225 Difference]: With dead ends: 1538 [2024-10-11 20:26:52,660 INFO L226 Difference]: Without dead ends: 1536 [2024-10-11 20:26:52,662 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-11 20:26:52,662 INFO L432 NwaCegarLoop]: 219 mSDtfsCounter, 289 mSDsluCounter, 500 mSDsCounter, 0 mSdLazyCounter, 798 mSolverCounterSat, 157 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 315 SdHoareTripleChecker+Valid, 719 SdHoareTripleChecker+Invalid, 955 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 157 IncrementalHoareTripleChecker+Valid, 798 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 20:26:52,662 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [315 Valid, 719 Invalid, 955 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [157 Valid, 798 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 20:26:52,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1536 states. [2024-10-11 20:26:52,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1536 to 1510. [2024-10-11 20:26:52,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1510 states, 1069 states have (on average 1.3685687558465855) internal successors, (1463), 1101 states have internal predecessors, (1463), 296 states have call successors, (296), 138 states have call predecessors, (296), 137 states have return successors, (302), 288 states have call predecessors, (302), 289 states have call successors, (302) [2024-10-11 20:26:52,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1510 states to 1510 states and 2061 transitions. [2024-10-11 20:26:52,762 INFO L78 Accepts]: Start accepts. Automaton has 1510 states and 2061 transitions. Word has length 143 [2024-10-11 20:26:52,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:26:52,762 INFO L471 AbstractCegarLoop]: Abstraction has 1510 states and 2061 transitions. [2024-10-11 20:26:52,763 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 21.0) internal successors, (84), 3 states have internal predecessors, (84), 1 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-11 20:26:52,763 INFO L276 IsEmpty]: Start isEmpty. Operand 1510 states and 2061 transitions. [2024-10-11 20:26:52,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-11 20:26:52,765 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:26:52,765 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:26:52,766 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-11 20:26:52,766 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ##fun~$Pointer$~X~$Pointer$~TO~intErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [cdev_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, cdev_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, zf_readwErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2024-10-11 20:26:52,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:26:52,766 INFO L85 PathProgramCache]: Analyzing trace with hash -2106396771, now seen corresponding path program 1 times [2024-10-11 20:26:52,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:26:52,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210579230] [2024-10-11 20:26:52,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:26:52,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:26:52,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:26:52,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:26:52,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:26:52,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 20:26:52,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:26:52,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 20:26:52,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:26:52,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:26:52,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:26:53,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 20:26:53,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:26:53,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 20:26:53,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:26:53,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 20:26:53,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:26:53,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-11 20:26:53,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:26:53,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:26:53,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:26:53,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-11 20:26:53,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:26:53,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 20:26:53,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:26:53,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-10-11 20:26:53,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:26:53,106 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2024-10-11 20:26:53,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:26:53,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210579230] [2024-10-11 20:26:53,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210579230] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:26:53,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:26:53,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 20:26:53,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249222843] [2024-10-11 20:26:53,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:26:53,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 20:26:53,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:26:53,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 20:26:53,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 20:26:53,109 INFO L87 Difference]: Start difference. First operand 1510 states and 2061 transitions. Second operand has 5 states, 4 states have (on average 20.75) internal successors, (83), 3 states have internal predecessors, (83), 1 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-11 20:26:54,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:26:54,183 INFO L93 Difference]: Finished difference Result 1536 states and 2097 transitions. [2024-10-11 20:26:54,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 20:26:54,183 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 20.75) internal successors, (83), 3 states have internal predecessors, (83), 1 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 142 [2024-10-11 20:26:54,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:26:54,190 INFO L225 Difference]: With dead ends: 1536 [2024-10-11 20:26:54,190 INFO L226 Difference]: Without dead ends: 1535 [2024-10-11 20:26:54,191 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-11 20:26:54,192 INFO L432 NwaCegarLoop]: 219 mSDtfsCounter, 286 mSDsluCounter, 500 mSDsCounter, 0 mSdLazyCounter, 800 mSolverCounterSat, 156 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 312 SdHoareTripleChecker+Valid, 719 SdHoareTripleChecker+Invalid, 956 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 156 IncrementalHoareTripleChecker+Valid, 800 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-11 20:26:54,192 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [312 Valid, 719 Invalid, 956 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [156 Valid, 800 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-11 20:26:54,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1535 states. [2024-10-11 20:26:54,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1535 to 1509. [2024-10-11 20:26:54,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1509 states, 1069 states have (on average 1.364826941066417) internal successors, (1459), 1100 states have internal predecessors, (1459), 296 states have call successors, (296), 138 states have call predecessors, (296), 137 states have return successors, (302), 288 states have call predecessors, (302), 289 states have call successors, (302) [2024-10-11 20:26:54,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1509 states to 1509 states and 2057 transitions. [2024-10-11 20:26:54,280 INFO L78 Accepts]: Start accepts. Automaton has 1509 states and 2057 transitions. Word has length 142 [2024-10-11 20:26:54,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:26:54,280 INFO L471 AbstractCegarLoop]: Abstraction has 1509 states and 2057 transitions. [2024-10-11 20:26:54,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 20.75) internal successors, (83), 3 states have internal predecessors, (83), 1 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-11 20:26:54,280 INFO L276 IsEmpty]: Start isEmpty. Operand 1509 states and 2057 transitions. [2024-10-11 20:26:54,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-10-11 20:26:54,282 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:26:54,282 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:26:54,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-11 20:26:54,283 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ##fun~$Pointer$~X~$Pointer$~TO~intErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [cdev_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, cdev_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, zf_readwErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2024-10-11 20:26:54,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:26:54,284 INFO L85 PathProgramCache]: Analyzing trace with hash -1436356968, now seen corresponding path program 1 times [2024-10-11 20:26:54,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:26:54,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055699047] [2024-10-11 20:26:54,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:26:54,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:26:54,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:26:54,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:26:54,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:26:54,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 20:26:54,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:26:54,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 20:26:54,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:26:54,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:26:54,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:26:54,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 20:26:54,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:26:54,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 20:26:54,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:26:54,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 20:26:54,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:26:54,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-11 20:26:54,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:26:54,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:26:54,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:26:54,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-11 20:26:54,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:26:54,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 20:26:54,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:26:54,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 20:26:54,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:26:54,643 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2024-10-11 20:26:54,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:26:54,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055699047] [2024-10-11 20:26:54,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055699047] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:26:54,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:26:54,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 20:26:54,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555269514] [2024-10-11 20:26:54,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:26:54,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 20:26:54,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:26:54,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 20:26:54,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 20:26:54,644 INFO L87 Difference]: Start difference. First operand 1509 states and 2057 transitions. Second operand has 5 states, 5 states have (on average 17.2) internal successors, (86), 3 states have internal predecessors, (86), 1 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-11 20:26:55,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:26:55,478 INFO L93 Difference]: Finished difference Result 2864 states and 3970 transitions. [2024-10-11 20:26:55,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 20:26:55,478 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 3 states have internal predecessors, (86), 1 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 145 [2024-10-11 20:26:55,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:26:55,485 INFO L225 Difference]: With dead ends: 2864 [2024-10-11 20:26:55,486 INFO L226 Difference]: Without dead ends: 1522 [2024-10-11 20:26:55,489 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-11 20:26:55,489 INFO L432 NwaCegarLoop]: 219 mSDtfsCounter, 284 mSDsluCounter, 500 mSDsCounter, 0 mSdLazyCounter, 783 mSolverCounterSat, 156 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 310 SdHoareTripleChecker+Valid, 719 SdHoareTripleChecker+Invalid, 939 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 156 IncrementalHoareTripleChecker+Valid, 783 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 20:26:55,490 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [310 Valid, 719 Invalid, 939 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [156 Valid, 783 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 20:26:55,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1522 states. [2024-10-11 20:26:55,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1522 to 1496. [2024-10-11 20:26:55,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1496 states, 1057 states have (on average 1.3614001892147587) internal successors, (1439), 1087 states have internal predecessors, (1439), 296 states have call successors, (296), 138 states have call predecessors, (296), 137 states have return successors, (302), 288 states have call predecessors, (302), 289 states have call successors, (302) [2024-10-11 20:26:55,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1496 states to 1496 states and 2037 transitions. [2024-10-11 20:26:55,590 INFO L78 Accepts]: Start accepts. Automaton has 1496 states and 2037 transitions. Word has length 145 [2024-10-11 20:26:55,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:26:55,591 INFO L471 AbstractCegarLoop]: Abstraction has 1496 states and 2037 transitions. [2024-10-11 20:26:55,592 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 3 states have internal predecessors, (86), 1 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-11 20:26:55,592 INFO L276 IsEmpty]: Start isEmpty. Operand 1496 states and 2037 transitions. [2024-10-11 20:26:55,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-10-11 20:26:55,594 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:26:55,594 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 5, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:26:55,594 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-11 20:26:55,594 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting zf_readwErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [cdev_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, cdev_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, zf_readwErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2024-10-11 20:26:55,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:26:55,595 INFO L85 PathProgramCache]: Analyzing trace with hash -357792101, now seen corresponding path program 1 times [2024-10-11 20:26:55,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:26:55,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775031378] [2024-10-11 20:26:55,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:26:55,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:26:55,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:26:55,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:26:55,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:26:55,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 20:26:55,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:26:55,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 20:26:55,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:26:55,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:26:55,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:26:55,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 20:26:55,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:26:55,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 20:26:55,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:26:55,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 20:26:55,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:26:55,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-11 20:26:55,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:26:55,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:26:55,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:26:55,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 20:26:55,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:26:55,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 20:26:55,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:26:55,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 20:26:55,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:26:55,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 20:26:55,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:26:55,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:26:55,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:26:55,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 20:26:55,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:26:55,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 20:26:55,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:26:55,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-11 20:26:55,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:26:55,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-11 20:26:55,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:26:55,999 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 174 trivial. 0 not checked. [2024-10-11 20:26:56,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:26:56,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775031378] [2024-10-11 20:26:56,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [775031378] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:26:56,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:26:56,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 20:26:56,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639168479] [2024-10-11 20:26:56,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:26:56,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 20:26:56,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:26:56,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 20:26:56,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-11 20:26:56,002 INFO L87 Difference]: Start difference. First operand 1496 states and 2037 transitions. Second operand has 8 states, 8 states have (on average 9.875) internal successors, (79), 4 states have internal predecessors, (79), 2 states have call successors, (21), 6 states have call predecessors, (21), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-11 20:26:57,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:26:57,420 INFO L93 Difference]: Finished difference Result 1684 states and 2248 transitions. [2024-10-11 20:26:57,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 20:26:57,421 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 4 states have internal predecessors, (79), 2 states have call successors, (21), 6 states have call predecessors, (21), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 152 [2024-10-11 20:26:57,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:26:57,426 INFO L225 Difference]: With dead ends: 1684 [2024-10-11 20:26:57,426 INFO L226 Difference]: Without dead ends: 1540 [2024-10-11 20:26:57,427 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2024-10-11 20:26:57,427 INFO L432 NwaCegarLoop]: 211 mSDtfsCounter, 675 mSDsluCounter, 734 mSDsCounter, 0 mSdLazyCounter, 1274 mSolverCounterSat, 442 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 692 SdHoareTripleChecker+Valid, 945 SdHoareTripleChecker+Invalid, 1716 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 442 IncrementalHoareTripleChecker+Valid, 1274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-11 20:26:57,428 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [692 Valid, 945 Invalid, 1716 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [442 Valid, 1274 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-11 20:26:57,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1540 states. [2024-10-11 20:26:57,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1540 to 1504. [2024-10-11 20:26:57,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1504 states, 1065 states have (on average 1.3586854460093896) internal successors, (1447), 1095 states have internal predecessors, (1447), 296 states have call successors, (296), 138 states have call predecessors, (296), 137 states have return successors, (302), 288 states have call predecessors, (302), 289 states have call successors, (302) [2024-10-11 20:26:57,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1504 states to 1504 states and 2045 transitions. [2024-10-11 20:26:57,569 INFO L78 Accepts]: Start accepts. Automaton has 1504 states and 2045 transitions. Word has length 152 [2024-10-11 20:26:57,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:26:57,569 INFO L471 AbstractCegarLoop]: Abstraction has 1504 states and 2045 transitions. [2024-10-11 20:26:57,569 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 4 states have internal predecessors, (79), 2 states have call successors, (21), 6 states have call predecessors, (21), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-11 20:26:57,569 INFO L276 IsEmpty]: Start isEmpty. Operand 1504 states and 2045 transitions. [2024-10-11 20:26:57,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-10-11 20:26:57,575 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:26:57,575 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 5, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 20:26:57,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-11 20:26:57,575 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting zf_readwErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [cdev_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, cdev_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, zf_readwErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2024-10-11 20:26:57,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:26:57,576 INFO L85 PathProgramCache]: Analyzing trace with hash -1935340621, now seen corresponding path program 1 times [2024-10-11 20:26:57,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:26:57,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220050753] [2024-10-11 20:26:57,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:26:57,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:26:57,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:26:57,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:26:57,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:26:57,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 20:26:57,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:26:57,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 20:26:57,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:26:57,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:26:57,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:26:57,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 20:26:57,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:26:57,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 20:26:57,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:26:57,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 20:26:57,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:26:58,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-11 20:26:58,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:26:58,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:26:58,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:26:58,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 20:26:58,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:26:58,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 20:26:58,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:26:58,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 20:26:58,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:26:58,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 20:26:58,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:26:58,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:26:58,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:26:58,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 20:26:58,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:26:58,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-11 20:26:58,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:26:58,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-11 20:26:58,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:26:58,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-10-11 20:26:58,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:26:58,111 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 174 trivial. 0 not checked. [2024-10-11 20:26:58,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:26:58,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220050753] [2024-10-11 20:26:58,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220050753] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:26:58,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:26:58,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 20:26:58,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579748528] [2024-10-11 20:26:58,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:26:58,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 20:26:58,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:26:58,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 20:26:58,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-11 20:26:58,113 INFO L87 Difference]: Start difference. First operand 1504 states and 2045 transitions. Second operand has 8 states, 6 states have (on average 13.666666666666666) internal successors, (82), 4 states have internal predecessors, (82), 2 states have call successors, (21), 6 states have call predecessors, (21), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-11 20:26:59,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:26:59,821 INFO L93 Difference]: Finished difference Result 1534 states and 2087 transitions. [2024-10-11 20:26:59,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 20:26:59,822 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 13.666666666666666) internal successors, (82), 4 states have internal predecessors, (82), 2 states have call successors, (21), 6 states have call predecessors, (21), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 155 [2024-10-11 20:26:59,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:26:59,831 INFO L225 Difference]: With dead ends: 1534 [2024-10-11 20:26:59,832 INFO L226 Difference]: Without dead ends: 1533 [2024-10-11 20:26:59,832 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2024-10-11 20:26:59,833 INFO L432 NwaCegarLoop]: 193 mSDtfsCounter, 914 mSDsluCounter, 625 mSDsCounter, 0 mSdLazyCounter, 664 mSolverCounterSat, 524 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 941 SdHoareTripleChecker+Valid, 818 SdHoareTripleChecker+Invalid, 1188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 524 IncrementalHoareTripleChecker+Valid, 664 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-11 20:26:59,834 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [941 Valid, 818 Invalid, 1188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [524 Valid, 664 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-11 20:26:59,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1533 states. [2024-10-11 20:26:59,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1533 to 1503. [2024-10-11 20:26:59,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1503 states, 1065 states have (on average 1.3549295774647887) internal successors, (1443), 1094 states have internal predecessors, (1443), 296 states have call successors, (296), 138 states have call predecessors, (296), 137 states have return successors, (302), 288 states have call predecessors, (302), 289 states have call successors, (302) [2024-10-11 20:26:59,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1503 states to 1503 states and 2041 transitions. [2024-10-11 20:26:59,947 INFO L78 Accepts]: Start accepts. Automaton has 1503 states and 2041 transitions. Word has length 155 [2024-10-11 20:26:59,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:26:59,949 INFO L471 AbstractCegarLoop]: Abstraction has 1503 states and 2041 transitions. [2024-10-11 20:26:59,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 13.666666666666666) internal successors, (82), 4 states have internal predecessors, (82), 2 states have call successors, (21), 6 states have call predecessors, (21), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-11 20:26:59,949 INFO L276 IsEmpty]: Start isEmpty. Operand 1503 states and 2041 transitions. [2024-10-11 20:26:59,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-10-11 20:26:59,951 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:26:59,952 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 20:26:59,952 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-11 20:26:59,952 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ##fun~$Pointer$~X~$Pointer$~TO~intErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [cdev_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, cdev_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, zf_readwErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2024-10-11 20:26:59,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:26:59,952 INFO L85 PathProgramCache]: Analyzing trace with hash -466740552, now seen corresponding path program 1 times [2024-10-11 20:26:59,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:26:59,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264698533] [2024-10-11 20:26:59,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:26:59,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:27:00,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:00,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:27:00,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:00,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 20:27:00,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:00,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 20:27:00,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:00,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:27:00,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:00,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 20:27:00,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:00,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 20:27:00,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:00,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 20:27:00,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:00,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-11 20:27:00,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:00,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:27:00,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:00,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-11 20:27:00,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:00,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 20:27:00,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:00,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-10-11 20:27:00,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:00,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-11 20:27:00,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:00,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-11 20:27:00,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:00,179 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2024-10-11 20:27:00,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:27:00,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264698533] [2024-10-11 20:27:00,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [264698533] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:27:00,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:27:00,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 20:27:00,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838908288] [2024-10-11 20:27:00,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:27:00,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 20:27:00,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:27:00,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 20:27:00,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 20:27:00,181 INFO L87 Difference]: Start difference. First operand 1503 states and 2041 transitions. Second operand has 6 states, 5 states have (on average 17.2) internal successors, (86), 3 states have internal predecessors, (86), 1 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-11 20:27:01,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:27:01,278 INFO L93 Difference]: Finished difference Result 1543 states and 2099 transitions. [2024-10-11 20:27:01,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 20:27:01,279 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 17.2) internal successors, (86), 3 states have internal predecessors, (86), 1 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 150 [2024-10-11 20:27:01,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:27:01,286 INFO L225 Difference]: With dead ends: 1543 [2024-10-11 20:27:01,286 INFO L226 Difference]: Without dead ends: 1541 [2024-10-11 20:27:01,286 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-10-11 20:27:01,287 INFO L432 NwaCegarLoop]: 220 mSDtfsCounter, 407 mSDsluCounter, 659 mSDsCounter, 0 mSdLazyCounter, 888 mSolverCounterSat, 286 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 419 SdHoareTripleChecker+Valid, 879 SdHoareTripleChecker+Invalid, 1174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 286 IncrementalHoareTripleChecker+Valid, 888 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-11 20:27:01,287 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [419 Valid, 879 Invalid, 1174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [286 Valid, 888 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-11 20:27:01,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1541 states. [2024-10-11 20:27:01,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1541 to 1511. [2024-10-11 20:27:01,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1511 states, 1073 states have (on average 1.352283317800559) internal successors, (1451), 1102 states have internal predecessors, (1451), 296 states have call successors, (296), 138 states have call predecessors, (296), 137 states have return successors, (302), 288 states have call predecessors, (302), 289 states have call successors, (302) [2024-10-11 20:27:01,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1511 states to 1511 states and 2049 transitions. [2024-10-11 20:27:01,417 INFO L78 Accepts]: Start accepts. Automaton has 1511 states and 2049 transitions. Word has length 150 [2024-10-11 20:27:01,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:27:01,418 INFO L471 AbstractCegarLoop]: Abstraction has 1511 states and 2049 transitions. [2024-10-11 20:27:01,418 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 17.2) internal successors, (86), 3 states have internal predecessors, (86), 1 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-11 20:27:01,418 INFO L276 IsEmpty]: Start isEmpty. Operand 1511 states and 2049 transitions. [2024-10-11 20:27:01,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-10-11 20:27:01,420 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:27:01,420 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:27:01,420 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-11 20:27:01,420 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting zf_pingErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [cdev_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, cdev_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, zf_readwErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2024-10-11 20:27:01,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:27:01,421 INFO L85 PathProgramCache]: Analyzing trace with hash -30090445, now seen corresponding path program 1 times [2024-10-11 20:27:01,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:27:01,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150524370] [2024-10-11 20:27:01,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:27:01,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:27:01,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:01,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:27:01,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:01,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 20:27:01,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:01,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 20:27:01,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:01,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:27:01,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:01,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 20:27:01,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:01,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 20:27:01,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:01,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 20:27:01,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:01,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-11 20:27:01,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:01,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:27:01,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:01,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-11 20:27:01,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:01,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 20:27:01,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:01,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 20:27:01,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:01,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 20:27:01,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:01,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-11 20:27:01,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:01,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-11 20:27:01,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:01,658 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2024-10-11 20:27:01,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:27:01,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150524370] [2024-10-11 20:27:01,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150524370] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:27:01,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:27:01,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 20:27:01,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225824804] [2024-10-11 20:27:01,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:27:01,659 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 20:27:01,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:27:01,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 20:27:01,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 20:27:01,660 INFO L87 Difference]: Start difference. First operand 1511 states and 2049 transitions. Second operand has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 4 states have internal predecessors, (81), 3 states have call successors, (17), 5 states have call predecessors, (17), 2 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2024-10-11 20:27:02,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:27:02,661 INFO L93 Difference]: Finished difference Result 2377 states and 3253 transitions. [2024-10-11 20:27:02,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 20:27:02,661 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 4 states have internal predecessors, (81), 3 states have call successors, (17), 5 states have call predecessors, (17), 2 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) Word has length 152 [2024-10-11 20:27:02,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:27:02,668 INFO L225 Difference]: With dead ends: 2377 [2024-10-11 20:27:02,668 INFO L226 Difference]: Without dead ends: 1551 [2024-10-11 20:27:02,670 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2024-10-11 20:27:02,670 INFO L432 NwaCegarLoop]: 220 mSDtfsCounter, 742 mSDsluCounter, 634 mSDsCounter, 0 mSdLazyCounter, 881 mSolverCounterSat, 421 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 767 SdHoareTripleChecker+Valid, 854 SdHoareTripleChecker+Invalid, 1302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 421 IncrementalHoareTripleChecker+Valid, 881 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-11 20:27:02,671 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [767 Valid, 854 Invalid, 1302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [421 Valid, 881 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-11 20:27:02,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1551 states. [2024-10-11 20:27:02,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1551 to 1517. [2024-10-11 20:27:02,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1517 states, 1077 states have (on average 1.3435468895078924) internal successors, (1447), 1108 states have internal predecessors, (1447), 296 states have call successors, (296), 138 states have call predecessors, (296), 139 states have return successors, (306), 288 states have call predecessors, (306), 289 states have call successors, (306) [2024-10-11 20:27:02,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1517 states to 1517 states and 2049 transitions. [2024-10-11 20:27:02,830 INFO L78 Accepts]: Start accepts. Automaton has 1517 states and 2049 transitions. Word has length 152 [2024-10-11 20:27:02,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:27:02,831 INFO L471 AbstractCegarLoop]: Abstraction has 1517 states and 2049 transitions. [2024-10-11 20:27:02,831 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 4 states have internal predecessors, (81), 3 states have call successors, (17), 5 states have call predecessors, (17), 2 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2024-10-11 20:27:02,831 INFO L276 IsEmpty]: Start isEmpty. Operand 1517 states and 2049 transitions. [2024-10-11 20:27:02,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-10-11 20:27:02,833 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:27:02,833 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 5, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 20:27:02,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-11 20:27:02,834 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting zf_readwErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [cdev_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, cdev_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, zf_readwErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2024-10-11 20:27:02,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:27:02,834 INFO L85 PathProgramCache]: Analyzing trace with hash 133983054, now seen corresponding path program 1 times [2024-10-11 20:27:02,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:27:02,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212336627] [2024-10-11 20:27:02,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:27:02,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:27:02,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:03,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:27:03,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:03,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 20:27:03,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:03,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 20:27:03,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:03,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:27:03,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:03,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 20:27:03,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:03,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 20:27:03,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:03,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 20:27:03,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:03,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-11 20:27:03,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:03,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:27:03,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:03,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 20:27:03,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:03,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 20:27:03,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:03,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 20:27:03,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:03,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 20:27:03,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:03,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:27:03,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:03,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 20:27:03,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:03,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-11 20:27:03,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:03,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-11 20:27:03,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:03,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-10-11 20:27:03,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:03,312 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 174 trivial. 0 not checked. [2024-10-11 20:27:03,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:27:03,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212336627] [2024-10-11 20:27:03,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212336627] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:27:03,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:27:03,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-11 20:27:03,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579744526] [2024-10-11 20:27:03,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:27:03,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 20:27:03,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:27:03,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 20:27:03,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2024-10-11 20:27:03,314 INFO L87 Difference]: Start difference. First operand 1517 states and 2049 transitions. Second operand has 11 states, 11 states have (on average 7.545454545454546) internal successors, (83), 6 states have internal predecessors, (83), 2 states have call successors, (21), 6 states have call predecessors, (21), 2 states have return successors, (18), 3 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-11 20:27:05,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:27:05,105 INFO L93 Difference]: Finished difference Result 1628 states and 2189 transitions. [2024-10-11 20:27:05,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 20:27:05,105 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.545454545454546) internal successors, (83), 6 states have internal predecessors, (83), 2 states have call successors, (21), 6 states have call predecessors, (21), 2 states have return successors, (18), 3 states have call predecessors, (18), 2 states have call successors, (18) Word has length 156 [2024-10-11 20:27:05,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:27:05,115 INFO L225 Difference]: With dead ends: 1628 [2024-10-11 20:27:05,118 INFO L226 Difference]: Without dead ends: 1516 [2024-10-11 20:27:05,119 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=70, Invalid=272, Unknown=0, NotChecked=0, Total=342 [2024-10-11 20:27:05,122 INFO L432 NwaCegarLoop]: 217 mSDtfsCounter, 568 mSDsluCounter, 1546 mSDsCounter, 0 mSdLazyCounter, 2145 mSolverCounterSat, 437 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 572 SdHoareTripleChecker+Valid, 1763 SdHoareTripleChecker+Invalid, 2582 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 437 IncrementalHoareTripleChecker+Valid, 2145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-11 20:27:05,122 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [572 Valid, 1763 Invalid, 2582 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [437 Valid, 2145 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-11 20:27:05,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1516 states. [2024-10-11 20:27:05,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1516 to 1486. [2024-10-11 20:27:05,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1486 states, 1057 states have (on average 1.349101229895932) internal successors, (1426), 1088 states have internal predecessors, (1426), 290 states have call successors, (290), 134 states have call predecessors, (290), 134 states have return successors, (299), 281 states have call predecessors, (299), 283 states have call successors, (299) [2024-10-11 20:27:05,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1486 states to 1486 states and 2015 transitions. [2024-10-11 20:27:05,367 INFO L78 Accepts]: Start accepts. Automaton has 1486 states and 2015 transitions. Word has length 156 [2024-10-11 20:27:05,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:27:05,371 INFO L471 AbstractCegarLoop]: Abstraction has 1486 states and 2015 transitions. [2024-10-11 20:27:05,371 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.545454545454546) internal successors, (83), 6 states have internal predecessors, (83), 2 states have call successors, (21), 6 states have call predecessors, (21), 2 states have return successors, (18), 3 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-11 20:27:05,371 INFO L276 IsEmpty]: Start isEmpty. Operand 1486 states and 2015 transitions. [2024-10-11 20:27:05,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-10-11 20:27:05,373 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:27:05,373 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 20:27:05,373 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-11 20:27:05,374 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ##fun~$Pointer$~X~$Pointer$~TO~intErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [cdev_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, cdev_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, zf_readwErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2024-10-11 20:27:05,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:27:05,374 INFO L85 PathProgramCache]: Analyzing trace with hash -1584053083, now seen corresponding path program 1 times [2024-10-11 20:27:05,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:27:05,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936273840] [2024-10-11 20:27:05,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:27:05,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:27:05,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:05,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:27:05,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:05,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 20:27:05,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:05,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 20:27:05,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:05,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:27:05,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:05,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 20:27:05,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:05,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 20:27:05,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:05,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 20:27:05,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:05,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-11 20:27:05,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:05,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:27:05,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:05,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-11 20:27:05,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:05,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 20:27:05,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:05,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-10-11 20:27:05,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:05,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-11 20:27:05,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:05,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-11 20:27:05,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:05,778 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2024-10-11 20:27:05,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:27:05,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936273840] [2024-10-11 20:27:05,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936273840] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:27:05,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:27:05,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 20:27:05,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057366230] [2024-10-11 20:27:05,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:27:05,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 20:27:05,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:27:05,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 20:27:05,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 20:27:05,780 INFO L87 Difference]: Start difference. First operand 1486 states and 2015 transitions. Second operand has 6 states, 5 states have (on average 17.4) internal successors, (87), 3 states have internal predecessors, (87), 1 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-11 20:27:06,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:27:06,734 INFO L93 Difference]: Finished difference Result 1516 states and 2057 transitions. [2024-10-11 20:27:06,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 20:27:06,735 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 17.4) internal successors, (87), 3 states have internal predecessors, (87), 1 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 151 [2024-10-11 20:27:06,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:27:06,741 INFO L225 Difference]: With dead ends: 1516 [2024-10-11 20:27:06,741 INFO L226 Difference]: Without dead ends: 1515 [2024-10-11 20:27:06,742 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-10-11 20:27:06,742 INFO L432 NwaCegarLoop]: 220 mSDtfsCounter, 397 mSDsluCounter, 659 mSDsCounter, 0 mSdLazyCounter, 883 mSolverCounterSat, 285 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 409 SdHoareTripleChecker+Valid, 879 SdHoareTripleChecker+Invalid, 1168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 285 IncrementalHoareTripleChecker+Valid, 883 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-11 20:27:06,742 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [409 Valid, 879 Invalid, 1168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [285 Valid, 883 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-11 20:27:06,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1515 states. [2024-10-11 20:27:06,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1515 to 1485. [2024-10-11 20:27:06,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1485 states, 1057 states have (on average 1.3453169347209082) internal successors, (1422), 1087 states have internal predecessors, (1422), 290 states have call successors, (290), 134 states have call predecessors, (290), 134 states have return successors, (299), 281 states have call predecessors, (299), 283 states have call successors, (299) [2024-10-11 20:27:06,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1485 states to 1485 states and 2011 transitions. [2024-10-11 20:27:06,852 INFO L78 Accepts]: Start accepts. Automaton has 1485 states and 2011 transitions. Word has length 151 [2024-10-11 20:27:06,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:27:06,852 INFO L471 AbstractCegarLoop]: Abstraction has 1485 states and 2011 transitions. [2024-10-11 20:27:06,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 17.4) internal successors, (87), 3 states have internal predecessors, (87), 1 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-11 20:27:06,853 INFO L276 IsEmpty]: Start isEmpty. Operand 1485 states and 2011 transitions. [2024-10-11 20:27:06,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-10-11 20:27:06,854 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:27:06,854 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 20:27:06,855 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-11 20:27:06,855 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ##fun~$Pointer$~X~$Pointer$~TO~intErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [cdev_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, cdev_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, zf_readwErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2024-10-11 20:27:06,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:27:06,855 INFO L85 PathProgramCache]: Analyzing trace with hash -1861005003, now seen corresponding path program 1 times [2024-10-11 20:27:06,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:27:06,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280954234] [2024-10-11 20:27:06,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:27:06,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:27:06,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:07,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:27:07,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:07,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 20:27:07,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:07,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 20:27:07,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:07,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:27:07,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:07,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 20:27:07,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:07,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 20:27:07,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:07,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 20:27:07,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:07,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-11 20:27:07,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:07,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:27:07,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:07,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-11 20:27:07,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:07,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 20:27:07,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:07,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-10-11 20:27:07,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:07,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-11 20:27:07,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:07,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-11 20:27:07,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:07,223 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2024-10-11 20:27:07,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:27:07,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280954234] [2024-10-11 20:27:07,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1280954234] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:27:07,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:27:07,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 20:27:07,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813065580] [2024-10-11 20:27:07,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:27:07,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 20:27:07,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:27:07,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 20:27:07,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 20:27:07,225 INFO L87 Difference]: Start difference. First operand 1485 states and 2011 transitions. Second operand has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 3 states have internal predecessors, (88), 1 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-11 20:27:08,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:27:08,441 INFO L93 Difference]: Finished difference Result 2851 states and 3910 transitions. [2024-10-11 20:27:08,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 20:27:08,442 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 3 states have internal predecessors, (88), 1 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 152 [2024-10-11 20:27:08,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:27:08,447 INFO L225 Difference]: With dead ends: 2851 [2024-10-11 20:27:08,447 INFO L226 Difference]: Without dead ends: 1502 [2024-10-11 20:27:08,450 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-10-11 20:27:08,450 INFO L432 NwaCegarLoop]: 220 mSDtfsCounter, 395 mSDsluCounter, 659 mSDsCounter, 0 mSdLazyCounter, 861 mSolverCounterSat, 285 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 407 SdHoareTripleChecker+Valid, 879 SdHoareTripleChecker+Invalid, 1146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 285 IncrementalHoareTripleChecker+Valid, 861 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:27:08,450 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [407 Valid, 879 Invalid, 1146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [285 Valid, 861 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-11 20:27:08,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1502 states. [2024-10-11 20:27:08,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1502 to 1472. [2024-10-11 20:27:08,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1472 states, 1045 states have (on average 1.3416267942583733) internal successors, (1402), 1074 states have internal predecessors, (1402), 290 states have call successors, (290), 134 states have call predecessors, (290), 134 states have return successors, (299), 281 states have call predecessors, (299), 283 states have call successors, (299) [2024-10-11 20:27:08,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1472 states to 1472 states and 1991 transitions. [2024-10-11 20:27:08,555 INFO L78 Accepts]: Start accepts. Automaton has 1472 states and 1991 transitions. Word has length 152 [2024-10-11 20:27:08,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:27:08,555 INFO L471 AbstractCegarLoop]: Abstraction has 1472 states and 1991 transitions. [2024-10-11 20:27:08,556 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 3 states have internal predecessors, (88), 1 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-11 20:27:08,556 INFO L276 IsEmpty]: Start isEmpty. Operand 1472 states and 1991 transitions. [2024-10-11 20:27:08,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-10-11 20:27:08,557 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:27:08,558 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:27:08,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-10-11 20:27:08,558 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting zf_pingErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [cdev_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, cdev_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, zf_readwErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2024-10-11 20:27:08,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:27:08,558 INFO L85 PathProgramCache]: Analyzing trace with hash -599309397, now seen corresponding path program 1 times [2024-10-11 20:27:08,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:27:08,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505223514] [2024-10-11 20:27:08,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:27:08,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:27:08,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:08,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:27:08,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:08,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 20:27:08,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:08,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 20:27:08,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:08,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:27:08,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:08,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 20:27:08,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:08,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 20:27:08,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:08,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 20:27:08,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:08,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-11 20:27:08,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:08,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:27:08,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:08,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-11 20:27:08,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:08,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 20:27:08,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:08,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 20:27:08,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:09,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-11 20:27:09,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:09,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-11 20:27:09,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:09,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-11 20:27:09,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:09,043 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2024-10-11 20:27:09,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:27:09,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505223514] [2024-10-11 20:27:09,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505223514] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:27:09,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:27:09,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 20:27:09,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212274014] [2024-10-11 20:27:09,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:27:09,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 20:27:09,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:27:09,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 20:27:09,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 20:27:09,046 INFO L87 Difference]: Start difference. First operand 1472 states and 1991 transitions. Second operand has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 4 states have internal predecessors, (83), 2 states have call successors, (17), 5 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-11 20:27:10,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:27:10,410 INFO L93 Difference]: Finished difference Result 2314 states and 3159 transitions. [2024-10-11 20:27:10,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 20:27:10,410 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 4 states have internal predecessors, (83), 2 states have call successors, (17), 5 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 154 [2024-10-11 20:27:10,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:27:10,416 INFO L225 Difference]: With dead ends: 2314 [2024-10-11 20:27:10,416 INFO L226 Difference]: Without dead ends: 1536 [2024-10-11 20:27:10,417 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2024-10-11 20:27:10,418 INFO L432 NwaCegarLoop]: 220 mSDtfsCounter, 443 mSDsluCounter, 855 mSDsCounter, 0 mSdLazyCounter, 1120 mSolverCounterSat, 323 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 448 SdHoareTripleChecker+Valid, 1075 SdHoareTripleChecker+Invalid, 1443 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 323 IncrementalHoareTripleChecker+Valid, 1120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:27:10,418 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [448 Valid, 1075 Invalid, 1443 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [323 Valid, 1120 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-11 20:27:10,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1536 states. [2024-10-11 20:27:10,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1536 to 1476. [2024-10-11 20:27:10,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1476 states, 1049 states have (on average 1.340324118207817) internal successors, (1406), 1078 states have internal predecessors, (1406), 290 states have call successors, (290), 134 states have call predecessors, (290), 134 states have return successors, (299), 281 states have call predecessors, (299), 283 states have call successors, (299) [2024-10-11 20:27:10,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1476 states to 1476 states and 1995 transitions. [2024-10-11 20:27:10,525 INFO L78 Accepts]: Start accepts. Automaton has 1476 states and 1995 transitions. Word has length 154 [2024-10-11 20:27:10,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:27:10,526 INFO L471 AbstractCegarLoop]: Abstraction has 1476 states and 1995 transitions. [2024-10-11 20:27:10,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 4 states have internal predecessors, (83), 2 states have call successors, (17), 5 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-11 20:27:10,526 INFO L276 IsEmpty]: Start isEmpty. Operand 1476 states and 1995 transitions. [2024-10-11 20:27:10,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-10-11 20:27:10,528 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:27:10,528 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 5, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 20:27:10,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-10-11 20:27:10,528 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting zf_readwErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [cdev_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, cdev_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, zf_readwErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2024-10-11 20:27:10,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:27:10,528 INFO L85 PathProgramCache]: Analyzing trace with hash -108449341, now seen corresponding path program 1 times [2024-10-11 20:27:10,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:27:10,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387900334] [2024-10-11 20:27:10,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:27:10,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:27:10,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:10,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:27:10,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:10,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 20:27:10,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:10,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 20:27:10,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:10,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:27:10,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:10,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 20:27:10,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:10,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 20:27:10,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:10,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 20:27:10,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:10,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-11 20:27:10,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:10,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:27:10,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:10,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-11 20:27:10,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:10,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 20:27:10,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:10,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 20:27:10,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:10,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-11 20:27:10,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:10,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:27:10,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:10,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 20:27:10,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:10,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-11 20:27:10,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:10,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-10-11 20:27:11,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:11,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-11 20:27:11,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:11,032 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 174 trivial. 0 not checked. [2024-10-11 20:27:11,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:27:11,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387900334] [2024-10-11 20:27:11,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387900334] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:27:11,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:27:11,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 20:27:11,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812964186] [2024-10-11 20:27:11,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:27:11,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 20:27:11,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:27:11,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 20:27:11,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-11 20:27:11,034 INFO L87 Difference]: Start difference. First operand 1476 states and 1995 transitions. Second operand has 8 states, 6 states have (on average 14.333333333333334) internal successors, (86), 4 states have internal predecessors, (86), 2 states have call successors, (21), 6 states have call predecessors, (21), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-11 20:27:12,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:27:12,481 INFO L93 Difference]: Finished difference Result 1713 states and 2402 transitions. [2024-10-11 20:27:12,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 20:27:12,481 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 14.333333333333334) internal successors, (86), 4 states have internal predecessors, (86), 2 states have call successors, (21), 6 states have call predecessors, (21), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 159 [2024-10-11 20:27:12,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:27:12,487 INFO L225 Difference]: With dead ends: 1713 [2024-10-11 20:27:12,488 INFO L226 Difference]: Without dead ends: 1619 [2024-10-11 20:27:12,488 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=84, Invalid=188, Unknown=0, NotChecked=0, Total=272 [2024-10-11 20:27:12,489 INFO L432 NwaCegarLoop]: 201 mSDtfsCounter, 1140 mSDsluCounter, 785 mSDsCounter, 0 mSdLazyCounter, 957 mSolverCounterSat, 645 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1159 SdHoareTripleChecker+Valid, 986 SdHoareTripleChecker+Invalid, 1602 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 645 IncrementalHoareTripleChecker+Valid, 957 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:27:12,489 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1159 Valid, 986 Invalid, 1602 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [645 Valid, 957 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-11 20:27:12,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1619 states. [2024-10-11 20:27:12,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1619 to 1274. [2024-10-11 20:27:12,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1274 states, 914 states have (on average 1.350109409190372) internal successors, (1234), 938 states have internal predecessors, (1234), 246 states have call successors, (246), 108 states have call predecessors, (246), 112 states have return successors, (262), 244 states have call predecessors, (262), 246 states have call successors, (262) [2024-10-11 20:27:12,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1274 states to 1274 states and 1742 transitions. [2024-10-11 20:27:12,612 INFO L78 Accepts]: Start accepts. Automaton has 1274 states and 1742 transitions. Word has length 159 [2024-10-11 20:27:12,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:27:12,612 INFO L471 AbstractCegarLoop]: Abstraction has 1274 states and 1742 transitions. [2024-10-11 20:27:12,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 14.333333333333334) internal successors, (86), 4 states have internal predecessors, (86), 2 states have call successors, (21), 6 states have call predecessors, (21), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-11 20:27:12,612 INFO L276 IsEmpty]: Start isEmpty. Operand 1274 states and 1742 transitions. [2024-10-11 20:27:12,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-10-11 20:27:12,614 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:27:12,614 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 20:27:12,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-10-11 20:27:12,616 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting zf_pingErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [cdev_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, cdev_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, zf_readwErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2024-10-11 20:27:12,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:27:12,616 INFO L85 PathProgramCache]: Analyzing trace with hash 1244162184, now seen corresponding path program 1 times [2024-10-11 20:27:12,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:27:12,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426328355] [2024-10-11 20:27:12,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:27:12,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:27:12,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:13,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:27:13,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:13,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 20:27:13,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:13,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 20:27:13,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:13,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:27:13,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:13,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 20:27:13,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:13,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 20:27:13,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:13,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 20:27:13,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:13,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-11 20:27:13,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:13,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:27:13,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:13,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-11 20:27:13,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:13,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 20:27:13,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:13,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-11 20:27:13,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:13,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 20:27:13,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:13,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-11 20:27:13,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:13,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-11 20:27:13,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:13,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-10-11 20:27:13,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:13,134 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 179 trivial. 0 not checked. [2024-10-11 20:27:13,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:27:13,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426328355] [2024-10-11 20:27:13,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426328355] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:27:13,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:27:13,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 20:27:13,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507894751] [2024-10-11 20:27:13,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:27:13,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 20:27:13,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:27:13,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 20:27:13,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 20:27:13,136 INFO L87 Difference]: Start difference. First operand 1274 states and 1742 transitions. Second operand has 6 states, 5 states have (on average 18.0) internal successors, (90), 3 states have internal predecessors, (90), 2 states have call successors, (18), 5 states have call predecessors, (18), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-11 20:27:14,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:27:14,037 INFO L93 Difference]: Finished difference Result 1304 states and 1785 transitions. [2024-10-11 20:27:14,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 20:27:14,038 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 18.0) internal successors, (90), 3 states have internal predecessors, (90), 2 states have call successors, (18), 5 states have call predecessors, (18), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 164 [2024-10-11 20:27:14,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:27:14,042 INFO L225 Difference]: With dead ends: 1304 [2024-10-11 20:27:14,043 INFO L226 Difference]: Without dead ends: 1303 [2024-10-11 20:27:14,043 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-10-11 20:27:14,043 INFO L432 NwaCegarLoop]: 216 mSDtfsCounter, 702 mSDsluCounter, 465 mSDsCounter, 0 mSdLazyCounter, 541 mSolverCounterSat, 413 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 725 SdHoareTripleChecker+Valid, 681 SdHoareTripleChecker+Invalid, 954 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 413 IncrementalHoareTripleChecker+Valid, 541 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 20:27:14,044 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [725 Valid, 681 Invalid, 954 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [413 Valid, 541 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 20:27:14,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1303 states. [2024-10-11 20:27:14,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1303 to 1273. [2024-10-11 20:27:14,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1273 states, 914 states have (on average 1.3468271334792123) internal successors, (1231), 937 states have internal predecessors, (1231), 246 states have call successors, (246), 108 states have call predecessors, (246), 112 states have return successors, (262), 244 states have call predecessors, (262), 246 states have call successors, (262) [2024-10-11 20:27:14,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1273 states to 1273 states and 1739 transitions. [2024-10-11 20:27:14,160 INFO L78 Accepts]: Start accepts. Automaton has 1273 states and 1739 transitions. Word has length 164 [2024-10-11 20:27:14,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:27:14,161 INFO L471 AbstractCegarLoop]: Abstraction has 1273 states and 1739 transitions. [2024-10-11 20:27:14,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 18.0) internal successors, (90), 3 states have internal predecessors, (90), 2 states have call successors, (18), 5 states have call predecessors, (18), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-11 20:27:14,161 INFO L276 IsEmpty]: Start isEmpty. Operand 1273 states and 1739 transitions. [2024-10-11 20:27:14,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-10-11 20:27:14,162 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:27:14,163 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 20:27:14,163 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-10-11 20:27:14,163 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting zf_pingErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [cdev_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, cdev_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, zf_readwErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2024-10-11 20:27:14,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:27:14,163 INFO L85 PathProgramCache]: Analyzing trace with hash -1909142328, now seen corresponding path program 1 times [2024-10-11 20:27:14,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:27:14,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658370742] [2024-10-11 20:27:14,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:27:14,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:27:14,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:14,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:27:14,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:14,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 20:27:14,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:14,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 20:27:14,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:14,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:27:14,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:14,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 20:27:14,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:14,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 20:27:14,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:14,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 20:27:14,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:14,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-11 20:27:14,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:14,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:27:14,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:14,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-11 20:27:14,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:14,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 20:27:14,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:14,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 20:27:14,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:14,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 20:27:14,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:14,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-10-11 20:27:14,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:14,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-10-11 20:27:14,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:14,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-11 20:27:14,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:14,674 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 179 trivial. 0 not checked. [2024-10-11 20:27:14,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:27:14,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658370742] [2024-10-11 20:27:14,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1658370742] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:27:14,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:27:14,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 20:27:14,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625946141] [2024-10-11 20:27:14,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:27:14,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 20:27:14,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:27:14,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 20:27:14,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-11 20:27:14,677 INFO L87 Difference]: Start difference. First operand 1273 states and 1739 transitions. Second operand has 8 states, 8 states have (on average 11.125) internal successors, (89), 5 states have internal predecessors, (89), 3 states have call successors, (18), 5 states have call predecessors, (18), 2 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2024-10-11 20:27:17,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:27:17,195 INFO L93 Difference]: Finished difference Result 3269 states and 4530 transitions. [2024-10-11 20:27:17,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-11 20:27:17,195 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.125) internal successors, (89), 5 states have internal predecessors, (89), 3 states have call successors, (18), 5 states have call predecessors, (18), 2 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) Word has length 163 [2024-10-11 20:27:17,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:27:17,202 INFO L225 Difference]: With dead ends: 3269 [2024-10-11 20:27:17,202 INFO L226 Difference]: Without dead ends: 2047 [2024-10-11 20:27:17,204 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=125, Invalid=337, Unknown=0, NotChecked=0, Total=462 [2024-10-11 20:27:17,204 INFO L432 NwaCegarLoop]: 364 mSDtfsCounter, 1433 mSDsluCounter, 1400 mSDsCounter, 0 mSdLazyCounter, 2154 mSolverCounterSat, 835 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1477 SdHoareTripleChecker+Valid, 1764 SdHoareTripleChecker+Invalid, 2989 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 835 IncrementalHoareTripleChecker+Valid, 2154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:27:17,205 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1477 Valid, 1764 Invalid, 2989 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [835 Valid, 2154 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-10-11 20:27:17,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2047 states. [2024-10-11 20:27:17,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2047 to 1375. [2024-10-11 20:27:17,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1375 states, 982 states have (on average 1.336048879837067) internal successors, (1312), 1006 states have internal predecessors, (1312), 267 states have call successors, (267), 121 states have call predecessors, (267), 125 states have return successors, (283), 265 states have call predecessors, (283), 267 states have call successors, (283) [2024-10-11 20:27:17,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1375 states to 1375 states and 1862 transitions. [2024-10-11 20:27:17,351 INFO L78 Accepts]: Start accepts. Automaton has 1375 states and 1862 transitions. Word has length 163 [2024-10-11 20:27:17,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:27:17,351 INFO L471 AbstractCegarLoop]: Abstraction has 1375 states and 1862 transitions. [2024-10-11 20:27:17,351 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.125) internal successors, (89), 5 states have internal predecessors, (89), 3 states have call successors, (18), 5 states have call predecessors, (18), 2 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2024-10-11 20:27:17,352 INFO L276 IsEmpty]: Start isEmpty. Operand 1375 states and 1862 transitions. [2024-10-11 20:27:17,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-10-11 20:27:17,353 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:27:17,353 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 20:27:17,353 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-10-11 20:27:17,354 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting zf_pingErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [cdev_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, cdev_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, zf_readwErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2024-10-11 20:27:17,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:27:17,354 INFO L85 PathProgramCache]: Analyzing trace with hash 364292900, now seen corresponding path program 1 times [2024-10-11 20:27:17,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:27:17,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346568764] [2024-10-11 20:27:17,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:27:17,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:27:17,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:18,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:27:18,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:18,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 20:27:18,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:18,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 20:27:18,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:18,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:27:18,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:18,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-11 20:27:18,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:18,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 20:27:18,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:18,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 20:27:18,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:18,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 20:27:18,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:18,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 20:27:18,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:18,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 20:27:18,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:18,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-11 20:27:18,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:18,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-11 20:27:18,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:18,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 20:27:18,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:18,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-11 20:27:18,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:18,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-11 20:27:18,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:18,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-10-11 20:27:18,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:27:18,500 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2024-10-11 20:27:18,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:27:18,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346568764] [2024-10-11 20:27:18,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346568764] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:27:18,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:27:18,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 20:27:18,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831355118] [2024-10-11 20:27:18,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:27:18,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 20:27:18,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:27:18,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 20:27:18,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-10-11 20:27:18,506 INFO L87 Difference]: Start difference. First operand 1375 states and 1862 transitions. Second operand has 9 states, 8 states have (on average 11.5) internal successors, (92), 6 states have internal predecessors, (92), 3 states have call successors, (18), 5 states have call predecessors, (18), 2 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2024-10-11 20:27:21,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:27:21,436 INFO L93 Difference]: Finished difference Result 2183 states and 2988 transitions. [2024-10-11 20:27:21,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 20:27:21,437 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 11.5) internal successors, (92), 6 states have internal predecessors, (92), 3 states have call successors, (18), 5 states have call predecessors, (18), 2 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) Word has length 165 [2024-10-11 20:27:21,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:27:21,439 INFO L225 Difference]: With dead ends: 2183 [2024-10-11 20:27:21,440 INFO L226 Difference]: Without dead ends: 0 [2024-10-11 20:27:21,443 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=116, Invalid=226, Unknown=0, NotChecked=0, Total=342 [2024-10-11 20:27:21,443 INFO L432 NwaCegarLoop]: 319 mSDtfsCounter, 1072 mSDsluCounter, 957 mSDsCounter, 0 mSdLazyCounter, 1175 mSolverCounterSat, 584 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1095 SdHoareTripleChecker+Valid, 1276 SdHoareTripleChecker+Invalid, 1759 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 584 IncrementalHoareTripleChecker+Valid, 1175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-10-11 20:27:21,444 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1095 Valid, 1276 Invalid, 1759 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [584 Valid, 1175 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-10-11 20:27:21,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-11 20:27:21,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-11 20:27:21,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:27:21,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-11 20:27:21,446 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 165 [2024-10-11 20:27:21,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:27:21,447 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-11 20:27:21,447 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 11.5) internal successors, (92), 6 states have internal predecessors, (92), 3 states have call successors, (18), 5 states have call predecessors, (18), 2 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2024-10-11 20:27:21,447 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-11 20:27:21,447 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-11 20:27:21,450 INFO L782 garLoopResultBuilder]: Registering result SAFE for location cdev_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 21 remaining) [2024-10-11 20:27:21,450 INFO L782 garLoopResultBuilder]: Registering result SAFE for location cdev_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 21 remaining) [2024-10-11 20:27:21,450 INFO L782 garLoopResultBuilder]: Registering result SAFE for location zf_readwErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 21 remaining) [2024-10-11 20:27:21,450 INFO L782 garLoopResultBuilder]: Registering result SAFE for location zf_readwErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 21 remaining) [2024-10-11 20:27:21,450 INFO L782 garLoopResultBuilder]: Registering result SAFE for location zf_pingErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 21 remaining) [2024-10-11 20:27:21,451 INFO L782 garLoopResultBuilder]: Registering result SAFE for location zf_pingErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 21 remaining) [2024-10-11 20:27:21,451 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ##fun~$Pointer$~X~$Pointer$~TO~intErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 21 remaining) [2024-10-11 20:27:21,451 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ##fun~$Pointer$~X~$Pointer$~TO~intErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 21 remaining) [2024-10-11 20:27:21,451 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ##fun~$Pointer$~X~$Pointer$~TO~intErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 21 remaining) [2024-10-11 20:27:21,451 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ##fun~$Pointer$~X~$Pointer$~TO~intErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 21 remaining) [2024-10-11 20:27:21,451 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ##fun~$Pointer$~X~$Pointer$~TO~intErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 21 remaining) [2024-10-11 20:27:21,451 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ##fun~$Pointer$~X~$Pointer$~TO~intErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 21 remaining) [2024-10-11 20:27:21,451 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 21 remaining) [2024-10-11 20:27:21,452 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 21 remaining) [2024-10-11 20:27:21,452 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 21 remaining) [2024-10-11 20:27:21,452 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 21 remaining) [2024-10-11 20:27:21,452 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 21 remaining) [2024-10-11 20:27:21,452 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 21 remaining) [2024-10-11 20:27:21,452 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 21 remaining) [2024-10-11 20:27:21,452 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 21 remaining) [2024-10-11 20:27:21,452 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 21 remaining) [2024-10-11 20:27:21,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-10-11 20:27:21,456 INFO L407 BasicCegarLoop]: Path program histogram: [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-10-11 20:27:21,458 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.