/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Overflow-32bit-Automizer_Default.epf -i ../sv-benchmarks/c/list-simple/dll2c_update_all_reverse.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-05d3305-m [2022-10-15 21:37:59,954 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-15 21:37:59,957 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-15 21:38:00,005 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-15 21:38:00,006 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-15 21:38:00,010 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-15 21:38:00,015 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-15 21:38:00,047 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-15 21:38:00,050 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-15 21:38:00,065 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-15 21:38:00,066 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-15 21:38:00,069 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-15 21:38:00,070 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-15 21:38:00,073 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-15 21:38:00,075 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-15 21:38:00,080 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-15 21:38:00,082 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-15 21:38:00,083 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-15 21:38:00,087 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-15 21:38:00,094 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-15 21:38:00,097 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-15 21:38:00,099 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-15 21:38:00,102 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-15 21:38:00,104 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-15 21:38:00,113 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-15 21:38:00,114 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-15 21:38:00,114 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-15 21:38:00,119 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-15 21:38:00,119 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-15 21:38:00,122 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-15 21:38:00,122 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-15 21:38:00,123 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-15 21:38:00,126 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-15 21:38:00,127 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-15 21:38:00,128 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-15 21:38:00,129 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-15 21:38:00,130 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-15 21:38:00,130 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-15 21:38:00,130 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-15 21:38:00,132 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-15 21:38:00,133 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-15 21:38:00,134 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Overflow-32bit-Automizer_Default.epf [2022-10-15 21:38:00,197 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-15 21:38:00,197 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-15 21:38:00,198 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-15 21:38:00,198 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-15 21:38:00,200 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-15 21:38:00,200 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-15 21:38:00,203 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-15 21:38:00,204 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-15 21:38:00,204 INFO L138 SettingsManager]: * Use SBE=true [2022-10-15 21:38:00,204 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-15 21:38:00,205 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-15 21:38:00,206 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-10-15 21:38:00,206 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-15 21:38:00,206 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-15 21:38:00,206 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-15 21:38:00,207 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-10-15 21:38:00,207 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-15 21:38:00,207 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-10-15 21:38:00,208 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-10-15 21:38:00,208 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-15 21:38:00,208 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-10-15 21:38:00,208 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-15 21:38:00,209 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-10-15 21:38:00,209 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-15 21:38:00,209 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-15 21:38:00,209 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-15 21:38:00,210 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-15 21:38:00,210 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-15 21:38:00,210 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-15 21:38:00,211 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-10-15 21:38:00,211 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-15 21:38:00,211 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-15 21:38:00,212 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-10-15 21:38:00,212 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-10-15 21:38:00,702 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-15 21:38:00,737 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-15 21:38:00,740 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-15 21:38:00,742 INFO L271 PluginConnector]: Initializing CDTParser... [2022-10-15 21:38:00,745 INFO L275 PluginConnector]: CDTParser initialized [2022-10-15 21:38:00,747 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/dll2c_update_all_reverse.i [2022-10-15 21:38:00,835 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a40fb03c3/62976a88f5ff421e99399d391f63194b/FLAG419f3a9e4 [2022-10-15 21:38:01,683 INFO L306 CDTParser]: Found 1 translation units. [2022-10-15 21:38:01,684 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2c_update_all_reverse.i [2022-10-15 21:38:01,707 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a40fb03c3/62976a88f5ff421e99399d391f63194b/FLAG419f3a9e4 [2022-10-15 21:38:01,871 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a40fb03c3/62976a88f5ff421e99399d391f63194b [2022-10-15 21:38:01,875 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-15 21:38:01,882 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-10-15 21:38:01,886 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-10-15 21:38:01,886 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-10-15 21:38:01,891 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-10-15 21:38:01,892 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 09:38:01" (1/1) ... [2022-10-15 21:38:01,893 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14b6f48e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:38:01, skipping insertion in model container [2022-10-15 21:38:01,894 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 09:38:01" (1/1) ... [2022-10-15 21:38:01,903 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-10-15 21:38:01,968 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-10-15 21:38:02,394 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2c_update_all_reverse.i[24556,24569] [2022-10-15 21:38:02,401 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-15 21:38:02,415 INFO L203 MainTranslator]: Completed pre-run [2022-10-15 21:38:02,540 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2c_update_all_reverse.i[24556,24569] [2022-10-15 21:38:02,541 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-15 21:38:02,586 INFO L208 MainTranslator]: Completed translation [2022-10-15 21:38:02,586 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:38:02 WrapperNode [2022-10-15 21:38:02,586 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-10-15 21:38:02,588 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-10-15 21:38:02,588 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-10-15 21:38:02,589 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-10-15 21:38:02,597 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:38:02" (1/1) ... [2022-10-15 21:38:02,638 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:38:02" (1/1) ... [2022-10-15 21:38:02,679 INFO L138 Inliner]: procedures = 126, calls = 29, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 149 [2022-10-15 21:38:02,679 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-10-15 21:38:02,680 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-15 21:38:02,680 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-15 21:38:02,680 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-15 21:38:02,693 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:38:02" (1/1) ... [2022-10-15 21:38:02,693 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:38:02" (1/1) ... [2022-10-15 21:38:02,697 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:38:02" (1/1) ... [2022-10-15 21:38:02,698 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:38:02" (1/1) ... [2022-10-15 21:38:02,707 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:38:02" (1/1) ... [2022-10-15 21:38:02,712 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:38:02" (1/1) ... [2022-10-15 21:38:02,715 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:38:02" (1/1) ... [2022-10-15 21:38:02,717 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:38:02" (1/1) ... [2022-10-15 21:38:02,721 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-15 21:38:02,722 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-15 21:38:02,722 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-15 21:38:02,723 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-15 21:38:02,724 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:38:02" (1/1) ... [2022-10-15 21:38:02,731 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-15 21:38:02,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 21:38:02,766 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-10-15 21:38:02,776 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-10-15 21:38:02,834 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-10-15 21:38:02,834 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-10-15 21:38:02,834 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2022-10-15 21:38:02,834 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2022-10-15 21:38:02,835 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-10-15 21:38:02,835 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-10-15 21:38:02,835 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-10-15 21:38:02,835 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-10-15 21:38:02,835 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-10-15 21:38:02,835 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-10-15 21:38:02,835 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-15 21:38:02,836 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-15 21:38:03,014 INFO L235 CfgBuilder]: Building ICFG [2022-10-15 21:38:03,017 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-15 21:38:03,389 INFO L276 CfgBuilder]: Performing block encoding [2022-10-15 21:38:03,397 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-15 21:38:03,397 INFO L300 CfgBuilder]: Removed 6 assume(true) statements. [2022-10-15 21:38:03,400 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 09:38:03 BoogieIcfgContainer [2022-10-15 21:38:03,400 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-15 21:38:03,402 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-15 21:38:03,403 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-15 21:38:03,407 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-15 21:38:03,407 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 09:38:01" (1/3) ... [2022-10-15 21:38:03,408 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e06e91b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 09:38:03, skipping insertion in model container [2022-10-15 21:38:03,408 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:38:02" (2/3) ... [2022-10-15 21:38:03,408 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e06e91b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 09:38:03, skipping insertion in model container [2022-10-15 21:38:03,409 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 09:38:03" (3/3) ... [2022-10-15 21:38:03,410 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2c_update_all_reverse.i [2022-10-15 21:38:03,435 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-15 21:38:03,436 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 18 error locations. [2022-10-15 21:38:03,498 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-10-15 21:38:03,508 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@6d492624, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-15 21:38:03,509 INFO L358 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2022-10-15 21:38:03,514 INFO L276 IsEmpty]: Start isEmpty. Operand has 73 states, 51 states have (on average 1.6666666666666667) internal successors, (85), 69 states have internal predecessors, (85), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-10-15 21:38:03,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-10-15 21:38:03,525 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:38:03,526 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:38:03,527 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2022-10-15 21:38:03,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:38:03,534 INFO L85 PathProgramCache]: Analyzing trace with hash -1772717541, now seen corresponding path program 1 times [2022-10-15 21:38:03,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:38:03,546 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291448469] [2022-10-15 21:38:03,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:38:03,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:38:03,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:38:04,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 21:38:04,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:38:04,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 21:38:04,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:38:04,078 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291448469] [2022-10-15 21:38:04,079 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1291448469] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:38:04,080 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 21:38:04,080 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-15 21:38:04,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105976261] [2022-10-15 21:38:04,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:38:04,088 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 21:38:04,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:38:04,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 21:38:04,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-15 21:38:04,143 INFO L87 Difference]: Start difference. First operand has 73 states, 51 states have (on average 1.6666666666666667) internal successors, (85), 69 states have internal predecessors, (85), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-10-15 21:38:04,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:38:04,241 INFO L93 Difference]: Finished difference Result 136 states and 167 transitions. [2022-10-15 21:38:04,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-15 21:38:04,244 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-10-15 21:38:04,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:38:04,253 INFO L225 Difference]: With dead ends: 136 [2022-10-15 21:38:04,253 INFO L226 Difference]: Without dead ends: 72 [2022-10-15 21:38:04,257 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-15 21:38:04,261 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 8 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 21:38:04,263 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 220 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 21:38:04,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-10-15 21:38:04,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 64. [2022-10-15 21:38:04,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 43 states have (on average 1.5348837209302326) internal successors, (66), 60 states have internal predecessors, (66), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-10-15 21:38:04,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 70 transitions. [2022-10-15 21:38:04,315 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 70 transitions. Word has length 13 [2022-10-15 21:38:04,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:38:04,316 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 70 transitions. [2022-10-15 21:38:04,317 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-10-15 21:38:04,317 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 70 transitions. [2022-10-15 21:38:04,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-10-15 21:38:04,319 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:38:04,319 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:38:04,319 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-15 21:38:04,320 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2022-10-15 21:38:04,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:38:04,320 INFO L85 PathProgramCache]: Analyzing trace with hash 1650629092, now seen corresponding path program 1 times [2022-10-15 21:38:04,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:38:04,321 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131029654] [2022-10-15 21:38:04,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:38:04,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:38:04,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:38:04,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 21:38:04,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:38:04,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-15 21:38:04,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:38:04,647 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-10-15 21:38:04,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:38:04,648 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131029654] [2022-10-15 21:38:04,648 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131029654] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:38:04,648 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 21:38:04,649 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-15 21:38:04,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967063707] [2022-10-15 21:38:04,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:38:04,651 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-15 21:38:04,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:38:04,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-15 21:38:04,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-10-15 21:38:04,652 INFO L87 Difference]: Start difference. First operand 64 states and 70 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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) [2022-10-15 21:38:04,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:38:04,731 INFO L93 Difference]: Finished difference Result 72 states and 80 transitions. [2022-10-15 21:38:04,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-15 21:38:04,731 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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 20 [2022-10-15 21:38:04,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:38:04,733 INFO L225 Difference]: With dead ends: 72 [2022-10-15 21:38:04,733 INFO L226 Difference]: Without dead ends: 70 [2022-10-15 21:38:04,734 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-10-15 21:38:04,736 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 4 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 21:38:04,737 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 242 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 21:38:04,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-10-15 21:38:04,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2022-10-15 21:38:04,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 48 states have (on average 1.5) internal successors, (72), 65 states have internal predecessors, (72), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-10-15 21:38:04,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 78 transitions. [2022-10-15 21:38:04,749 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 78 transitions. Word has length 20 [2022-10-15 21:38:04,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:38:04,750 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 78 transitions. [2022-10-15 21:38:04,750 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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) [2022-10-15 21:38:04,750 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 78 transitions. [2022-10-15 21:38:04,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-10-15 21:38:04,751 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:38:04,751 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:38:04,752 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-15 21:38:04,752 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2022-10-15 21:38:04,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:38:04,753 INFO L85 PathProgramCache]: Analyzing trace with hash 1754178825, now seen corresponding path program 1 times [2022-10-15 21:38:04,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:38:04,753 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347026843] [2022-10-15 21:38:04,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:38:04,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:38:04,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:38:04,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 21:38:05,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:38:05,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-15 21:38:05,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:38:05,081 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-10-15 21:38:05,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:38:05,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347026843] [2022-10-15 21:38:05,083 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347026843] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:38:05,083 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 21:38:05,083 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-15 21:38:05,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800933884] [2022-10-15 21:38:05,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:38:05,084 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 21:38:05,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:38:05,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 21:38:05,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-15 21:38:05,089 INFO L87 Difference]: Start difference. First operand 70 states and 78 transitions. Second operand has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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) [2022-10-15 21:38:05,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:38:05,177 INFO L93 Difference]: Finished difference Result 70 states and 78 transitions. [2022-10-15 21:38:05,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-15 21:38:05,178 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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 25 [2022-10-15 21:38:05,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:38:05,182 INFO L225 Difference]: With dead ends: 70 [2022-10-15 21:38:05,182 INFO L226 Difference]: Without dead ends: 66 [2022-10-15 21:38:05,183 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-15 21:38:05,184 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 45 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 21:38:05,185 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 99 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 21:38:05,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-10-15 21:38:05,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2022-10-15 21:38:05,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 48 states have (on average 1.4166666666666667) internal successors, (68), 61 states have internal predecessors, (68), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-10-15 21:38:05,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 74 transitions. [2022-10-15 21:38:05,196 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 74 transitions. Word has length 25 [2022-10-15 21:38:05,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:38:05,197 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 74 transitions. [2022-10-15 21:38:05,197 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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) [2022-10-15 21:38:05,198 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 74 transitions. [2022-10-15 21:38:05,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-10-15 21:38:05,199 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:38:05,199 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:38:05,199 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-10-15 21:38:05,199 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2022-10-15 21:38:05,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:38:05,200 INFO L85 PathProgramCache]: Analyzing trace with hash 1874350939, now seen corresponding path program 1 times [2022-10-15 21:38:05,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:38:05,201 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93776821] [2022-10-15 21:38:05,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:38:05,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:38:05,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:38:05,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 21:38:05,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:38:05,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-15 21:38:05,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:38:05,389 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-10-15 21:38:05,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:38:05,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93776821] [2022-10-15 21:38:05,390 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93776821] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:38:05,390 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 21:38:05,390 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-15 21:38:05,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107107326] [2022-10-15 21:38:05,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:38:05,391 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-15 21:38:05,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:38:05,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-15 21:38:05,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-10-15 21:38:05,393 INFO L87 Difference]: Start difference. First operand 66 states and 74 transitions. Second operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 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) [2022-10-15 21:38:05,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:38:05,510 INFO L93 Difference]: Finished difference Result 99 states and 112 transitions. [2022-10-15 21:38:05,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-15 21:38:05,511 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 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 28 [2022-10-15 21:38:05,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:38:05,513 INFO L225 Difference]: With dead ends: 99 [2022-10-15 21:38:05,513 INFO L226 Difference]: Without dead ends: 97 [2022-10-15 21:38:05,513 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-10-15 21:38:05,515 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 76 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 21:38:05,516 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 130 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 21:38:05,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-10-15 21:38:05,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 70. [2022-10-15 21:38:05,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 52 states have (on average 1.4038461538461537) internal successors, (73), 65 states have internal predecessors, (73), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-10-15 21:38:05,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 79 transitions. [2022-10-15 21:38:05,527 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 79 transitions. Word has length 28 [2022-10-15 21:38:05,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:38:05,528 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 79 transitions. [2022-10-15 21:38:05,528 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 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) [2022-10-15 21:38:05,529 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 79 transitions. [2022-10-15 21:38:05,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-10-15 21:38:05,530 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:38:05,530 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-10-15 21:38:05,530 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-10-15 21:38:05,531 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2022-10-15 21:38:05,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:38:05,531 INFO L85 PathProgramCache]: Analyzing trace with hash -2024662957, now seen corresponding path program 1 times [2022-10-15 21:38:05,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:38:05,532 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533510750] [2022-10-15 21:38:05,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:38:05,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:38:05,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:38:05,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 21:38:05,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:38:05,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-15 21:38:05,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:38:05,688 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-10-15 21:38:05,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:38:05,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533510750] [2022-10-15 21:38:05,689 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533510750] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:38:05,689 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 21:38:05,689 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-15 21:38:05,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099572434] [2022-10-15 21:38:05,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:38:05,690 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-15 21:38:05,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:38:05,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-15 21:38:05,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-10-15 21:38:05,692 INFO L87 Difference]: Start difference. First operand 70 states and 79 transitions. Second operand has 5 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 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) [2022-10-15 21:38:05,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:38:05,768 INFO L93 Difference]: Finished difference Result 91 states and 102 transitions. [2022-10-15 21:38:05,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-15 21:38:05,769 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 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 29 [2022-10-15 21:38:05,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:38:05,770 INFO L225 Difference]: With dead ends: 91 [2022-10-15 21:38:05,770 INFO L226 Difference]: Without dead ends: 68 [2022-10-15 21:38:05,771 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-10-15 21:38:05,772 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 75 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 21:38:05,773 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 103 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 21:38:05,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-10-15 21:38:05,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2022-10-15 21:38:05,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 52 states have (on average 1.3461538461538463) internal successors, (70), 63 states have internal predecessors, (70), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-10-15 21:38:05,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 76 transitions. [2022-10-15 21:38:05,783 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 76 transitions. Word has length 29 [2022-10-15 21:38:05,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:38:05,783 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 76 transitions. [2022-10-15 21:38:05,784 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 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) [2022-10-15 21:38:05,784 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 76 transitions. [2022-10-15 21:38:05,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-10-15 21:38:05,785 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:38:05,785 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-10-15 21:38:05,785 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-10-15 21:38:05,786 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2022-10-15 21:38:05,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:38:05,786 INFO L85 PathProgramCache]: Analyzing trace with hash -80913803, now seen corresponding path program 1 times [2022-10-15 21:38:05,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:38:05,787 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737568757] [2022-10-15 21:38:05,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:38:05,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:38:05,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:38:05,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 21:38:05,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:38:05,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-15 21:38:05,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:38:05,975 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-10-15 21:38:05,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:38:05,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737568757] [2022-10-15 21:38:05,976 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1737568757] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:38:05,976 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 21:38:05,976 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-10-15 21:38:05,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486688951] [2022-10-15 21:38:05,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:38:05,977 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-10-15 21:38:05,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:38:05,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-10-15 21:38:05,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-10-15 21:38:05,978 INFO L87 Difference]: Start difference. First operand 68 states and 76 transitions. Second operand has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 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) [2022-10-15 21:38:06,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:38:06,117 INFO L93 Difference]: Finished difference Result 95 states and 105 transitions. [2022-10-15 21:38:06,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-10-15 21:38:06,117 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 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 31 [2022-10-15 21:38:06,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:38:06,118 INFO L225 Difference]: With dead ends: 95 [2022-10-15 21:38:06,119 INFO L226 Difference]: Without dead ends: 94 [2022-10-15 21:38:06,119 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-10-15 21:38:06,120 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 130 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 21:38:06,121 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 193 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 21:38:06,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-10-15 21:38:06,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 72. [2022-10-15 21:38:06,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 56 states have (on average 1.3571428571428572) internal successors, (76), 67 states have internal predecessors, (76), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-10-15 21:38:06,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 82 transitions. [2022-10-15 21:38:06,132 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 82 transitions. Word has length 31 [2022-10-15 21:38:06,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:38:06,133 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 82 transitions. [2022-10-15 21:38:06,133 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 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) [2022-10-15 21:38:06,133 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 82 transitions. [2022-10-15 21:38:06,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-10-15 21:38:06,135 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:38:06,135 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:38:06,135 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-10-15 21:38:06,135 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2022-10-15 21:38:06,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:38:06,136 INFO L85 PathProgramCache]: Analyzing trace with hash -1512118474, now seen corresponding path program 1 times [2022-10-15 21:38:06,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:38:06,136 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144427904] [2022-10-15 21:38:06,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:38:06,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:38:06,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:38:06,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 21:38:06,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:38:06,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-15 21:38:06,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:38:06,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-10-15 21:38:06,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:38:06,365 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-10-15 21:38:06,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:38:06,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144427904] [2022-10-15 21:38:06,366 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144427904] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 21:38:06,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [760540539] [2022-10-15 21:38:06,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:38:06,367 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 21:38:06,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 21:38:06,370 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-15 21:38:06,397 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-10-15 21:38:06,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:38:06,539 INFO L263 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 6 conjunts are in the unsatisfiable core [2022-10-15 21:38:06,546 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 21:38:06,620 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-10-15 21:38:06,620 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-15 21:38:06,620 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [760540539] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:38:06,621 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-15 21:38:06,621 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 8 [2022-10-15 21:38:06,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795059685] [2022-10-15 21:38:06,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:38:06,622 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-15 21:38:06,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:38:06,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-15 21:38:06,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-10-15 21:38:06,623 INFO L87 Difference]: Start difference. First operand 72 states and 82 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-10-15 21:38:06,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:38:06,650 INFO L93 Difference]: Finished difference Result 125 states and 140 transitions. [2022-10-15 21:38:06,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-15 21:38:06,651 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 32 [2022-10-15 21:38:06,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:38:06,652 INFO L225 Difference]: With dead ends: 125 [2022-10-15 21:38:06,652 INFO L226 Difference]: Without dead ends: 64 [2022-10-15 21:38:06,653 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-10-15 21:38:06,654 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 46 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 21:38:06,654 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 129 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 21:38:06,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-10-15 21:38:06,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2022-10-15 21:38:06,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 51 states have (on average 1.3137254901960784) internal successors, (67), 60 states have internal predecessors, (67), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-10-15 21:38:06,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 71 transitions. [2022-10-15 21:38:06,663 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 71 transitions. Word has length 32 [2022-10-15 21:38:06,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:38:06,664 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 71 transitions. [2022-10-15 21:38:06,664 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-10-15 21:38:06,664 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 71 transitions. [2022-10-15 21:38:06,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-10-15 21:38:06,665 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:38:06,666 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-10-15 21:38:06,705 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-10-15 21:38:06,880 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 21:38:06,881 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2022-10-15 21:38:06,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:38:06,882 INFO L85 PathProgramCache]: Analyzing trace with hash 1786639494, now seen corresponding path program 1 times [2022-10-15 21:38:06,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:38:06,883 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696703871] [2022-10-15 21:38:06,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:38:06,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:38:06,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:38:06,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 21:38:06,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:38:06,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-15 21:38:06,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:38:06,998 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-10-15 21:38:06,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:38:06,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696703871] [2022-10-15 21:38:06,998 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696703871] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:38:06,998 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 21:38:06,999 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-15 21:38:06,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043283471] [2022-10-15 21:38:06,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:38:07,000 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 21:38:07,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:38:07,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 21:38:07,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-15 21:38:07,001 INFO L87 Difference]: Start difference. First operand 64 states and 71 transitions. Second operand has 4 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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) [2022-10-15 21:38:07,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:38:07,036 INFO L93 Difference]: Finished difference Result 64 states and 71 transitions. [2022-10-15 21:38:07,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-15 21:38:07,037 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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 32 [2022-10-15 21:38:07,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:38:07,038 INFO L225 Difference]: With dead ends: 64 [2022-10-15 21:38:07,038 INFO L226 Difference]: Without dead ends: 63 [2022-10-15 21:38:07,038 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-15 21:38:07,039 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 1 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 21:38:07,040 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 155 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 21:38:07,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-10-15 21:38:07,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2022-10-15 21:38:07,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 51 states have (on average 1.2745098039215685) internal successors, (65), 59 states have internal predecessors, (65), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-10-15 21:38:07,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 69 transitions. [2022-10-15 21:38:07,048 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 69 transitions. Word has length 32 [2022-10-15 21:38:07,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:38:07,049 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 69 transitions. [2022-10-15 21:38:07,049 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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) [2022-10-15 21:38:07,049 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 69 transitions. [2022-10-15 21:38:07,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-10-15 21:38:07,050 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:38:07,050 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-10-15 21:38:07,051 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-10-15 21:38:07,051 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2022-10-15 21:38:07,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:38:07,052 INFO L85 PathProgramCache]: Analyzing trace with hash -1028024026, now seen corresponding path program 1 times [2022-10-15 21:38:07,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:38:07,052 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432050970] [2022-10-15 21:38:07,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:38:07,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:38:07,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:38:07,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 21:38:07,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:38:07,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-15 21:38:07,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:38:07,227 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-10-15 21:38:07,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:38:07,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432050970] [2022-10-15 21:38:07,228 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432050970] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:38:07,228 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 21:38:07,228 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-10-15 21:38:07,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991847036] [2022-10-15 21:38:07,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:38:07,229 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-10-15 21:38:07,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:38:07,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-10-15 21:38:07,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-10-15 21:38:07,230 INFO L87 Difference]: Start difference. First operand 63 states and 69 transitions. Second operand has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 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) [2022-10-15 21:38:07,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:38:07,331 INFO L93 Difference]: Finished difference Result 77 states and 84 transitions. [2022-10-15 21:38:07,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-15 21:38:07,331 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 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 34 [2022-10-15 21:38:07,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:38:07,333 INFO L225 Difference]: With dead ends: 77 [2022-10-15 21:38:07,333 INFO L226 Difference]: Without dead ends: 75 [2022-10-15 21:38:07,333 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-10-15 21:38:07,334 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 82 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 21:38:07,334 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 144 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 21:38:07,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-10-15 21:38:07,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 61. [2022-10-15 21:38:07,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 51 states have (on average 1.2352941176470589) internal successors, (63), 57 states have internal predecessors, (63), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-10-15 21:38:07,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 67 transitions. [2022-10-15 21:38:07,343 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 67 transitions. Word has length 34 [2022-10-15 21:38:07,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:38:07,343 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 67 transitions. [2022-10-15 21:38:07,343 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 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) [2022-10-15 21:38:07,344 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 67 transitions. [2022-10-15 21:38:07,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-10-15 21:38:07,345 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:38:07,345 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-10-15 21:38:07,345 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-10-15 21:38:07,345 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2022-10-15 21:38:07,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:38:07,346 INFO L85 PathProgramCache]: Analyzing trace with hash -1803973631, now seen corresponding path program 1 times [2022-10-15 21:38:07,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:38:07,346 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518680049] [2022-10-15 21:38:07,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:38:07,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:38:07,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:38:07,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 21:38:07,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:38:07,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-15 21:38:07,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:38:07,465 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-10-15 21:38:07,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:38:07,466 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518680049] [2022-10-15 21:38:07,466 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518680049] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:38:07,466 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 21:38:07,466 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-15 21:38:07,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315190045] [2022-10-15 21:38:07,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:38:07,467 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-15 21:38:07,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:38:07,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-15 21:38:07,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-10-15 21:38:07,468 INFO L87 Difference]: Start difference. First operand 61 states and 67 transitions. Second operand has 5 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 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) [2022-10-15 21:38:07,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:38:07,553 INFO L93 Difference]: Finished difference Result 61 states and 67 transitions. [2022-10-15 21:38:07,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-15 21:38:07,554 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 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 35 [2022-10-15 21:38:07,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:38:07,555 INFO L225 Difference]: With dead ends: 61 [2022-10-15 21:38:07,555 INFO L226 Difference]: Without dead ends: 60 [2022-10-15 21:38:07,555 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-10-15 21:38:07,556 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 23 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 21:38:07,557 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 148 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 21:38:07,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-10-15 21:38:07,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2022-10-15 21:38:07,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 51 states have (on average 1.2156862745098038) internal successors, (62), 56 states have internal predecessors, (62), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-10-15 21:38:07,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 66 transitions. [2022-10-15 21:38:07,564 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 66 transitions. Word has length 35 [2022-10-15 21:38:07,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:38:07,564 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 66 transitions. [2022-10-15 21:38:07,565 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 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) [2022-10-15 21:38:07,565 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 66 transitions. [2022-10-15 21:38:07,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-10-15 21:38:07,566 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:38:07,566 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:38:07,566 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-10-15 21:38:07,567 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2022-10-15 21:38:07,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:38:07,567 INFO L85 PathProgramCache]: Analyzing trace with hash 998855629, now seen corresponding path program 1 times [2022-10-15 21:38:07,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:38:07,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918926217] [2022-10-15 21:38:07,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:38:07,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:38:07,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:38:07,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 21:38:07,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:38:07,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-15 21:38:07,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:38:07,789 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-10-15 21:38:07,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:38:07,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918926217] [2022-10-15 21:38:07,790 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918926217] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:38:07,790 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 21:38:07,790 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-10-15 21:38:07,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504135270] [2022-10-15 21:38:07,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:38:07,791 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-15 21:38:07,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:38:07,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-15 21:38:07,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-10-15 21:38:07,792 INFO L87 Difference]: Start difference. First operand 60 states and 66 transitions. Second operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 5 states have internal predecessors, (32), 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) [2022-10-15 21:38:07,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:38:07,893 INFO L93 Difference]: Finished difference Result 113 states and 124 transitions. [2022-10-15 21:38:07,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-10-15 21:38:07,893 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 5 states have internal predecessors, (32), 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 40 [2022-10-15 21:38:07,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:38:07,894 INFO L225 Difference]: With dead ends: 113 [2022-10-15 21:38:07,894 INFO L226 Difference]: Without dead ends: 80 [2022-10-15 21:38:07,895 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-10-15 21:38:07,895 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 96 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 21:38:07,896 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 139 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 21:38:07,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-10-15 21:38:07,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 61. [2022-10-15 21:38:07,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 52 states have (on average 1.2115384615384615) internal successors, (63), 57 states have internal predecessors, (63), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-10-15 21:38:07,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 67 transitions. [2022-10-15 21:38:07,903 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 67 transitions. Word has length 40 [2022-10-15 21:38:07,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:38:07,904 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 67 transitions. [2022-10-15 21:38:07,904 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 5 states have internal predecessors, (32), 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) [2022-10-15 21:38:07,904 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 67 transitions. [2022-10-15 21:38:07,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-10-15 21:38:07,905 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:38:07,905 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:38:07,906 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-10-15 21:38:07,906 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2022-10-15 21:38:07,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:38:07,907 INFO L85 PathProgramCache]: Analyzing trace with hash 1912596922, now seen corresponding path program 1 times [2022-10-15 21:38:07,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:38:07,907 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138643060] [2022-10-15 21:38:07,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:38:07,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:38:07,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:38:08,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 21:38:08,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:38:08,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-15 21:38:08,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:38:08,125 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-10-15 21:38:08,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:38:08,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138643060] [2022-10-15 21:38:08,126 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138643060] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 21:38:08,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [366833169] [2022-10-15 21:38:08,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:38:08,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 21:38:08,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 21:38:08,127 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-15 21:38:08,152 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-10-15 21:38:08,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:38:08,308 INFO L263 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 7 conjunts are in the unsatisfiable core [2022-10-15 21:38:08,311 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 21:38:08,426 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-10-15 21:38:08,427 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 21:38:08,548 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-10-15 21:38:08,549 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [366833169] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 21:38:08,549 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 21:38:08,549 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 12 [2022-10-15 21:38:08,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98608815] [2022-10-15 21:38:08,550 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 21:38:08,551 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-10-15 21:38:08,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:38:08,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-10-15 21:38:08,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-10-15 21:38:08,552 INFO L87 Difference]: Start difference. First operand 61 states and 67 transitions. Second operand has 12 states, 12 states have (on average 5.333333333333333) internal successors, (64), 11 states have internal predecessors, (64), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-10-15 21:38:08,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:38:08,729 INFO L93 Difference]: Finished difference Result 110 states and 120 transitions. [2022-10-15 21:38:08,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-10-15 21:38:08,730 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.333333333333333) internal successors, (64), 11 states have internal predecessors, (64), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 43 [2022-10-15 21:38:08,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:38:08,731 INFO L225 Difference]: With dead ends: 110 [2022-10-15 21:38:08,731 INFO L226 Difference]: Without dead ends: 77 [2022-10-15 21:38:08,732 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 80 SyntacticMatches, 5 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=188, Unknown=0, NotChecked=0, Total=272 [2022-10-15 21:38:08,733 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 144 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 21:38:08,733 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 209 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 21:38:08,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-10-15 21:38:08,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 58. [2022-10-15 21:38:08,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 50 states have (on average 1.18) internal successors, (59), 54 states have internal predecessors, (59), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-10-15 21:38:08,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 63 transitions. [2022-10-15 21:38:08,742 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 63 transitions. Word has length 43 [2022-10-15 21:38:08,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:38:08,742 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 63 transitions. [2022-10-15 21:38:08,742 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.333333333333333) internal successors, (64), 11 states have internal predecessors, (64), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-10-15 21:38:08,743 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 63 transitions. [2022-10-15 21:38:08,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-10-15 21:38:08,744 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:38:08,744 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-10-15 21:38:08,788 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-10-15 21:38:08,958 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-10-15 21:38:08,958 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2022-10-15 21:38:08,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:38:08,959 INFO L85 PathProgramCache]: Analyzing trace with hash 1229254852, now seen corresponding path program 1 times [2022-10-15 21:38:08,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:38:08,959 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215255647] [2022-10-15 21:38:08,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:38:08,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:38:08,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:38:09,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 21:38:09,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:38:09,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-15 21:38:09,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:38:09,169 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-10-15 21:38:09,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:38:09,170 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215255647] [2022-10-15 21:38:09,170 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215255647] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 21:38:09,170 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1645629398] [2022-10-15 21:38:09,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:38:09,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 21:38:09,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 21:38:09,172 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-15 21:38:09,179 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-10-15 21:38:09,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:38:09,337 INFO L263 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 5 conjunts are in the unsatisfiable core [2022-10-15 21:38:09,340 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 21:38:09,437 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-10-15 21:38:09,437 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 21:38:09,513 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-10-15 21:38:09,514 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1645629398] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 21:38:09,514 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 21:38:09,514 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 11 [2022-10-15 21:38:09,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960077484] [2022-10-15 21:38:09,515 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 21:38:09,515 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-10-15 21:38:09,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:38:09,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-10-15 21:38:09,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2022-10-15 21:38:09,516 INFO L87 Difference]: Start difference. First operand 58 states and 63 transitions. Second operand has 11 states, 11 states have (on average 5.909090909090909) internal successors, (65), 10 states have internal predecessors, (65), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-10-15 21:38:09,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:38:09,629 INFO L93 Difference]: Finished difference Result 99 states and 107 transitions. [2022-10-15 21:38:09,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-10-15 21:38:09,630 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.909090909090909) internal successors, (65), 10 states have internal predecessors, (65), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 46 [2022-10-15 21:38:09,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:38:09,631 INFO L225 Difference]: With dead ends: 99 [2022-10-15 21:38:09,631 INFO L226 Difference]: Without dead ends: 78 [2022-10-15 21:38:09,631 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 88 SyntacticMatches, 4 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2022-10-15 21:38:09,632 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 130 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 21:38:09,632 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 180 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 21:38:09,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-10-15 21:38:09,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 64. [2022-10-15 21:38:09,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 56 states have (on average 1.1607142857142858) internal successors, (65), 60 states have internal predecessors, (65), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-10-15 21:38:09,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 69 transitions. [2022-10-15 21:38:09,640 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 69 transitions. Word has length 46 [2022-10-15 21:38:09,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:38:09,641 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 69 transitions. [2022-10-15 21:38:09,641 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.909090909090909) internal successors, (65), 10 states have internal predecessors, (65), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-10-15 21:38:09,641 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 69 transitions. [2022-10-15 21:38:09,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-10-15 21:38:09,642 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:38:09,642 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:38:09,681 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-10-15 21:38:09,855 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 21:38:09,856 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2022-10-15 21:38:09,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:38:09,857 INFO L85 PathProgramCache]: Analyzing trace with hash -1659324010, now seen corresponding path program 2 times [2022-10-15 21:38:09,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:38:09,858 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641835616] [2022-10-15 21:38:09,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:38:09,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:38:09,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:38:10,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 21:38:10,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:38:10,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-15 21:38:10,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:38:10,056 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-10-15 21:38:10,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:38:10,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641835616] [2022-10-15 21:38:10,057 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [641835616] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:38:10,057 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 21:38:10,057 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-10-15 21:38:10,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707958199] [2022-10-15 21:38:10,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:38:10,058 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-10-15 21:38:10,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:38:10,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-10-15 21:38:10,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-10-15 21:38:10,058 INFO L87 Difference]: Start difference. First operand 64 states and 69 transitions. Second operand has 7 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 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) [2022-10-15 21:38:10,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:38:10,218 INFO L93 Difference]: Finished difference Result 78 states and 84 transitions. [2022-10-15 21:38:10,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-10-15 21:38:10,218 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 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 55 [2022-10-15 21:38:10,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:38:10,219 INFO L225 Difference]: With dead ends: 78 [2022-10-15 21:38:10,220 INFO L226 Difference]: Without dead ends: 77 [2022-10-15 21:38:10,220 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-10-15 21:38:10,221 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 83 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 21:38:10,222 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 167 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 21:38:10,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-10-15 21:38:10,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 68. [2022-10-15 21:38:10,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 60 states have (on average 1.1833333333333333) internal successors, (71), 64 states have internal predecessors, (71), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-10-15 21:38:10,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 75 transitions. [2022-10-15 21:38:10,233 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 75 transitions. Word has length 55 [2022-10-15 21:38:10,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:38:10,234 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 75 transitions. [2022-10-15 21:38:10,234 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 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) [2022-10-15 21:38:10,234 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 75 transitions. [2022-10-15 21:38:10,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-10-15 21:38:10,237 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:38:10,237 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:38:10,237 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-10-15 21:38:10,239 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2022-10-15 21:38:10,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:38:10,240 INFO L85 PathProgramCache]: Analyzing trace with hash 100563377, now seen corresponding path program 1 times [2022-10-15 21:38:10,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:38:10,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870730737] [2022-10-15 21:38:10,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:38:10,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:38:10,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:38:10,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 21:38:10,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:38:10,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-15 21:38:10,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:38:10,362 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-10-15 21:38:10,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:38:10,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870730737] [2022-10-15 21:38:10,363 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870730737] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:38:10,363 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 21:38:10,363 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-15 21:38:10,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019930930] [2022-10-15 21:38:10,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:38:10,364 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 21:38:10,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:38:10,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 21:38:10,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-15 21:38:10,365 INFO L87 Difference]: Start difference. First operand 68 states and 75 transitions. Second operand has 4 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 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) [2022-10-15 21:38:10,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:38:10,399 INFO L93 Difference]: Finished difference Result 68 states and 75 transitions. [2022-10-15 21:38:10,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-15 21:38:10,400 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 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 56 [2022-10-15 21:38:10,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:38:10,401 INFO L225 Difference]: With dead ends: 68 [2022-10-15 21:38:10,401 INFO L226 Difference]: Without dead ends: 67 [2022-10-15 21:38:10,403 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-15 21:38:10,404 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 1 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 21:38:10,406 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 140 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 21:38:10,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-10-15 21:38:10,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2022-10-15 21:38:10,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 60 states have (on average 1.15) internal successors, (69), 63 states have internal predecessors, (69), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-10-15 21:38:10,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 73 transitions. [2022-10-15 21:38:10,414 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 73 transitions. Word has length 56 [2022-10-15 21:38:10,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:38:10,414 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 73 transitions. [2022-10-15 21:38:10,414 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 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) [2022-10-15 21:38:10,415 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 73 transitions. [2022-10-15 21:38:10,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-10-15 21:38:10,415 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:38:10,415 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:38:10,416 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-10-15 21:38:10,416 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2022-10-15 21:38:10,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:38:10,416 INFO L85 PathProgramCache]: Analyzing trace with hash -2055001787, now seen corresponding path program 1 times [2022-10-15 21:38:10,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:38:10,417 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493725877] [2022-10-15 21:38:10,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:38:10,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:38:10,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:38:10,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 21:38:10,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:38:10,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-15 21:38:10,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:38:10,609 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-10-15 21:38:10,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:38:10,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493725877] [2022-10-15 21:38:10,609 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [493725877] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:38:10,609 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 21:38:10,610 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-10-15 21:38:10,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558520272] [2022-10-15 21:38:10,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:38:10,610 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-15 21:38:10,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:38:10,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-15 21:38:10,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-10-15 21:38:10,611 INFO L87 Difference]: Start difference. First operand 67 states and 73 transitions. Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 5 states have internal predecessors, (42), 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) [2022-10-15 21:38:10,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:38:10,700 INFO L93 Difference]: Finished difference Result 92 states and 100 transitions. [2022-10-15 21:38:10,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-10-15 21:38:10,700 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 5 states have internal predecessors, (42), 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 59 [2022-10-15 21:38:10,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:38:10,701 INFO L225 Difference]: With dead ends: 92 [2022-10-15 21:38:10,701 INFO L226 Difference]: Without dead ends: 76 [2022-10-15 21:38:10,702 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-10-15 21:38:10,702 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 49 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 21:38:10,703 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 143 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 21:38:10,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-10-15 21:38:10,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 68. [2022-10-15 21:38:10,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 61 states have (on average 1.1475409836065573) internal successors, (70), 64 states have internal predecessors, (70), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-10-15 21:38:10,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 74 transitions. [2022-10-15 21:38:10,711 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 74 transitions. Word has length 59 [2022-10-15 21:38:10,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:38:10,711 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 74 transitions. [2022-10-15 21:38:10,712 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 5 states have internal predecessors, (42), 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) [2022-10-15 21:38:10,712 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 74 transitions. [2022-10-15 21:38:10,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-10-15 21:38:10,712 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:38:10,713 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:38:10,713 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-10-15 21:38:10,713 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2022-10-15 21:38:10,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:38:10,713 INFO L85 PathProgramCache]: Analyzing trace with hash 1488513794, now seen corresponding path program 1 times [2022-10-15 21:38:10,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:38:10,714 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39183148] [2022-10-15 21:38:10,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:38:10,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:38:10,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:38:10,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 21:38:10,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:38:10,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-15 21:38:10,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:38:10,887 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-10-15 21:38:10,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:38:10,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39183148] [2022-10-15 21:38:10,888 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39183148] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:38:10,888 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 21:38:10,888 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-10-15 21:38:10,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197371493] [2022-10-15 21:38:10,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:38:10,889 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-10-15 21:38:10,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:38:10,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-10-15 21:38:10,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-10-15 21:38:10,890 INFO L87 Difference]: Start difference. First operand 68 states and 74 transitions. Second operand has 7 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 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) [2022-10-15 21:38:10,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:38:10,967 INFO L93 Difference]: Finished difference Result 68 states and 74 transitions. [2022-10-15 21:38:10,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-15 21:38:10,968 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 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 62 [2022-10-15 21:38:10,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:38:10,969 INFO L225 Difference]: With dead ends: 68 [2022-10-15 21:38:10,969 INFO L226 Difference]: Without dead ends: 66 [2022-10-15 21:38:10,969 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-10-15 21:38:10,970 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 49 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 21:38:10,970 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 127 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 21:38:10,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-10-15 21:38:10,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2022-10-15 21:38:10,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 61 states have (on average 1.1147540983606556) internal successors, (68), 62 states have internal predecessors, (68), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-10-15 21:38:10,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 72 transitions. [2022-10-15 21:38:10,978 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 72 transitions. Word has length 62 [2022-10-15 21:38:10,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:38:10,978 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 72 transitions. [2022-10-15 21:38:10,979 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 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) [2022-10-15 21:38:10,979 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 72 transitions. [2022-10-15 21:38:10,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-10-15 21:38:10,979 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:38:10,980 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:38:10,980 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-10-15 21:38:10,980 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2022-10-15 21:38:10,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:38:10,981 INFO L85 PathProgramCache]: Analyzing trace with hash -1100712490, now seen corresponding path program 1 times [2022-10-15 21:38:10,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:38:10,981 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679183617] [2022-10-15 21:38:10,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:38:10,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:38:11,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:38:11,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 21:38:11,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:38:11,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-15 21:38:11,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:38:11,125 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-10-15 21:38:11,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:38:11,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679183617] [2022-10-15 21:38:11,125 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679183617] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:38:11,126 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 21:38:11,126 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-15 21:38:11,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158509502] [2022-10-15 21:38:11,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:38:11,126 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-15 21:38:11,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:38:11,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-15 21:38:11,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-10-15 21:38:11,127 INFO L87 Difference]: Start difference. First operand 66 states and 72 transitions. Second operand has 5 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 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) [2022-10-15 21:38:11,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:38:11,190 INFO L93 Difference]: Finished difference Result 66 states and 72 transitions. [2022-10-15 21:38:11,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-15 21:38:11,191 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 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 63 [2022-10-15 21:38:11,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:38:11,192 INFO L225 Difference]: With dead ends: 66 [2022-10-15 21:38:11,192 INFO L226 Difference]: Without dead ends: 65 [2022-10-15 21:38:11,192 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-10-15 21:38:11,193 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 14 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 21:38:11,193 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 136 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 21:38:11,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-10-15 21:38:11,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2022-10-15 21:38:11,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 61 states have (on average 1.098360655737705) internal successors, (67), 61 states have internal predecessors, (67), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-10-15 21:38:11,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 71 transitions. [2022-10-15 21:38:11,202 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 71 transitions. Word has length 63 [2022-10-15 21:38:11,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:38:11,203 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 71 transitions. [2022-10-15 21:38:11,203 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 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) [2022-10-15 21:38:11,203 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 71 transitions. [2022-10-15 21:38:11,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-10-15 21:38:11,211 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:38:11,211 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:38:11,211 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-10-15 21:38:11,211 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2022-10-15 21:38:11,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:38:11,212 INFO L85 PathProgramCache]: Analyzing trace with hash -1157563324, now seen corresponding path program 1 times [2022-10-15 21:38:11,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:38:11,212 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680206557] [2022-10-15 21:38:11,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:38:11,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:38:11,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:38:11,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 21:38:11,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:38:11,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-15 21:38:11,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:38:11,513 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-10-15 21:38:11,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:38:11,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680206557] [2022-10-15 21:38:11,514 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680206557] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 21:38:11,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [363940157] [2022-10-15 21:38:11,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:38:11,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 21:38:11,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 21:38:11,518 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-15 21:38:11,542 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-10-15 21:38:11,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:38:11,732 INFO L263 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 7 conjunts are in the unsatisfiable core [2022-10-15 21:38:11,738 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 21:38:11,846 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-10-15 21:38:11,846 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 21:38:11,952 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-10-15 21:38:11,953 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [363940157] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 21:38:11,953 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 21:38:11,953 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 12 [2022-10-15 21:38:11,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64278509] [2022-10-15 21:38:11,953 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 21:38:11,955 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-10-15 21:38:11,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:38:11,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-10-15 21:38:11,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-10-15 21:38:11,956 INFO L87 Difference]: Start difference. First operand 65 states and 71 transitions. Second operand has 12 states, 12 states have (on average 8.0) internal successors, (96), 11 states have internal predecessors, (96), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-10-15 21:38:12,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:38:12,114 INFO L93 Difference]: Finished difference Result 81 states and 88 transitions. [2022-10-15 21:38:12,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-10-15 21:38:12,114 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 8.0) internal successors, (96), 11 states have internal predecessors, (96), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 68 [2022-10-15 21:38:12,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:38:12,115 INFO L225 Difference]: With dead ends: 81 [2022-10-15 21:38:12,115 INFO L226 Difference]: Without dead ends: 0 [2022-10-15 21:38:12,115 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 130 SyntacticMatches, 5 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=165, Unknown=0, NotChecked=0, Total=240 [2022-10-15 21:38:12,116 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 56 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 21:38:12,117 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 232 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 21:38:12,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-10-15 21:38:12,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-10-15 21:38:12,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 21:38:12,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-10-15 21:38:12,118 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 68 [2022-10-15 21:38:12,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:38:12,118 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-10-15 21:38:12,119 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.0) internal successors, (96), 11 states have internal predecessors, (96), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-10-15 21:38:12,119 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-10-15 21:38:12,119 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-10-15 21:38:12,122 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 18 remaining) [2022-10-15 21:38:12,123 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 18 remaining) [2022-10-15 21:38:12,123 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 18 remaining) [2022-10-15 21:38:12,124 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 18 remaining) [2022-10-15 21:38:12,124 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 18 remaining) [2022-10-15 21:38:12,124 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 18 remaining) [2022-10-15 21:38:12,124 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 18 remaining) [2022-10-15 21:38:12,124 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 18 remaining) [2022-10-15 21:38:12,124 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 18 remaining) [2022-10-15 21:38:12,125 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 18 remaining) [2022-10-15 21:38:12,125 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 18 remaining) [2022-10-15 21:38:12,125 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 18 remaining) [2022-10-15 21:38:12,125 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 18 remaining) [2022-10-15 21:38:12,125 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 18 remaining) [2022-10-15 21:38:12,125 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 18 remaining) [2022-10-15 21:38:12,126 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 18 remaining) [2022-10-15 21:38:12,126 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 18 remaining) [2022-10-15 21:38:12,127 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 18 remaining) [2022-10-15 21:38:12,169 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-10-15 21:38:12,342 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 21:38:12,347 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-10-15 21:38:14,171 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 631) no Hoare annotation was computed. [2022-10-15 21:38:14,171 INFO L902 garLoopResultBuilder]: At program point L638(lines 626 645) the Hoare annotation is: true [2022-10-15 21:38:14,171 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW(line 615) no Hoare annotation was computed. [2022-10-15 21:38:14,172 INFO L899 garLoopResultBuilder]: For program point L622(line 622) no Hoare annotation was computed. [2022-10-15 21:38:14,172 INFO L895 garLoopResultBuilder]: At program point L589(line 589) the Hoare annotation is: (and (= 2 |ULTIMATE.start_dll_circular_create_~len#1|) (= |ULTIMATE.start_main_~len~0#1| 2)) [2022-10-15 21:38:14,172 INFO L899 garLoopResultBuilder]: For program point L622-1(line 622) no Hoare annotation was computed. [2022-10-15 21:38:14,172 INFO L899 garLoopResultBuilder]: For program point L589-1(line 589) no Hoare annotation was computed. [2022-10-15 21:38:14,172 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 622) no Hoare annotation was computed. [2022-10-15 21:38:14,172 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 595) no Hoare annotation was computed. [2022-10-15 21:38:14,173 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-10-15 21:38:14,173 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-10-15 21:38:14,173 INFO L899 garLoopResultBuilder]: For program point L631(line 631) no Hoare annotation was computed. [2022-10-15 21:38:14,173 INFO L899 garLoopResultBuilder]: For program point L631-1(line 631) no Hoare annotation was computed. [2022-10-15 21:38:14,173 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW(line 635) no Hoare annotation was computed. [2022-10-15 21:38:14,173 INFO L899 garLoopResultBuilder]: For program point L631-4(lines 631 634) no Hoare annotation was computed. [2022-10-15 21:38:14,173 INFO L899 garLoopResultBuilder]: For program point L631-5(line 631) no Hoare annotation was computed. [2022-10-15 21:38:14,173 INFO L899 garLoopResultBuilder]: For program point L631-6(line 631) no Hoare annotation was computed. [2022-10-15 21:38:14,173 INFO L895 garLoopResultBuilder]: At program point L631-7(lines 631 634) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse1 (<= |ULTIMATE.start_dll_circular_create_~len#1| 1))) (or (and (<= (+ 2 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~len~0#1|) (<= |ULTIMATE.start_dll_circular_update_at_~index#1| 0) .cse0 .cse1) (let ((.cse2 (+ |ULTIMATE.start_main_~i~0#1| 1))) (and (<= |ULTIMATE.start_main_~len~0#1| .cse2) (<= .cse2 |ULTIMATE.start_main_~len~0#1|) .cse0 .cse1)))) [2022-10-15 21:38:14,174 INFO L899 garLoopResultBuilder]: For program point L631-8(lines 631 634) no Hoare annotation was computed. [2022-10-15 21:38:14,174 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW(line 631) no Hoare annotation was computed. [2022-10-15 21:38:14,174 INFO L899 garLoopResultBuilder]: For program point L615(line 615) no Hoare annotation was computed. [2022-10-15 21:38:14,174 INFO L899 garLoopResultBuilder]: For program point L615-1(line 615) no Hoare annotation was computed. [2022-10-15 21:38:14,174 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 595) no Hoare annotation was computed. [2022-10-15 21:38:14,174 INFO L899 garLoopResultBuilder]: For program point L632(line 632) no Hoare annotation was computed. [2022-10-15 21:38:14,174 INFO L895 garLoopResultBuilder]: At program point L599(lines 585 600) the Hoare annotation is: (and (= |ULTIMATE.start_main_~len~0#1| 2) (<= |ULTIMATE.start_dll_circular_create_~len#1| 1)) [2022-10-15 21:38:14,174 INFO L899 garLoopResultBuilder]: For program point L632-1(line 632) no Hoare annotation was computed. [2022-10-15 21:38:14,175 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW(line 635) no Hoare annotation was computed. [2022-10-15 21:38:14,175 INFO L899 garLoopResultBuilder]: For program point L591(lines 591 593) no Hoare annotation was computed. [2022-10-15 21:38:14,175 INFO L899 garLoopResultBuilder]: For program point L591-2(lines 591 593) no Hoare annotation was computed. [2022-10-15 21:38:14,175 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW(line 631) no Hoare annotation was computed. [2022-10-15 21:38:14,175 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW(line 635) no Hoare annotation was computed. [2022-10-15 21:38:14,175 INFO L895 garLoopResultBuilder]: At program point L617(lines 612 618) the Hoare annotation is: (and (<= (+ |ULTIMATE.start_main_~i~0#1| 1) |ULTIMATE.start_main_~len~0#1|) (<= |ULTIMATE.start_dll_circular_get_data_at_~index#1| 0) (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_dll_circular_update_at_~index#1| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (<= |ULTIMATE.start_dll_circular_create_~len#1| 1)) [2022-10-15 21:38:14,175 INFO L899 garLoopResultBuilder]: For program point L601(lines 601 611) no Hoare annotation was computed. [2022-10-15 21:38:14,176 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW(line 635) no Hoare annotation was computed. [2022-10-15 21:38:14,176 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-10-15 21:38:14,176 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 632) no Hoare annotation was computed. [2022-10-15 21:38:14,176 INFO L899 garLoopResultBuilder]: For program point L635(line 635) no Hoare annotation was computed. [2022-10-15 21:38:14,176 INFO L899 garLoopResultBuilder]: For program point L602(lines 602 610) no Hoare annotation was computed. [2022-10-15 21:38:14,176 INFO L899 garLoopResultBuilder]: For program point L635-3(lines 635 640) no Hoare annotation was computed. [2022-10-15 21:38:14,176 INFO L899 garLoopResultBuilder]: For program point L635-4(line 635) no Hoare annotation was computed. [2022-10-15 21:38:14,176 INFO L899 garLoopResultBuilder]: For program point L635-5(line 635) no Hoare annotation was computed. [2022-10-15 21:38:14,177 INFO L895 garLoopResultBuilder]: At program point L635-6(lines 635 640) the Hoare annotation is: (let ((.cse1 (<= |ULTIMATE.start_dll_circular_update_at_~index#1| 0)) (.cse2 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse3 (<= |ULTIMATE.start_dll_circular_create_~len#1| 1))) (or (let ((.cse0 (+ |ULTIMATE.start_main_~i~0#1| 1))) (and (<= |ULTIMATE.start_main_~len~0#1| .cse0) (<= .cse0 |ULTIMATE.start_main_~len~0#1|) .cse1 .cse2 .cse3)) (and (<= |ULTIMATE.start_dll_circular_get_data_at_~index#1| 0) (<= (+ 2 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~len~0#1|) .cse1 .cse2 .cse3))) [2022-10-15 21:38:14,177 INFO L899 garLoopResultBuilder]: For program point L635-7(lines 635 640) no Hoare annotation was computed. [2022-10-15 21:38:14,177 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW(line 636) no Hoare annotation was computed. [2022-10-15 21:38:14,177 INFO L899 garLoopResultBuilder]: For program point L619(lines 619 625) no Hoare annotation was computed. [2022-10-15 21:38:14,177 INFO L895 garLoopResultBuilder]: At program point L586(line 586) the Hoare annotation is: (and (= 2 |ULTIMATE.start_dll_circular_create_~len#1|) (= |ULTIMATE.start_main_~len~0#1| 2)) [2022-10-15 21:38:14,177 INFO L899 garLoopResultBuilder]: For program point L586-1(line 586) no Hoare annotation was computed. [2022-10-15 21:38:14,178 INFO L902 garLoopResultBuilder]: At program point L644(lines 626 645) the Hoare annotation is: true [2022-10-15 21:38:14,178 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-10-15 21:38:14,178 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 632) no Hoare annotation was computed. [2022-10-15 21:38:14,178 INFO L899 garLoopResultBuilder]: For program point L636(line 636) no Hoare annotation was computed. [2022-10-15 21:38:14,178 INFO L899 garLoopResultBuilder]: For program point L636-1(line 636) no Hoare annotation was computed. [2022-10-15 21:38:14,178 INFO L899 garLoopResultBuilder]: For program point L595(line 595) no Hoare annotation was computed. [2022-10-15 21:38:14,178 INFO L899 garLoopResultBuilder]: For program point L595-1(line 595) no Hoare annotation was computed. [2022-10-15 21:38:14,178 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW(line 636) no Hoare annotation was computed. [2022-10-15 21:38:14,179 INFO L895 garLoopResultBuilder]: At program point L620-2(lines 620 623) the Hoare annotation is: (let ((.cse1 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse2 (<= |ULTIMATE.start_dll_circular_create_~len#1| 1))) (or (let ((.cse0 (+ |ULTIMATE.start_main_~i~0#1| 1))) (and (<= |ULTIMATE.start_dll_circular_update_at_~index#1| 1) (<= |ULTIMATE.start_main_~len~0#1| .cse0) (<= .cse0 |ULTIMATE.start_main_~len~0#1|) .cse1 .cse2)) (and (<= (+ 2 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~len~0#1|) (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_dll_circular_update_at_~index#1| 0) .cse1 .cse2))) [2022-10-15 21:38:14,179 INFO L899 garLoopResultBuilder]: For program point L620-3(lines 620 623) no Hoare annotation was computed. [2022-10-15 21:38:14,179 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 631) no Hoare annotation was computed. [2022-10-15 21:38:14,179 INFO L899 garLoopResultBuilder]: For program point L637(lines 637 639) no Hoare annotation was computed. [2022-10-15 21:38:14,179 INFO L902 garLoopResultBuilder]: At program point L604-2(lines 604 608) the Hoare annotation is: true [2022-10-15 21:38:14,179 INFO L899 garLoopResultBuilder]: For program point L604-3(lines 604 608) no Hoare annotation was computed. [2022-10-15 21:38:14,179 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW(line 615) no Hoare annotation was computed. [2022-10-15 21:38:14,180 INFO L895 garLoopResultBuilder]: At program point L588-2(lines 588 596) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_main_~len~0#1| 2))) (or (and .cse0 (<= |ULTIMATE.start_dll_circular_create_~len#1| 1)) (and (= 2 |ULTIMATE.start_dll_circular_create_~len#1|) .cse0))) [2022-10-15 21:38:14,180 INFO L899 garLoopResultBuilder]: For program point L588-3(lines 588 596) no Hoare annotation was computed. [2022-10-15 21:38:14,180 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 622) no Hoare annotation was computed. [2022-10-15 21:38:14,180 INFO L895 garLoopResultBuilder]: At program point L613-2(lines 613 616) the Hoare annotation is: (let ((.cse0 (<= |ULTIMATE.start_dll_circular_update_at_~index#1| 0)) (.cse1 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse2 (<= |ULTIMATE.start_dll_circular_create_~len#1| 1))) (or (and (<= |ULTIMATE.start_dll_circular_get_data_at_~index#1| 0) (<= (+ 2 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~len~0#1|) (<= 0 |ULTIMATE.start_main_~i~0#1|) .cse0 .cse1 .cse2) (let ((.cse3 (+ |ULTIMATE.start_main_~i~0#1| 1))) (and (<= |ULTIMATE.start_main_~len~0#1| .cse3) (<= |ULTIMATE.start_dll_circular_get_data_at_~index#1| 1) (<= .cse3 |ULTIMATE.start_main_~len~0#1|) .cse0 .cse1 .cse2)))) [2022-10-15 21:38:14,180 INFO L899 garLoopResultBuilder]: For program point L613-3(lines 613 616) no Hoare annotation was computed. [2022-10-15 21:38:14,180 INFO L899 garLoopResultBuilder]: For program point L577(lines 577 579) no Hoare annotation was computed. [2022-10-15 21:38:14,180 INFO L899 garLoopResultBuilder]: For program point L577-1(lines 577 579) no Hoare annotation was computed. [2022-10-15 21:38:14,181 INFO L902 garLoopResultBuilder]: At program point L573(line 573) the Hoare annotation is: true [2022-10-15 21:38:14,181 INFO L895 garLoopResultBuilder]: At program point node_createENTRY(lines 575 584) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|)) [2022-10-15 21:38:14,181 INFO L899 garLoopResultBuilder]: For program point node_createFINAL(lines 575 584) no Hoare annotation was computed. [2022-10-15 21:38:14,181 INFO L899 garLoopResultBuilder]: For program point node_createEXIT(lines 575 584) no Hoare annotation was computed. [2022-10-15 21:38:14,185 INFO L444 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:38:14,188 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-10-15 21:38:14,210 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 09:38:14 BoogieIcfgContainer [2022-10-15 21:38:14,210 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-10-15 21:38:14,211 INFO L158 Benchmark]: Toolchain (without parser) took 12333.36ms. Allocated memory was 165.7MB in the beginning and 292.6MB in the end (delta: 126.9MB). Free memory was 144.6MB in the beginning and 123.7MB in the end (delta: 20.8MB). Peak memory consumption was 171.5MB. Max. memory is 8.0GB. [2022-10-15 21:38:14,211 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 165.7MB. Free memory is still 135.7MB. There was no memory consumed. Max. memory is 8.0GB. [2022-10-15 21:38:14,212 INFO L158 Benchmark]: CACSL2BoogieTranslator took 700.93ms. Allocated memory is still 165.7MB. Free memory was 144.3MB in the beginning and 142.1MB in the end (delta: 2.2MB). Peak memory consumption was 13.1MB. Max. memory is 8.0GB. [2022-10-15 21:38:14,212 INFO L158 Benchmark]: Boogie Procedure Inliner took 91.51ms. Allocated memory is still 165.7MB. Free memory was 142.1MB in the beginning and 139.7MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-10-15 21:38:14,212 INFO L158 Benchmark]: Boogie Preprocessor took 41.35ms. Allocated memory is still 165.7MB. Free memory was 139.7MB in the beginning and 137.9MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-10-15 21:38:14,213 INFO L158 Benchmark]: RCFGBuilder took 677.88ms. Allocated memory is still 165.7MB. Free memory was 137.9MB in the beginning and 120.6MB in the end (delta: 17.2MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2022-10-15 21:38:14,213 INFO L158 Benchmark]: TraceAbstraction took 10807.81ms. Allocated memory was 165.7MB in the beginning and 292.6MB in the end (delta: 126.9MB). Free memory was 119.7MB in the beginning and 123.7MB in the end (delta: -4.0MB). Peak memory consumption was 147.9MB. Max. memory is 8.0GB. [2022-10-15 21:38:14,215 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25ms. Allocated memory is still 165.7MB. Free memory is still 135.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 700.93ms. Allocated memory is still 165.7MB. Free memory was 144.3MB in the beginning and 142.1MB in the end (delta: 2.2MB). Peak memory consumption was 13.1MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 91.51ms. Allocated memory is still 165.7MB. Free memory was 142.1MB in the beginning and 139.7MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 41.35ms. Allocated memory is still 165.7MB. Free memory was 139.7MB in the beginning and 137.9MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 677.88ms. Allocated memory is still 165.7MB. Free memory was 137.9MB in the beginning and 120.6MB in the end (delta: 17.2MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * TraceAbstraction took 10807.81ms. Allocated memory was 165.7MB in the beginning and 292.6MB in the end (delta: 126.9MB). Free memory was 119.7MB in the beginning and 123.7MB in the end (delta: -4.0MB). Peak memory consumption was 147.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 595]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 595]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 631]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 631]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 632]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 632]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 622]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 622]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 631]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 631]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 635]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 635]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 636]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 636]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 615]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 615]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 635]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 635]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 73 locations, 18 error locations. Started 1 CEGAR loops. OverallTime: 10.7s, OverallIterations: 19, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.8s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1113 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1112 mSDsluCounter, 3036 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2130 mSDsCounter, 110 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1167 IncrementalHoareTripleChecker+Invalid, 1277 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 110 mSolverCounterUnsat, 906 mSDtfsCounter, 1167 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 523 GetRequests, 396 SyntacticMatches, 14 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 219 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=73occurred in iteration=0, InterpolantAutomatonStates: 118, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 19 MinimizatonAttempts, 140 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 14 LocationsWithAnnotation, 18 PreInvPairs, 38 NumberOfFragments, 233 HoareAnnotationTreeSize, 18 FomulaSimplifications, 4669 FormulaSimplificationTreeSizeReduction, 1.5s HoareSimplificationTime, 14 FomulaSimplificationsInter, 8059 FormulaSimplificationTreeSizeReductionInter, 0.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 4.0s InterpolantComputationTime, 960 NumberOfCodeBlocks, 960 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 1091 ConstructedInterpolants, 0 QuantifiedInterpolants, 3321 SizeOfPredicates, 13 NumberOfNonLiveVariables, 1395 ConjunctsInSsa, 25 ConjunctsInUnsatCore, 26 InterpolantComputations, 16 PerfectInterpolantSequences, 321/337 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 18 specifications checked. All of them hold - InvariantResult [Line: 626]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 585]: Loop Invariant Derived loop invariant: len == 2 && len <= 1 - InvariantResult [Line: 620]: Loop Invariant Derived loop invariant: ((((index <= 1 && len <= i + 1) && i + 1 <= len) && len == 2) && len <= 1) || ((((2 + i <= len && 0 <= i) && index <= 0) && len == 2) && len <= 1) - InvariantResult [Line: 626]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 635]: Loop Invariant Derived loop invariant: ((((len <= i + 1 && i + 1 <= len) && index <= 0) && len == 2) && len <= 1) || ((((index <= 0 && 2 + i <= len) && index <= 0) && len == 2) && len <= 1) - InvariantResult [Line: 604]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 612]: Loop Invariant Derived loop invariant: ((((i + 1 <= len && index <= 0) && 0 <= i) && index <= 0) && len == 2) && len <= 1 - InvariantResult [Line: 588]: Loop Invariant Derived loop invariant: (len == 2 && len <= 1) || (2 == len && len == 2) - InvariantResult [Line: 631]: Loop Invariant Derived loop invariant: (((2 + i <= len && index <= 0) && len == 2) && len <= 1) || (((len <= i + 1 && i + 1 <= len) && len == 2) && len <= 1) - InvariantResult [Line: 613]: Loop Invariant Derived loop invariant: (((((index <= 0 && 2 + i <= len) && 0 <= i) && index <= 0) && len == 2) && len <= 1) || (((((len <= i + 1 && index <= 1) && i + 1 <= len) && index <= 0) && len == 2) && len <= 1) - InvariantResult [Line: 573]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2022-10-15 21:38:14,266 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...