./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-61.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-61.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c6dac1e5238ed53a380160bb79ff5b6b2442b7be93876c5524c1d6a035c6da2a --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 14:01:18,237 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 14:01:18,299 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 14:01:18,304 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 14:01:18,304 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 14:01:18,326 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 14:01:18,327 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 14:01:18,328 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 14:01:18,328 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 14:01:18,329 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 14:01:18,329 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 14:01:18,329 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 14:01:18,330 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 14:01:18,330 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 14:01:18,331 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 14:01:18,331 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 14:01:18,331 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 14:01:18,332 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 14:01:18,332 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 14:01:18,333 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 14:01:18,333 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 14:01:18,333 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 14:01:18,334 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 14:01:18,334 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 14:01:18,335 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 14:01:18,335 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 14:01:18,335 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 14:01:18,336 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 14:01:18,336 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 14:01:18,336 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 14:01:18,337 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 14:01:18,337 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 14:01:18,337 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 14:01:18,338 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 14:01:18,338 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 14:01:18,338 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 14:01:18,338 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 14:01:18,339 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 14:01:18,339 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 14:01:18,339 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 14:01:18,340 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 14:01:18,340 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 14:01:18,342 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c6dac1e5238ed53a380160bb79ff5b6b2442b7be93876c5524c1d6a035c6da2a [2024-10-11 14:01:18,589 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 14:01:18,614 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 14:01:18,618 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 14:01:18,620 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 14:01:18,620 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 14:01:18,621 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-61.i [2024-10-11 14:01:20,081 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 14:01:20,277 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 14:01:20,278 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-61.i [2024-10-11 14:01:20,289 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/c51247d8b/7134aa7519d441d08359a9ff1b842f8e/FLAG6a1733ad1 [2024-10-11 14:01:20,302 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/c51247d8b/7134aa7519d441d08359a9ff1b842f8e [2024-10-11 14:01:20,304 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 14:01:20,306 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 14:01:20,307 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 14:01:20,307 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 14:01:20,313 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 14:01:20,314 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:01:20" (1/1) ... [2024-10-11 14:01:20,314 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56a75059 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:01:20, skipping insertion in model container [2024-10-11 14:01:20,315 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:01:20" (1/1) ... [2024-10-11 14:01:20,344 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 14:01:20,518 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-61.i[917,930] [2024-10-11 14:01:20,622 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 14:01:20,641 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 14:01:20,654 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-61.i[917,930] [2024-10-11 14:01:20,718 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 14:01:20,757 INFO L204 MainTranslator]: Completed translation [2024-10-11 14:01:20,757 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:01:20 WrapperNode [2024-10-11 14:01:20,758 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 14:01:20,759 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 14:01:20,759 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 14:01:20,760 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 14:01:20,765 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:01:20" (1/1) ... [2024-10-11 14:01:20,783 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:01:20" (1/1) ... [2024-10-11 14:01:20,824 INFO L138 Inliner]: procedures = 29, calls = 184, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 522 [2024-10-11 14:01:20,824 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 14:01:20,825 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 14:01:20,825 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 14:01:20,825 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 14:01:20,835 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:01:20" (1/1) ... [2024-10-11 14:01:20,836 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:01:20" (1/1) ... [2024-10-11 14:01:20,843 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:01:20" (1/1) ... [2024-10-11 14:01:20,869 INFO L175 MemorySlicer]: Split 147 memory accesses to 2 slices as follows [2, 145]. 99 percent of accesses are in the largest equivalence class. The 22 initializations are split as follows [2, 20]. The 23 writes are split as follows [0, 23]. [2024-10-11 14:01:20,870 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:01:20" (1/1) ... [2024-10-11 14:01:20,870 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:01:20" (1/1) ... [2024-10-11 14:01:20,887 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:01:20" (1/1) ... [2024-10-11 14:01:20,892 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:01:20" (1/1) ... [2024-10-11 14:01:20,895 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:01:20" (1/1) ... [2024-10-11 14:01:20,898 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:01:20" (1/1) ... [2024-10-11 14:01:20,904 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 14:01:20,905 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 14:01:20,905 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 14:01:20,905 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 14:01:20,906 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:01:20" (1/1) ... [2024-10-11 14:01:20,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 14:01:20,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 14:01:20,958 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 14:01:20,962 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 14:01:21,011 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 14:01:21,011 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-10-11 14:01:21,012 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-10-11 14:01:21,013 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-11 14:01:21,013 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-11 14:01:21,013 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-10-11 14:01:21,013 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-10-11 14:01:21,014 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-11 14:01:21,015 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-11 14:01:21,015 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-10-11 14:01:21,015 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-10-11 14:01:21,015 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 14:01:21,015 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 14:01:21,015 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 14:01:21,015 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 14:01:21,015 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 14:01:21,016 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 14:01:21,152 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 14:01:21,154 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 14:01:21,804 INFO L? ?]: Removed 104 outVars from TransFormulas that were not future-live. [2024-10-11 14:01:21,804 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 14:01:21,842 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 14:01:21,844 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 14:01:21,845 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:01:21 BoogieIcfgContainer [2024-10-11 14:01:21,845 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 14:01:21,847 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 14:01:21,847 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 14:01:21,850 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 14:01:21,851 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 02:01:20" (1/3) ... [2024-10-11 14:01:21,851 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42efadc0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:01:21, skipping insertion in model container [2024-10-11 14:01:21,851 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:01:20" (2/3) ... [2024-10-11 14:01:21,852 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42efadc0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:01:21, skipping insertion in model container [2024-10-11 14:01:21,852 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:01:21" (3/3) ... [2024-10-11 14:01:21,853 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-61.i [2024-10-11 14:01:21,866 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 14:01:21,866 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 14:01:21,926 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 14:01:21,932 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@6f12192, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 14:01:21,933 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 14:01:21,942 INFO L276 IsEmpty]: Start isEmpty. Operand has 113 states, 85 states have (on average 1.388235294117647) internal successors, (118), 86 states have internal predecessors, (118), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-11 14:01:21,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2024-10-11 14:01:21,958 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:01:21,959 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:01:21,960 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:01:21,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:01:21,966 INFO L85 PathProgramCache]: Analyzing trace with hash -1897595223, now seen corresponding path program 1 times [2024-10-11 14:01:21,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:01:21,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42155915] [2024-10-11 14:01:21,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:01:21,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:01:22,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:22,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 14:01:22,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:22,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 14:01:22,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:22,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 14:01:22,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:22,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 14:01:22,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:22,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 14:01:22,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:22,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 14:01:22,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:22,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 14:01:22,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:22,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 14:01:22,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:22,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 14:01:22,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:22,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 14:01:22,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:22,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 14:01:22,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:22,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 14:01:22,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:22,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 14:01:22,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:22,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 14:01:22,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:22,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 14:01:22,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:22,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 14:01:22,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:22,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 14:01:22,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:22,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 14:01:22,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:22,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 14:01:22,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:22,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-11 14:01:22,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:22,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-11 14:01:22,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:22,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 14:01:22,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:22,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 14:01:22,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:22,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-11 14:01:22,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:22,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-10-11 14:01:22,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:22,543 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-10-11 14:01:22,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:01:22,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42155915] [2024-10-11 14:01:22,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42155915] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:01:22,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:01:22,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 14:01:22,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602017320] [2024-10-11 14:01:22,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:01:22,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 14:01:22,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:01:22,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 14:01:22,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 14:01:22,589 INFO L87 Difference]: Start difference. First operand has 113 states, 85 states have (on average 1.388235294117647) internal successors, (118), 86 states have internal predecessors, (118), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) [2024-10-11 14:01:22,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:01:22,645 INFO L93 Difference]: Finished difference Result 223 states and 359 transitions. [2024-10-11 14:01:22,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 14:01:22,648 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) Word has length 185 [2024-10-11 14:01:22,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:01:22,657 INFO L225 Difference]: With dead ends: 223 [2024-10-11 14:01:22,657 INFO L226 Difference]: Without dead ends: 111 [2024-10-11 14:01:22,664 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 14:01:22,670 INFO L432 NwaCegarLoop]: 159 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 14:01:22,671 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 159 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 14:01:22,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-10-11 14:01:22,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2024-10-11 14:01:22,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 84 states have (on average 1.3452380952380953) internal successors, (113), 84 states have internal predecessors, (113), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-11 14:01:22,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 163 transitions. [2024-10-11 14:01:22,761 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 163 transitions. Word has length 185 [2024-10-11 14:01:22,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:01:22,763 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 163 transitions. [2024-10-11 14:01:22,763 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) [2024-10-11 14:01:22,764 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 163 transitions. [2024-10-11 14:01:22,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2024-10-11 14:01:22,786 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:01:22,787 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:01:22,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 14:01:22,787 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:01:22,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:01:22,791 INFO L85 PathProgramCache]: Analyzing trace with hash 484150551, now seen corresponding path program 1 times [2024-10-11 14:01:22,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:01:22,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753605208] [2024-10-11 14:01:22,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:01:22,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:01:22,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:23,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 14:01:23,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:23,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 14:01:23,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:23,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 14:01:23,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:23,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 14:01:23,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:23,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 14:01:23,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:23,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 14:01:23,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:23,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 14:01:23,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:23,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 14:01:23,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:23,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 14:01:23,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:23,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 14:01:23,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:23,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 14:01:23,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:23,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 14:01:23,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:23,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 14:01:23,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:23,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 14:01:23,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:23,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 14:01:23,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:23,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 14:01:23,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:23,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 14:01:23,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:23,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 14:01:23,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:23,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 14:01:23,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:23,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-11 14:01:23,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:23,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-11 14:01:23,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:23,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 14:01:23,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:23,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 14:01:23,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:23,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-11 14:01:23,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:23,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-10-11 14:01:23,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:23,324 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-10-11 14:01:23,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:01:23,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753605208] [2024-10-11 14:01:23,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753605208] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:01:23,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:01:23,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 14:01:23,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598233084] [2024-10-11 14:01:23,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:01:23,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 14:01:23,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:01:23,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 14:01:23,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 14:01:23,328 INFO L87 Difference]: Start difference. First operand 111 states and 163 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-10-11 14:01:23,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:01:23,395 INFO L93 Difference]: Finished difference Result 224 states and 329 transitions. [2024-10-11 14:01:23,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 14:01:23,398 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 185 [2024-10-11 14:01:23,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:01:23,401 INFO L225 Difference]: With dead ends: 224 [2024-10-11 14:01:23,401 INFO L226 Difference]: Without dead ends: 114 [2024-10-11 14:01:23,402 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 14:01:23,403 INFO L432 NwaCegarLoop]: 156 mSDtfsCounter, 1 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 14:01:23,404 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 461 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 14:01:23,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-10-11 14:01:23,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 113. [2024-10-11 14:01:23,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 86 states have (on average 1.3372093023255813) internal successors, (115), 86 states have internal predecessors, (115), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-11 14:01:23,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 165 transitions. [2024-10-11 14:01:23,426 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 165 transitions. Word has length 185 [2024-10-11 14:01:23,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:01:23,428 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 165 transitions. [2024-10-11 14:01:23,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-10-11 14:01:23,428 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 165 transitions. [2024-10-11 14:01:23,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2024-10-11 14:01:23,430 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:01:23,430 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:01:23,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 14:01:23,431 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:01:23,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:01:23,433 INFO L85 PathProgramCache]: Analyzing trace with hash -325196075, now seen corresponding path program 1 times [2024-10-11 14:01:23,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:01:23,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326832456] [2024-10-11 14:01:23,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:01:23,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:01:23,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:23,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 14:01:23,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:23,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 14:01:23,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:23,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 14:01:23,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:23,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 14:01:23,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:23,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 14:01:23,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:23,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 14:01:23,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:23,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 14:01:23,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:23,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 14:01:23,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:23,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 14:01:23,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:23,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 14:01:23,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:23,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 14:01:23,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:23,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 14:01:23,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:23,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 14:01:23,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:23,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 14:01:23,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:23,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 14:01:23,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:23,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 14:01:23,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:23,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 14:01:23,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:23,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 14:01:23,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:23,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 14:01:23,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:23,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-11 14:01:23,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:23,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-11 14:01:23,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:23,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 14:01:23,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:23,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 14:01:23,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:23,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-11 14:01:23,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:23,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-10-11 14:01:23,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:23,749 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-10-11 14:01:23,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:01:23,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326832456] [2024-10-11 14:01:23,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326832456] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:01:23,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:01:23,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 14:01:23,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794211818] [2024-10-11 14:01:23,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:01:23,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 14:01:23,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:01:23,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 14:01:23,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 14:01:23,753 INFO L87 Difference]: Start difference. First operand 113 states and 165 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-10-11 14:01:23,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:01:23,789 INFO L93 Difference]: Finished difference Result 228 states and 333 transitions. [2024-10-11 14:01:23,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 14:01:23,790 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 185 [2024-10-11 14:01:23,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:01:23,792 INFO L225 Difference]: With dead ends: 228 [2024-10-11 14:01:23,792 INFO L226 Difference]: Without dead ends: 116 [2024-10-11 14:01:23,793 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 14:01:23,794 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 1 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 465 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 14:01:23,795 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 465 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 14:01:23,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-10-11 14:01:23,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 115. [2024-10-11 14:01:23,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 88 states have (on average 1.3295454545454546) internal successors, (117), 88 states have internal predecessors, (117), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-11 14:01:23,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 167 transitions. [2024-10-11 14:01:23,805 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 167 transitions. Word has length 185 [2024-10-11 14:01:23,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:01:23,806 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 167 transitions. [2024-10-11 14:01:23,806 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-10-11 14:01:23,806 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 167 transitions. [2024-10-11 14:01:23,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2024-10-11 14:01:23,809 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:01:23,809 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:01:23,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 14:01:23,810 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:01:23,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:01:23,810 INFO L85 PathProgramCache]: Analyzing trace with hash -325136493, now seen corresponding path program 1 times [2024-10-11 14:01:23,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:01:23,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888490608] [2024-10-11 14:01:23,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:01:23,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:01:24,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:24,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 14:01:24,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:24,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 14:01:24,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:24,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 14:01:24,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:24,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 14:01:24,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:24,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 14:01:24,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:24,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 14:01:24,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:24,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 14:01:24,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:24,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 14:01:24,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:24,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 14:01:24,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:24,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 14:01:24,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:24,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 14:01:24,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:24,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 14:01:24,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:24,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 14:01:24,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:24,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 14:01:24,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:24,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 14:01:24,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:24,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 14:01:24,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:24,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 14:01:24,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:24,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 14:01:24,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:24,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 14:01:24,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:24,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-11 14:01:24,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:24,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-11 14:01:24,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:24,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 14:01:24,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:24,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 14:01:24,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:24,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-11 14:01:24,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:24,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-10-11 14:01:24,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:24,850 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-10-11 14:01:24,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:01:24,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888490608] [2024-10-11 14:01:24,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888490608] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:01:24,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:01:24,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 14:01:24,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82826773] [2024-10-11 14:01:24,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:01:24,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 14:01:24,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:01:24,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 14:01:24,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 14:01:24,854 INFO L87 Difference]: Start difference. First operand 115 states and 167 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-10-11 14:01:25,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:01:25,199 INFO L93 Difference]: Finished difference Result 235 states and 341 transitions. [2024-10-11 14:01:25,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 14:01:25,199 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 185 [2024-10-11 14:01:25,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:01:25,202 INFO L225 Difference]: With dead ends: 235 [2024-10-11 14:01:25,204 INFO L226 Difference]: Without dead ends: 121 [2024-10-11 14:01:25,205 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-11 14:01:25,206 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 117 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 14:01:25,209 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 397 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 14:01:25,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2024-10-11 14:01:25,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 117. [2024-10-11 14:01:25,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 90 states have (on average 1.3222222222222222) internal successors, (119), 90 states have internal predecessors, (119), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-11 14:01:25,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 169 transitions. [2024-10-11 14:01:25,230 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 169 transitions. Word has length 185 [2024-10-11 14:01:25,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:01:25,232 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 169 transitions. [2024-10-11 14:01:25,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-10-11 14:01:25,233 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 169 transitions. [2024-10-11 14:01:25,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2024-10-11 14:01:25,239 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:01:25,239 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:01:25,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 14:01:25,239 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:01:25,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:01:25,240 INFO L85 PathProgramCache]: Analyzing trace with hash -834609583, now seen corresponding path program 1 times [2024-10-11 14:01:25,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:01:25,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702180103] [2024-10-11 14:01:25,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:01:25,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:01:25,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:26,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 14:01:26,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:26,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 14:01:26,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:26,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 14:01:26,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:26,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 14:01:26,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:26,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 14:01:26,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:26,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 14:01:26,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:26,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 14:01:26,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:26,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 14:01:26,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:26,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 14:01:26,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:26,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 14:01:26,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:26,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 14:01:26,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:26,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 14:01:26,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:26,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 14:01:26,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:26,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 14:01:26,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:26,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 14:01:26,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:26,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 14:01:26,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:26,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 14:01:26,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:26,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 14:01:26,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:26,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 14:01:26,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:26,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-11 14:01:26,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:26,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-11 14:01:26,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:26,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 14:01:26,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:26,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 14:01:26,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:26,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-11 14:01:26,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:26,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-10-11 14:01:26,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:26,861 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-10-11 14:01:26,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:01:26,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702180103] [2024-10-11 14:01:26,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702180103] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:01:26,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:01:26,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 14:01:26,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508225552] [2024-10-11 14:01:26,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:01:26,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 14:01:26,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:01:26,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 14:01:26,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-10-11 14:01:26,865 INFO L87 Difference]: Start difference. First operand 117 states and 169 transitions. Second operand has 9 states, 9 states have (on average 7.0) internal successors, (63), 9 states have internal predecessors, (63), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2024-10-11 14:01:27,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:01:27,408 INFO L93 Difference]: Finished difference Result 279 states and 402 transitions. [2024-10-11 14:01:27,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 14:01:27,408 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.0) internal successors, (63), 9 states have internal predecessors, (63), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 185 [2024-10-11 14:01:27,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:01:27,410 INFO L225 Difference]: With dead ends: 279 [2024-10-11 14:01:27,410 INFO L226 Difference]: Without dead ends: 163 [2024-10-11 14:01:27,411 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-10-11 14:01:27,412 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 228 mSDsluCounter, 419 mSDsCounter, 0 mSdLazyCounter, 447 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 527 SdHoareTripleChecker+Invalid, 449 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 447 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 14:01:27,412 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [228 Valid, 527 Invalid, 449 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 447 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 14:01:27,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2024-10-11 14:01:27,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 126. [2024-10-11 14:01:27,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 99 states have (on average 1.3333333333333333) internal successors, (132), 99 states have internal predecessors, (132), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-11 14:01:27,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 182 transitions. [2024-10-11 14:01:27,437 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 182 transitions. Word has length 185 [2024-10-11 14:01:27,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:01:27,441 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 182 transitions. [2024-10-11 14:01:27,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.0) internal successors, (63), 9 states have internal predecessors, (63), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2024-10-11 14:01:27,442 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 182 transitions. [2024-10-11 14:01:27,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2024-10-11 14:01:27,443 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:01:27,443 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:01:27,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 14:01:27,444 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:01:27,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:01:27,449 INFO L85 PathProgramCache]: Analyzing trace with hash 1872009811, now seen corresponding path program 1 times [2024-10-11 14:01:27,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:01:27,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667769143] [2024-10-11 14:01:27,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:01:27,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:01:27,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:34,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 14:01:34,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:34,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 14:01:34,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:34,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 14:01:34,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:34,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 14:01:34,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:34,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 14:01:34,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:34,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 14:01:34,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:34,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 14:01:34,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:34,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 14:01:34,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:34,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 14:01:34,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:35,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 14:01:35,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:35,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 14:01:35,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:35,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 14:01:35,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:35,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 14:01:35,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:35,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 14:01:35,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:35,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 14:01:35,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:35,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 14:01:35,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:35,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 14:01:35,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:35,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 14:01:35,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:35,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 14:01:35,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:35,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-11 14:01:35,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:35,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-11 14:01:35,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:35,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 14:01:35,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:35,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 14:01:35,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:35,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-11 14:01:35,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:35,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-10-11 14:01:35,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:35,419 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 9 proven. 63 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2024-10-11 14:01:35,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:01:35,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667769143] [2024-10-11 14:01:35,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667769143] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 14:01:35,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [784550772] [2024-10-11 14:01:35,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:01:35,421 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 14:01:35,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 14:01:35,423 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 14:01:35,425 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 14:01:35,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:35,697 INFO L255 TraceCheckSpWp]: Trace formula consists of 664 conjuncts, 87 conjuncts are in the unsatisfiable core [2024-10-11 14:01:35,734 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 14:01:37,833 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-11 14:01:38,990 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-10-11 14:01:39,925 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-10-11 14:01:40,695 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-10-11 14:01:41,410 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-10-11 14:01:42,086 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-10-11 14:01:42,737 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-10-11 14:01:43,401 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-10-11 14:01:44,067 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-10-11 14:01:44,771 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-10-11 14:01:45,489 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-10-11 14:01:46,122 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:01:46,380 INFO L349 Elim1Store]: treesize reduction 217, result has 46.9 percent of original size [2024-10-11 14:01:46,381 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 20 case distinctions, treesize of input 61 treesize of output 228