./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 a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-61.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! 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-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 06:40:52,788 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 06:40:52,849 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 06:40:52,855 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 06:40:52,856 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 06:40:52,877 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 06:40:52,878 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 06:40:52,878 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 06:40:52,878 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 06:40:52,879 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 06:40:52,879 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 06:40:52,879 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 06:40:52,880 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 06:40:52,880 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 06:40:52,882 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 06:40:52,882 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 06:40:52,882 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 06:40:52,883 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 06:40:52,883 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 06:40:52,883 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 06:40:52,885 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 06:40:52,886 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 06:40:52,886 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 06:40:52,886 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 06:40:52,886 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 06:40:52,887 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 06:40:52,887 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 06:40:52,887 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 06:40:52,887 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 06:40:52,887 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 06:40:52,888 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 06:40:52,888 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 06:40:52,889 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 06:40:52,889 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 06:40:52,889 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 06:40:52,889 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 06:40:52,890 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 06:40:52,890 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 06:40:52,890 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 06:40:52,890 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 06:40:52,890 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 06:40:52,891 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 06:40:52,891 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! 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-13 06:40:53,086 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 06:40:53,105 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 06:40:53,108 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 06:40:53,109 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 06:40:53,109 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 06:40:53,110 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-13 06:40:54,312 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 06:40:54,473 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 06:40:54,473 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-61.i [2024-10-13 06:40:54,485 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4fe7be147/52fddbce4fd144be8e9ae6a2e5876e39/FLAG3952c9dd6 [2024-10-13 06:40:54,869 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4fe7be147/52fddbce4fd144be8e9ae6a2e5876e39 [2024-10-13 06:40:54,871 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 06:40:54,872 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 06:40:54,873 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 06:40:54,873 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 06:40:54,877 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 06:40:54,878 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 06:40:54" (1/1) ... [2024-10-13 06:40:54,879 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d4b98bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:40:54, skipping insertion in model container [2024-10-13 06:40:54,879 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 06:40:54" (1/1) ... [2024-10-13 06:40:54,900 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 06:40:55,054 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-13 06:40:55,129 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 06:40:55,144 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 06:40:55,155 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-13 06:40:55,220 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 06:40:55,259 INFO L204 MainTranslator]: Completed translation [2024-10-13 06:40:55,260 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:40:55 WrapperNode [2024-10-13 06:40:55,260 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 06:40:55,261 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 06:40:55,261 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 06:40:55,261 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 06:40:55,267 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:40:55" (1/1) ... [2024-10-13 06:40:55,284 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:40:55" (1/1) ... [2024-10-13 06:40:55,319 INFO L138 Inliner]: procedures = 29, calls = 184, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 522 [2024-10-13 06:40:55,320 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 06:40:55,320 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 06:40:55,320 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 06:40:55,320 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 06:40:55,331 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:40:55" (1/1) ... [2024-10-13 06:40:55,331 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:40:55" (1/1) ... [2024-10-13 06:40:55,335 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:40:55" (1/1) ... [2024-10-13 06:40:55,369 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-13 06:40:55,369 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:40:55" (1/1) ... [2024-10-13 06:40:55,369 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:40:55" (1/1) ... [2024-10-13 06:40:55,383 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:40:55" (1/1) ... [2024-10-13 06:40:55,387 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:40:55" (1/1) ... [2024-10-13 06:40:55,389 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:40:55" (1/1) ... [2024-10-13 06:40:55,391 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:40:55" (1/1) ... [2024-10-13 06:40:55,400 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 06:40:55,401 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 06:40:55,401 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 06:40:55,402 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 06:40:55,403 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:40:55" (1/1) ... [2024-10-13 06:40:55,410 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 06:40:55,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 06:40:55,429 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 06:40:55,433 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 06:40:55,465 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 06:40:55,465 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-10-13 06:40:55,466 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-10-13 06:40:55,466 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-13 06:40:55,466 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-13 06:40:55,466 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-10-13 06:40:55,466 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-10-13 06:40:55,466 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-13 06:40:55,466 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-13 06:40:55,467 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-10-13 06:40:55,467 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-10-13 06:40:55,468 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 06:40:55,468 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 06:40:55,468 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 06:40:55,468 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-13 06:40:55,468 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 06:40:55,468 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 06:40:55,560 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 06:40:55,562 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 06:40:55,963 INFO L? ?]: Removed 104 outVars from TransFormulas that were not future-live. [2024-10-13 06:40:55,963 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 06:40:55,984 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 06:40:55,985 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 06:40:55,985 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 06:40:55 BoogieIcfgContainer [2024-10-13 06:40:55,985 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 06:40:55,986 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 06:40:55,987 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 06:40:55,989 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 06:40:55,989 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 06:40:54" (1/3) ... [2024-10-13 06:40:55,990 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c377ff0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 06:40:55, skipping insertion in model container [2024-10-13 06:40:55,990 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:40:55" (2/3) ... [2024-10-13 06:40:55,990 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c377ff0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 06:40:55, skipping insertion in model container [2024-10-13 06:40:55,990 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 06:40:55" (3/3) ... [2024-10-13 06:40:55,991 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-61.i [2024-10-13 06:40:56,003 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 06:40:56,003 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 06:40:56,050 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 06:40:56,056 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;@6602a0f0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 06:40:56,056 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 06:40:56,063 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-13 06:40:56,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2024-10-13 06:40:56,078 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:40:56,079 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-13 06:40:56,079 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:40:56,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:40:56,085 INFO L85 PathProgramCache]: Analyzing trace with hash -1897595223, now seen corresponding path program 1 times [2024-10-13 06:40:56,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:40:56,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145591492] [2024-10-13 06:40:56,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:40:56,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:40:56,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:40:56,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:40:56,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:40:56,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:40:56,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:40:56,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:40:56,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:40:56,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:40:56,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:40:56,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:40:56,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:40:56,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:40:56,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:40:56,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:40:56,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:40:56,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:40:56,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:40:56,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:40:56,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:40:56,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:40:56,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:40:56,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:40:56,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:40:56,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:40:56,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:40:56,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:40:56,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:40:56,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:40:56,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:40:56,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 06:40:56,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:40:56,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 06:40:56,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:40:56,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 06:40:56,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:40:56,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 06:40:56,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:40:56,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-13 06:40:56,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:40:56,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-13 06:40:56,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:40:56,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-13 06:40:56,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:40:56,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-13 06:40:56,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:40:56,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-13 06:40:56,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:40:56,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-13 06:40:56,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:40:56,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-10-13 06:40:56,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:40:56,575 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-13 06:40:56,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:40:56,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145591492] [2024-10-13 06:40:56,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1145591492] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:40:56,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:40:56,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 06:40:56,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169023475] [2024-10-13 06:40:56,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:40:56,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 06:40:56,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:40:56,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 06:40:56,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 06:40:56,618 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-13 06:40:56,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:40:56,656 INFO L93 Difference]: Finished difference Result 223 states and 359 transitions. [2024-10-13 06:40:56,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 06:40:56,659 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-13 06:40:56,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:40:56,665 INFO L225 Difference]: With dead ends: 223 [2024-10-13 06:40:56,665 INFO L226 Difference]: Without dead ends: 111 [2024-10-13 06:40:56,669 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-13 06:40:56,672 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-13 06:40:56,674 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-13 06:40:56,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-10-13 06:40:56,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2024-10-13 06:40:56,707 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-13 06:40:56,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 163 transitions. [2024-10-13 06:40:56,711 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 163 transitions. Word has length 185 [2024-10-13 06:40:56,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:40:56,711 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 163 transitions. [2024-10-13 06:40:56,712 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-13 06:40:56,712 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 163 transitions. [2024-10-13 06:40:56,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2024-10-13 06:40:56,717 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:40:56,717 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-13 06:40:56,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 06:40:56,718 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:40:56,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:40:56,718 INFO L85 PathProgramCache]: Analyzing trace with hash 484150551, now seen corresponding path program 1 times [2024-10-13 06:40:56,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:40:56,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893412034] [2024-10-13 06:40:56,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:40:56,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:40:56,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:40:57,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:40:57,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:40:57,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:40:57,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:40:57,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:40:57,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:40:57,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:40:57,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:40:57,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:40:57,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:40:57,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:40:57,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:40:57,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:40:57,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:40:57,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:40:57,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:40:57,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:40:57,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:40:57,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:40:57,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:40:57,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:40:57,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:40:57,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:40:57,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:40:57,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:40:57,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:40:57,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:40:57,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:40:57,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 06:40:57,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:40:57,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 06:40:57,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:40:57,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 06:40:57,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:40:57,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 06:40:57,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:40:57,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-13 06:40:57,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:40:57,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-13 06:40:57,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:40:57,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-13 06:40:57,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:40:57,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-13 06:40:57,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:40:57,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-13 06:40:57,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:40:57,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-13 06:40:57,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:40:57,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-10-13 06:40:57,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:40:57,120 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-13 06:40:57,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:40:57,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893412034] [2024-10-13 06:40:57,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1893412034] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:40:57,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:40:57,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 06:40:57,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986654163] [2024-10-13 06:40:57,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:40:57,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 06:40:57,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:40:57,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 06:40:57,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 06:40:57,124 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-13 06:40:57,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:40:57,174 INFO L93 Difference]: Finished difference Result 224 states and 329 transitions. [2024-10-13 06:40:57,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 06:40:57,175 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-13 06:40:57,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:40:57,179 INFO L225 Difference]: With dead ends: 224 [2024-10-13 06:40:57,180 INFO L226 Difference]: Without dead ends: 114 [2024-10-13 06:40:57,180 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-13 06:40:57,183 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-13 06:40:57,183 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-13 06:40:57,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-10-13 06:40:57,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 113. [2024-10-13 06:40:57,197 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-13 06:40:57,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 165 transitions. [2024-10-13 06:40:57,202 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 165 transitions. Word has length 185 [2024-10-13 06:40:57,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:40:57,203 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 165 transitions. [2024-10-13 06:40:57,203 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-13 06:40:57,204 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 165 transitions. [2024-10-13 06:40:57,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2024-10-13 06:40:57,208 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:40:57,208 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-13 06:40:57,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 06:40:57,209 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:40:57,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:40:57,210 INFO L85 PathProgramCache]: Analyzing trace with hash -325196075, now seen corresponding path program 1 times [2024-10-13 06:40:57,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:40:57,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935588765] [2024-10-13 06:40:57,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:40:57,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:40:57,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:40:57,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:40:57,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:40:57,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:40:57,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:40:57,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:40:57,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:40:57,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:40:57,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:40:57,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:40:57,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:40:57,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:40:57,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:40:57,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:40:57,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:40:57,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:40:57,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:40:57,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:40:57,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:40:57,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:40:57,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:40:57,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:40:57,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:40:57,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:40:57,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:40:57,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:40:57,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:40:57,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:40:57,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:40:57,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 06:40:57,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:40:57,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 06:40:57,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:40:57,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 06:40:57,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:40:57,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 06:40:57,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:40:57,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-13 06:40:57,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:40:57,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-13 06:40:57,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:40:57,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-13 06:40:57,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:40:57,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-13 06:40:57,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:40:57,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-13 06:40:57,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:40:57,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-13 06:40:57,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:40:57,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-10-13 06:40:57,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:40:57,462 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-13 06:40:57,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:40:57,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935588765] [2024-10-13 06:40:57,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935588765] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:40:57,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:40:57,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 06:40:57,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317396061] [2024-10-13 06:40:57,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:40:57,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 06:40:57,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:40:57,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 06:40:57,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 06:40:57,465 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-13 06:40:57,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:40:57,505 INFO L93 Difference]: Finished difference Result 228 states and 333 transitions. [2024-10-13 06:40:57,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 06:40:57,506 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-13 06:40:57,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:40:57,507 INFO L225 Difference]: With dead ends: 228 [2024-10-13 06:40:57,507 INFO L226 Difference]: Without dead ends: 116 [2024-10-13 06:40:57,508 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-13 06:40:57,509 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-13 06:40:57,509 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-13 06:40:57,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-10-13 06:40:57,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 115. [2024-10-13 06:40:57,515 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-13 06:40:57,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 167 transitions. [2024-10-13 06:40:57,516 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 167 transitions. Word has length 185 [2024-10-13 06:40:57,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:40:57,517 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 167 transitions. [2024-10-13 06:40:57,517 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-13 06:40:57,517 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 167 transitions. [2024-10-13 06:40:57,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2024-10-13 06:40:57,522 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:40:57,522 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-13 06:40:57,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 06:40:57,522 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:40:57,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:40:57,523 INFO L85 PathProgramCache]: Analyzing trace with hash -325136493, now seen corresponding path program 1 times [2024-10-13 06:40:57,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:40:57,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986303643] [2024-10-13 06:40:57,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:40:57,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:40:57,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:40:58,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:40:58,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:40:58,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:40:58,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:40:58,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:40:58,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:40:58,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:40:58,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:40:58,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:40:58,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:40:58,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:40:58,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:40:58,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:40:58,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:40:58,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:40:58,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:40:58,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:40:58,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:40:58,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:40:58,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:40:58,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:40:58,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:40:58,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:40:58,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:40:58,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:40:58,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:40:58,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:40:58,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:40:58,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 06:40:58,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:40:58,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 06:40:58,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:40:58,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 06:40:58,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:40:58,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 06:40:58,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:40:58,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-13 06:40:58,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:40:58,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-13 06:40:58,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:40:58,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-13 06:40:58,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:40:58,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-13 06:40:58,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:40:58,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-13 06:40:58,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:40:58,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-13 06:40:58,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:40:58,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-10-13 06:40:58,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:40:58,300 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-13 06:40:58,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:40:58,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986303643] [2024-10-13 06:40:58,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [986303643] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:40:58,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:40:58,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 06:40:58,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435281750] [2024-10-13 06:40:58,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:40:58,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 06:40:58,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:40:58,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 06:40:58,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-13 06:40:58,304 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-13 06:40:58,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:40:58,575 INFO L93 Difference]: Finished difference Result 235 states and 341 transitions. [2024-10-13 06:40:58,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 06:40:58,576 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-13 06:40:58,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:40:58,577 INFO L225 Difference]: With dead ends: 235 [2024-10-13 06:40:58,577 INFO L226 Difference]: Without dead ends: 121 [2024-10-13 06:40:58,578 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-13 06:40:58,579 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.2s IncrementalHoareTripleChecker+Time [2024-10-13 06:40:58,581 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.2s Time] [2024-10-13 06:40:58,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2024-10-13 06:40:58,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 117. [2024-10-13 06:40:58,595 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-13 06:40:58,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 169 transitions. [2024-10-13 06:40:58,597 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 169 transitions. Word has length 185 [2024-10-13 06:40:58,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:40:58,597 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 169 transitions. [2024-10-13 06:40:58,599 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-13 06:40:58,599 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 169 transitions. [2024-10-13 06:40:58,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2024-10-13 06:40:58,601 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:40:58,601 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-13 06:40:58,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 06:40:58,601 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:40:58,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:40:58,602 INFO L85 PathProgramCache]: Analyzing trace with hash -834609583, now seen corresponding path program 1 times [2024-10-13 06:40:58,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:40:58,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719649284] [2024-10-13 06:40:58,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:40:58,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:40:58,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:40:59,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:40:59,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:40:59,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:40:59,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:40:59,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:40:59,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:40:59,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:40:59,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:40:59,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:40:59,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:40:59,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:40:59,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:40:59,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:40:59,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:40:59,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:40:59,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:40:59,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:40:59,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:40:59,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:40:59,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:40:59,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:40:59,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:40:59,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:40:59,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:40:59,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:40:59,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:40:59,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:40:59,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:40:59,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 06:40:59,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:40:59,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 06:40:59,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:40:59,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 06:40:59,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:40:59,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 06:40:59,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:40:59,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-13 06:40:59,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:40:59,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-13 06:40:59,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:40:59,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-13 06:40:59,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:40:59,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-13 06:40:59,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:40:59,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-13 06:40:59,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:40:59,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-13 06:40:59,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:40:59,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-10-13 06:40:59,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:40:59,807 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-13 06:40:59,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:40:59,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719649284] [2024-10-13 06:40:59,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719649284] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:40:59,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:40:59,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-13 06:40:59,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705018497] [2024-10-13 06:40:59,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:40:59,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-13 06:40:59,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:40:59,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-13 06:40:59,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-10-13 06:40:59,809 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-13 06:41:00,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:41:00,208 INFO L93 Difference]: Finished difference Result 279 states and 402 transitions. [2024-10-13 06:41:00,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 06:41:00,209 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-13 06:41:00,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:41:00,210 INFO L225 Difference]: With dead ends: 279 [2024-10-13 06:41:00,210 INFO L226 Difference]: Without dead ends: 163 [2024-10-13 06:41:00,214 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-13 06:41:00,215 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 228 mSDsluCounter, 419 mSDsCounter, 0 mSdLazyCounter, 447 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.3s IncrementalHoareTripleChecker+Time [2024-10-13 06:41:00,215 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.3s Time] [2024-10-13 06:41:00,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2024-10-13 06:41:00,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 126. [2024-10-13 06:41:00,226 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-13 06:41:00,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 182 transitions. [2024-10-13 06:41:00,227 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 182 transitions. Word has length 185 [2024-10-13 06:41:00,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:41:00,228 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 182 transitions. [2024-10-13 06:41:00,228 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-13 06:41:00,228 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 182 transitions. [2024-10-13 06:41:00,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2024-10-13 06:41:00,229 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:41:00,229 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-13 06:41:00,229 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 06:41:00,230 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:41:00,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:41:00,230 INFO L85 PathProgramCache]: Analyzing trace with hash 1872009811, now seen corresponding path program 1 times [2024-10-13 06:41:00,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:41:00,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017923812] [2024-10-13 06:41:00,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:41:00,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:41:00,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:41:05,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:41:05,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:41:05,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:41:05,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:41:05,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:41:05,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:41:06,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:41:06,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:41:06,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:41:06,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:41:06,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:41:06,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:41:06,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:41:06,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:41:06,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:41:06,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:41:06,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:41:06,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:41:06,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:41:06,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:41:06,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:41:06,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:41:06,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:41:06,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:41:06,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:41:06,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:41:06,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:41:06,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:41:06,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 06:41:06,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:41:06,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 06:41:06,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:41:06,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 06:41:06,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:41:06,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 06:41:06,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:41:06,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-13 06:41:06,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:41:06,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-13 06:41:06,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:41:06,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-13 06:41:06,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:41:06,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-13 06:41:06,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:41:06,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-13 06:41:06,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:41:06,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-13 06:41:06,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:41:06,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-10-13 06:41:06,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:41:06,508 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-13 06:41:06,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:41:06,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017923812] [2024-10-13 06:41:06,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017923812] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 06:41:06,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1800542535] [2024-10-13 06:41:06,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:41:06,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 06:41:06,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 06:41:06,512 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 06:41:06,513 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-13 06:41:06,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:41:06,711 INFO L255 TraceCheckSpWp]: Trace formula consists of 664 conjuncts, 87 conjuncts are in the unsatisfiable core [2024-10-13 06:41:06,737 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:41:08,337 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-13 06:41:09,125 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-13 06:41:09,781 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-13 06:41:10,377 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-13 06:41:11,018 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-13 06:41:11,636 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-13 06:41:12,222 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-13 06:41:12,788 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-13 06:41:13,340 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-13 06:41:13,903 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-13 06:41:14,446 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-13 06:41:14,888 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 06:41:15,102 INFO L349 Elim1Store]: treesize reduction 217, result has 46.9 percent of original size [2024-10-13 06:41:15,102 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