./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-83.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 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-83.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 a710c8a85a9b8babc674eadb463f38727995c780b4aae16a0530660db602c87a --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 14:11:56,650 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 14:11:56,720 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 14:11:56,723 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 14:11:56,725 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 14:11:56,747 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 14:11:56,748 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 14:11:56,749 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 14:11:56,749 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 14:11:56,752 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 14:11:56,752 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 14:11:56,752 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 14:11:56,753 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 14:11:56,753 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 14:11:56,753 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 14:11:56,753 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 14:11:56,753 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 14:11:56,753 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 14:11:56,753 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 14:11:56,754 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 14:11:56,754 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 14:11:56,758 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 14:11:56,759 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 14:11:56,759 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 14:11:56,759 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 14:11:56,759 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 14:11:56,759 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 14:11:56,759 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 14:11:56,760 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 14:11:56,760 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 14:11:56,761 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 14:11:56,761 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 14:11:56,761 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 14:11:56,761 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 14:11:56,761 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 14:11:56,762 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 14:11:56,762 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 14:11:56,762 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 14:11:56,762 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 14:11:56,762 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 14:11:56,762 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 14:11:56,762 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 14:11:56,763 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 -> a710c8a85a9b8babc674eadb463f38727995c780b4aae16a0530660db602c87a [2024-10-14 14:11:56,975 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 14:11:56,995 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 14:11:56,997 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 14:11:56,998 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 14:11:56,999 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 14:11:57,000 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-83.i [2024-10-14 14:11:58,244 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 14:11:58,431 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 14:11:58,431 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-83.i [2024-10-14 14:11:58,439 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c178bea1f/a5539b3e03e34926aca77d2cd260565d/FLAG4f68a07f3 [2024-10-14 14:11:58,808 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c178bea1f/a5539b3e03e34926aca77d2cd260565d [2024-10-14 14:11:58,810 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 14:11:58,811 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 14:11:58,814 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 14:11:58,814 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 14:11:58,818 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 14:11:58,819 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 02:11:58" (1/1) ... [2024-10-14 14:11:58,819 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a95ea06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:11:58, skipping insertion in model container [2024-10-14 14:11:58,819 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 02:11:58" (1/1) ... [2024-10-14 14:11:58,841 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 14:11:58,994 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-83.i[917,930] [2024-10-14 14:11:59,042 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 14:11:59,053 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 14:11:59,062 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-83.i[917,930] [2024-10-14 14:11:59,100 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 14:11:59,127 INFO L204 MainTranslator]: Completed translation [2024-10-14 14:11:59,127 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:11:59 WrapperNode [2024-10-14 14:11:59,128 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 14:11:59,131 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 14:11:59,131 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 14:11:59,131 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 14:11:59,137 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:11:59" (1/1) ... [2024-10-14 14:11:59,155 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:11:59" (1/1) ... [2024-10-14 14:11:59,204 INFO L138 Inliner]: procedures = 29, calls = 153, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 522 [2024-10-14 14:11:59,205 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 14:11:59,205 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 14:11:59,205 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 14:11:59,206 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 14:11:59,217 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:11:59" (1/1) ... [2024-10-14 14:11:59,217 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:11:59" (1/1) ... [2024-10-14 14:11:59,222 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:11:59" (1/1) ... [2024-10-14 14:11:59,253 INFO L175 MemorySlicer]: Split 130 memory accesses to 2 slices as follows [2, 128]. 98 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 12]. The 16 writes are split as follows [0, 16]. [2024-10-14 14:11:59,254 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:11:59" (1/1) ... [2024-10-14 14:11:59,254 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:11:59" (1/1) ... [2024-10-14 14:11:59,273 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:11:59" (1/1) ... [2024-10-14 14:11:59,280 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:11:59" (1/1) ... [2024-10-14 14:11:59,286 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:11:59" (1/1) ... [2024-10-14 14:11:59,289 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:11:59" (1/1) ... [2024-10-14 14:11:59,298 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 14:11:59,299 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 14:11:59,299 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 14:11:59,299 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 14:11:59,300 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:11:59" (1/1) ... [2024-10-14 14:11:59,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 14:11:59,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 14:11:59,334 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-14 14:11:59,337 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-14 14:11:59,380 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 14:11:59,380 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-10-14 14:11:59,381 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-10-14 14:11:59,381 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-14 14:11:59,382 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-14 14:11:59,382 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-10-14 14:11:59,382 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-10-14 14:11:59,382 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-14 14:11:59,382 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-14 14:11:59,383 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-10-14 14:11:59,383 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-10-14 14:11:59,383 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 14:11:59,384 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 14:11:59,384 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 14:11:59,384 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-14 14:11:59,384 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 14:11:59,384 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 14:11:59,496 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 14:11:59,498 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 14:11:59,932 INFO L? ?]: Removed 139 outVars from TransFormulas that were not future-live. [2024-10-14 14:11:59,932 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 14:11:59,960 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 14:11:59,960 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 14:11:59,961 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 02:11:59 BoogieIcfgContainer [2024-10-14 14:11:59,961 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 14:11:59,962 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 14:11:59,963 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 14:11:59,965 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 14:11:59,966 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 02:11:58" (1/3) ... [2024-10-14 14:11:59,966 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b5174e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 02:11:59, skipping insertion in model container [2024-10-14 14:11:59,966 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:11:59" (2/3) ... [2024-10-14 14:11:59,966 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b5174e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 02:11:59, skipping insertion in model container [2024-10-14 14:11:59,966 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 02:11:59" (3/3) ... [2024-10-14 14:11:59,967 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-83.i [2024-10-14 14:11:59,980 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 14:11:59,981 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 14:12:00,037 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 14:12:00,043 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;@7a1570c8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 14:12:00,044 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 14:12:00,047 INFO L276 IsEmpty]: Start isEmpty. Operand has 105 states, 91 states have (on average 1.5054945054945055) internal successors, (137), 92 states have internal predecessors, (137), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-14 14:12:00,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-14 14:12:00,057 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 14:12:00,058 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 14:12:00,058 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 14:12:00,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:12:00,064 INFO L85 PathProgramCache]: Analyzing trace with hash -859057060, now seen corresponding path program 1 times [2024-10-14 14:12:00,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 14:12:00,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637271345] [2024-10-14 14:12:00,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:12:00,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 14:12:00,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:12:00,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 14:12:00,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:12:00,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 14:12:00,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:12:00,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 14:12:00,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:12:00,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 14:12:00,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:12:00,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 14:12:00,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:12:00,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 14:12:00,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:12:00,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 14:12:00,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:12:00,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 14:12:00,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:12:00,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 14:12:00,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:12:00,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 14:12:00,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:12:00,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 14:12:00,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:12:00,440 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-14 14:12:00,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 14:12:00,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637271345] [2024-10-14 14:12:00,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1637271345] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 14:12:00,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 14:12:00,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 14:12:00,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346933620] [2024-10-14 14:12:00,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 14:12:00,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 14:12:00,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 14:12:00,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 14:12:00,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 14:12:00,468 INFO L87 Difference]: Start difference. First operand has 105 states, 91 states have (on average 1.5054945054945055) internal successors, (137), 92 states have internal predecessors, (137), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-14 14:12:00,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 14:12:00,508 INFO L93 Difference]: Finished difference Result 207 states and 327 transitions. [2024-10-14 14:12:00,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 14:12:00,511 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) Word has length 101 [2024-10-14 14:12:00,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 14:12:00,517 INFO L225 Difference]: With dead ends: 207 [2024-10-14 14:12:00,518 INFO L226 Difference]: Without dead ends: 103 [2024-10-14 14:12:00,522 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 35 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-14 14:12:00,527 INFO L432 NwaCegarLoop]: 144 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, 144 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-14 14:12:00,528 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 144 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 14:12:00,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-10-14 14:12:00,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2024-10-14 14:12:00,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 90 states have (on average 1.4) internal successors, (126), 90 states have internal predecessors, (126), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-14 14:12:00,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 148 transitions. [2024-10-14 14:12:00,566 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 148 transitions. Word has length 101 [2024-10-14 14:12:00,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 14:12:00,566 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 148 transitions. [2024-10-14 14:12:00,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-14 14:12:00,567 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 148 transitions. [2024-10-14 14:12:00,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-14 14:12:00,570 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 14:12:00,570 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 14:12:00,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 14:12:00,570 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 14:12:00,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:12:00,571 INFO L85 PathProgramCache]: Analyzing trace with hash 1754611118, now seen corresponding path program 1 times [2024-10-14 14:12:00,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 14:12:00,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827151391] [2024-10-14 14:12:00,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:12:00,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 14:12:00,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:12:00,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 14:12:00,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:12:00,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 14:12:00,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:12:00,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 14:12:00,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:12:00,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 14:12:00,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:12:00,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 14:12:00,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:12:00,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 14:12:00,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:12:00,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 14:12:00,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:12:00,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 14:12:00,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:12:00,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 14:12:00,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:12:00,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 14:12:00,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:12:00,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 14:12:00,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:12:00,862 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-14 14:12:00,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 14:12:00,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827151391] [2024-10-14 14:12:00,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827151391] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 14:12:00,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 14:12:00,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 14:12:00,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419430115] [2024-10-14 14:12:00,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 14:12:00,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 14:12:00,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 14:12:00,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 14:12:00,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 14:12:00,868 INFO L87 Difference]: Start difference. First operand 103 states and 148 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-14 14:12:00,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 14:12:00,912 INFO L93 Difference]: Finished difference Result 207 states and 298 transitions. [2024-10-14 14:12:00,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 14:12:00,912 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 101 [2024-10-14 14:12:00,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 14:12:00,914 INFO L225 Difference]: With dead ends: 207 [2024-10-14 14:12:00,914 INFO L226 Difference]: Without dead ends: 105 [2024-10-14 14:12:00,916 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 24 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-14 14:12:00,917 INFO L432 NwaCegarLoop]: 142 mSDtfsCounter, 0 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 419 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 14:12:00,918 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 419 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 14:12:00,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-10-14 14:12:00,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2024-10-14 14:12:00,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 92 states have (on average 1.391304347826087) internal successors, (128), 92 states have internal predecessors, (128), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-14 14:12:00,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 150 transitions. [2024-10-14 14:12:00,928 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 150 transitions. Word has length 101 [2024-10-14 14:12:00,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 14:12:00,930 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 150 transitions. [2024-10-14 14:12:00,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-14 14:12:00,931 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 150 transitions. [2024-10-14 14:12:00,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-14 14:12:00,932 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 14:12:00,932 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 14:12:00,932 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 14:12:00,932 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 14:12:00,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:12:00,933 INFO L85 PathProgramCache]: Analyzing trace with hash -184550928, now seen corresponding path program 1 times [2024-10-14 14:12:00,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 14:12:00,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447637223] [2024-10-14 14:12:00,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:12:00,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 14:12:00,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:12:01,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 14:12:01,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:12:01,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 14:12:01,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:12:01,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 14:12:01,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:12:01,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 14:12:01,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:12:01,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 14:12:01,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:12:01,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 14:12:01,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:12:01,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 14:12:01,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:12:01,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 14:12:01,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:12:01,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 14:12:01,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:12:01,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 14:12:01,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:12:01,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 14:12:01,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:12:01,130 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-14 14:12:01,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 14:12:01,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447637223] [2024-10-14 14:12:01,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447637223] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 14:12:01,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 14:12:01,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 14:12:01,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838326136] [2024-10-14 14:12:01,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 14:12:01,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 14:12:01,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 14:12:01,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 14:12:01,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 14:12:01,135 INFO L87 Difference]: Start difference. First operand 105 states and 150 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-14 14:12:01,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 14:12:01,186 INFO L93 Difference]: Finished difference Result 212 states and 303 transitions. [2024-10-14 14:12:01,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 14:12:01,187 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 101 [2024-10-14 14:12:01,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 14:12:01,191 INFO L225 Difference]: With dead ends: 212 [2024-10-14 14:12:01,193 INFO L226 Difference]: Without dead ends: 108 [2024-10-14 14:12:01,194 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 24 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-14 14:12:01,194 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 1 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 416 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-14 14:12:01,195 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 416 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 14:12:01,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-10-14 14:12:01,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 107. [2024-10-14 14:12:01,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 94 states have (on average 1.3829787234042554) internal successors, (130), 94 states have internal predecessors, (130), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-14 14:12:01,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 152 transitions. [2024-10-14 14:12:01,206 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 152 transitions. Word has length 101 [2024-10-14 14:12:01,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 14:12:01,206 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 152 transitions. [2024-10-14 14:12:01,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-14 14:12:01,207 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 152 transitions. [2024-10-14 14:12:01,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-14 14:12:01,208 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 14:12:01,208 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 14:12:01,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 14:12:01,208 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 14:12:01,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:12:01,209 INFO L85 PathProgramCache]: Analyzing trace with hash -993897554, now seen corresponding path program 1 times [2024-10-14 14:12:01,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 14:12:01,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213041719] [2024-10-14 14:12:01,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:12:01,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 14:12:01,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:12:01,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 14:12:01,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:12:01,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 14:12:01,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:12:01,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 14:12:01,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:12:01,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 14:12:01,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:12:01,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 14:12:01,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:12:01,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 14:12:01,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:12:01,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 14:12:01,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:12:01,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 14:12:01,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:12:01,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 14:12:01,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:12:01,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 14:12:01,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:12:01,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 14:12:01,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:12:01,399 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-14 14:12:01,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 14:12:01,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213041719] [2024-10-14 14:12:01,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [213041719] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 14:12:01,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 14:12:01,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 14:12:01,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695578368] [2024-10-14 14:12:01,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 14:12:01,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 14:12:01,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 14:12:01,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 14:12:01,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 14:12:01,404 INFO L87 Difference]: Start difference. First operand 107 states and 152 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-14 14:12:01,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 14:12:01,441 INFO L93 Difference]: Finished difference Result 216 states and 307 transitions. [2024-10-14 14:12:01,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 14:12:01,442 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 101 [2024-10-14 14:12:01,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 14:12:01,445 INFO L225 Difference]: With dead ends: 216 [2024-10-14 14:12:01,445 INFO L226 Difference]: Without dead ends: 110 [2024-10-14 14:12:01,445 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 24 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-14 14:12:01,449 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 1 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 14:12:01,449 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 417 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 14:12:01,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-10-14 14:12:01,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 109. [2024-10-14 14:12:01,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 96 states have (on average 1.375) internal successors, (132), 96 states have internal predecessors, (132), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-14 14:12:01,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 154 transitions. [2024-10-14 14:12:01,458 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 154 transitions. Word has length 101 [2024-10-14 14:12:01,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 14:12:01,458 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 154 transitions. [2024-10-14 14:12:01,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-14 14:12:01,459 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 154 transitions. [2024-10-14 14:12:01,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-14 14:12:01,463 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 14:12:01,463 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 14:12:01,463 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 14:12:01,464 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 14:12:01,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:12:01,465 INFO L85 PathProgramCache]: Analyzing trace with hash -936639252, now seen corresponding path program 1 times [2024-10-14 14:12:01,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 14:12:01,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206855520] [2024-10-14 14:12:01,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:12:01,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 14:12:01,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:12:01,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 14:12:01,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:12:01,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 14:12:01,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:12:01,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 14:12:01,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:12:01,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 14:12:01,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:12:01,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 14:12:01,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:12:01,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 14:12:01,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:12:01,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 14:12:01,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:12:01,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 14:12:01,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:12:01,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 14:12:01,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:12:01,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 14:12:01,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:12:01,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 14:12:01,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:12:01,592 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-14 14:12:01,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 14:12:01,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206855520] [2024-10-14 14:12:01,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206855520] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 14:12:01,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 14:12:01,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 14:12:01,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074667102] [2024-10-14 14:12:01,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 14:12:01,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 14:12:01,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 14:12:01,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 14:12:01,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 14:12:01,594 INFO L87 Difference]: Start difference. First operand 109 states and 154 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-14 14:12:01,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 14:12:01,622 INFO L93 Difference]: Finished difference Result 220 states and 311 transitions. [2024-10-14 14:12:01,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 14:12:01,623 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 101 [2024-10-14 14:12:01,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 14:12:01,624 INFO L225 Difference]: With dead ends: 220 [2024-10-14 14:12:01,624 INFO L226 Difference]: Without dead ends: 112 [2024-10-14 14:12:01,624 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 24 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-14 14:12:01,625 INFO L432 NwaCegarLoop]: 142 mSDtfsCounter, 1 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 420 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-14 14:12:01,625 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 420 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 14:12:01,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-10-14 14:12:01,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 111. [2024-10-14 14:12:01,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 98 states have (on average 1.3673469387755102) internal successors, (134), 98 states have internal predecessors, (134), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-14 14:12:01,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 156 transitions. [2024-10-14 14:12:01,632 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 156 transitions. Word has length 101 [2024-10-14 14:12:01,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 14:12:01,632 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 156 transitions. [2024-10-14 14:12:01,632 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-14 14:12:01,633 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 156 transitions. [2024-10-14 14:12:01,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-14 14:12:01,637 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 14:12:01,637 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 14:12:01,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 14:12:01,638 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 14:12:01,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:12:01,638 INFO L85 PathProgramCache]: Analyzing trace with hash -936579670, now seen corresponding path program 1 times [2024-10-14 14:12:01,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 14:12:01,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371345672] [2024-10-14 14:12:01,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:12:01,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 14:12:01,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:12:02,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 14:12:02,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:12:02,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 14:12:02,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:12:02,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 14:12:02,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:12:02,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 14:12:02,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:12:02,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 14:12:02,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:12:02,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 14:12:02,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:12:02,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 14:12:02,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:12:02,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 14:12:02,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:12:02,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 14:12:02,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:12:02,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 14:12:02,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:12:02,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 14:12:02,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:12:02,279 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-14 14:12:02,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 14:12:02,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371345672] [2024-10-14 14:12:02,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1371345672] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 14:12:02,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 14:12:02,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 14:12:02,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570790758] [2024-10-14 14:12:02,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 14:12:02,282 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 14:12:02,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 14:12:02,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 14:12:02,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 14:12:02,285 INFO L87 Difference]: Start difference. First operand 111 states and 156 transitions. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-14 14:12:02,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 14:12:02,473 INFO L93 Difference]: Finished difference Result 221 states and 311 transitions. [2024-10-14 14:12:02,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 14:12:02,474 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 101 [2024-10-14 14:12:02,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 14:12:02,475 INFO L225 Difference]: With dead ends: 221 [2024-10-14 14:12:02,475 INFO L226 Difference]: Without dead ends: 111 [2024-10-14 14:12:02,476 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-14 14:12:02,477 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 163 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 14:12:02,478 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 279 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 14:12:02,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-10-14 14:12:02,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2024-10-14 14:12:02,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 98 states have (on average 1.3571428571428572) internal successors, (133), 98 states have internal predecessors, (133), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-14 14:12:02,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 155 transitions. [2024-10-14 14:12:02,487 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 155 transitions. Word has length 101 [2024-10-14 14:12:02,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 14:12:02,487 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 155 transitions. [2024-10-14 14:12:02,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-14 14:12:02,487 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 155 transitions. [2024-10-14 14:12:02,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-10-14 14:12:02,488 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 14:12:02,488 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 14:12:02,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 14:12:02,488 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 14:12:02,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:12:02,489 INFO L85 PathProgramCache]: Analyzing trace with hash 2061795194, now seen corresponding path program 1 times [2024-10-14 14:12:02,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 14:12:02,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257783571] [2024-10-14 14:12:02,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:12:02,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 14:12:02,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:12:02,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 14:12:02,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:12:02,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 14:12:02,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:12:02,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 14:12:02,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:12:02,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 14:12:02,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:12:02,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 14:12:02,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:12:02,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 14:12:02,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:12:02,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 14:12:02,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:12:02,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 14:12:02,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:12:02,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 14:12:02,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:12:02,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 14:12:02,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:12:02,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 14:12:02,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:12:02,647 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-14 14:12:02,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 14:12:02,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257783571] [2024-10-14 14:12:02,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [257783571] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 14:12:02,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 14:12:02,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 14:12:02,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912598020] [2024-10-14 14:12:02,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 14:12:02,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 14:12:02,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 14:12:02,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 14:12:02,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 14:12:02,649 INFO L87 Difference]: Start difference. First operand 111 states and 155 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-14 14:12:02,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 14:12:02,767 INFO L93 Difference]: Finished difference Result 223 states and 312 transitions. [2024-10-14 14:12:02,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 14:12:02,767 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 102 [2024-10-14 14:12:02,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 14:12:02,768 INFO L225 Difference]: With dead ends: 223 [2024-10-14 14:12:02,768 INFO L226 Difference]: Without dead ends: 113 [2024-10-14 14:12:02,769 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-14 14:12:02,769 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 3 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 454 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 14:12:02,769 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 454 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 14:12:02,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-10-14 14:12:02,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2024-10-14 14:12:02,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 100 states have (on average 1.35) internal successors, (135), 100 states have internal predecessors, (135), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-14 14:12:02,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 157 transitions. [2024-10-14 14:12:02,781 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 157 transitions. Word has length 102 [2024-10-14 14:12:02,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 14:12:02,782 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 157 transitions. [2024-10-14 14:12:02,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-14 14:12:02,783 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 157 transitions. [2024-10-14 14:12:02,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-14 14:12:02,784 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 14:12:02,784 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 14:12:02,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 14:12:02,784 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 14:12:02,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:12:02,784 INFO L85 PathProgramCache]: Analyzing trace with hash 2060604880, now seen corresponding path program 1 times [2024-10-14 14:12:02,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 14:12:02,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125810047] [2024-10-14 14:12:02,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:12:02,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 14:12:02,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:12:03,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 14:12:03,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:12:03,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 14:12:03,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:12:03,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 14:12:03,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:12:03,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 14:12:03,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:12:03,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 14:12:03,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:12:03,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 14:12:03,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:12:03,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 14:12:03,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:12:03,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 14:12:03,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:12:03,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 14:12:03,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:12:03,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 14:12:03,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:12:03,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 14:12:03,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:12:03,778 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-14 14:12:03,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 14:12:03,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125810047] [2024-10-14 14:12:03,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1125810047] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 14:12:03,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 14:12:03,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-14 14:12:03,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049026806] [2024-10-14 14:12:03,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 14:12:03,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 14:12:03,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 14:12:03,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 14:12:03,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-10-14 14:12:03,782 INFO L87 Difference]: Start difference. First operand 113 states and 157 transitions. Second operand has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-14 14:12:04,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 14:12:04,160 INFO L93 Difference]: Finished difference Result 292 states and 405 transitions. [2024-10-14 14:12:04,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 14:12:04,160 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 103 [2024-10-14 14:12:04,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 14:12:04,161 INFO L225 Difference]: With dead ends: 292 [2024-10-14 14:12:04,161 INFO L226 Difference]: Without dead ends: 180 [2024-10-14 14:12:04,162 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2024-10-14 14:12:04,162 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 257 mSDsluCounter, 450 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 561 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 14:12:04,162 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 561 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 14:12:04,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2024-10-14 14:12:04,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 134. [2024-10-14 14:12:04,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 121 states have (on average 1.3636363636363635) internal successors, (165), 121 states have internal predecessors, (165), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-14 14:12:04,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 187 transitions. [2024-10-14 14:12:04,171 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 187 transitions. Word has length 103 [2024-10-14 14:12:04,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 14:12:04,171 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 187 transitions. [2024-10-14 14:12:04,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-14 14:12:04,171 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 187 transitions. [2024-10-14 14:12:04,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-14 14:12:04,172 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 14:12:04,172 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 14:12:04,172 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-14 14:12:04,172 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 14:12:04,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:12:04,173 INFO L85 PathProgramCache]: Analyzing trace with hash 780741202, now seen corresponding path program 1 times [2024-10-14 14:12:04,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 14:12:04,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92981651] [2024-10-14 14:12:04,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:12:04,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 14:12:04,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-14 14:12:04,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1833090713] [2024-10-14 14:12:04,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:12:04,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 14:12:04,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 14:12:04,268 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-14 14:12:04,269 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-14 14:12:04,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:12:04,449 INFO L255 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-14 14:12:04,460 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 14:12:05,014 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 14:12:05,022 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 23 treesize of output 11 [2024-10-14 14:12:05,049 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-10-14 14:12:05,065 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-14 14:12:05,066 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 14:12:05,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 14:12:05,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92981651] [2024-10-14 14:12:05,066 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-14 14:12:05,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1833090713] [2024-10-14 14:12:05,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1833090713] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 14:12:05,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 14:12:05,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 14:12:05,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714088499] [2024-10-14 14:12:05,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 14:12:05,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 14:12:05,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 14:12:05,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 14:12:05,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-14 14:12:05,068 INFO L87 Difference]: Start difference. First operand 134 states and 187 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-14 14:12:05,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 14:12:05,279 INFO L93 Difference]: Finished difference Result 334 states and 467 transitions. [2024-10-14 14:12:05,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 14:12:05,280 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 103 [2024-10-14 14:12:05,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 14:12:05,281 INFO L225 Difference]: With dead ends: 334 [2024-10-14 14:12:05,281 INFO L226 Difference]: Without dead ends: 201 [2024-10-14 14:12:05,282 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-14 14:12:05,282 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 294 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 14:12:05,282 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [294 Valid, 350 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 14:12:05,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2024-10-14 14:12:05,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 150. [2024-10-14 14:12:05,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 137 states have (on average 1.3795620437956204) internal successors, (189), 137 states have internal predecessors, (189), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-14 14:12:05,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 211 transitions. [2024-10-14 14:12:05,292 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 211 transitions. Word has length 103 [2024-10-14 14:12:05,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 14:12:05,293 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 211 transitions. [2024-10-14 14:12:05,293 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-14 14:12:05,293 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 211 transitions. [2024-10-14 14:12:05,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-14 14:12:05,294 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 14:12:05,294 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 14:12:05,308 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-14 14:12:05,495 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 14:12:05,495 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 14:12:05,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:12:05,496 INFO L85 PathProgramCache]: Analyzing trace with hash -240327152, now seen corresponding path program 1 times [2024-10-14 14:12:05,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 14:12:05,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696187897] [2024-10-14 14:12:05,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:12:05,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 14:12:05,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-14 14:12:05,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [35824193] [2024-10-14 14:12:05,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:12:05,582 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 14:12:05,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 14:12:05,583 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 14:12:05,585 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-14 14:12:05,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:12:05,831 INFO L255 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-10-14 14:12:05,835 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 14:12:05,869 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-10-14 14:12:06,428 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 14:12:06,451 INFO L349 Elim1Store]: treesize reduction 31, result has 32.6 percent of original size [2024-10-14 14:12:06,451 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 37 [2024-10-14 14:12:06,514 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 14:12:06,515 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2024-10-14 14:12:06,530 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-14 14:12:06,530 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 14:12:06,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 14:12:06,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696187897] [2024-10-14 14:12:06,531 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-14 14:12:06,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [35824193] [2024-10-14 14:12:06,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [35824193] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 14:12:06,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 14:12:06,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 14:12:06,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372656586] [2024-10-14 14:12:06,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 14:12:06,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 14:12:06,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 14:12:06,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 14:12:06,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-14 14:12:06,532 INFO L87 Difference]: Start difference. First operand 150 states and 211 transitions. Second operand has 8 states, 8 states have (on average 6.375) internal successors, (51), 7 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-14 14:12:10,828 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-14 14:12:11,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 14:12:11,165 INFO L93 Difference]: Finished difference Result 470 states and 664 transitions. [2024-10-14 14:12:11,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 14:12:11,166 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 7 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 103 [2024-10-14 14:12:11,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 14:12:11,167 INFO L225 Difference]: With dead ends: 470 [2024-10-14 14:12:11,167 INFO L226 Difference]: Without dead ends: 321 [2024-10-14 14:12:11,168 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2024-10-14 14:12:11,168 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 179 mSDsluCounter, 517 mSDsCounter, 0 mSdLazyCounter, 441 mSolverCounterSat, 32 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 622 SdHoareTripleChecker+Invalid, 474 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 441 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2024-10-14 14:12:11,169 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 622 Invalid, 474 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 441 Invalid, 1 Unknown, 0 Unchecked, 4.5s Time] [2024-10-14 14:12:11,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2024-10-14 14:12:11,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 198. [2024-10-14 14:12:11,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 173 states have (on average 1.3526011560693643) internal successors, (234), 173 states have internal predecessors, (234), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-14 14:12:11,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 278 transitions. [2024-10-14 14:12:11,201 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 278 transitions. Word has length 103 [2024-10-14 14:12:11,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 14:12:11,201 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 278 transitions. [2024-10-14 14:12:11,202 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 7 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-14 14:12:11,202 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 278 transitions. [2024-10-14 14:12:11,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-14 14:12:11,202 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 14:12:11,203 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 14:12:11,217 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-14 14:12:11,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-10-14 14:12:11,404 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 14:12:11,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:12:11,405 INFO L85 PathProgramCache]: Analyzing trace with hash 1171126897, now seen corresponding path program 1 times [2024-10-14 14:12:11,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 14:12:11,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504972186] [2024-10-14 14:12:11,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:12:11,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 14:12:11,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:12:12,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 14:12:12,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:12:12,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 14:12:12,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:12:12,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 14:12:12,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:12:12,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 14:12:12,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:12:12,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 14:12:12,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:12:12,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 14:12:12,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:12:12,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 14:12:12,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:12:12,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 14:12:12,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:12:12,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 14:12:12,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:12:12,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 14:12:12,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:12:12,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 14:12:12,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:12:12,507 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-14 14:12:12,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 14:12:12,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504972186] [2024-10-14 14:12:12,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504972186] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 14:12:12,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 14:12:12,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-14 14:12:12,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68369501] [2024-10-14 14:12:12,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 14:12:12,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 14:12:12,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 14:12:12,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 14:12:12,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-10-14 14:12:12,509 INFO L87 Difference]: Start difference. First operand 198 states and 278 transitions. Second operand has 9 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 3 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2024-10-14 14:12:13,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 14:12:13,047 INFO L93 Difference]: Finished difference Result 351 states and 491 transitions. [2024-10-14 14:12:13,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 14:12:13,047 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 3 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 103 [2024-10-14 14:12:13,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 14:12:13,048 INFO L225 Difference]: With dead ends: 351 [2024-10-14 14:12:13,049 INFO L226 Difference]: Without dead ends: 202 [2024-10-14 14:12:13,049 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2024-10-14 14:12:13,049 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 219 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 311 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 14:12:13,049 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 287 Invalid, 383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 311 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 14:12:13,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2024-10-14 14:12:13,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 202. [2024-10-14 14:12:13,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 176 states have (on average 1.3352272727272727) internal successors, (235), 176 states have internal predecessors, (235), 22 states have call successors, (22), 3 states have call predecessors, (22), 3 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-14 14:12:13,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 279 transitions. [2024-10-14 14:12:13,065 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 279 transitions. Word has length 103 [2024-10-14 14:12:13,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 14:12:13,065 INFO L471 AbstractCegarLoop]: Abstraction has 202 states and 279 transitions. [2024-10-14 14:12:13,066 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 3 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2024-10-14 14:12:13,066 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 279 transitions. [2024-10-14 14:12:13,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-14 14:12:13,069 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 14:12:13,069 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 14:12:13,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-14 14:12:13,070 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 14:12:13,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:12:13,071 INFO L85 PathProgramCache]: Analyzing trace with hash -749800242, now seen corresponding path program 1 times [2024-10-14 14:12:13,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 14:12:13,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005222685] [2024-10-14 14:12:13,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:12:13,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 14:12:13,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:12:14,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 14:12:14,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:12:14,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 14:12:14,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:12:14,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 14:12:14,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:12:14,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 14:12:14,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:12:14,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 14:12:14,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:12:14,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 14:12:14,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:12:14,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 14:12:14,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:12:14,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 14:12:14,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:12:14,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 14:12:14,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:12:14,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 14:12:14,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:12:14,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 14:12:14,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:12:14,148 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-14 14:12:14,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 14:12:14,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005222685] [2024-10-14 14:12:14,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005222685] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 14:12:14,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 14:12:14,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-14 14:12:14,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125005433] [2024-10-14 14:12:14,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 14:12:14,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 14:12:14,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 14:12:14,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 14:12:14,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-10-14 14:12:14,150 INFO L87 Difference]: Start difference. First operand 202 states and 279 transitions. Second operand has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-14 14:12:14,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 14:12:14,962 INFO L93 Difference]: Finished difference Result 455 states and 628 transitions. [2024-10-14 14:12:14,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 14:12:14,963 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 103 [2024-10-14 14:12:14,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 14:12:14,964 INFO L225 Difference]: With dead ends: 455 [2024-10-14 14:12:14,965 INFO L226 Difference]: Without dead ends: 302 [2024-10-14 14:12:14,965 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2024-10-14 14:12:14,965 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 324 mSDsluCounter, 471 mSDsCounter, 0 mSdLazyCounter, 355 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 324 SdHoareTripleChecker+Valid, 614 SdHoareTripleChecker+Invalid, 366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-14 14:12:14,966 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [324 Valid, 614 Invalid, 366 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 355 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-14 14:12:14,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2024-10-14 14:12:14,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 229. [2024-10-14 14:12:14,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 203 states have (on average 1.3497536945812807) internal successors, (274), 203 states have internal predecessors, (274), 22 states have call successors, (22), 3 states have call predecessors, (22), 3 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-14 14:12:14,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 318 transitions. [2024-10-14 14:12:14,984 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 318 transitions. Word has length 103 [2024-10-14 14:12:14,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 14:12:14,984 INFO L471 AbstractCegarLoop]: Abstraction has 229 states and 318 transitions. [2024-10-14 14:12:14,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-14 14:12:14,984 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 318 transitions. [2024-10-14 14:12:14,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-14 14:12:14,985 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 14:12:14,985 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 14:12:14,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-14 14:12:14,986 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 14:12:14,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:12:14,986 INFO L85 PathProgramCache]: Analyzing trace with hash -1841675826, now seen corresponding path program 1 times [2024-10-14 14:12:14,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 14:12:14,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54393597] [2024-10-14 14:12:14,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:12:14,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 14:12:15,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat