./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test4-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test4-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9ddeff00ba0e288e2e7b04a6005a0db991f8cee358fe3ef021af7107ab321b8e --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 21:57:32,169 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 21:57:32,253 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-11-10 21:57:32,259 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 21:57:32,260 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 21:57:32,285 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 21:57:32,286 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 21:57:32,286 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 21:57:32,287 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 21:57:32,287 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 21:57:32,287 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 21:57:32,288 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 21:57:32,288 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 21:57:32,289 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 21:57:32,291 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 21:57:32,291 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 21:57:32,291 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 21:57:32,292 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 21:57:32,292 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 21:57:32,296 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 21:57:32,296 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 21:57:32,297 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 21:57:32,297 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 21:57:32,297 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 21:57:32,297 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 21:57:32,297 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-10 21:57:32,298 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 21:57:32,298 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 21:57:32,298 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 21:57:32,298 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 21:57:32,299 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 21:57:32,299 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 21:57:32,299 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 21:57:32,299 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 21:57:32,300 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 21:57:32,300 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 21:57:32,300 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 21:57:32,300 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 21:57:32,301 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 21:57:32,301 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 21:57:32,301 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 21:57:32,301 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 21:57:32,302 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 21:57:32,302 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 21:57:32,302 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9ddeff00ba0e288e2e7b04a6005a0db991f8cee358fe3ef021af7107ab321b8e [2024-11-10 21:57:32,545 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 21:57:32,572 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 21:57:32,575 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 21:57:32,577 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 21:57:32,577 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 21:57:32,578 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test4-1.i [2024-11-10 21:57:34,070 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 21:57:34,360 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 21:57:34,361 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test4-1.i [2024-11-10 21:57:34,381 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/223074209/ef7273dc462b4e40a336f86eaebf67c0/FLAG5ac360547 [2024-11-10 21:57:34,649 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/223074209/ef7273dc462b4e40a336f86eaebf67c0 [2024-11-10 21:57:34,651 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 21:57:34,652 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 21:57:34,653 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 21:57:34,653 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 21:57:34,658 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 21:57:34,658 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 09:57:34" (1/1) ... [2024-11-10 21:57:34,659 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7656770a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:57:34, skipping insertion in model container [2024-11-10 21:57:34,659 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 09:57:34" (1/1) ... [2024-11-10 21:57:34,720 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 21:57:35,328 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 21:57:35,341 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 21:57:35,456 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 21:57:35,506 INFO L204 MainTranslator]: Completed translation [2024-11-10 21:57:35,507 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:57:35 WrapperNode [2024-11-10 21:57:35,507 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 21:57:35,508 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 21:57:35,508 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 21:57:35,508 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 21:57:35,515 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:57:35" (1/1) ... [2024-11-10 21:57:35,561 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:57:35" (1/1) ... [2024-11-10 21:57:35,629 INFO L138 Inliner]: procedures = 176, calls = 336, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1563 [2024-11-10 21:57:35,629 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 21:57:35,630 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 21:57:35,630 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 21:57:35,630 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 21:57:35,643 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:57:35" (1/1) ... [2024-11-10 21:57:35,644 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:57:35" (1/1) ... [2024-11-10 21:57:35,655 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:57:35" (1/1) ... [2024-11-10 21:57:35,760 INFO L175 MemorySlicer]: Split 309 memory accesses to 2 slices as follows [2, 307]. 99 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 82 writes are split as follows [0, 82]. [2024-11-10 21:57:35,761 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:57:35" (1/1) ... [2024-11-10 21:57:35,761 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:57:35" (1/1) ... [2024-11-10 21:57:35,860 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:57:35" (1/1) ... [2024-11-10 21:57:35,866 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:57:35" (1/1) ... [2024-11-10 21:57:35,877 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:57:35" (1/1) ... [2024-11-10 21:57:35,886 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:57:35" (1/1) ... [2024-11-10 21:57:35,895 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 21:57:35,896 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 21:57:35,896 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 21:57:35,897 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 21:57:35,897 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:57:35" (1/1) ... [2024-11-10 21:57:35,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 21:57:35,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 21:57:35,957 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 21:57:35,963 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 21:57:36,010 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-10 21:57:36,010 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-10 21:57:36,010 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-10 21:57:36,011 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-10 21:57:36,011 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-10 21:57:36,011 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-10 21:57:36,011 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-10 21:57:36,011 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-10 21:57:36,011 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-10 21:57:36,013 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-10 21:57:36,013 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-10 21:57:36,013 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 21:57:36,013 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-10 21:57:36,013 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-10 21:57:36,013 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-10 21:57:36,013 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-10 21:57:36,014 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-10 21:57:36,014 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 21:57:36,014 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-10 21:57:36,014 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 21:57:36,014 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 21:57:36,273 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 21:57:36,275 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 21:57:37,922 INFO L? ?]: Removed 393 outVars from TransFormulas that were not future-live. [2024-11-10 21:57:37,923 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 21:57:37,976 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 21:57:37,976 INFO L336 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-10 21:57:37,977 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 09:57:37 BoogieIcfgContainer [2024-11-10 21:57:37,977 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 21:57:37,979 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 21:57:37,979 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 21:57:37,982 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 21:57:37,983 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 09:57:34" (1/3) ... [2024-11-10 21:57:37,983 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3754adc6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 09:57:37, skipping insertion in model container [2024-11-10 21:57:37,983 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:57:35" (2/3) ... [2024-11-10 21:57:37,984 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3754adc6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 09:57:37, skipping insertion in model container [2024-11-10 21:57:37,984 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 09:57:37" (3/3) ... [2024-11-10 21:57:37,985 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_JEN_test4-1.i [2024-11-10 21:57:38,001 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 21:57:38,002 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2024-11-10 21:57:38,085 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 21:57:38,093 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;@7716b59a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 21:57:38,093 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-11-10 21:57:38,099 INFO L276 IsEmpty]: Start isEmpty. Operand has 445 states, 420 states have (on average 1.6095238095238096) internal successors, (676), 436 states have internal predecessors, (676), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-10 21:57:38,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-10 21:57:38,107 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 21:57:38,108 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-10 21:57:38,109 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-10 21:57:38,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 21:57:38,114 INFO L85 PathProgramCache]: Analyzing trace with hash 406330624, now seen corresponding path program 1 times [2024-11-10 21:57:38,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 21:57:38,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067266016] [2024-11-10 21:57:38,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 21:57:38,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 21:57:38,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:57:38,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 21:57:38,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 21:57:38,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067266016] [2024-11-10 21:57:38,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067266016] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 21:57:38,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 21:57:38,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-10 21:57:38,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893890690] [2024-11-10 21:57:38,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 21:57:38,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 21:57:38,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 21:57:38,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 21:57:38,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 21:57:38,342 INFO L87 Difference]: Start difference. First operand has 445 states, 420 states have (on average 1.6095238095238096) internal successors, (676), 436 states have internal predecessors, (676), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 1 states have (on average 7.0) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 21:57:38,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 21:57:38,499 INFO L93 Difference]: Finished difference Result 886 states and 1423 transitions. [2024-11-10 21:57:38,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 21:57:38,503 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 7.0) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-11-10 21:57:38,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 21:57:38,519 INFO L225 Difference]: With dead ends: 886 [2024-11-10 21:57:38,520 INFO L226 Difference]: Without dead ends: 438 [2024-11-10 21:57:38,526 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 21:57:38,532 INFO L432 NwaCegarLoop]: 593 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 593 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 21:57:38,533 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 593 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 21:57:38,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2024-11-10 21:57:38,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 438. [2024-11-10 21:57:38,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 438 states, 415 states have (on average 1.4457831325301205) internal successors, (600), 429 states have internal predecessors, (600), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-10 21:57:38,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 632 transitions. [2024-11-10 21:57:38,627 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 632 transitions. Word has length 7 [2024-11-10 21:57:38,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 21:57:38,627 INFO L471 AbstractCegarLoop]: Abstraction has 438 states and 632 transitions. [2024-11-10 21:57:38,627 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 7.0) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 21:57:38,628 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 632 transitions. [2024-11-10 21:57:38,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-10 21:57:38,628 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 21:57:38,628 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 21:57:38,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 21:57:38,629 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-10 21:57:38,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 21:57:38,630 INFO L85 PathProgramCache]: Analyzing trace with hash -311616649, now seen corresponding path program 1 times [2024-11-10 21:57:38,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 21:57:38,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278809841] [2024-11-10 21:57:38,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 21:57:38,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 21:57:38,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:57:38,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 21:57:38,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 21:57:38,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278809841] [2024-11-10 21:57:38,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278809841] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 21:57:38,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 21:57:38,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 21:57:38,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695344546] [2024-11-10 21:57:38,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 21:57:38,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 21:57:38,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 21:57:38,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 21:57:38,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 21:57:38,708 INFO L87 Difference]: Start difference. First operand 438 states and 632 transitions. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 21:57:38,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 21:57:38,899 INFO L93 Difference]: Finished difference Result 865 states and 1253 transitions. [2024-11-10 21:57:38,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 21:57:38,900 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-10 21:57:38,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 21:57:38,904 INFO L225 Difference]: With dead ends: 865 [2024-11-10 21:57:38,904 INFO L226 Difference]: Without dead ends: 830 [2024-11-10 21:57:38,905 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 21:57:38,906 INFO L432 NwaCegarLoop]: 668 mSDtfsCounter, 552 mSDsluCounter, 579 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 558 SdHoareTripleChecker+Valid, 1247 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 21:57:38,907 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [558 Valid, 1247 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 21:57:38,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 830 states. [2024-11-10 21:57:38,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 830 to 444. [2024-11-10 21:57:38,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 444 states, 421 states have (on average 1.4394299287410925) internal successors, (606), 435 states have internal predecessors, (606), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-10 21:57:38,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 638 transitions. [2024-11-10 21:57:38,949 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 638 transitions. Word has length 8 [2024-11-10 21:57:38,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 21:57:38,950 INFO L471 AbstractCegarLoop]: Abstraction has 444 states and 638 transitions. [2024-11-10 21:57:38,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 21:57:38,951 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 638 transitions. [2024-11-10 21:57:38,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-10 21:57:38,957 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 21:57:38,958 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 21:57:38,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 21:57:38,958 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-10 21:57:38,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 21:57:38,962 INFO L85 PathProgramCache]: Analyzing trace with hash -532612145, now seen corresponding path program 1 times [2024-11-10 21:57:38,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 21:57:38,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006080393] [2024-11-10 21:57:38,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 21:57:38,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 21:57:39,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:57:39,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 21:57:39,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 21:57:39,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006080393] [2024-11-10 21:57:39,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006080393] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 21:57:39,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 21:57:39,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 21:57:39,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61153323] [2024-11-10 21:57:39,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 21:57:39,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 21:57:39,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 21:57:39,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 21:57:39,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 21:57:39,518 INFO L87 Difference]: Start difference. First operand 444 states and 638 transitions. Second operand has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 21:57:39,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 21:57:39,691 INFO L93 Difference]: Finished difference Result 845 states and 1212 transitions. [2024-11-10 21:57:39,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 21:57:39,692 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 155 [2024-11-10 21:57:39,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 21:57:39,694 INFO L225 Difference]: With dead ends: 845 [2024-11-10 21:57:39,694 INFO L226 Difference]: Without dead ends: 409 [2024-11-10 21:57:39,696 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 21:57:39,697 INFO L432 NwaCegarLoop]: 495 mSDtfsCounter, 23 mSDsluCounter, 968 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 1463 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 21:57:39,697 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 1463 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 21:57:39,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2024-11-10 21:57:39,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 408. [2024-11-10 21:57:39,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 408 states, 385 states have (on average 1.3974025974025974) internal successors, (538), 399 states have internal predecessors, (538), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-10 21:57:39,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 570 transitions. [2024-11-10 21:57:39,713 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 570 transitions. Word has length 155 [2024-11-10 21:57:39,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 21:57:39,714 INFO L471 AbstractCegarLoop]: Abstraction has 408 states and 570 transitions. [2024-11-10 21:57:39,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 21:57:39,714 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 570 transitions. [2024-11-10 21:57:39,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-10 21:57:39,725 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 21:57:39,725 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 21:57:39,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 21:57:39,726 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-10 21:57:39,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 21:57:39,727 INFO L85 PathProgramCache]: Analyzing trace with hash -317782992, now seen corresponding path program 1 times [2024-11-10 21:57:39,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 21:57:39,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456367814] [2024-11-10 21:57:39,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 21:57:39,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 21:57:39,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:57:40,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 21:57:40,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 21:57:40,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456367814] [2024-11-10 21:57:40,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456367814] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 21:57:40,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 21:57:40,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 21:57:40,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891785565] [2024-11-10 21:57:40,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 21:57:40,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 21:57:40,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 21:57:40,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 21:57:40,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 21:57:40,121 INFO L87 Difference]: Start difference. First operand 408 states and 570 transitions. Second operand has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 21:57:40,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 21:57:40,270 INFO L93 Difference]: Finished difference Result 796 states and 1120 transitions. [2024-11-10 21:57:40,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 21:57:40,271 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 155 [2024-11-10 21:57:40,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 21:57:40,273 INFO L225 Difference]: With dead ends: 796 [2024-11-10 21:57:40,274 INFO L226 Difference]: Without dead ends: 396 [2024-11-10 21:57:40,276 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 21:57:40,279 INFO L432 NwaCegarLoop]: 491 mSDtfsCounter, 27 mSDsluCounter, 969 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 1460 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 21:57:40,280 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 1460 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 21:57:40,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2024-11-10 21:57:40,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 396. [2024-11-10 21:57:40,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 373 states have (on average 1.3914209115281502) internal successors, (519), 387 states have internal predecessors, (519), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-10 21:57:40,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 551 transitions. [2024-11-10 21:57:40,298 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 551 transitions. Word has length 155 [2024-11-10 21:57:40,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 21:57:40,299 INFO L471 AbstractCegarLoop]: Abstraction has 396 states and 551 transitions. [2024-11-10 21:57:40,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 21:57:40,299 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 551 transitions. [2024-11-10 21:57:40,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-10 21:57:40,301 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 21:57:40,301 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 21:57:40,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 21:57:40,304 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-10 21:57:40,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 21:57:40,305 INFO L85 PathProgramCache]: Analyzing trace with hash 556892297, now seen corresponding path program 1 times [2024-11-10 21:57:40,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 21:57:40,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251705858] [2024-11-10 21:57:40,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 21:57:40,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 21:57:40,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:57:40,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 21:57:40,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 21:57:40,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251705858] [2024-11-10 21:57:40,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251705858] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 21:57:40,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 21:57:40,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 21:57:40,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876393389] [2024-11-10 21:57:40,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 21:57:40,570 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 21:57:40,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 21:57:40,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 21:57:40,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 21:57:40,571 INFO L87 Difference]: Start difference. First operand 396 states and 551 transitions. Second operand has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 21:57:40,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 21:57:40,707 INFO L93 Difference]: Finished difference Result 865 states and 1203 transitions. [2024-11-10 21:57:40,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 21:57:40,708 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 155 [2024-11-10 21:57:40,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 21:57:40,711 INFO L225 Difference]: With dead ends: 865 [2024-11-10 21:57:40,711 INFO L226 Difference]: Without dead ends: 477 [2024-11-10 21:57:40,712 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 21:57:40,713 INFO L432 NwaCegarLoop]: 509 mSDtfsCounter, 54 mSDsluCounter, 502 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 1011 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 21:57:40,714 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 1011 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 21:57:40,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2024-11-10 21:57:40,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 477. [2024-11-10 21:57:40,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 477 states, 454 states have (on average 1.381057268722467) internal successors, (627), 468 states have internal predecessors, (627), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-10 21:57:40,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 659 transitions. [2024-11-10 21:57:40,730 INFO L78 Accepts]: Start accepts. Automaton has 477 states and 659 transitions. Word has length 155 [2024-11-10 21:57:40,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 21:57:40,731 INFO L471 AbstractCegarLoop]: Abstraction has 477 states and 659 transitions. [2024-11-10 21:57:40,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 21:57:40,731 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 659 transitions. [2024-11-10 21:57:40,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-11-10 21:57:40,734 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 21:57:40,735 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 21:57:40,735 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 21:57:40,735 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-10 21:57:40,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 21:57:40,736 INFO L85 PathProgramCache]: Analyzing trace with hash -546913248, now seen corresponding path program 1 times [2024-11-10 21:57:40,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 21:57:40,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449278295] [2024-11-10 21:57:40,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 21:57:40,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 21:57:40,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:57:41,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-10 21:57:41,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:57:41,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-10 21:57:41,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:57:41,145 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-10 21:57:41,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 21:57:41,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449278295] [2024-11-10 21:57:41,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449278295] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 21:57:41,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 21:57:41,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 21:57:41,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847828487] [2024-11-10 21:57:41,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 21:57:41,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 21:57:41,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 21:57:41,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 21:57:41,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 21:57:41,156 INFO L87 Difference]: Start difference. First operand 477 states and 659 transitions. Second operand has 5 states, 5 states have (on average 32.6) internal successors, (163), 4 states have internal predecessors, (163), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 21:57:41,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 21:57:41,637 INFO L93 Difference]: Finished difference Result 826 states and 1145 transitions. [2024-11-10 21:57:41,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 21:57:41,638 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 32.6) internal successors, (163), 4 states have internal predecessors, (163), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 170 [2024-11-10 21:57:41,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 21:57:41,641 INFO L225 Difference]: With dead ends: 826 [2024-11-10 21:57:41,641 INFO L226 Difference]: Without dead ends: 438 [2024-11-10 21:57:41,642 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-10 21:57:41,643 INFO L432 NwaCegarLoop]: 410 mSDtfsCounter, 42 mSDsluCounter, 1084 mSDsCounter, 0 mSdLazyCounter, 291 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 1494 SdHoareTripleChecker+Invalid, 327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 21:57:41,643 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 1494 Invalid, 327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 291 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 21:57:41,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2024-11-10 21:57:41,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 435. [2024-11-10 21:57:41,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 435 states, 412 states have (on average 1.3349514563106797) internal successors, (550), 426 states have internal predecessors, (550), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-10 21:57:41,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 582 transitions. [2024-11-10 21:57:41,656 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 582 transitions. Word has length 170 [2024-11-10 21:57:41,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 21:57:41,656 INFO L471 AbstractCegarLoop]: Abstraction has 435 states and 582 transitions. [2024-11-10 21:57:41,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 32.6) internal successors, (163), 4 states have internal predecessors, (163), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 21:57:41,657 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 582 transitions. [2024-11-10 21:57:41,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-11-10 21:57:41,659 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 21:57:41,659 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 21:57:41,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 21:57:41,659 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-10 21:57:41,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 21:57:41,660 INFO L85 PathProgramCache]: Analyzing trace with hash -434646058, now seen corresponding path program 1 times [2024-11-10 21:57:41,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 21:57:41,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454087520] [2024-11-10 21:57:41,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 21:57:41,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 21:57:41,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:57:41,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-10 21:57:41,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:57:41,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-10 21:57:41,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:57:42,000 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-10 21:57:42,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 21:57:42,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454087520] [2024-11-10 21:57:42,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454087520] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 21:57:42,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 21:57:42,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 21:57:42,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927045986] [2024-11-10 21:57:42,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 21:57:42,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 21:57:42,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 21:57:42,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 21:57:42,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 21:57:42,003 INFO L87 Difference]: Start difference. First operand 435 states and 582 transitions. Second operand has 5 states, 5 states have (on average 32.6) internal successors, (163), 4 states have internal predecessors, (163), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 21:57:42,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 21:57:42,445 INFO L93 Difference]: Finished difference Result 778 states and 1051 transitions. [2024-11-10 21:57:42,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 21:57:42,446 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 32.6) internal successors, (163), 4 states have internal predecessors, (163), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 170 [2024-11-10 21:57:42,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 21:57:42,449 INFO L225 Difference]: With dead ends: 778 [2024-11-10 21:57:42,449 INFO L226 Difference]: Without dead ends: 432 [2024-11-10 21:57:42,450 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-10 21:57:42,451 INFO L432 NwaCegarLoop]: 412 mSDtfsCounter, 15 mSDsluCounter, 1089 mSDsCounter, 0 mSdLazyCounter, 281 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 1501 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 21:57:42,451 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 1501 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 281 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 21:57:42,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2024-11-10 21:57:42,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 429. [2024-11-10 21:57:42,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 429 states, 406 states have (on average 1.3300492610837438) internal successors, (540), 420 states have internal predecessors, (540), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-10 21:57:42,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 572 transitions. [2024-11-10 21:57:42,461 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 572 transitions. Word has length 170 [2024-11-10 21:57:42,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 21:57:42,462 INFO L471 AbstractCegarLoop]: Abstraction has 429 states and 572 transitions. [2024-11-10 21:57:42,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 32.6) internal successors, (163), 4 states have internal predecessors, (163), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 21:57:42,462 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 572 transitions. [2024-11-10 21:57:42,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-11-10 21:57:42,464 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 21:57:42,464 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 21:57:42,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 21:57:42,464 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-10 21:57:42,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 21:57:42,465 INFO L85 PathProgramCache]: Analyzing trace with hash 1924100826, now seen corresponding path program 1 times [2024-11-10 21:57:42,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 21:57:42,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125325140] [2024-11-10 21:57:42,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 21:57:42,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 21:57:42,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:57:42,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-10 21:57:42,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:57:42,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-10 21:57:42,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:57:42,717 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-10 21:57:42,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 21:57:42,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125325140] [2024-11-10 21:57:42,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125325140] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 21:57:42,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 21:57:42,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 21:57:42,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102446096] [2024-11-10 21:57:42,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 21:57:42,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 21:57:42,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 21:57:42,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 21:57:42,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 21:57:42,720 INFO L87 Difference]: Start difference. First operand 429 states and 572 transitions. Second operand has 4 states, 4 states have (on average 40.75) internal successors, (163), 3 states have internal predecessors, (163), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 21:57:43,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 21:57:43,171 INFO L93 Difference]: Finished difference Result 914 states and 1230 transitions. [2024-11-10 21:57:43,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 21:57:43,171 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 40.75) internal successors, (163), 3 states have internal predecessors, (163), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 170 [2024-11-10 21:57:43,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 21:57:43,174 INFO L225 Difference]: With dead ends: 914 [2024-11-10 21:57:43,174 INFO L226 Difference]: Without dead ends: 574 [2024-11-10 21:57:43,175 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 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-11-10 21:57:43,176 INFO L432 NwaCegarLoop]: 427 mSDtfsCounter, 166 mSDsluCounter, 726 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 1153 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 21:57:43,176 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 1153 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 21:57:43,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2024-11-10 21:57:43,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 571. [2024-11-10 21:57:43,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 571 states, 545 states have (on average 1.3266055045871559) internal successors, (723), 559 states have internal predecessors, (723), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 10 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-10 21:57:43,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 761 transitions. [2024-11-10 21:57:43,192 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 761 transitions. Word has length 170 [2024-11-10 21:57:43,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 21:57:43,193 INFO L471 AbstractCegarLoop]: Abstraction has 571 states and 761 transitions. [2024-11-10 21:57:43,193 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.75) internal successors, (163), 3 states have internal predecessors, (163), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 21:57:43,193 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 761 transitions. [2024-11-10 21:57:43,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2024-11-10 21:57:43,195 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 21:57:43,195 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 21:57:43,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 21:57:43,195 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-10 21:57:43,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 21:57:43,196 INFO L85 PathProgramCache]: Analyzing trace with hash -993147155, now seen corresponding path program 1 times [2024-11-10 21:57:43,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 21:57:43,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613541564] [2024-11-10 21:57:43,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 21:57:43,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 21:57:43,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:57:43,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-10 21:57:43,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:57:43,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-10 21:57:43,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:57:43,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-10 21:57:43,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:57:43,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-11-10 21:57:43,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:57:43,585 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-10 21:57:43,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 21:57:43,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613541564] [2024-11-10 21:57:43,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1613541564] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 21:57:43,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 21:57:43,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 21:57:43,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436911997] [2024-11-10 21:57:43,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 21:57:43,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 21:57:43,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 21:57:43,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 21:57:43,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 21:57:43,589 INFO L87 Difference]: Start difference. First operand 571 states and 761 transitions. Second operand has 5 states, 4 states have (on average 42.0) internal successors, (168), 4 states have internal predecessors, (168), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-10 21:57:44,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 21:57:44,100 INFO L93 Difference]: Finished difference Result 642 states and 864 transitions. [2024-11-10 21:57:44,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 21:57:44,101 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 42.0) internal successors, (168), 4 states have internal predecessors, (168), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 185 [2024-11-10 21:57:44,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 21:57:44,104 INFO L225 Difference]: With dead ends: 642 [2024-11-10 21:57:44,104 INFO L226 Difference]: Without dead ends: 640 [2024-11-10 21:57:44,105 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 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-11-10 21:57:44,105 INFO L432 NwaCegarLoop]: 419 mSDtfsCounter, 220 mSDsluCounter, 1122 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 1541 SdHoareTripleChecker+Invalid, 289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-10 21:57:44,105 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 1541 Invalid, 289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-10 21:57:44,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 640 states. [2024-11-10 21:57:44,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 640 to 636. [2024-11-10 21:57:44,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 636 states, 607 states have (on average 1.3212520593080725) internal successors, (802), 621 states have internal predecessors, (802), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 13 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-10 21:57:44,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 636 states to 636 states and 846 transitions. [2024-11-10 21:57:44,132 INFO L78 Accepts]: Start accepts. Automaton has 636 states and 846 transitions. Word has length 185 [2024-11-10 21:57:44,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 21:57:44,133 INFO L471 AbstractCegarLoop]: Abstraction has 636 states and 846 transitions. [2024-11-10 21:57:44,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 42.0) internal successors, (168), 4 states have internal predecessors, (168), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-10 21:57:44,133 INFO L276 IsEmpty]: Start isEmpty. Operand 636 states and 846 transitions. [2024-11-10 21:57:44,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2024-11-10 21:57:44,136 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 21:57:44,136 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 21:57:44,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 21:57:44,136 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-10 21:57:44,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 21:57:44,137 INFO L85 PathProgramCache]: Analyzing trace with hash -756985630, now seen corresponding path program 1 times [2024-11-10 21:57:44,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 21:57:44,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464264953] [2024-11-10 21:57:44,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 21:57:44,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 21:57:44,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:57:44,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-10 21:57:44,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:57:44,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-10 21:57:44,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:57:44,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-10 21:57:44,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:57:44,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-11-10 21:57:44,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:57:44,538 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-10 21:57:44,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 21:57:44,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464264953] [2024-11-10 21:57:44,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464264953] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 21:57:44,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [215572858] [2024-11-10 21:57:44,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 21:57:44,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 21:57:44,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 21:57:44,541 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 21:57:44,542 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-10 21:57:45,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:57:45,070 INFO L255 TraceCheckSpWp]: Trace formula consists of 1037 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 21:57:45,082 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 21:57:45,363 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-10 21:57:45,363 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 21:57:45,659 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-10 21:57:45,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [215572858] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 21:57:45,659 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 21:57:45,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 11 [2024-11-10 21:57:45,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617602653] [2024-11-10 21:57:45,660 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 21:57:45,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-10 21:57:45,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 21:57:45,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-10 21:57:45,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2024-11-10 21:57:45,662 INFO L87 Difference]: Start difference. First operand 636 states and 846 transitions. Second operand has 11 states, 11 states have (on average 46.45454545454545) internal successors, (511), 10 states have internal predecessors, (511), 3 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-10 21:57:46,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 21:57:46,421 INFO L93 Difference]: Finished difference Result 976 states and 1323 transitions. [2024-11-10 21:57:46,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 21:57:46,422 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 46.45454545454545) internal successors, (511), 10 states have internal predecessors, (511), 3 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 193 [2024-11-10 21:57:46,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 21:57:46,427 INFO L225 Difference]: With dead ends: 976 [2024-11-10 21:57:46,427 INFO L226 Difference]: Without dead ends: 941 [2024-11-10 21:57:46,427 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 397 GetRequests, 388 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2024-11-10 21:57:46,428 INFO L432 NwaCegarLoop]: 417 mSDtfsCounter, 1192 mSDsluCounter, 1917 mSDsCounter, 0 mSdLazyCounter, 404 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1220 SdHoareTripleChecker+Valid, 2334 SdHoareTripleChecker+Invalid, 434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 404 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-10 21:57:46,428 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1220 Valid, 2334 Invalid, 434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 404 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-10 21:57:46,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 941 states. [2024-11-10 21:57:46,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 941 to 938. [2024-11-10 21:57:46,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 938 states, 903 states have (on average 1.317829457364341) internal successors, (1190), 917 states have internal predecessors, (1190), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 19 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-10 21:57:46,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 938 states to 938 states and 1246 transitions. [2024-11-10 21:57:46,455 INFO L78 Accepts]: Start accepts. Automaton has 938 states and 1246 transitions. Word has length 193 [2024-11-10 21:57:46,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 21:57:46,456 INFO L471 AbstractCegarLoop]: Abstraction has 938 states and 1246 transitions. [2024-11-10 21:57:46,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 46.45454545454545) internal successors, (511), 10 states have internal predecessors, (511), 3 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-10 21:57:46,457 INFO L276 IsEmpty]: Start isEmpty. Operand 938 states and 1246 transitions. [2024-11-10 21:57:46,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2024-11-10 21:57:46,459 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 21:57:46,459 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 21:57:46,480 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-10 21:57:46,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-10 21:57:46,664 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-10 21:57:46,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 21:57:46,665 INFO L85 PathProgramCache]: Analyzing trace with hash -734020793, now seen corresponding path program 1 times [2024-11-10 21:57:46,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 21:57:46,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770827677] [2024-11-10 21:57:46,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 21:57:46,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 21:57:47,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:57:47,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-10 21:57:47,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:57:47,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-10 21:57:47,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:57:47,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-10 21:57:47,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:57:47,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-11-10 21:57:47,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:57:47,667 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-10 21:57:47,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 21:57:47,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770827677] [2024-11-10 21:57:47,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770827677] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 21:57:47,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [189041471] [2024-11-10 21:57:47,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 21:57:47,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 21:57:47,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 21:57:47,670 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 21:57:47,672 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-10 21:57:48,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:57:48,287 INFO L255 TraceCheckSpWp]: Trace formula consists of 1043 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-10 21:57:48,303 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 21:57:48,353 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-10 21:57:48,389 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2024-11-10 21:57:49,257 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-10 21:57:49,257 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 21:57:49,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [189041471] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 21:57:49,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 21:57:49,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [5] total 15 [2024-11-10 21:57:49,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874522539] [2024-11-10 21:57:49,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 21:57:49,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-10 21:57:49,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 21:57:49,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-10 21:57:49,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2024-11-10 21:57:49,259 INFO L87 Difference]: Start difference. First operand 938 states and 1246 transitions. Second operand has 12 states, 12 states have (on average 14.666666666666666) internal successors, (176), 12 states have internal predecessors, (176), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-10 21:57:52,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 21:57:52,350 INFO L93 Difference]: Finished difference Result 1834 states and 2447 transitions. [2024-11-10 21:57:52,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-10 21:57:52,354 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 14.666666666666666) internal successors, (176), 12 states have internal predecessors, (176), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 193 [2024-11-10 21:57:52,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 21:57:52,360 INFO L225 Difference]: With dead ends: 1834 [2024-11-10 21:57:52,360 INFO L226 Difference]: Without dead ends: 938 [2024-11-10 21:57:52,365 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=112, Invalid=394, Unknown=0, NotChecked=0, Total=506 [2024-11-10 21:57:52,366 INFO L432 NwaCegarLoop]: 452 mSDtfsCounter, 468 mSDsluCounter, 3182 mSDsCounter, 0 mSdLazyCounter, 1343 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 473 SdHoareTripleChecker+Valid, 3634 SdHoareTripleChecker+Invalid, 1351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-11-10 21:57:52,366 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [473 Valid, 3634 Invalid, 1351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1343 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-11-10 21:57:52,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 938 states. [2024-11-10 21:57:52,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 938 to 938. [2024-11-10 21:57:52,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 938 states, 903 states have (on average 1.3167220376522701) internal successors, (1189), 917 states have internal predecessors, (1189), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 19 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-10 21:57:52,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 938 states to 938 states and 1245 transitions. [2024-11-10 21:57:52,397 INFO L78 Accepts]: Start accepts. Automaton has 938 states and 1245 transitions. Word has length 193 [2024-11-10 21:57:52,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 21:57:52,397 INFO L471 AbstractCegarLoop]: Abstraction has 938 states and 1245 transitions. [2024-11-10 21:57:52,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 14.666666666666666) internal successors, (176), 12 states have internal predecessors, (176), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-10 21:57:52,398 INFO L276 IsEmpty]: Start isEmpty. Operand 938 states and 1245 transitions. [2024-11-10 21:57:52,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2024-11-10 21:57:52,400 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 21:57:52,400 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 21:57:52,422 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-10 21:57:52,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-10 21:57:52,605 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-10 21:57:52,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 21:57:52,606 INFO L85 PathProgramCache]: Analyzing trace with hash -1857412612, now seen corresponding path program 1 times [2024-11-10 21:57:52,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 21:57:52,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893721899] [2024-11-10 21:57:52,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 21:57:52,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 21:57:53,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:57:53,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-10 21:57:53,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:57:53,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 21:57:53,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:57:53,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-11-10 21:57:53,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:57:53,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-11-10 21:57:53,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:57:53,573 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-10 21:57:53,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 21:57:53,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893721899] [2024-11-10 21:57:53,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [893721899] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 21:57:53,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [234104698] [2024-11-10 21:57:53,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 21:57:53,574 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 21:57:53,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 21:57:53,576 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 21:57:53,577 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-10 21:57:54,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:57:54,169 INFO L255 TraceCheckSpWp]: Trace formula consists of 1044 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-10 21:57:54,174 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 21:57:54,228 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-10 21:57:54,229 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 21:57:54,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [234104698] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 21:57:54,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 21:57:54,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2024-11-10 21:57:54,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496631770] [2024-11-10 21:57:54,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 21:57:54,230 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 21:57:54,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 21:57:54,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 21:57:54,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-10 21:57:54,231 INFO L87 Difference]: Start difference. First operand 938 states and 1245 transitions. Second operand has 4 states, 4 states have (on average 44.25) internal successors, (177), 4 states have internal predecessors, (177), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-10 21:57:54,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 21:57:54,402 INFO L93 Difference]: Finished difference Result 1834 states and 2446 transitions. [2024-11-10 21:57:54,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 21:57:54,403 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 44.25) internal successors, (177), 4 states have internal predecessors, (177), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 194 [2024-11-10 21:57:54,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 21:57:54,407 INFO L225 Difference]: With dead ends: 1834 [2024-11-10 21:57:54,407 INFO L226 Difference]: Without dead ends: 938 [2024-11-10 21:57:54,409 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 199 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-10 21:57:54,410 INFO L432 NwaCegarLoop]: 423 mSDtfsCounter, 13 mSDsluCounter, 733 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 1156 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 21:57:54,410 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 1156 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 21:57:54,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 938 states. [2024-11-10 21:57:54,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 938 to 938. [2024-11-10 21:57:54,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 938 states, 903 states have (on average 1.3133997785160576) internal successors, (1186), 917 states have internal predecessors, (1186), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 19 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-10 21:57:54,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 938 states to 938 states and 1242 transitions. [2024-11-10 21:57:54,434 INFO L78 Accepts]: Start accepts. Automaton has 938 states and 1242 transitions. Word has length 194 [2024-11-10 21:57:54,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 21:57:54,435 INFO L471 AbstractCegarLoop]: Abstraction has 938 states and 1242 transitions. [2024-11-10 21:57:54,435 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 44.25) internal successors, (177), 4 states have internal predecessors, (177), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-10 21:57:54,435 INFO L276 IsEmpty]: Start isEmpty. Operand 938 states and 1242 transitions. [2024-11-10 21:57:54,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2024-11-10 21:57:54,437 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 21:57:54,437 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 21:57:54,459 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-10 21:57:54,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 21:57:54,639 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-10 21:57:54,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 21:57:54,639 INFO L85 PathProgramCache]: Analyzing trace with hash 106456042, now seen corresponding path program 1 times [2024-11-10 21:57:54,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 21:57:54,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8303601] [2024-11-10 21:57:54,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 21:57:54,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 21:57:54,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:57:55,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 21:57:55,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:57:55,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 21:57:55,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:57:55,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-10 21:57:55,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:57:55,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-10 21:57:55,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:57:55,179 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-10 21:57:55,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 21:57:55,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8303601] [2024-11-10 21:57:55,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [8303601] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 21:57:55,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 21:57:55,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 21:57:55,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153127655] [2024-11-10 21:57:55,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 21:57:55,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 21:57:55,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 21:57:55,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 21:57:55,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-10 21:57:55,182 INFO L87 Difference]: Start difference. First operand 938 states and 1242 transitions. Second operand has 7 states, 7 states have (on average 25.428571428571427) internal successors, (178), 6 states have internal predecessors, (178), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-10 21:57:55,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 21:57:55,843 INFO L93 Difference]: Finished difference Result 1843 states and 2472 transitions. [2024-11-10 21:57:55,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 21:57:55,844 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 25.428571428571427) internal successors, (178), 6 states have internal predecessors, (178), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 195 [2024-11-10 21:57:55,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 21:57:55,848 INFO L225 Difference]: With dead ends: 1843 [2024-11-10 21:57:55,848 INFO L226 Difference]: Without dead ends: 950 [2024-11-10 21:57:55,849 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-10 21:57:55,850 INFO L432 NwaCegarLoop]: 418 mSDtfsCounter, 10 mSDsluCounter, 1355 mSDsCounter, 0 mSdLazyCounter, 488 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 1773 SdHoareTripleChecker+Invalid, 505 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 488 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-10 21:57:55,850 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 1773 Invalid, 505 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 488 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-10 21:57:55,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 950 states. [2024-11-10 21:57:55,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 950 to 947. [2024-11-10 21:57:55,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 947 states, 912 states have (on average 1.3103070175438596) internal successors, (1195), 926 states have internal predecessors, (1195), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 19 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-10 21:57:55,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 947 states to 947 states and 1251 transitions. [2024-11-10 21:57:55,875 INFO L78 Accepts]: Start accepts. Automaton has 947 states and 1251 transitions. Word has length 195 [2024-11-10 21:57:55,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 21:57:55,876 INFO L471 AbstractCegarLoop]: Abstraction has 947 states and 1251 transitions. [2024-11-10 21:57:55,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 25.428571428571427) internal successors, (178), 6 states have internal predecessors, (178), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-10 21:57:55,876 INFO L276 IsEmpty]: Start isEmpty. Operand 947 states and 1251 transitions. [2024-11-10 21:57:55,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2024-11-10 21:57:55,878 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 21:57:55,878 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 21:57:55,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-10 21:57:55,879 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-10 21:57:55,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 21:57:55,879 INFO L85 PathProgramCache]: Analyzing trace with hash -977614906, now seen corresponding path program 1 times [2024-11-10 21:57:55,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 21:57:55,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953698509] [2024-11-10 21:57:55,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 21:57:55,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 21:57:56,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:57:56,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 21:57:56,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:57:56,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-10 21:57:56,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:57:56,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-10 21:57:56,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:57:56,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-10 21:57:56,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:57:56,675 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-10 21:57:56,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 21:57:56,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953698509] [2024-11-10 21:57:56,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953698509] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 21:57:56,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1167865173] [2024-11-10 21:57:56,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 21:57:56,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 21:57:56,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 21:57:56,678 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 21:57:56,679 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-10 21:57:57,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:57:57,569 INFO L255 TraceCheckSpWp]: Trace formula consists of 1043 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-10 21:57:57,574 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 21:57:57,721 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-10 21:57:57,721 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 21:57:57,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1167865173] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 21:57:57,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 21:57:57,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [5] total 10 [2024-11-10 21:57:57,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058401824] [2024-11-10 21:57:57,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 21:57:57,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 21:57:57,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 21:57:57,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 21:57:57,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-10 21:57:57,724 INFO L87 Difference]: Start difference. First operand 947 states and 1251 transitions. Second operand has 7 states, 7 states have (on average 26.0) internal successors, (182), 7 states have internal predecessors, (182), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-10 21:57:58,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 21:57:58,029 INFO L93 Difference]: Finished difference Result 1722 states and 2291 transitions. [2024-11-10 21:57:58,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 21:57:58,030 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 26.0) internal successors, (182), 7 states have internal predecessors, (182), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 196 [2024-11-10 21:57:58,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 21:57:58,034 INFO L225 Difference]: With dead ends: 1722 [2024-11-10 21:57:58,035 INFO L226 Difference]: Without dead ends: 962 [2024-11-10 21:57:58,036 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 198 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-10 21:57:58,037 INFO L432 NwaCegarLoop]: 419 mSDtfsCounter, 8 mSDsluCounter, 1471 mSDsCounter, 0 mSdLazyCounter, 383 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 1890 SdHoareTripleChecker+Invalid, 385 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 383 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 21:57:58,037 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 1890 Invalid, 385 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 383 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 21:57:58,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 962 states. [2024-11-10 21:57:58,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 962 to 959. [2024-11-10 21:57:58,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 959 states, 924 states have (on average 1.3062770562770563) internal successors, (1207), 938 states have internal predecessors, (1207), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 19 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-10 21:57:58,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 959 states to 959 states and 1263 transitions. [2024-11-10 21:57:58,064 INFO L78 Accepts]: Start accepts. Automaton has 959 states and 1263 transitions. Word has length 196 [2024-11-10 21:57:58,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 21:57:58,064 INFO L471 AbstractCegarLoop]: Abstraction has 959 states and 1263 transitions. [2024-11-10 21:57:58,065 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 26.0) internal successors, (182), 7 states have internal predecessors, (182), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-10 21:57:58,065 INFO L276 IsEmpty]: Start isEmpty. Operand 959 states and 1263 transitions. [2024-11-10 21:57:58,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2024-11-10 21:57:58,066 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 21:57:58,067 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 21:57:58,091 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-10 21:57:58,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 21:57:58,268 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-10 21:57:58,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 21:57:58,268 INFO L85 PathProgramCache]: Analyzing trace with hash -815157072, now seen corresponding path program 1 times [2024-11-10 21:57:58,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 21:57:58,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570004778] [2024-11-10 21:57:58,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 21:57:58,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 21:57:58,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:57:58,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 21:57:58,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:57:58,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-10 21:57:58,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:57:58,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-10 21:57:58,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:57:58,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-11-10 21:57:58,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:57:58,783 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-10 21:57:58,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 21:57:58,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570004778] [2024-11-10 21:57:58,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570004778] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 21:57:58,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 21:57:58,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 21:57:58,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593706886] [2024-11-10 21:57:58,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 21:57:58,785 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 21:57:58,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 21:57:58,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 21:57:58,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-10 21:57:58,786 INFO L87 Difference]: Start difference. First operand 959 states and 1263 transitions. Second operand has 8 states, 8 states have (on average 22.5) internal successors, (180), 7 states have internal predecessors, (180), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-10 21:57:59,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 21:57:59,683 INFO L93 Difference]: Finished difference Result 1735 states and 2316 transitions. [2024-11-10 21:57:59,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 21:57:59,684 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 22.5) internal successors, (180), 7 states have internal predecessors, (180), 2 states have call successors, (4), 1 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 197 [2024-11-10 21:57:59,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 21:57:59,688 INFO L225 Difference]: With dead ends: 1735 [2024-11-10 21:57:59,688 INFO L226 Difference]: Without dead ends: 977 [2024-11-10 21:57:59,690 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-10 21:57:59,690 INFO L432 NwaCegarLoop]: 409 mSDtfsCounter, 16 mSDsluCounter, 2009 mSDsCounter, 0 mSdLazyCounter, 716 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 2418 SdHoareTripleChecker+Invalid, 731 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 716 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-10 21:57:59,691 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 2418 Invalid, 731 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 716 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-10 21:57:59,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 977 states. [2024-11-10 21:57:59,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 977 to 971. [2024-11-10 21:57:59,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 971 states, 936 states have (on average 1.3055555555555556) internal successors, (1222), 950 states have internal predecessors, (1222), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 19 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-10 21:57:59,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 971 states to 971 states and 1278 transitions. [2024-11-10 21:57:59,713 INFO L78 Accepts]: Start accepts. Automaton has 971 states and 1278 transitions. Word has length 197 [2024-11-10 21:57:59,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 21:57:59,718 INFO L471 AbstractCegarLoop]: Abstraction has 971 states and 1278 transitions. [2024-11-10 21:57:59,718 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 22.5) internal successors, (180), 7 states have internal predecessors, (180), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-10 21:57:59,718 INFO L276 IsEmpty]: Start isEmpty. Operand 971 states and 1278 transitions. [2024-11-10 21:57:59,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2024-11-10 21:57:59,719 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 21:57:59,720 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 21:57:59,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-10 21:57:59,720 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-10 21:57:59,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 21:57:59,721 INFO L85 PathProgramCache]: Analyzing trace with hash 712892227, now seen corresponding path program 1 times [2024-11-10 21:57:59,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 21:57:59,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097859482] [2024-11-10 21:57:59,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 21:57:59,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 21:57:59,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:58:00,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 21:58:00,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:58:00,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-10 21:58:00,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:58:00,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-10 21:58:00,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:58:00,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-11-10 21:58:00,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:58:00,337 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-10 21:58:00,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 21:58:00,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097859482] [2024-11-10 21:58:00,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097859482] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 21:58:00,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 21:58:00,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 21:58:00,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007724322] [2024-11-10 21:58:00,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 21:58:00,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 21:58:00,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 21:58:00,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 21:58:00,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-10 21:58:00,341 INFO L87 Difference]: Start difference. First operand 971 states and 1278 transitions. Second operand has 7 states, 7 states have (on average 25.857142857142858) internal successors, (181), 6 states have internal predecessors, (181), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-10 21:58:01,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 21:58:01,029 INFO L93 Difference]: Finished difference Result 1756 states and 2343 transitions. [2024-11-10 21:58:01,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 21:58:01,030 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 25.857142857142858) internal successors, (181), 6 states have internal predecessors, (181), 2 states have call successors, (4), 1 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 198 [2024-11-10 21:58:01,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 21:58:01,035 INFO L225 Difference]: With dead ends: 1756 [2024-11-10 21:58:01,035 INFO L226 Difference]: Without dead ends: 983 [2024-11-10 21:58:01,036 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-10 21:58:01,037 INFO L432 NwaCegarLoop]: 419 mSDtfsCounter, 10 mSDsluCounter, 1678 mSDsCounter, 0 mSdLazyCounter, 601 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 2097 SdHoareTripleChecker+Invalid, 616 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 601 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-10 21:58:01,037 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 2097 Invalid, 616 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 601 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-10 21:58:01,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 983 states. [2024-11-10 21:58:01,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 983 to 980. [2024-11-10 21:58:01,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 980 states, 945 states have (on average 1.3026455026455026) internal successors, (1231), 959 states have internal predecessors, (1231), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 19 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-10 21:58:01,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 980 states to 980 states and 1287 transitions. [2024-11-10 21:58:01,067 INFO L78 Accepts]: Start accepts. Automaton has 980 states and 1287 transitions. Word has length 198 [2024-11-10 21:58:01,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 21:58:01,067 INFO L471 AbstractCegarLoop]: Abstraction has 980 states and 1287 transitions. [2024-11-10 21:58:01,068 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 25.857142857142858) internal successors, (181), 6 states have internal predecessors, (181), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-10 21:58:01,068 INFO L276 IsEmpty]: Start isEmpty. Operand 980 states and 1287 transitions. [2024-11-10 21:58:01,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2024-11-10 21:58:01,069 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 21:58:01,070 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 21:58:01,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-10 21:58:01,070 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-10 21:58:01,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 21:58:01,070 INFO L85 PathProgramCache]: Analyzing trace with hash 1435500127, now seen corresponding path program 1 times [2024-11-10 21:58:01,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 21:58:01,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195669177] [2024-11-10 21:58:01,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 21:58:01,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 21:58:01,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:58:01,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 21:58:01,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:58:01,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-10 21:58:01,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:58:01,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-10 21:58:01,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:58:01,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-11-10 21:58:01,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:58:01,805 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-10 21:58:01,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 21:58:01,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195669177] [2024-11-10 21:58:01,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [195669177] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 21:58:01,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 21:58:01,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-10 21:58:01,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930706976] [2024-11-10 21:58:01,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 21:58:01,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 21:58:01,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 21:58:01,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 21:58:01,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-10 21:58:01,808 INFO L87 Difference]: Start difference. First operand 980 states and 1287 transitions. Second operand has 10 states, 10 states have (on average 18.1) internal successors, (181), 9 states have internal predecessors, (181), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-10 21:58:02,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 21:58:02,840 INFO L93 Difference]: Finished difference Result 1793 states and 2389 transitions. [2024-11-10 21:58:02,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-10 21:58:02,841 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 18.1) internal successors, (181), 9 states have internal predecessors, (181), 2 states have call successors, (4), 1 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 198 [2024-11-10 21:58:02,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 21:58:02,846 INFO L225 Difference]: With dead ends: 1793 [2024-11-10 21:58:02,846 INFO L226 Difference]: Without dead ends: 1016 [2024-11-10 21:58:02,847 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2024-11-10 21:58:02,848 INFO L432 NwaCegarLoop]: 417 mSDtfsCounter, 35 mSDsluCounter, 2773 mSDsCounter, 0 mSdLazyCounter, 966 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 3190 SdHoareTripleChecker+Invalid, 983 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 966 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-10 21:58:02,848 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 3190 Invalid, 983 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 966 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-10 21:58:02,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1016 states. [2024-11-10 21:58:02,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1016 to 1004. [2024-11-10 21:58:02,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1004 states, 969 states have (on average 1.301341589267286) internal successors, (1261), 983 states have internal predecessors, (1261), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 19 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-10 21:58:02,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1004 states to 1004 states and 1317 transitions. [2024-11-10 21:58:02,873 INFO L78 Accepts]: Start accepts. Automaton has 1004 states and 1317 transitions. Word has length 198 [2024-11-10 21:58:02,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 21:58:02,874 INFO L471 AbstractCegarLoop]: Abstraction has 1004 states and 1317 transitions. [2024-11-10 21:58:02,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 18.1) internal successors, (181), 9 states have internal predecessors, (181), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-10 21:58:02,874 INFO L276 IsEmpty]: Start isEmpty. Operand 1004 states and 1317 transitions. [2024-11-10 21:58:02,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-11-10 21:58:02,877 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 21:58:02,877 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 21:58:02,877 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-10 21:58:02,877 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-10 21:58:02,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 21:58:02,878 INFO L85 PathProgramCache]: Analyzing trace with hash 1320579383, now seen corresponding path program 1 times [2024-11-10 21:58:02,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 21:58:02,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716413373] [2024-11-10 21:58:02,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 21:58:02,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 21:58:03,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:58:03,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 21:58:03,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:58:03,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-10 21:58:03,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:58:03,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-11-10 21:58:03,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:58:03,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-10 21:58:03,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:58:03,746 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-10 21:58:03,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 21:58:03,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716413373] [2024-11-10 21:58:03,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716413373] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 21:58:03,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [193202194] [2024-11-10 21:58:03,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 21:58:03,747 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 21:58:03,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 21:58:03,749 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 21:58:03,751 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-10 21:58:04,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:58:04,450 INFO L255 TraceCheckSpWp]: Trace formula consists of 1043 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-10 21:58:04,455 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 21:58:04,728 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-10 21:58:04,728 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 21:58:04,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [193202194] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 21:58:04,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 21:58:04,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [5] total 10 [2024-11-10 21:58:04,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847159608] [2024-11-10 21:58:04,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 21:58:04,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 21:58:04,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 21:58:04,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 21:58:04,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-10 21:58:04,731 INFO L87 Difference]: Start difference. First operand 1004 states and 1317 transitions. Second operand has 7 states, 7 states have (on average 26.0) internal successors, (182), 7 states have internal predecessors, (182), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-10 21:58:05,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 21:58:05,123 INFO L93 Difference]: Finished difference Result 1968 states and 2596 transitions. [2024-11-10 21:58:05,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 21:58:05,124 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 26.0) internal successors, (182), 7 states have internal predecessors, (182), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 199 [2024-11-10 21:58:05,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 21:58:05,128 INFO L225 Difference]: With dead ends: 1968 [2024-11-10 21:58:05,128 INFO L226 Difference]: Without dead ends: 1019 [2024-11-10 21:58:05,130 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-10 21:58:05,131 INFO L432 NwaCegarLoop]: 413 mSDtfsCounter, 8 mSDsluCounter, 1781 mSDsCounter, 0 mSdLazyCounter, 504 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 2194 SdHoareTripleChecker+Invalid, 505 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 504 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 21:58:05,131 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 2194 Invalid, 505 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 504 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 21:58:05,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1019 states. [2024-11-10 21:58:05,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1019 to 1016. [2024-11-10 21:58:05,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1016 states, 981 states have (on average 1.3007135575942916) internal successors, (1276), 995 states have internal predecessors, (1276), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 19 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-10 21:58:05,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1016 states to 1016 states and 1332 transitions. [2024-11-10 21:58:05,159 INFO L78 Accepts]: Start accepts. Automaton has 1016 states and 1332 transitions. Word has length 199 [2024-11-10 21:58:05,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 21:58:05,159 INFO L471 AbstractCegarLoop]: Abstraction has 1016 states and 1332 transitions. [2024-11-10 21:58:05,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 26.0) internal successors, (182), 7 states have internal predecessors, (182), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-10 21:58:05,159 INFO L276 IsEmpty]: Start isEmpty. Operand 1016 states and 1332 transitions. [2024-11-10 21:58:05,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-11-10 21:58:05,162 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 21:58:05,162 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 21:58:05,186 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-10 21:58:05,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-10 21:58:05,363 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-10 21:58:05,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 21:58:05,364 INFO L85 PathProgramCache]: Analyzing trace with hash -2032483267, now seen corresponding path program 1 times [2024-11-10 21:58:05,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 21:58:05,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260750415] [2024-11-10 21:58:05,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 21:58:05,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 21:58:05,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:58:05,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 21:58:05,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:58:05,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-10 21:58:05,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:58:05,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-11-10 21:58:05,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:58:05,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-10 21:58:05,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:58:05,880 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-10 21:58:05,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 21:58:05,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260750415] [2024-11-10 21:58:05,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260750415] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 21:58:05,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 21:58:05,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 21:58:05,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993854503] [2024-11-10 21:58:05,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 21:58:05,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 21:58:05,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 21:58:05,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 21:58:05,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-10 21:58:05,884 INFO L87 Difference]: Start difference. First operand 1016 states and 1332 transitions. Second operand has 8 states, 8 states have (on average 22.75) internal successors, (182), 7 states have internal predecessors, (182), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-10 21:58:06,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 21:58:06,667 INFO L93 Difference]: Finished difference Result 1991 states and 2642 transitions. [2024-11-10 21:58:06,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 21:58:06,668 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 22.75) internal successors, (182), 7 states have internal predecessors, (182), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 199 [2024-11-10 21:58:06,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 21:58:06,673 INFO L225 Difference]: With dead ends: 1991 [2024-11-10 21:58:06,674 INFO L226 Difference]: Without dead ends: 1034 [2024-11-10 21:58:06,676 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-10 21:58:06,677 INFO L432 NwaCegarLoop]: 414 mSDtfsCounter, 14 mSDsluCounter, 2015 mSDsCounter, 0 mSdLazyCounter, 743 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 2429 SdHoareTripleChecker+Invalid, 760 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 743 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-10 21:58:06,677 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 2429 Invalid, 760 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 743 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-10 21:58:06,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1034 states. [2024-11-10 21:58:06,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1034 to 1016. [2024-11-10 21:58:06,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1016 states, 981 states have (on average 1.3007135575942916) internal successors, (1276), 995 states have internal predecessors, (1276), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 19 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-10 21:58:06,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1016 states to 1016 states and 1332 transitions. [2024-11-10 21:58:06,710 INFO L78 Accepts]: Start accepts. Automaton has 1016 states and 1332 transitions. Word has length 199 [2024-11-10 21:58:06,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 21:58:06,711 INFO L471 AbstractCegarLoop]: Abstraction has 1016 states and 1332 transitions. [2024-11-10 21:58:06,711 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 22.75) internal successors, (182), 7 states have internal predecessors, (182), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-10 21:58:06,711 INFO L276 IsEmpty]: Start isEmpty. Operand 1016 states and 1332 transitions. [2024-11-10 21:58:06,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2024-11-10 21:58:06,715 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 21:58:06,715 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 21:58:06,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-10 21:58:06,716 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-10 21:58:06,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 21:58:06,716 INFO L85 PathProgramCache]: Analyzing trace with hash -460571086, now seen corresponding path program 1 times [2024-11-10 21:58:06,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 21:58:06,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671496077] [2024-11-10 21:58:06,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 21:58:06,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 21:58:07,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:58:07,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-10 21:58:07,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:58:07,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 21:58:07,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:58:07,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-11-10 21:58:07,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:58:07,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-10 21:58:07,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:58:07,416 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-10 21:58:07,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 21:58:07,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671496077] [2024-11-10 21:58:07,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671496077] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 21:58:07,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [922279964] [2024-11-10 21:58:07,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 21:58:07,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 21:58:07,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 21:58:07,419 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 21:58:07,420 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-10 21:58:08,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:58:08,188 INFO L255 TraceCheckSpWp]: Trace formula consists of 1044 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-10 21:58:08,192 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 21:58:08,346 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-10 21:58:08,346 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 21:58:08,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [922279964] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 21:58:08,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 21:58:08,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [5] total 11 [2024-11-10 21:58:08,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554238402] [2024-11-10 21:58:08,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 21:58:08,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 21:58:08,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 21:58:08,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 21:58:08,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-11-10 21:58:08,348 INFO L87 Difference]: Start difference. First operand 1016 states and 1332 transitions. Second operand has 8 states, 8 states have (on average 22.875) internal successors, (183), 8 states have internal predecessors, (183), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-10 21:58:09,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 21:58:09,622 INFO L93 Difference]: Finished difference Result 1998 states and 2631 transitions. [2024-11-10 21:58:09,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 21:58:09,622 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 22.875) internal successors, (183), 8 states have internal predecessors, (183), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 200 [2024-11-10 21:58:09,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 21:58:09,627 INFO L225 Difference]: With dead ends: 1998 [2024-11-10 21:58:09,627 INFO L226 Difference]: Without dead ends: 1046 [2024-11-10 21:58:09,629 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-11-10 21:58:09,629 INFO L432 NwaCegarLoop]: 412 mSDtfsCounter, 13 mSDsluCounter, 2151 mSDsCounter, 0 mSdLazyCounter, 587 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 2563 SdHoareTripleChecker+Invalid, 587 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 587 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-10 21:58:09,629 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 2563 Invalid, 587 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 587 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-10 21:58:09,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1046 states. [2024-11-10 21:58:09,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1046 to 1031. [2024-11-10 21:58:09,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1031 states, 996 states have (on average 1.2991967871485943) internal successors, (1294), 1010 states have internal predecessors, (1294), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 19 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-10 21:58:09,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1031 states to 1031 states and 1350 transitions. [2024-11-10 21:58:09,653 INFO L78 Accepts]: Start accepts. Automaton has 1031 states and 1350 transitions. Word has length 200 [2024-11-10 21:58:09,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 21:58:09,653 INFO L471 AbstractCegarLoop]: Abstraction has 1031 states and 1350 transitions. [2024-11-10 21:58:09,653 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 22.875) internal successors, (183), 8 states have internal predecessors, (183), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-10 21:58:09,653 INFO L276 IsEmpty]: Start isEmpty. Operand 1031 states and 1350 transitions. [2024-11-10 21:58:09,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2024-11-10 21:58:09,655 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 21:58:09,655 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 21:58:09,677 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-10 21:58:09,855 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 21:58:09,856 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-10 21:58:09,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 21:58:09,856 INFO L85 PathProgramCache]: Analyzing trace with hash -1326298132, now seen corresponding path program 1 times [2024-11-10 21:58:09,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 21:58:09,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595084855] [2024-11-10 21:58:09,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 21:58:09,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 21:58:09,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:58:10,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-10 21:58:10,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:58:10,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 21:58:10,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:58:10,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-11-10 21:58:10,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:58:10,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-10 21:58:10,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:58:10,402 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-10 21:58:10,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 21:58:10,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595084855] [2024-11-10 21:58:10,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595084855] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 21:58:10,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 21:58:10,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-10 21:58:10,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182101529] [2024-11-10 21:58:10,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 21:58:10,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 21:58:10,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 21:58:10,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 21:58:10,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-10 21:58:10,407 INFO L87 Difference]: Start difference. First operand 1031 states and 1350 transitions. Second operand has 10 states, 10 states have (on average 18.3) internal successors, (183), 9 states have internal predecessors, (183), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-10 21:58:11,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 21:58:11,059 INFO L93 Difference]: Finished difference Result 2026 states and 2682 transitions. [2024-11-10 21:58:11,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-10 21:58:11,060 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 18.3) internal successors, (183), 9 states have internal predecessors, (183), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 200 [2024-11-10 21:58:11,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 21:58:11,064 INFO L225 Difference]: With dead ends: 2026 [2024-11-10 21:58:11,064 INFO L226 Difference]: Without dead ends: 1064 [2024-11-10 21:58:11,066 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-10 21:58:11,067 INFO L432 NwaCegarLoop]: 418 mSDtfsCounter, 22 mSDsluCounter, 2115 mSDsCounter, 0 mSdLazyCounter, 748 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 2533 SdHoareTripleChecker+Invalid, 765 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 748 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-10 21:58:11,067 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 2533 Invalid, 765 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 748 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-10 21:58:11,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1064 states. [2024-11-10 21:58:11,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1064 to 1052. [2024-11-10 21:58:11,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1052 states, 1017 states have (on average 1.2989183874139627) internal successors, (1321), 1031 states have internal predecessors, (1321), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 19 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-10 21:58:11,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1052 states to 1052 states and 1377 transitions. [2024-11-10 21:58:11,096 INFO L78 Accepts]: Start accepts. Automaton has 1052 states and 1377 transitions. Word has length 200 [2024-11-10 21:58:11,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 21:58:11,096 INFO L471 AbstractCegarLoop]: Abstraction has 1052 states and 1377 transitions. [2024-11-10 21:58:11,096 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 18.3) internal successors, (183), 9 states have internal predecessors, (183), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-10 21:58:11,097 INFO L276 IsEmpty]: Start isEmpty. Operand 1052 states and 1377 transitions. [2024-11-10 21:58:11,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2024-11-10 21:58:11,098 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 21:58:11,098 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 21:58:11,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-10 21:58:11,098 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-10 21:58:11,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 21:58:11,099 INFO L85 PathProgramCache]: Analyzing trace with hash 22587120, now seen corresponding path program 1 times [2024-11-10 21:58:11,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 21:58:11,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828064809] [2024-11-10 21:58:11,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 21:58:11,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 21:58:11,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:58:11,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 21:58:11,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:58:11,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-10 21:58:11,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:58:11,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-11-10 21:58:11,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:58:11,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-10 21:58:11,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:58:11,715 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-10 21:58:11,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 21:58:11,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828064809] [2024-11-10 21:58:11,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [828064809] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 21:58:11,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [686277035] [2024-11-10 21:58:11,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 21:58:11,715 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 21:58:11,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 21:58:11,717 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 21:58:11,719 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-10 21:58:13,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:58:13,872 INFO L255 TraceCheckSpWp]: Trace formula consists of 1045 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-10 21:58:13,876 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 21:58:13,897 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-10 21:58:13,899 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 21:58:13,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [686277035] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 21:58:13,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 21:58:13,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2024-11-10 21:58:13,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813246171] [2024-11-10 21:58:13,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 21:58:13,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 21:58:13,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 21:58:13,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 21:58:13,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-10 21:58:13,901 INFO L87 Difference]: Start difference. First operand 1052 states and 1377 transitions. Second operand has 4 states, 4 states have (on average 47.5) internal successors, (190), 4 states have internal predecessors, (190), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-10 21:58:13,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 21:58:13,996 INFO L93 Difference]: Finished difference Result 1996 states and 2634 transitions. [2024-11-10 21:58:13,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 21:58:13,999 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 47.5) internal successors, (190), 4 states have internal predecessors, (190), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 201 [2024-11-10 21:58:13,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 21:58:14,005 INFO L225 Difference]: With dead ends: 1996 [2024-11-10 21:58:14,006 INFO L226 Difference]: Without dead ends: 1055 [2024-11-10 21:58:14,009 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 207 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-10 21:58:14,010 INFO L432 NwaCegarLoop]: 426 mSDtfsCounter, 0 mSDsluCounter, 845 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1271 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 21:58:14,010 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1271 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 21:58:14,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1055 states. [2024-11-10 21:58:14,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1055 to 1055. [2024-11-10 21:58:14,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1055 states, 1019 states have (on average 1.2993130520117762) internal successors, (1324), 1034 states have internal predecessors, (1324), 28 states have call successors, (28), 2 states have call predecessors, (28), 3 states have return successors, (34), 19 states have call predecessors, (34), 28 states have call successors, (34) [2024-11-10 21:58:14,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1055 states to 1055 states and 1386 transitions. [2024-11-10 21:58:14,035 INFO L78 Accepts]: Start accepts. Automaton has 1055 states and 1386 transitions. Word has length 201 [2024-11-10 21:58:14,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 21:58:14,035 INFO L471 AbstractCegarLoop]: Abstraction has 1055 states and 1386 transitions. [2024-11-10 21:58:14,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 47.5) internal successors, (190), 4 states have internal predecessors, (190), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-10 21:58:14,036 INFO L276 IsEmpty]: Start isEmpty. Operand 1055 states and 1386 transitions. [2024-11-10 21:58:14,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2024-11-10 21:58:14,037 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 21:58:14,037 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 21:58:14,078 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-10 21:58:14,238 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 21:58:14,239 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-10 21:58:14,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 21:58:14,239 INFO L85 PathProgramCache]: Analyzing trace with hash -535706184, now seen corresponding path program 1 times [2024-11-10 21:58:14,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 21:58:14,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857855043] [2024-11-10 21:58:14,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 21:58:14,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 21:58:14,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:58:15,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 21:58:15,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:58:15,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 21:58:15,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:58:15,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-10 21:58:15,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:58:15,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-11-10 21:58:15,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:58:15,274 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 6 proven. 19 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-11-10 21:58:15,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 21:58:15,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857855043] [2024-11-10 21:58:15,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857855043] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 21:58:15,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2081487635] [2024-11-10 21:58:15,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 21:58:15,275 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 21:58:15,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 21:58:15,277 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 21:58:15,292 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-10 21:58:16,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:58:16,461 INFO L255 TraceCheckSpWp]: Trace formula consists of 1105 conjuncts, 156 conjuncts are in the unsatisfiable core [2024-11-10 21:58:16,473 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 21:58:16,478 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-10 21:58:16,673 INFO L349 Elim1Store]: treesize reduction 32, result has 30.4 percent of original size [2024-11-10 21:58:16,673 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 20 [2024-11-10 21:58:16,681 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-10 21:58:16,686 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-10 21:58:16,727 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2024-11-10 21:58:16,812 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-10 21:58:16,812 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 38 [2024-11-10 21:58:16,818 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1