./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-s_file-84.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-84.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 4fa328083b1d4aa3a21868494aa94d1f433f55ced0b8b3227cc831ea530b809d --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 06:33:05,159 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 06:33:05,245 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 06:33:05,250 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 06:33:05,250 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 06:33:05,271 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 06:33:05,272 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 06:33:05,272 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 06:33:05,273 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 06:33:05,273 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 06:33:05,274 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 06:33:05,274 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 06:33:05,275 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 06:33:05,275 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 06:33:05,276 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 06:33:05,276 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 06:33:05,276 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 06:33:05,281 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 06:33:05,281 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 06:33:05,282 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 06:33:05,282 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 06:33:05,282 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 06:33:05,283 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 06:33:05,283 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 06:33:05,283 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 06:33:05,283 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 06:33:05,284 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 06:33:05,284 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 06:33:05,284 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 06:33:05,284 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 06:33:05,284 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 06:33:05,285 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 06:33:05,285 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 06:33:05,285 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 06:33:05,285 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 06:33:05,286 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 06:33:05,286 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 06:33:05,286 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 06:33:05,288 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 06:33:05,288 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 06:33:05,289 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 06:33:05,289 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 06:33:05,289 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 -> 4fa328083b1d4aa3a21868494aa94d1f433f55ced0b8b3227cc831ea530b809d [2024-10-13 06:33:05,541 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 06:33:05,571 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 06:33:05,574 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 06:33:05,575 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 06:33:05,576 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 06:33:05,577 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-84.i [2024-10-13 06:33:07,036 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 06:33:07,240 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 06:33:07,241 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-84.i [2024-10-13 06:33:07,250 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f367edf99/1afe7e0b63524474a09fe2c03d45c586/FLAGe41938167 [2024-10-13 06:33:07,263 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f367edf99/1afe7e0b63524474a09fe2c03d45c586 [2024-10-13 06:33:07,266 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 06:33:07,267 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 06:33:07,269 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 06:33:07,269 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 06:33:07,274 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 06:33:07,275 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 06:33:07" (1/1) ... [2024-10-13 06:33:07,276 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@340340e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:33:07, skipping insertion in model container [2024-10-13 06:33:07,276 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 06:33:07" (1/1) ... [2024-10-13 06:33:07,305 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 06:33:07,491 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-s_file-84.i[916,929] [2024-10-13 06:33:07,576 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 06:33:07,590 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 06:33:07,601 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-s_file-84.i[916,929] [2024-10-13 06:33:07,653 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 06:33:07,681 INFO L204 MainTranslator]: Completed translation [2024-10-13 06:33:07,682 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:33:07 WrapperNode [2024-10-13 06:33:07,682 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 06:33:07,683 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 06:33:07,684 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 06:33:07,684 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 06:33:07,691 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:33:07" (1/1) ... [2024-10-13 06:33:07,710 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:33:07" (1/1) ... [2024-10-13 06:33:07,751 INFO L138 Inliner]: procedures = 29, calls = 154, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 422 [2024-10-13 06:33:07,751 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 06:33:07,752 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 06:33:07,752 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 06:33:07,753 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 06:33:07,764 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:33:07" (1/1) ... [2024-10-13 06:33:07,765 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:33:07" (1/1) ... [2024-10-13 06:33:07,773 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:33:07" (1/1) ... [2024-10-13 06:33:07,805 INFO L175 MemorySlicer]: Split 122 memory accesses to 2 slices as follows [2, 120]. 98 percent of accesses are in the largest equivalence class. The 17 initializations are split as follows [2, 15]. The 17 writes are split as follows [0, 17]. [2024-10-13 06:33:07,806 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:33:07" (1/1) ... [2024-10-13 06:33:07,806 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:33:07" (1/1) ... [2024-10-13 06:33:07,828 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:33:07" (1/1) ... [2024-10-13 06:33:07,840 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:33:07" (1/1) ... [2024-10-13 06:33:07,846 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:33:07" (1/1) ... [2024-10-13 06:33:07,848 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:33:07" (1/1) ... [2024-10-13 06:33:07,853 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 06:33:07,854 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 06:33:07,854 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 06:33:07,854 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 06:33:07,855 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:33:07" (1/1) ... [2024-10-13 06:33:07,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 06:33:07,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 06:33:07,897 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 06:33:07,904 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 06:33:07,949 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 06:33:07,949 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-10-13 06:33:07,949 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-10-13 06:33:07,950 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-13 06:33:07,950 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-13 06:33:07,950 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-10-13 06:33:07,950 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-10-13 06:33:07,951 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-13 06:33:07,952 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-13 06:33:07,952 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-10-13 06:33:07,952 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-10-13 06:33:07,953 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 06:33:07,953 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 06:33:07,953 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 06:33:07,953 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-13 06:33:07,953 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 06:33:07,953 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 06:33:08,093 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 06:33:08,095 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 06:33:08,601 INFO L? ?]: Removed 98 outVars from TransFormulas that were not future-live. [2024-10-13 06:33:08,601 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 06:33:08,646 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 06:33:08,646 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 06:33:08,646 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 06:33:08 BoogieIcfgContainer [2024-10-13 06:33:08,646 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 06:33:08,651 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 06:33:08,652 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 06:33:08,655 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 06:33:08,656 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 06:33:07" (1/3) ... [2024-10-13 06:33:08,657 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b198008 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 06:33:08, skipping insertion in model container [2024-10-13 06:33:08,658 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:33:07" (2/3) ... [2024-10-13 06:33:08,658 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b198008 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 06:33:08, skipping insertion in model container [2024-10-13 06:33:08,658 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 06:33:08" (3/3) ... [2024-10-13 06:33:08,660 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-84.i [2024-10-13 06:33:08,680 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 06:33:08,681 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 06:33:08,754 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 06:33:08,761 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;@26f383af, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 06:33:08,762 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 06:33:08,766 INFO L276 IsEmpty]: Start isEmpty. Operand has 96 states, 73 states have (on average 1.3835616438356164) internal successors, (101), 74 states have internal predecessors, (101), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-13 06:33:08,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-10-13 06:33:08,784 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:33:08,786 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:33:08,787 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:33:08,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:33:08,793 INFO L85 PathProgramCache]: Analyzing trace with hash 740533480, now seen corresponding path program 1 times [2024-10-13 06:33:08,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:33:08,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778975021] [2024-10-13 06:33:08,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:33:08,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:33:08,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:09,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:33:09,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:09,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:33:09,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:09,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:33:09,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:09,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:33:09,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:09,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:33:09,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:09,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:33:09,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:09,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:33:09,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:09,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:33:09,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:09,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:33:09,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:09,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:33:09,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:09,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:33:09,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:09,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:33:09,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:09,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:33:09,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:09,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:33:09,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:09,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 06:33:09,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:09,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 06:33:09,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:09,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 06:33:09,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:09,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 06:33:09,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:09,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-13 06:33:09,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:09,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 06:33:09,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:09,341 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-13 06:33:09,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:33:09,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778975021] [2024-10-13 06:33:09,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778975021] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:33:09,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:33:09,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 06:33:09,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642895385] [2024-10-13 06:33:09,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:33:09,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 06:33:09,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:33:09,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 06:33:09,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 06:33:09,375 INFO L87 Difference]: Start difference. First operand has 96 states, 73 states have (on average 1.3835616438356164) internal successors, (101), 74 states have internal predecessors, (101), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-10-13 06:33:09,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:33:09,427 INFO L93 Difference]: Finished difference Result 189 states and 300 transitions. [2024-10-13 06:33:09,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 06:33:09,429 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 145 [2024-10-13 06:33:09,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:33:09,435 INFO L225 Difference]: With dead ends: 189 [2024-10-13 06:33:09,436 INFO L226 Difference]: Without dead ends: 94 [2024-10-13 06:33:09,439 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 06:33:09,442 INFO L432 NwaCegarLoop]: 132 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, 132 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 06:33:09,443 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 132 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 06:33:09,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-10-13 06:33:09,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2024-10-13 06:33:09,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 72 states have (on average 1.3333333333333333) internal successors, (96), 72 states have internal predecessors, (96), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-13 06:33:09,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 136 transitions. [2024-10-13 06:33:09,502 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 136 transitions. Word has length 145 [2024-10-13 06:33:09,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:33:09,504 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 136 transitions. [2024-10-13 06:33:09,505 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-10-13 06:33:09,505 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 136 transitions. [2024-10-13 06:33:09,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-10-13 06:33:09,509 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:33:09,510 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:33:09,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 06:33:09,511 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:33:09,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:33:09,511 INFO L85 PathProgramCache]: Analyzing trace with hash 342880844, now seen corresponding path program 1 times [2024-10-13 06:33:09,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:33:09,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381787505] [2024-10-13 06:33:09,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:33:09,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:33:09,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:09,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:33:09,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:09,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:33:09,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:09,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:33:09,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:09,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:33:09,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:09,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:33:09,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:09,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:33:09,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:09,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:33:09,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:09,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:33:09,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:09,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:33:09,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:09,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:33:09,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:09,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:33:09,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:09,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:33:09,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:09,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:33:09,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:09,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:33:09,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:09,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 06:33:09,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:09,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 06:33:09,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:09,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 06:33:09,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:09,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 06:33:09,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:09,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-13 06:33:09,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:09,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 06:33:09,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:09,897 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-13 06:33:09,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:33:09,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381787505] [2024-10-13 06:33:09,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381787505] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:33:09,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:33:09,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 06:33:09,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589816628] [2024-10-13 06:33:09,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:33:09,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 06:33:09,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:33:09,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 06:33:09,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 06:33:09,904 INFO L87 Difference]: Start difference. First operand 94 states and 136 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-13 06:33:09,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:33:09,971 INFO L93 Difference]: Finished difference Result 190 states and 275 transitions. [2024-10-13 06:33:09,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 06:33:09,971 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 145 [2024-10-13 06:33:09,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:33:09,975 INFO L225 Difference]: With dead ends: 190 [2024-10-13 06:33:09,977 INFO L226 Difference]: Without dead ends: 97 [2024-10-13 06:33:09,978 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 06:33:09,980 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 1 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 06:33:09,980 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 383 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 06:33:09,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-10-13 06:33:10,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 96. [2024-10-13 06:33:10,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 74 states have (on average 1.3243243243243243) internal successors, (98), 74 states have internal predecessors, (98), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-13 06:33:10,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 138 transitions. [2024-10-13 06:33:10,031 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 138 transitions. Word has length 145 [2024-10-13 06:33:10,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:33:10,034 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 138 transitions. [2024-10-13 06:33:10,034 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-13 06:33:10,035 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 138 transitions. [2024-10-13 06:33:10,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-10-13 06:33:10,040 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:33:10,040 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:33:10,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 06:33:10,041 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:33:10,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:33:10,042 INFO L85 PathProgramCache]: Analyzing trace with hash 342940426, now seen corresponding path program 1 times [2024-10-13 06:33:10,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:33:10,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185877830] [2024-10-13 06:33:10,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:33:10,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:33:10,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:10,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:33:10,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:10,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:33:10,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:10,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:33:10,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:10,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:33:10,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:10,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:33:10,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:10,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:33:10,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:10,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:33:10,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:10,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:33:10,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:10,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:33:10,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:10,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:33:10,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:10,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:33:10,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:10,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:33:10,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:10,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:33:10,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:10,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:33:10,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:10,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 06:33:10,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:10,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 06:33:10,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:10,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 06:33:10,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:10,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 06:33:10,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:10,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-13 06:33:10,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:10,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 06:33:10,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:10,518 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-13 06:33:10,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:33:10,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185877830] [2024-10-13 06:33:10,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [185877830] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:33:10,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:33:10,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 06:33:10,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844963698] [2024-10-13 06:33:10,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:33:10,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 06:33:10,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:33:10,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 06:33:10,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 06:33:10,524 INFO L87 Difference]: Start difference. First operand 96 states and 138 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-13 06:33:11,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:33:11,001 INFO L93 Difference]: Finished difference Result 312 states and 447 transitions. [2024-10-13 06:33:11,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 06:33:11,002 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 145 [2024-10-13 06:33:11,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:33:11,006 INFO L225 Difference]: With dead ends: 312 [2024-10-13 06:33:11,006 INFO L226 Difference]: Without dead ends: 217 [2024-10-13 06:33:11,007 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-13 06:33:11,010 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 187 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 06:33:11,013 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 302 Invalid, 309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 06:33:11,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2024-10-13 06:33:11,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 191. [2024-10-13 06:33:11,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 148 states have (on average 1.3108108108108107) internal successors, (194), 148 states have internal predecessors, (194), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-13 06:33:11,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 274 transitions. [2024-10-13 06:33:11,055 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 274 transitions. Word has length 145 [2024-10-13 06:33:11,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:33:11,056 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 274 transitions. [2024-10-13 06:33:11,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-13 06:33:11,057 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 274 transitions. [2024-10-13 06:33:11,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-10-13 06:33:11,062 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:33:11,062 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:33:11,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 06:33:11,063 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:33:11,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:33:11,063 INFO L85 PathProgramCache]: Analyzing trace with hash 836204076, now seen corresponding path program 1 times [2024-10-13 06:33:11,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:33:11,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359783445] [2024-10-13 06:33:11,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:33:11,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:33:11,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:14,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:33:14,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:14,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:33:14,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:14,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:33:14,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:14,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:33:14,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:14,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:33:14,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:14,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:33:14,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:14,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:33:14,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:14,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:33:14,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:14,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:33:14,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:14,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:33:14,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:14,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:33:14,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:14,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:33:14,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:14,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:33:14,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:14,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:33:14,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:14,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 06:33:14,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:14,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 06:33:14,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:14,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 06:33:14,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:14,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 06:33:14,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:14,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-13 06:33:14,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:14,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 06:33:14,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:14,529 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-13 06:33:14,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:33:14,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359783445] [2024-10-13 06:33:14,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359783445] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:33:14,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:33:14,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-10-13 06:33:14,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469962863] [2024-10-13 06:33:14,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:33:14,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-13 06:33:14,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:33:14,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-13 06:33:14,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2024-10-13 06:33:14,532 INFO L87 Difference]: Start difference. First operand 191 states and 274 transitions. Second operand has 16 states, 14 states have (on average 4.0) internal successors, (56), 16 states have internal predecessors, (56), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2024-10-13 06:33:15,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:33:15,722 INFO L93 Difference]: Finished difference Result 599 states and 851 transitions. [2024-10-13 06:33:15,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-13 06:33:15,723 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 4.0) internal successors, (56), 16 states have internal predecessors, (56), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) Word has length 153 [2024-10-13 06:33:15,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:33:15,726 INFO L225 Difference]: With dead ends: 599 [2024-10-13 06:33:15,727 INFO L226 Difference]: Without dead ends: 409 [2024-10-13 06:33:15,728 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=87, Invalid=465, Unknown=0, NotChecked=0, Total=552 [2024-10-13 06:33:15,729 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 163 mSDsluCounter, 1196 mSDsCounter, 0 mSdLazyCounter, 1040 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 1322 SdHoareTripleChecker+Invalid, 1046 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1040 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-13 06:33:15,730 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 1322 Invalid, 1046 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1040 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-13 06:33:15,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2024-10-13 06:33:15,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 221. [2024-10-13 06:33:15,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 178 states have (on average 1.3202247191011236) internal successors, (235), 178 states have internal predecessors, (235), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-13 06:33:15,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 315 transitions. [2024-10-13 06:33:15,764 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 315 transitions. Word has length 153 [2024-10-13 06:33:15,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:33:15,765 INFO L471 AbstractCegarLoop]: Abstraction has 221 states and 315 transitions. [2024-10-13 06:33:15,766 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 4.0) internal successors, (56), 16 states have internal predecessors, (56), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2024-10-13 06:33:15,766 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 315 transitions. [2024-10-13 06:33:15,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-10-13 06:33:15,768 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:33:15,768 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:33:15,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 06:33:15,769 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:33:15,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:33:15,769 INFO L85 PathProgramCache]: Analyzing trace with hash 18555626, now seen corresponding path program 1 times [2024-10-13 06:33:15,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:33:15,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938930393] [2024-10-13 06:33:15,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:33:15,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:33:15,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:18,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:33:18,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:18,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:33:18,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:18,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:33:18,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:18,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:33:18,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:18,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:33:18,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:18,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:33:18,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:18,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:33:18,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:18,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:33:18,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:18,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:33:18,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:18,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:33:18,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:18,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:33:18,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:18,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:33:18,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:18,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:33:18,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:18,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:33:18,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:18,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 06:33:18,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:18,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 06:33:18,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:18,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 06:33:18,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:18,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 06:33:18,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:18,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-13 06:33:18,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:18,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 06:33:18,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:18,208 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-13 06:33:18,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:33:18,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938930393] [2024-10-13 06:33:18,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [938930393] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:33:18,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:33:18,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-10-13 06:33:18,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814319920] [2024-10-13 06:33:18,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:33:18,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-13 06:33:18,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:33:18,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-13 06:33:18,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2024-10-13 06:33:18,211 INFO L87 Difference]: Start difference. First operand 221 states and 315 transitions. Second operand has 14 states, 12 states have (on average 4.666666666666667) internal successors, (56), 14 states have internal predecessors, (56), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2024-10-13 06:33:19,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:33:19,023 INFO L93 Difference]: Finished difference Result 517 states and 735 transitions. [2024-10-13 06:33:19,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-13 06:33:19,024 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 4.666666666666667) internal successors, (56), 14 states have internal predecessors, (56), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) Word has length 153 [2024-10-13 06:33:19,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:33:19,028 INFO L225 Difference]: With dead ends: 517 [2024-10-13 06:33:19,028 INFO L226 Difference]: Without dead ends: 297 [2024-10-13 06:33:19,029 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=324, Unknown=0, NotChecked=0, Total=380 [2024-10-13 06:33:19,031 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 58 mSDsluCounter, 1006 mSDsCounter, 0 mSdLazyCounter, 835 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 1123 SdHoareTripleChecker+Invalid, 837 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 835 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-13 06:33:19,032 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 1123 Invalid, 837 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 835 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-13 06:33:19,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2024-10-13 06:33:19,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 225. [2024-10-13 06:33:19,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 182 states have (on average 1.3241758241758241) internal successors, (241), 182 states have internal predecessors, (241), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-13 06:33:19,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 321 transitions. [2024-10-13 06:33:19,059 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 321 transitions. Word has length 153 [2024-10-13 06:33:19,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:33:19,061 INFO L471 AbstractCegarLoop]: Abstraction has 225 states and 321 transitions. [2024-10-13 06:33:19,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 4.666666666666667) internal successors, (56), 14 states have internal predecessors, (56), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2024-10-13 06:33:19,061 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 321 transitions. [2024-10-13 06:33:19,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-10-13 06:33:19,063 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:33:19,063 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:33:19,063 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 06:33:19,064 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:33:19,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:33:19,066 INFO L85 PathProgramCache]: Analyzing trace with hash 95907591, now seen corresponding path program 1 times [2024-10-13 06:33:19,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:33:19,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328521939] [2024-10-13 06:33:19,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:33:19,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:33:19,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:20,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:33:20,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:20,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:33:20,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:20,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:33:20,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:20,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:33:20,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:20,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:33:20,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:20,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:33:20,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:20,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:33:20,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:20,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:33:20,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:20,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:33:20,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:20,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:33:20,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:20,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:33:20,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:20,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:33:20,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:20,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:33:20,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:20,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:33:20,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:20,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 06:33:20,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:20,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 06:33:20,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:20,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 06:33:20,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:20,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 06:33:20,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:20,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-13 06:33:20,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:20,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 06:33:20,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:20,980 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-13 06:33:20,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:33:20,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328521939] [2024-10-13 06:33:20,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [328521939] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:33:20,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:33:20,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-13 06:33:20,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710051311] [2024-10-13 06:33:20,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:33:20,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-13 06:33:20,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:33:20,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-13 06:33:20,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2024-10-13 06:33:20,983 INFO L87 Difference]: Start difference. First operand 225 states and 321 transitions. Second operand has 11 states, 9 states have (on average 6.444444444444445) internal successors, (58), 11 states have internal predecessors, (58), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2024-10-13 06:33:21,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:33:21,828 INFO L93 Difference]: Finished difference Result 557 states and 789 transitions. [2024-10-13 06:33:21,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-13 06:33:21,828 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 6.444444444444445) internal successors, (58), 11 states have internal predecessors, (58), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) Word has length 155 [2024-10-13 06:33:21,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:33:21,831 INFO L225 Difference]: With dead ends: 557 [2024-10-13 06:33:21,831 INFO L226 Difference]: Without dead ends: 333 [2024-10-13 06:33:21,832 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2024-10-13 06:33:21,833 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 56 mSDsluCounter, 701 mSDsCounter, 0 mSdLazyCounter, 788 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 824 SdHoareTripleChecker+Invalid, 792 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 788 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-13 06:33:21,833 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 824 Invalid, 792 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 788 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-13 06:33:21,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2024-10-13 06:33:21,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 329. [2024-10-13 06:33:21,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 329 states, 280 states have (on average 1.3428571428571427) internal successors, (376), 282 states have internal predecessors, (376), 44 states have call successors, (44), 4 states have call predecessors, (44), 4 states have return successors, (44), 42 states have call predecessors, (44), 44 states have call successors, (44) [2024-10-13 06:33:21,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 464 transitions. [2024-10-13 06:33:21,855 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 464 transitions. Word has length 155 [2024-10-13 06:33:21,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:33:21,856 INFO L471 AbstractCegarLoop]: Abstraction has 329 states and 464 transitions. [2024-10-13 06:33:21,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 6.444444444444445) internal successors, (58), 11 states have internal predecessors, (58), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2024-10-13 06:33:21,856 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 464 transitions. [2024-10-13 06:33:21,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-10-13 06:33:21,858 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:33:21,858 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:33:21,858 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-13 06:33:21,859 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:33:21,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:33:21,859 INFO L85 PathProgramCache]: Analyzing trace with hash -1183956087, now seen corresponding path program 1 times [2024-10-13 06:33:21,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:33:21,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122863694] [2024-10-13 06:33:21,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:33:21,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:33:21,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:23,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:33:23,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:23,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:33:23,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:23,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:33:23,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:23,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:33:23,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:23,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:33:23,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:23,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:33:23,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:23,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:33:23,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:23,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:33:23,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:23,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:33:23,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:23,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:33:23,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:23,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:33:23,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:23,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:33:23,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:23,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:33:23,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:23,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:33:23,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:23,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 06:33:23,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:23,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 06:33:23,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:23,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 06:33:23,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:23,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 06:33:23,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:23,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-13 06:33:23,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:23,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 06:33:23,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:23,478 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-13 06:33:23,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:33:23,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122863694] [2024-10-13 06:33:23,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122863694] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:33:23,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:33:23,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-13 06:33:23,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910750639] [2024-10-13 06:33:23,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:33:23,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 06:33:23,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:33:23,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 06:33:23,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-13 06:33:23,483 INFO L87 Difference]: Start difference. First operand 329 states and 464 transitions. Second operand has 7 states, 5 states have (on average 11.6) internal successors, (58), 7 states have internal predecessors, (58), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2024-10-13 06:33:23,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:33:23,947 INFO L93 Difference]: Finished difference Result 763 states and 1066 transitions. [2024-10-13 06:33:23,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 06:33:23,947 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 11.6) internal successors, (58), 7 states have internal predecessors, (58), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) Word has length 155 [2024-10-13 06:33:23,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:33:23,952 INFO L225 Difference]: With dead ends: 763 [2024-10-13 06:33:23,954 INFO L226 Difference]: Without dead ends: 435 [2024-10-13 06:33:23,955 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-13 06:33:23,956 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 52 mSDsluCounter, 391 mSDsCounter, 0 mSdLazyCounter, 370 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 496 SdHoareTripleChecker+Invalid, 373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 370 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 06:33:23,956 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 496 Invalid, 373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 370 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 06:33:23,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2024-10-13 06:33:23,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 359. [2024-10-13 06:33:23,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 310 states have (on average 1.332258064516129) internal successors, (413), 312 states have internal predecessors, (413), 44 states have call successors, (44), 4 states have call predecessors, (44), 4 states have return successors, (44), 42 states have call predecessors, (44), 44 states have call successors, (44) [2024-10-13 06:33:23,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 501 transitions. [2024-10-13 06:33:23,987 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 501 transitions. Word has length 155 [2024-10-13 06:33:23,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:33:23,988 INFO L471 AbstractCegarLoop]: Abstraction has 359 states and 501 transitions. [2024-10-13 06:33:23,988 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 11.6) internal successors, (58), 7 states have internal predecessors, (58), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2024-10-13 06:33:23,988 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 501 transitions. [2024-10-13 06:33:23,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-10-13 06:33:23,990 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:33:23,990 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:33:23,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-13 06:33:23,991 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:33:23,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:33:23,991 INFO L85 PathProgramCache]: Analyzing trace with hash -1738067501, now seen corresponding path program 1 times [2024-10-13 06:33:23,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:33:23,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644706612] [2024-10-13 06:33:23,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:33:23,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:33:24,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:24,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:33:24,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:24,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:33:24,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:24,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:33:24,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:24,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:33:24,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:24,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:33:24,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:24,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:33:24,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:24,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:33:24,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:24,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:33:24,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:24,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:33:24,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:24,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:33:24,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:24,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:33:24,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:24,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:33:24,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:24,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:33:24,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:24,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:33:24,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:24,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 06:33:24,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:24,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 06:33:24,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:24,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 06:33:24,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:24,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 06:33:24,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:24,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-13 06:33:24,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:24,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 06:33:24,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:24,177 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-13 06:33:24,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:33:24,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644706612] [2024-10-13 06:33:24,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1644706612] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:33:24,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:33:24,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 06:33:24,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323072002] [2024-10-13 06:33:24,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:33:24,178 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 06:33:24,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:33:24,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 06:33:24,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 06:33:24,179 INFO L87 Difference]: Start difference. First operand 359 states and 501 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-13 06:33:24,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:33:24,223 INFO L93 Difference]: Finished difference Result 729 states and 1017 transitions. [2024-10-13 06:33:24,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 06:33:24,224 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 155 [2024-10-13 06:33:24,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:33:24,227 INFO L225 Difference]: With dead ends: 729 [2024-10-13 06:33:24,227 INFO L226 Difference]: Without dead ends: 371 [2024-10-13 06:33:24,229 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 06:33:24,230 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 0 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 505 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 06:33:24,231 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 505 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 06:33:24,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2024-10-13 06:33:24,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 371. [2024-10-13 06:33:24,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 371 states, 322 states have (on average 1.3198757763975155) internal successors, (425), 324 states have internal predecessors, (425), 44 states have call successors, (44), 4 states have call predecessors, (44), 4 states have return successors, (44), 42 states have call predecessors, (44), 44 states have call successors, (44) [2024-10-13 06:33:24,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 513 transitions. [2024-10-13 06:33:24,260 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 513 transitions. Word has length 155 [2024-10-13 06:33:24,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:33:24,263 INFO L471 AbstractCegarLoop]: Abstraction has 371 states and 513 transitions. [2024-10-13 06:33:24,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-13 06:33:24,264 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 513 transitions. [2024-10-13 06:33:24,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-10-13 06:33:24,265 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:33:24,265 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:33:24,265 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-13 06:33:24,266 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:33:24,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:33:24,266 INFO L85 PathProgramCache]: Analyzing trace with hash 1855835217, now seen corresponding path program 1 times [2024-10-13 06:33:24,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:33:24,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408829584] [2024-10-13 06:33:24,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:33:24,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:33:24,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:26,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:33:26,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:26,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:33:26,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:26,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:33:26,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:26,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:33:26,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:26,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:33:26,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:26,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:33:26,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:26,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:33:26,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:26,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:33:26,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:26,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:33:26,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:26,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:33:26,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:26,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:33:26,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:26,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:33:26,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:26,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:33:26,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:26,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:33:26,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:26,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 06:33:26,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:26,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 06:33:26,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:26,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 06:33:26,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:26,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 06:33:26,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:26,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-13 06:33:26,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:26,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 06:33:26,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:26,925 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-13 06:33:26,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:33:26,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408829584] [2024-10-13 06:33:26,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [408829584] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:33:26,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:33:26,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-10-13 06:33:26,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540818068] [2024-10-13 06:33:26,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:33:26,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-13 06:33:26,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:33:26,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-13 06:33:26,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2024-10-13 06:33:26,928 INFO L87 Difference]: Start difference. First operand 371 states and 513 transitions. Second operand has 13 states, 10 states have (on average 5.8) internal successors, (58), 13 states have internal predecessors, (58), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 4 states have call successors, (20) [2024-10-13 06:33:28,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:33:28,417 INFO L93 Difference]: Finished difference Result 1041 states and 1416 transitions. [2024-10-13 06:33:28,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-10-13 06:33:28,418 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 10 states have (on average 5.8) internal successors, (58), 13 states have internal predecessors, (58), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 4 states have call successors, (20) Word has length 155 [2024-10-13 06:33:28,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:33:28,422 INFO L225 Difference]: With dead ends: 1041 [2024-10-13 06:33:28,423 INFO L226 Difference]: Without dead ends: 671 [2024-10-13 06:33:28,424 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=92, Invalid=508, Unknown=0, NotChecked=0, Total=600 [2024-10-13 06:33:28,425 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 170 mSDsluCounter, 773 mSDsCounter, 0 mSdLazyCounter, 884 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 872 SdHoareTripleChecker+Invalid, 911 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 884 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-13 06:33:28,426 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 872 Invalid, 911 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 884 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-13 06:33:28,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 671 states. [2024-10-13 06:33:28,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 671 to 575. [2024-10-13 06:33:28,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 575 states, 510 states have (on average 1.3274509803921568) internal successors, (677), 514 states have internal predecessors, (677), 56 states have call successors, (56), 8 states have call predecessors, (56), 8 states have return successors, (56), 52 states have call predecessors, (56), 56 states have call successors, (56) [2024-10-13 06:33:28,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 575 states to 575 states and 789 transitions. [2024-10-13 06:33:28,473 INFO L78 Accepts]: Start accepts. Automaton has 575 states and 789 transitions. Word has length 155 [2024-10-13 06:33:28,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:33:28,474 INFO L471 AbstractCegarLoop]: Abstraction has 575 states and 789 transitions. [2024-10-13 06:33:28,474 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 10 states have (on average 5.8) internal successors, (58), 13 states have internal predecessors, (58), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 4 states have call successors, (20) [2024-10-13 06:33:28,474 INFO L276 IsEmpty]: Start isEmpty. Operand 575 states and 789 transitions. [2024-10-13 06:33:28,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-10-13 06:33:28,477 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:33:28,477 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:33:28,477 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-13 06:33:28,478 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:33:28,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:33:28,478 INFO L85 PathProgramCache]: Analyzing trace with hash -130303193, now seen corresponding path program 1 times [2024-10-13 06:33:28,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:33:28,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60548685] [2024-10-13 06:33:28,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:33:28,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:33:28,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:30,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:33:30,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:30,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:33:30,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:30,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:33:30,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:30,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:33:30,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:30,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:33:30,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:30,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:33:30,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:30,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:33:30,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:30,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:33:30,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:30,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:33:30,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:30,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:33:30,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:30,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:33:30,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:30,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:33:30,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:30,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:33:30,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:30,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:33:30,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:30,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 06:33:30,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:30,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 06:33:30,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:30,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 06:33:30,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:30,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 06:33:30,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:30,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-13 06:33:30,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:30,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 06:33:30,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:30,384 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-13 06:33:30,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:33:30,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60548685] [2024-10-13 06:33:30,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [60548685] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:33:30,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:33:30,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-13 06:33:30,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866970913] [2024-10-13 06:33:30,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:33:30,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-13 06:33:30,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:33:30,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-13 06:33:30,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2024-10-13 06:33:30,387 INFO L87 Difference]: Start difference. First operand 575 states and 789 transitions. Second operand has 12 states, 10 states have (on average 5.8) internal successors, (58), 12 states have internal predecessors, (58), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2024-10-13 06:33:31,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:33:31,202 INFO L93 Difference]: Finished difference Result 1219 states and 1668 transitions. [2024-10-13 06:33:31,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-13 06:33:31,203 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 5.8) internal successors, (58), 12 states have internal predecessors, (58), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) Word has length 155 [2024-10-13 06:33:31,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:33:31,207 INFO L225 Difference]: With dead ends: 1219 [2024-10-13 06:33:31,207 INFO L226 Difference]: Without dead ends: 645 [2024-10-13 06:33:31,208 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2024-10-13 06:33:31,209 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 92 mSDsluCounter, 691 mSDsCounter, 0 mSdLazyCounter, 661 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 802 SdHoareTripleChecker+Invalid, 673 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 661 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-13 06:33:31,210 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 802 Invalid, 673 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 661 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-13 06:33:31,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 645 states. [2024-10-13 06:33:31,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 645 to 575. [2024-10-13 06:33:31,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 575 states, 510 states have (on average 1.3196078431372549) internal successors, (673), 514 states have internal predecessors, (673), 56 states have call successors, (56), 8 states have call predecessors, (56), 8 states have return successors, (56), 52 states have call predecessors, (56), 56 states have call successors, (56) [2024-10-13 06:33:31,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 575 states to 575 states and 785 transitions. [2024-10-13 06:33:31,253 INFO L78 Accepts]: Start accepts. Automaton has 575 states and 785 transitions. Word has length 155 [2024-10-13 06:33:31,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:33:31,253 INFO L471 AbstractCegarLoop]: Abstraction has 575 states and 785 transitions. [2024-10-13 06:33:31,254 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 5.8) internal successors, (58), 12 states have internal predecessors, (58), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2024-10-13 06:33:31,254 INFO L276 IsEmpty]: Start isEmpty. Operand 575 states and 785 transitions. [2024-10-13 06:33:31,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-10-13 06:33:31,257 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:33:31,257 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:33:31,257 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-13 06:33:31,257 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:33:31,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:33:31,258 INFO L85 PathProgramCache]: Analyzing trace with hash 1721821711, now seen corresponding path program 1 times [2024-10-13 06:33:31,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:33:31,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791920780] [2024-10-13 06:33:31,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:33:31,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:33:31,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:32,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:33:32,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:32,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:33:32,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:32,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:33:32,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:32,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:33:32,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:32,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:33:32,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:32,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:33:32,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:32,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:33:32,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:32,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:33:32,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:32,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:33:32,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:32,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:33:32,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:32,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:33:32,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:32,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:33:32,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:32,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:33:32,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:32,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:33:32,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:32,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 06:33:32,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:32,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 06:33:32,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:32,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 06:33:32,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:32,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 06:33:32,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:32,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-13 06:33:32,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:32,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 06:33:32,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:32,040 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-13 06:33:32,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:33:32,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791920780] [2024-10-13 06:33:32,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [791920780] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:33:32,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:33:32,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 06:33:32,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450354133] [2024-10-13 06:33:32,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:33:32,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 06:33:32,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:33:32,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 06:33:32,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-13 06:33:32,042 INFO L87 Difference]: Start difference. First operand 575 states and 785 transitions. Second operand has 6 states, 5 states have (on average 11.6) internal successors, (58), 6 states have internal predecessors, (58), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-10-13 06:33:32,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:33:32,396 INFO L93 Difference]: Finished difference Result 1245 states and 1688 transitions. [2024-10-13 06:33:32,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 06:33:32,396 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.6) internal successors, (58), 6 states have internal predecessors, (58), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 155 [2024-10-13 06:33:32,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:33:32,400 INFO L225 Difference]: With dead ends: 1245 [2024-10-13 06:33:32,400 INFO L226 Difference]: Without dead ends: 671 [2024-10-13 06:33:32,401 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-13 06:33:32,402 INFO L432 NwaCegarLoop]: 171 mSDtfsCounter, 58 mSDsluCounter, 404 mSDsCounter, 0 mSdLazyCounter, 329 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 575 SdHoareTripleChecker+Invalid, 335 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 06:33:32,402 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 575 Invalid, 335 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 329 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 06:33:32,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 671 states. [2024-10-13 06:33:32,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 671 to 667. [2024-10-13 06:33:32,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 667 states, 580 states have (on average 1.2982758620689656) internal successors, (753), 586 states have internal predecessors, (753), 72 states have call successors, (72), 14 states have call predecessors, (72), 14 states have return successors, (72), 66 states have call predecessors, (72), 72 states have call successors, (72) [2024-10-13 06:33:32,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 667 states to 667 states and 897 transitions. [2024-10-13 06:33:32,459 INFO L78 Accepts]: Start accepts. Automaton has 667 states and 897 transitions. Word has length 155 [2024-10-13 06:33:32,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:33:32,460 INFO L471 AbstractCegarLoop]: Abstraction has 667 states and 897 transitions. [2024-10-13 06:33:32,460 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.6) internal successors, (58), 6 states have internal predecessors, (58), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-10-13 06:33:32,460 INFO L276 IsEmpty]: Start isEmpty. Operand 667 states and 897 transitions. [2024-10-13 06:33:32,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-10-13 06:33:32,462 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:33:32,463 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:33:32,463 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-13 06:33:32,463 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:33:32,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:33:32,463 INFO L85 PathProgramCache]: Analyzing trace with hash 1482110985, now seen corresponding path program 1 times [2024-10-13 06:33:32,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:33:32,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616974249] [2024-10-13 06:33:32,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:33:32,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:33:32,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:33,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:33:33,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:33,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:33:33,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:33,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:33:33,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:33,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:33:33,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:33,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:33:33,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:33,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:33:33,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:33,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:33:33,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:33,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:33:33,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:33,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:33:33,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:33,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:33:33,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:33,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:33:33,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:33,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:33:33,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:33,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:33:33,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:33,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:33:33,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:33,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 06:33:33,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:33,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 06:33:33,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:33,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 06:33:33,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:33,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 06:33:33,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:33,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-13 06:33:33,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:33,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 06:33:33,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:33,425 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-13 06:33:33,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:33:33,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616974249] [2024-10-13 06:33:33,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616974249] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:33:33,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:33:33,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 06:33:33,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706354484] [2024-10-13 06:33:33,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:33:33,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 06:33:33,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:33:33,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 06:33:33,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-13 06:33:33,428 INFO L87 Difference]: Start difference. First operand 667 states and 897 transitions. Second operand has 6 states, 5 states have (on average 11.6) internal successors, (58), 6 states have internal predecessors, (58), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-10-13 06:33:33,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:33:33,824 INFO L93 Difference]: Finished difference Result 1444 states and 1936 transitions. [2024-10-13 06:33:33,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 06:33:33,825 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.6) internal successors, (58), 6 states have internal predecessors, (58), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 155 [2024-10-13 06:33:33,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:33:33,830 INFO L225 Difference]: With dead ends: 1444 [2024-10-13 06:33:33,831 INFO L226 Difference]: Without dead ends: 778 [2024-10-13 06:33:33,832 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-13 06:33:33,834 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 59 mSDsluCounter, 361 mSDsCounter, 0 mSdLazyCounter, 328 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 494 SdHoareTripleChecker+Invalid, 336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 06:33:33,834 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 494 Invalid, 336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 328 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 06:33:33,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 778 states. [2024-10-13 06:33:33,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 778 to 720. [2024-10-13 06:33:33,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 720 states, 631 states have (on average 1.305863708399366) internal successors, (824), 638 states have internal predecessors, (824), 72 states have call successors, (72), 16 states have call predecessors, (72), 16 states have return successors, (72), 65 states have call predecessors, (72), 72 states have call successors, (72) [2024-10-13 06:33:33,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 720 states to 720 states and 968 transitions. [2024-10-13 06:33:33,898 INFO L78 Accepts]: Start accepts. Automaton has 720 states and 968 transitions. Word has length 155 [2024-10-13 06:33:33,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:33:33,898 INFO L471 AbstractCegarLoop]: Abstraction has 720 states and 968 transitions. [2024-10-13 06:33:33,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.6) internal successors, (58), 6 states have internal predecessors, (58), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-10-13 06:33:33,899 INFO L276 IsEmpty]: Start isEmpty. Operand 720 states and 968 transitions. [2024-10-13 06:33:33,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-10-13 06:33:33,901 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:33:33,901 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:33:33,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-13 06:33:33,902 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:33:33,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:33:33,902 INFO L85 PathProgramCache]: Analyzing trace with hash 1544150599, now seen corresponding path program 1 times [2024-10-13 06:33:33,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:33:33,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898613599] [2024-10-13 06:33:33,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:33:33,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:33:33,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:35,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:33:35,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:35,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:33:35,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:35,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:33:35,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:35,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:33:35,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:35,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:33:35,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:35,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:33:35,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:35,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:33:35,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:35,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:33:35,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:35,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:33:35,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:35,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:33:35,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:35,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:33:35,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:35,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:33:35,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:35,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:33:35,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:35,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:33:35,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:35,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 06:33:35,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:35,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 06:33:35,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:35,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 06:33:35,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:35,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 06:33:35,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:35,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-13 06:33:35,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:35,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 06:33:35,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:35,260 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-13 06:33:35,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:33:35,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898613599] [2024-10-13 06:33:35,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [898613599] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:33:35,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:33:35,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-13 06:33:35,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219724983] [2024-10-13 06:33:35,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:33:35,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 06:33:35,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:33:35,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 06:33:35,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-13 06:33:35,262 INFO L87 Difference]: Start difference. First operand 720 states and 968 transitions. Second operand has 7 states, 5 states have (on average 11.6) internal successors, (58), 7 states have internal predecessors, (58), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2024-10-13 06:33:35,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:33:35,723 INFO L93 Difference]: Finished difference Result 1481 states and 1987 transitions. [2024-10-13 06:33:35,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 06:33:35,724 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 11.6) internal successors, (58), 7 states have internal predecessors, (58), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) Word has length 155 [2024-10-13 06:33:35,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:33:35,728 INFO L225 Difference]: With dead ends: 1481 [2024-10-13 06:33:35,729 INFO L226 Difference]: Without dead ends: 762 [2024-10-13 06:33:35,731 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-13 06:33:35,732 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 51 mSDsluCounter, 436 mSDsCounter, 0 mSdLazyCounter, 420 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 568 SdHoareTripleChecker+Invalid, 424 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 06:33:35,732 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 568 Invalid, 424 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 420 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 06:33:35,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 762 states. [2024-10-13 06:33:35,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 762 to 720. [2024-10-13 06:33:35,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 720 states, 631 states have (on average 1.2931854199683044) internal successors, (816), 638 states have internal predecessors, (816), 72 states have call successors, (72), 16 states have call predecessors, (72), 16 states have return successors, (72), 65 states have call predecessors, (72), 72 states have call successors, (72) [2024-10-13 06:33:35,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 720 states to 720 states and 960 transitions. [2024-10-13 06:33:35,789 INFO L78 Accepts]: Start accepts. Automaton has 720 states and 960 transitions. Word has length 155 [2024-10-13 06:33:35,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:33:35,789 INFO L471 AbstractCegarLoop]: Abstraction has 720 states and 960 transitions. [2024-10-13 06:33:35,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 11.6) internal successors, (58), 7 states have internal predecessors, (58), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2024-10-13 06:33:35,789 INFO L276 IsEmpty]: Start isEmpty. Operand 720 states and 960 transitions. [2024-10-13 06:33:35,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-10-13 06:33:35,792 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:33:35,792 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:33:35,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-13 06:33:35,792 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:33:35,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:33:35,793 INFO L85 PathProgramCache]: Analyzing trace with hash 264286921, now seen corresponding path program 1 times [2024-10-13 06:33:35,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:33:35,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670383233] [2024-10-13 06:33:35,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:33:35,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:33:35,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:37,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:33:37,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:37,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:33:37,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:37,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:33:37,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:37,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:33:37,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:37,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:33:37,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:37,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:33:37,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:37,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:33:37,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:37,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:33:37,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:37,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:33:37,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:37,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:33:37,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:37,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:33:37,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:37,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:33:37,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:37,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:33:37,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:37,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:33:37,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:37,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 06:33:37,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:37,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 06:33:37,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:37,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 06:33:37,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:37,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 06:33:37,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:37,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-13 06:33:37,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:37,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 06:33:37,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:37,279 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-13 06:33:37,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:33:37,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670383233] [2024-10-13 06:33:37,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670383233] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:33:37,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:33:37,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-13 06:33:37,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84032269] [2024-10-13 06:33:37,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:33:37,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-13 06:33:37,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:33:37,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-13 06:33:37,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-10-13 06:33:37,282 INFO L87 Difference]: Start difference. First operand 720 states and 960 transitions. Second operand has 11 states, 9 states have (on average 6.444444444444445) internal successors, (58), 11 states have internal predecessors, (58), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2024-10-13 06:33:38,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:33:38,046 INFO L93 Difference]: Finished difference Result 1613 states and 2138 transitions. [2024-10-13 06:33:38,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-13 06:33:38,047 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 6.444444444444445) internal successors, (58), 11 states have internal predecessors, (58), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) Word has length 155 [2024-10-13 06:33:38,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:33:38,053 INFO L225 Difference]: With dead ends: 1613 [2024-10-13 06:33:38,053 INFO L226 Difference]: Without dead ends: 894 [2024-10-13 06:33:38,055 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2024-10-13 06:33:38,056 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 54 mSDsluCounter, 618 mSDsCounter, 0 mSdLazyCounter, 773 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 768 SdHoareTripleChecker+Invalid, 778 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 773 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-13 06:33:38,057 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 768 Invalid, 778 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 773 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-13 06:33:38,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 894 states. [2024-10-13 06:33:38,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 894 to 712. [2024-10-13 06:33:38,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 712 states, 623 states have (on average 1.290529695024077) internal successors, (804), 630 states have internal predecessors, (804), 72 states have call successors, (72), 16 states have call predecessors, (72), 16 states have return successors, (72), 65 states have call predecessors, (72), 72 states have call successors, (72) [2024-10-13 06:33:38,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 712 states to 712 states and 948 transitions. [2024-10-13 06:33:38,128 INFO L78 Accepts]: Start accepts. Automaton has 712 states and 948 transitions. Word has length 155 [2024-10-13 06:33:38,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:33:38,129 INFO L471 AbstractCegarLoop]: Abstraction has 712 states and 948 transitions. [2024-10-13 06:33:38,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 6.444444444444445) internal successors, (58), 11 states have internal predecessors, (58), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2024-10-13 06:33:38,129 INFO L276 IsEmpty]: Start isEmpty. Operand 712 states and 948 transitions. [2024-10-13 06:33:38,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-10-13 06:33:38,131 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:33:38,131 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:33:38,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-13 06:33:38,132 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:33:38,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:33:38,132 INFO L85 PathProgramCache]: Analyzing trace with hash -332447701, now seen corresponding path program 1 times [2024-10-13 06:33:38,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:33:38,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251309173] [2024-10-13 06:33:38,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:33:38,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:33:38,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:38,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:33:38,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:38,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:33:38,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:38,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:33:38,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:38,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:33:38,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:38,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:33:38,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:38,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:33:38,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:38,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:33:38,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:38,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:33:38,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:38,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:33:38,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:38,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:33:38,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:38,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:33:38,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:38,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:33:38,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:38,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:33:38,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:38,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:33:38,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:38,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 06:33:38,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:38,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 06:33:38,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:38,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 06:33:38,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:38,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 06:33:38,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:38,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-13 06:33:38,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:38,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 06:33:38,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:38,389 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-13 06:33:38,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:33:38,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251309173] [2024-10-13 06:33:38,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251309173] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:33:38,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:33:38,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 06:33:38,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724053949] [2024-10-13 06:33:38,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:33:38,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 06:33:38,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:33:38,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 06:33:38,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 06:33:38,391 INFO L87 Difference]: Start difference. First operand 712 states and 948 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-13 06:33:38,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:33:38,761 INFO L93 Difference]: Finished difference Result 1712 states and 2267 transitions. [2024-10-13 06:33:38,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 06:33:38,762 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 155 [2024-10-13 06:33:38,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:33:38,767 INFO L225 Difference]: With dead ends: 1712 [2024-10-13 06:33:38,768 INFO L226 Difference]: Without dead ends: 1001 [2024-10-13 06:33:38,770 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 42 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-13 06:33:38,770 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 42 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 06:33:38,771 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 412 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 06:33:38,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1001 states. [2024-10-13 06:33:38,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1001 to 728. [2024-10-13 06:33:38,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 728 states, 639 states have (on average 1.2816901408450705) internal successors, (819), 646 states have internal predecessors, (819), 72 states have call successors, (72), 16 states have call predecessors, (72), 16 states have return successors, (72), 65 states have call predecessors, (72), 72 states have call successors, (72) [2024-10-13 06:33:38,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 728 states to 728 states and 963 transitions. [2024-10-13 06:33:38,841 INFO L78 Accepts]: Start accepts. Automaton has 728 states and 963 transitions. Word has length 155 [2024-10-13 06:33:38,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:33:38,842 INFO L471 AbstractCegarLoop]: Abstraction has 728 states and 963 transitions. [2024-10-13 06:33:38,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-13 06:33:38,842 INFO L276 IsEmpty]: Start isEmpty. Operand 728 states and 963 transitions. [2024-10-13 06:33:38,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-10-13 06:33:38,844 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:33:38,844 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:33:38,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-13 06:33:38,844 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:33:38,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:33:38,845 INFO L85 PathProgramCache]: Analyzing trace with hash -1343564951, now seen corresponding path program 1 times [2024-10-13 06:33:38,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:33:38,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571913461] [2024-10-13 06:33:38,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:33:38,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:33:38,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:40,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:33:40,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:40,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:33:40,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:40,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:33:40,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:40,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:33:40,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:40,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:33:40,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:40,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:33:40,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:40,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:33:40,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:40,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:33:40,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:40,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:33:40,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:40,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:33:40,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:40,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:33:40,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:40,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:33:40,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:40,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:33:40,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:40,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:33:40,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:40,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 06:33:40,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:40,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 06:33:40,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:40,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 06:33:40,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:40,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 06:33:40,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:40,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-13 06:33:40,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:40,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 06:33:40,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:40,327 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-13 06:33:40,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:33:40,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571913461] [2024-10-13 06:33:40,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [571913461] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:33:40,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:33:40,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-13 06:33:40,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758722182] [2024-10-13 06:33:40,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:33:40,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-13 06:33:40,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:33:40,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-13 06:33:40,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-10-13 06:33:40,329 INFO L87 Difference]: Start difference. First operand 728 states and 963 transitions. Second operand has 11 states, 9 states have (on average 6.444444444444445) internal successors, (58), 11 states have internal predecessors, (58), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2024-10-13 06:33:41,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:33:41,170 INFO L93 Difference]: Finished difference Result 1574 states and 2070 transitions. [2024-10-13 06:33:41,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-13 06:33:41,171 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 6.444444444444445) internal successors, (58), 11 states have internal predecessors, (58), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) Word has length 155 [2024-10-13 06:33:41,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:33:41,176 INFO L225 Difference]: With dead ends: 1574 [2024-10-13 06:33:41,176 INFO L226 Difference]: Without dead ends: 847 [2024-10-13 06:33:41,178 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-10-13 06:33:41,178 INFO L432 NwaCegarLoop]: 162 mSDtfsCounter, 51 mSDsluCounter, 826 mSDsCounter, 0 mSdLazyCounter, 820 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 988 SdHoareTripleChecker+Invalid, 824 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 820 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-13 06:33:41,179 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 988 Invalid, 824 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 820 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-13 06:33:41,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 847 states. [2024-10-13 06:33:41,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 847 to 673. [2024-10-13 06:33:41,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 673 states, 589 states have (on average 1.2852292020373515) internal successors, (757), 595 states have internal predecessors, (757), 68 states have call successors, (68), 15 states have call predecessors, (68), 15 states have return successors, (68), 62 states have call predecessors, (68), 68 states have call successors, (68) [2024-10-13 06:33:41,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 673 states to 673 states and 893 transitions. [2024-10-13 06:33:41,253 INFO L78 Accepts]: Start accepts. Automaton has 673 states and 893 transitions. Word has length 155 [2024-10-13 06:33:41,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:33:41,254 INFO L471 AbstractCegarLoop]: Abstraction has 673 states and 893 transitions. [2024-10-13 06:33:41,254 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 6.444444444444445) internal successors, (58), 11 states have internal predecessors, (58), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2024-10-13 06:33:41,254 INFO L276 IsEmpty]: Start isEmpty. Operand 673 states and 893 transitions. [2024-10-13 06:33:41,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-10-13 06:33:41,256 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:33:41,256 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:33:41,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-13 06:33:41,257 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:33:41,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:33:41,257 INFO L85 PathProgramCache]: Analyzing trace with hash 1409345858, now seen corresponding path program 1 times [2024-10-13 06:33:41,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:33:41,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305602827] [2024-10-13 06:33:41,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:33:41,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:33:41,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:43,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:33:43,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:43,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:33:43,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:43,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:33:43,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:43,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:33:43,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:43,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:33:43,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:43,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:33:43,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:43,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:33:43,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:43,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:33:43,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:43,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:33:43,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:43,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:33:43,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:43,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:33:43,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:43,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:33:43,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:43,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:33:43,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:43,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:33:43,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:43,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 06:33:43,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:43,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 06:33:43,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:43,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 06:33:43,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:43,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 06:33:43,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:43,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-13 06:33:43,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:43,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 06:33:43,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:43,711 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-13 06:33:43,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:33:43,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305602827] [2024-10-13 06:33:43,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305602827] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:33:43,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:33:43,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2024-10-13 06:33:43,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011946306] [2024-10-13 06:33:43,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:33:43,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-10-13 06:33:43,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:33:43,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-10-13 06:33:43,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=268, Unknown=0, NotChecked=0, Total=306 [2024-10-13 06:33:43,715 INFO L87 Difference]: Start difference. First operand 673 states and 893 transitions. Second operand has 18 states, 16 states have (on average 3.75) internal successors, (60), 18 states have internal predecessors, (60), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2024-10-13 06:33:45,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:33:45,118 INFO L93 Difference]: Finished difference Result 1799 states and 2382 transitions. [2024-10-13 06:33:45,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-13 06:33:45,119 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 3.75) internal successors, (60), 18 states have internal predecessors, (60), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) Word has length 157 [2024-10-13 06:33:45,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:33:45,125 INFO L225 Difference]: With dead ends: 1799 [2024-10-13 06:33:45,125 INFO L226 Difference]: Without dead ends: 1127 [2024-10-13 06:33:45,127 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=104, Invalid=652, Unknown=0, NotChecked=0, Total=756 [2024-10-13 06:33:45,128 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 180 mSDsluCounter, 1299 mSDsCounter, 0 mSdLazyCounter, 1201 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 1422 SdHoareTripleChecker+Invalid, 1206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-13 06:33:45,128 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 1422 Invalid, 1206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1201 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-13 06:33:45,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1127 states. [2024-10-13 06:33:45,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1127 to 725. [2024-10-13 06:33:45,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 725 states, 641 states have (on average 1.2870514820592824) internal successors, (825), 647 states have internal predecessors, (825), 68 states have call successors, (68), 15 states have call predecessors, (68), 15 states have return successors, (68), 62 states have call predecessors, (68), 68 states have call successors, (68) [2024-10-13 06:33:45,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 725 states to 725 states and 961 transitions. [2024-10-13 06:33:45,193 INFO L78 Accepts]: Start accepts. Automaton has 725 states and 961 transitions. Word has length 157 [2024-10-13 06:33:45,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:33:45,193 INFO L471 AbstractCegarLoop]: Abstraction has 725 states and 961 transitions. [2024-10-13 06:33:45,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 3.75) internal successors, (60), 18 states have internal predecessors, (60), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2024-10-13 06:33:45,194 INFO L276 IsEmpty]: Start isEmpty. Operand 725 states and 961 transitions. [2024-10-13 06:33:45,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-10-13 06:33:45,198 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:33:45,199 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:33:45,199 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-13 06:33:45,199 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:33:45,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:33:45,200 INFO L85 PathProgramCache]: Analyzing trace with hash 398228608, now seen corresponding path program 1 times [2024-10-13 06:33:45,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:33:45,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68072585] [2024-10-13 06:33:45,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:33:45,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:33:45,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:45,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:33:45,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:45,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:33:45,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:45,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:33:45,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:45,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:33:45,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:45,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:33:45,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:45,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:33:45,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:45,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:33:45,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:45,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:33:45,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:45,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:33:45,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:45,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:33:45,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:45,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:33:45,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:45,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:33:45,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:45,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:33:45,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:45,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:33:45,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:45,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 06:33:45,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:45,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 06:33:45,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:45,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 06:33:45,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:45,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 06:33:45,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:45,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-13 06:33:45,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:45,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 06:33:45,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:45,477 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-13 06:33:45,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:33:45,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68072585] [2024-10-13 06:33:45,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68072585] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:33:45,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:33:45,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 06:33:45,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909349362] [2024-10-13 06:33:45,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:33:45,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 06:33:45,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:33:45,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 06:33:45,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 06:33:45,479 INFO L87 Difference]: Start difference. First operand 725 states and 961 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-13 06:33:45,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:33:45,775 INFO L93 Difference]: Finished difference Result 1671 states and 2199 transitions. [2024-10-13 06:33:45,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 06:33:45,776 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 157 [2024-10-13 06:33:45,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:33:45,780 INFO L225 Difference]: With dead ends: 1671 [2024-10-13 06:33:45,781 INFO L226 Difference]: Without dead ends: 947 [2024-10-13 06:33:45,782 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 42 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-13 06:33:45,783 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 42 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 396 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 06:33:45,783 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 396 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 06:33:45,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 947 states. [2024-10-13 06:33:45,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 947 to 721. [2024-10-13 06:33:45,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 721 states, 637 states have (on average 1.2731554160125589) internal successors, (811), 643 states have internal predecessors, (811), 68 states have call successors, (68), 15 states have call predecessors, (68), 15 states have return successors, (68), 62 states have call predecessors, (68), 68 states have call successors, (68) [2024-10-13 06:33:45,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 721 states to 721 states and 947 transitions. [2024-10-13 06:33:45,842 INFO L78 Accepts]: Start accepts. Automaton has 721 states and 947 transitions. Word has length 157 [2024-10-13 06:33:45,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:33:45,842 INFO L471 AbstractCegarLoop]: Abstraction has 721 states and 947 transitions. [2024-10-13 06:33:45,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-13 06:33:45,843 INFO L276 IsEmpty]: Start isEmpty. Operand 721 states and 947 transitions. [2024-10-13 06:33:45,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-10-13 06:33:45,844 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:33:45,844 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:33:45,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-13 06:33:45,845 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:33:45,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:33:45,845 INFO L85 PathProgramCache]: Analyzing trace with hash 1628200576, now seen corresponding path program 1 times [2024-10-13 06:33:45,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:33:45,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174555842] [2024-10-13 06:33:45,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:33:45,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:33:45,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:47,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:33:47,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:47,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:33:47,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:47,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:33:47,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:47,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:33:47,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:47,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:33:47,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:47,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:33:47,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:47,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:33:47,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:47,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:33:47,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:47,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:33:47,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:47,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:33:47,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:47,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:33:47,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:47,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:33:47,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:47,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:33:47,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:47,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:33:47,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:47,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 06:33:47,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:47,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 06:33:47,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:47,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 06:33:47,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:47,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 06:33:47,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:47,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-13 06:33:47,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:47,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 06:33:47,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:47,608 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-13 06:33:47,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:33:47,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174555842] [2024-10-13 06:33:47,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174555842] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:33:47,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:33:47,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-10-13 06:33:47,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109058296] [2024-10-13 06:33:47,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:33:47,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-13 06:33:47,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:33:47,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-13 06:33:47,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=208, Unknown=0, NotChecked=0, Total=240 [2024-10-13 06:33:47,611 INFO L87 Difference]: Start difference. First operand 721 states and 947 transitions. Second operand has 16 states, 14 states have (on average 4.285714285714286) internal successors, (60), 16 states have internal predecessors, (60), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2024-10-13 06:33:48,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:33:48,527 INFO L93 Difference]: Finished difference Result 1599 states and 2094 transitions. [2024-10-13 06:33:48,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-13 06:33:48,527 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 4.285714285714286) internal successors, (60), 16 states have internal predecessors, (60), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) Word has length 157 [2024-10-13 06:33:48,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:33:48,532 INFO L225 Difference]: With dead ends: 1599 [2024-10-13 06:33:48,532 INFO L226 Difference]: Without dead ends: 879 [2024-10-13 06:33:48,534 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=70, Invalid=482, Unknown=0, NotChecked=0, Total=552 [2024-10-13 06:33:48,535 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 50 mSDsluCounter, 1299 mSDsCounter, 0 mSdLazyCounter, 1076 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 1438 SdHoareTripleChecker+Invalid, 1078 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1076 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-13 06:33:48,535 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 1438 Invalid, 1078 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1076 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-13 06:33:48,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 879 states. [2024-10-13 06:33:48,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 879 to 729. [2024-10-13 06:33:48,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 729 states, 645 states have (on average 1.275968992248062) internal successors, (823), 651 states have internal predecessors, (823), 68 states have call successors, (68), 15 states have call predecessors, (68), 15 states have return successors, (68), 62 states have call predecessors, (68), 68 states have call successors, (68) [2024-10-13 06:33:48,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 729 states to 729 states and 959 transitions. [2024-10-13 06:33:48,591 INFO L78 Accepts]: Start accepts. Automaton has 729 states and 959 transitions. Word has length 157 [2024-10-13 06:33:48,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:33:48,592 INFO L471 AbstractCegarLoop]: Abstraction has 729 states and 959 transitions. [2024-10-13 06:33:48,592 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 4.285714285714286) internal successors, (60), 16 states have internal predecessors, (60), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2024-10-13 06:33:48,592 INFO L276 IsEmpty]: Start isEmpty. Operand 729 states and 959 transitions. [2024-10-13 06:33:48,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-10-13 06:33:48,594 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:33:48,594 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:33:48,594 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-13 06:33:48,594 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:33:48,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:33:48,595 INFO L85 PathProgramCache]: Analyzing trace with hash 899872768, now seen corresponding path program 1 times [2024-10-13 06:33:48,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:33:48,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076319725] [2024-10-13 06:33:48,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:33:48,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:33:48,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:49,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:33:49,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:49,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:33:49,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:49,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:33:49,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:49,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:33:49,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:49,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:33:49,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:49,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:33:49,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:49,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:33:49,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:49,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:33:49,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:49,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:33:49,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:49,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:33:49,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:49,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:33:49,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:49,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:33:49,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:49,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:33:49,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:49,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:33:49,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:49,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 06:33:49,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:49,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 06:33:49,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:49,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 06:33:49,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:49,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 06:33:49,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:49,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-13 06:33:49,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:49,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 06:33:49,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:49,933 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-13 06:33:49,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:33:49,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076319725] [2024-10-13 06:33:49,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076319725] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:33:49,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:33:49,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-13 06:33:49,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307733804] [2024-10-13 06:33:49,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:33:49,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 06:33:49,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:33:49,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 06:33:49,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-13 06:33:49,935 INFO L87 Difference]: Start difference. First operand 729 states and 959 transitions. Second operand has 8 states, 6 states have (on average 10.0) internal successors, (60), 8 states have internal predecessors, (60), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2024-10-13 06:33:50,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:33:50,395 INFO L93 Difference]: Finished difference Result 1401 states and 1845 transitions. [2024-10-13 06:33:50,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 06:33:50,396 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 10.0) internal successors, (60), 8 states have internal predecessors, (60), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) Word has length 157 [2024-10-13 06:33:50,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:33:50,400 INFO L225 Difference]: With dead ends: 1401 [2024-10-13 06:33:50,400 INFO L226 Difference]: Without dead ends: 673 [2024-10-13 06:33:50,401 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-10-13 06:33:50,402 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 1 mSDsluCounter, 416 mSDsCounter, 0 mSdLazyCounter, 405 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 540 SdHoareTripleChecker+Invalid, 406 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 405 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 06:33:50,402 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 540 Invalid, 406 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 405 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 06:33:50,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 673 states. [2024-10-13 06:33:50,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 673 to 673. [2024-10-13 06:33:50,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 673 states, 589 states have (on average 1.2716468590831917) internal successors, (749), 595 states have internal predecessors, (749), 68 states have call successors, (68), 15 states have call predecessors, (68), 15 states have return successors, (68), 62 states have call predecessors, (68), 68 states have call successors, (68) [2024-10-13 06:33:50,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 673 states to 673 states and 885 transitions. [2024-10-13 06:33:50,459 INFO L78 Accepts]: Start accepts. Automaton has 673 states and 885 transitions. Word has length 157 [2024-10-13 06:33:50,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:33:50,459 INFO L471 AbstractCegarLoop]: Abstraction has 673 states and 885 transitions. [2024-10-13 06:33:50,459 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 10.0) internal successors, (60), 8 states have internal predecessors, (60), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2024-10-13 06:33:50,460 INFO L276 IsEmpty]: Start isEmpty. Operand 673 states and 885 transitions. [2024-10-13 06:33:50,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-10-13 06:33:50,461 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:33:50,461 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:33:50,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-13 06:33:50,462 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:33:50,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:33:50,462 INFO L85 PathProgramCache]: Analyzing trace with hash -355213375, now seen corresponding path program 1 times [2024-10-13 06:33:50,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:33:50,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874335304] [2024-10-13 06:33:50,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:33:50,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:33:50,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:50,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:33:50,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:50,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:33:50,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:50,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:33:50,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:50,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:33:50,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:50,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:33:50,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:50,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:33:50,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:50,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:33:50,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:50,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:33:50,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:50,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:33:50,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:50,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:33:50,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:50,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:33:50,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:50,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:33:50,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:50,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:33:50,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:50,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:33:50,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:50,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 06:33:50,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:50,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 06:33:50,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:50,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 06:33:50,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:50,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 06:33:50,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:50,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-13 06:33:50,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:50,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 06:33:50,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:50,607 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-13 06:33:50,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:33:50,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874335304] [2024-10-13 06:33:50,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874335304] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:33:50,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:33:50,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 06:33:50,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858290460] [2024-10-13 06:33:50,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:33:50,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 06:33:50,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:33:50,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 06:33:50,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 06:33:50,609 INFO L87 Difference]: Start difference. First operand 673 states and 885 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-13 06:33:50,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:33:50,697 INFO L93 Difference]: Finished difference Result 1369 states and 1801 transitions. [2024-10-13 06:33:50,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 06:33:50,698 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 157 [2024-10-13 06:33:50,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:33:50,702 INFO L225 Difference]: With dead ends: 1369 [2024-10-13 06:33:50,702 INFO L226 Difference]: Without dead ends: 697 [2024-10-13 06:33:50,703 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 06:33:50,704 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 0 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 505 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 06:33:50,704 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 505 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 06:33:50,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 697 states. [2024-10-13 06:33:50,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 697 to 697. [2024-10-13 06:33:50,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 697 states, 613 states have (on average 1.2610114192495923) internal successors, (773), 619 states have internal predecessors, (773), 68 states have call successors, (68), 15 states have call predecessors, (68), 15 states have return successors, (68), 62 states have call predecessors, (68), 68 states have call successors, (68) [2024-10-13 06:33:50,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 697 states to 697 states and 909 transitions. [2024-10-13 06:33:50,759 INFO L78 Accepts]: Start accepts. Automaton has 697 states and 909 transitions. Word has length 157 [2024-10-13 06:33:50,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:33:50,760 INFO L471 AbstractCegarLoop]: Abstraction has 697 states and 909 transitions. [2024-10-13 06:33:50,760 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-13 06:33:50,760 INFO L276 IsEmpty]: Start isEmpty. Operand 697 states and 909 transitions. [2024-10-13 06:33:50,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-10-13 06:33:50,762 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:33:50,762 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:33:50,762 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-13 06:33:50,762 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:33:50,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:33:50,763 INFO L85 PathProgramCache]: Analyzing trace with hash -997992510, now seen corresponding path program 1 times [2024-10-13 06:33:50,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:33:50,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674626878] [2024-10-13 06:33:50,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:33:50,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:33:50,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:52,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:33:52,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:52,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:33:52,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:52,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:33:52,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:52,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:33:52,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:52,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:33:52,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:52,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:33:52,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:52,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:33:52,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:52,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:33:52,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:52,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:33:52,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:52,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:33:52,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:52,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:33:52,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:52,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:33:52,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:52,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:33:52,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:52,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:33:52,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:52,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 06:33:52,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:52,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 06:33:52,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:52,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 06:33:52,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:52,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 06:33:52,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:52,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-13 06:33:52,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:52,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 06:33:52,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:52,386 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-13 06:33:52,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:33:52,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674626878] [2024-10-13 06:33:52,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674626878] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:33:52,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:33:52,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2024-10-13 06:33:52,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973308720] [2024-10-13 06:33:52,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:33:52,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-10-13 06:33:52,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:33:52,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-10-13 06:33:52,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=268, Unknown=0, NotChecked=0, Total=306 [2024-10-13 06:33:52,389 INFO L87 Difference]: Start difference. First operand 697 states and 909 transitions. Second operand has 18 states, 16 states have (on average 3.75) internal successors, (60), 18 states have internal predecessors, (60), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2024-10-13 06:33:53,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:33:53,605 INFO L93 Difference]: Finished difference Result 1795 states and 2326 transitions. [2024-10-13 06:33:53,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-13 06:33:53,606 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 3.75) internal successors, (60), 18 states have internal predecessors, (60), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) Word has length 157 [2024-10-13 06:33:53,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:33:53,611 INFO L225 Difference]: With dead ends: 1795 [2024-10-13 06:33:53,611 INFO L226 Difference]: Without dead ends: 1099 [2024-10-13 06:33:53,613 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=104, Invalid=652, Unknown=0, NotChecked=0, Total=756 [2024-10-13 06:33:53,615 INFO L432 NwaCegarLoop]: 165 mSDtfsCounter, 145 mSDsluCounter, 1730 mSDsCounter, 0 mSdLazyCounter, 1461 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 1895 SdHoareTripleChecker+Invalid, 1467 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1461 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-13 06:33:53,615 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 1895 Invalid, 1467 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1461 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-13 06:33:53,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1099 states. [2024-10-13 06:33:53,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1099 to 729. [2024-10-13 06:33:53,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 729 states, 645 states have (on average 1.2573643410852713) internal successors, (811), 651 states have internal predecessors, (811), 68 states have call successors, (68), 15 states have call predecessors, (68), 15 states have return successors, (68), 62 states have call predecessors, (68), 68 states have call successors, (68) [2024-10-13 06:33:53,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 729 states to 729 states and 947 transitions. [2024-10-13 06:33:53,676 INFO L78 Accepts]: Start accepts. Automaton has 729 states and 947 transitions. Word has length 157 [2024-10-13 06:33:53,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:33:53,677 INFO L471 AbstractCegarLoop]: Abstraction has 729 states and 947 transitions. [2024-10-13 06:33:53,677 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 3.75) internal successors, (60), 18 states have internal predecessors, (60), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2024-10-13 06:33:53,677 INFO L276 IsEmpty]: Start isEmpty. Operand 729 states and 947 transitions. [2024-10-13 06:33:53,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-10-13 06:33:53,678 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:33:53,678 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:33:53,679 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-13 06:33:53,679 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:33:53,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:33:53,679 INFO L85 PathProgramCache]: Analyzing trace with hash -779137792, now seen corresponding path program 1 times [2024-10-13 06:33:53,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:33:53,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779269449] [2024-10-13 06:33:53,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:33:53,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:33:53,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:55,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:33:55,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:55,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:33:55,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:55,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:33:55,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:55,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:33:55,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:55,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:33:55,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:55,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:33:55,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:55,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:33:55,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:55,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:33:55,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:55,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:33:55,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:55,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:33:55,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:55,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:33:55,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:55,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:33:55,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:55,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:33:55,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:55,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:33:55,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:55,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 06:33:55,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:55,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 06:33:55,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:55,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 06:33:55,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:55,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 06:33:55,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:55,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-13 06:33:55,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:55,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 06:33:55,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:55,314 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-13 06:33:55,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:33:55,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779269449] [2024-10-13 06:33:55,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779269449] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:33:55,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:33:55,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-10-13 06:33:55,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204057751] [2024-10-13 06:33:55,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:33:55,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-13 06:33:55,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:33:55,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-13 06:33:55,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=208, Unknown=0, NotChecked=0, Total=240 [2024-10-13 06:33:55,317 INFO L87 Difference]: Start difference. First operand 729 states and 947 transitions. Second operand has 16 states, 14 states have (on average 4.285714285714286) internal successors, (60), 16 states have internal predecessors, (60), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2024-10-13 06:33:56,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:33:56,187 INFO L93 Difference]: Finished difference Result 1575 states and 2040 transitions. [2024-10-13 06:33:56,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-13 06:33:56,188 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 4.285714285714286) internal successors, (60), 16 states have internal predecessors, (60), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) Word has length 157 [2024-10-13 06:33:56,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:33:56,196 INFO L225 Difference]: With dead ends: 1575 [2024-10-13 06:33:56,198 INFO L226 Difference]: Without dead ends: 847 [2024-10-13 06:33:56,200 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=70, Invalid=482, Unknown=0, NotChecked=0, Total=552 [2024-10-13 06:33:56,201 INFO L432 NwaCegarLoop]: 142 mSDtfsCounter, 49 mSDsluCounter, 1166 mSDsCounter, 0 mSdLazyCounter, 927 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 1308 SdHoareTripleChecker+Invalid, 929 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 927 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-13 06:33:56,201 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 1308 Invalid, 929 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 927 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-13 06:33:56,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 847 states. [2024-10-13 06:33:56,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 847 to 681. [2024-10-13 06:33:56,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 681 states, 597 states have (on average 1.2613065326633166) internal successors, (753), 603 states have internal predecessors, (753), 68 states have call successors, (68), 15 states have call predecessors, (68), 15 states have return successors, (68), 62 states have call predecessors, (68), 68 states have call successors, (68) [2024-10-13 06:33:56,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 681 states to 681 states and 889 transitions. [2024-10-13 06:33:56,260 INFO L78 Accepts]: Start accepts. Automaton has 681 states and 889 transitions. Word has length 157 [2024-10-13 06:33:56,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:33:56,260 INFO L471 AbstractCegarLoop]: Abstraction has 681 states and 889 transitions. [2024-10-13 06:33:56,260 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 4.285714285714286) internal successors, (60), 16 states have internal predecessors, (60), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2024-10-13 06:33:56,261 INFO L276 IsEmpty]: Start isEmpty. Operand 681 states and 889 transitions. [2024-10-13 06:33:56,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-10-13 06:33:56,262 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:33:56,262 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:33:56,262 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-13 06:33:56,262 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:33:56,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:33:56,263 INFO L85 PathProgramCache]: Analyzing trace with hash 606173640, now seen corresponding path program 1 times [2024-10-13 06:33:56,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:33:56,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867085152] [2024-10-13 06:33:56,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:33:56,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:33:56,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:56,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:33:56,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:56,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:33:56,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:56,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:33:56,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:56,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:33:56,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:56,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:33:56,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:56,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:33:56,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:56,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:33:56,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:56,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:33:56,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:56,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:33:56,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:56,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:33:56,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:56,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:33:56,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:56,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:33:56,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:56,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:33:56,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:56,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:33:56,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:56,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 06:33:56,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:56,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 06:33:56,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:56,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 06:33:56,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:56,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 06:33:56,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:56,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-13 06:33:56,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:56,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 06:33:56,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:33:56,952 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-13 06:33:56,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:33:56,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867085152] [2024-10-13 06:33:56,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1867085152] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:33:56,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:33:56,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 06:33:56,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852268977] [2024-10-13 06:33:56,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:33:56,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 06:33:56,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:33:56,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 06:33:56,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-13 06:33:56,954 INFO L87 Difference]: Start difference. First operand 681 states and 889 transitions. Second operand has 6 states, 5 states have (on average 12.4) internal successors, (62), 6 states have internal predecessors, (62), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-10-13 06:33:57,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:33:57,292 INFO L93 Difference]: Finished difference Result 1373 states and 1786 transitions. [2024-10-13 06:33:57,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 06:33:57,293 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.4) internal successors, (62), 6 states have internal predecessors, (62), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 159 [2024-10-13 06:33:57,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:33:57,297 INFO L225 Difference]: With dead ends: 1373 [2024-10-13 06:33:57,298 INFO L226 Difference]: Without dead ends: 693 [2024-10-13 06:33:57,299 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-13 06:33:57,299 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 58 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 302 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 372 SdHoareTripleChecker+Invalid, 309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 06:33:57,300 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 372 Invalid, 309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 302 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 06:33:57,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 693 states. [2024-10-13 06:33:57,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 693 to 640. [2024-10-13 06:33:57,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 640 states, 565 states have (on average 1.2584070796460176) internal successors, (711), 570 states have internal predecessors, (711), 60 states have call successors, (60), 14 states have call predecessors, (60), 14 states have return successors, (60), 55 states have call predecessors, (60), 60 states have call successors, (60) [2024-10-13 06:33:57,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 640 states to 640 states and 831 transitions. [2024-10-13 06:33:57,355 INFO L78 Accepts]: Start accepts. Automaton has 640 states and 831 transitions. Word has length 159 [2024-10-13 06:33:57,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:33:57,355 INFO L471 AbstractCegarLoop]: Abstraction has 640 states and 831 transitions. [2024-10-13 06:33:57,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.4) internal successors, (62), 6 states have internal predecessors, (62), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-10-13 06:33:57,356 INFO L276 IsEmpty]: Start isEmpty. Operand 640 states and 831 transitions. [2024-10-13 06:33:57,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-10-13 06:33:57,358 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:33:57,358 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:33:57,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-13 06:33:57,358 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:33:57,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:33:57,359 INFO L85 PathProgramCache]: Analyzing trace with hash 1886037318, now seen corresponding path program 1 times [2024-10-13 06:33:57,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:33:57,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931684806] [2024-10-13 06:33:57,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:33:57,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:33:57,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 06:33:57,473 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 06:33:57,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 06:33:57,652 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 06:33:57,653 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-13 06:33:57,655 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-13 06:33:57,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-13 06:33:57,659 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:33:57,742 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 06:33:57,745 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 06:33:57 BoogieIcfgContainer [2024-10-13 06:33:57,745 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 06:33:57,747 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 06:33:57,747 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 06:33:57,747 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 06:33:57,748 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 06:33:08" (3/4) ... [2024-10-13 06:33:57,750 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-13 06:33:57,751 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 06:33:57,752 INFO L158 Benchmark]: Toolchain (without parser) took 50484.82ms. Allocated memory was 125.8MB in the beginning and 1.2GB in the end (delta: 1.1GB). Free memory was 56.9MB in the beginning and 827.6MB in the end (delta: -770.7MB). Peak memory consumption was 344.2MB. Max. memory is 16.1GB. [2024-10-13 06:33:57,752 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 125.8MB. Free memory was 87.1MB in the beginning and 87.0MB in the end (delta: 93.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 06:33:57,752 INFO L158 Benchmark]: CACSL2BoogieTranslator took 413.62ms. Allocated memory was 125.8MB in the beginning and 165.7MB in the end (delta: 39.8MB). Free memory was 56.7MB in the beginning and 123.9MB in the end (delta: -67.2MB). Peak memory consumption was 13.0MB. Max. memory is 16.1GB. [2024-10-13 06:33:57,752 INFO L158 Benchmark]: Boogie Procedure Inliner took 68.71ms. Allocated memory is still 165.7MB. Free memory was 123.9MB in the beginning and 118.7MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-13 06:33:57,752 INFO L158 Benchmark]: Boogie Preprocessor took 100.79ms. Allocated memory is still 165.7MB. Free memory was 118.7MB in the beginning and 113.4MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-13 06:33:57,753 INFO L158 Benchmark]: RCFGBuilder took 792.75ms. Allocated memory is still 165.7MB. Free memory was 113.4MB in the beginning and 76.7MB in the end (delta: 36.7MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. [2024-10-13 06:33:57,753 INFO L158 Benchmark]: TraceAbstraction took 49095.35ms. Allocated memory was 165.7MB in the beginning and 1.2GB in the end (delta: 1.1GB). Free memory was 76.7MB in the beginning and 827.6MB in the end (delta: -750.9MB). Peak memory consumption was 322.9MB. Max. memory is 16.1GB. [2024-10-13 06:33:57,753 INFO L158 Benchmark]: Witness Printer took 4.55ms. Allocated memory is still 1.2GB. Free memory is still 827.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 06:33:57,758 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 125.8MB. Free memory was 87.1MB in the beginning and 87.0MB in the end (delta: 93.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 413.62ms. Allocated memory was 125.8MB in the beginning and 165.7MB in the end (delta: 39.8MB). Free memory was 56.7MB in the beginning and 123.9MB in the end (delta: -67.2MB). Peak memory consumption was 13.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 68.71ms. Allocated memory is still 165.7MB. Free memory was 123.9MB in the beginning and 118.7MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 100.79ms. Allocated memory is still 165.7MB. Free memory was 118.7MB in the beginning and 113.4MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 792.75ms. Allocated memory is still 165.7MB. Free memory was 113.4MB in the beginning and 76.7MB in the end (delta: 36.7MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. * TraceAbstraction took 49095.35ms. Allocated memory was 165.7MB in the beginning and 1.2GB in the end (delta: 1.1GB). Free memory was 76.7MB in the beginning and 827.6MB in the end (delta: -750.9MB). Peak memory consumption was 322.9MB. Max. memory is 16.1GB. * Witness Printer took 4.55ms. Allocated memory is still 1.2GB. Free memory is still 827.6MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 120. Possible FailurePath: [L39] unsigned char isInitial = 0; [L40-L56] struct WrapperStruct00 WrapperStruct00 = { 128, 25, 64, 8, 0, 64, 1, 27843, -4, 128, 5, 28020, 128, 10000000000000.926, 1000000.6 }; [L40-L56] struct WrapperStruct00 WrapperStruct00 = { 128, 25, 64, 8, 0, 64, 1, 27843, -4, 128, 5, 28020, 128, 10000000000000.926, 1000000.6 }; [L40-L56] struct WrapperStruct00 WrapperStruct00 = { 128, 25, 64, 8, 0, 64, 1, 27843, -4, 128, 5, 28020, 128, 10000000000000.926, 1000000.6 }; [L40-L56] struct WrapperStruct00 WrapperStruct00 = { 128, 25, 64, 8, 0, 64, 1, 27843, -4, 128, 5, 28020, 128, 10000000000000.926, 1000000.6 }; [L40-L56] struct WrapperStruct00 WrapperStruct00 = { 128, 25, 64, 8, 0, 64, 1, 27843, -4, 128, 5, 28020, 128, 10000000000000.926, 1000000.6 }; [L40-L56] struct WrapperStruct00 WrapperStruct00 = { 128, 25, 64, 8, 0, 64, 1, 27843, -4, 128, 5, 28020, 128, 10000000000000.926, 1000000.6 }; [L40-L56] struct WrapperStruct00 WrapperStruct00 = { 128, 25, 64, 8, 0, 64, 1, 27843, -4, 128, 5, 28020, 128, 10000000000000.926, 1000000.6 }; [L40-L56] struct WrapperStruct00 WrapperStruct00 = { 128, 25, 64, 8, 0, 64, 1, 27843, -4, 128, 5, 28020, 128, 10000000000000.926, 1000000.6 }; [L40-L56] struct WrapperStruct00 WrapperStruct00 = { 128, 25, 64, 8, 0, 64, 1, 27843, -4, 128, 5, 28020, 128, 10000000000000.926, 1000000.6 }; [L40-L56] struct WrapperStruct00 WrapperStruct00 = { 128, 25, 64, 8, 0, 64, 1, 27843, -4, 128, 5, 28020, 128, 10000000000000.926, 1000000.6 }; [L40-L56] struct WrapperStruct00 WrapperStruct00 = { 128, 25, 64, 8, 0, 64, 1, 27843, -4, 128, 5, 28020, 128, 10000000000000.926, 1000000.6 }; [L40-L56] struct WrapperStruct00 WrapperStruct00 = { 128, 25, 64, 8, 0, 64, 1, 27843, -4, 128, 5, 28020, 128, 10000000000000.926, 1000000.6 }; [L40-L56] struct WrapperStruct00 WrapperStruct00 = { 128, 25, 64, 8, 0, 64, 1, 27843, -4, 128, 5, 28020, 128, 10000000000000.926, 1000000.6 }; [L40-L56] struct WrapperStruct00 WrapperStruct00 = { 128, 25, 64, 8, 0, 64, 1, 27843, -4, 128, 5, 28020, 128, 10000000000000.926, 1000000.6 }; [L40-L56] struct WrapperStruct00 WrapperStruct00 = { 128, 25, 64, 8, 0, 64, 1, 27843, -4, 128, 5, 28020, 128, 10000000000000.926, 1000000.6 }; [L40-L56] struct WrapperStruct00 WrapperStruct00 = { 128, 25, 64, 8, 0, 64, 1, 27843, -4, 128, 5, 28020, 128, 10000000000000.926, 1000000.6 }; [L57] unsigned short int last_1_WrapperStruct00_var_1_8 = 64; [L58] signed short int last_1_WrapperStruct00_var_1_11 = -4; [L124] isInitial = 1 [L125] FCALL initially() [L126] COND TRUE 1 [L127] CALL updateLastVariables() [L116] EXPR WrapperStruct00.var_1_8 [L116] last_1_WrapperStruct00_var_1_8 = WrapperStruct00.var_1_8 [L117] EXPR WrapperStruct00.var_1_11 [L117] last_1_WrapperStruct00_var_1_11 = WrapperStruct00.var_1_11 [L127] RET updateLastVariables() [L128] CALL updateVariables() [L84] WrapperStruct00.var_1_4 = __VERIFIER_nondet_uchar() [L85] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L85] CALL assume_abort_if_not(WrapperStruct00.var_1_4 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L85] RET assume_abort_if_not(WrapperStruct00.var_1_4 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L86] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L86] CALL assume_abort_if_not(WrapperStruct00.var_1_4 <= 127) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L86] RET assume_abort_if_not(WrapperStruct00.var_1_4 <= 127) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L87] WrapperStruct00.var_1_5 = __VERIFIER_nondet_uchar() [L88] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L88] CALL assume_abort_if_not(WrapperStruct00.var_1_5 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L88] RET assume_abort_if_not(WrapperStruct00.var_1_5 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L89] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L89] CALL assume_abort_if_not(WrapperStruct00.var_1_5 <= 127) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L89] RET assume_abort_if_not(WrapperStruct00.var_1_5 <= 127) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L90] WrapperStruct00.var_1_6 = __VERIFIER_nondet_uchar() [L91] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L91] CALL assume_abort_if_not(WrapperStruct00.var_1_6 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L91] RET assume_abort_if_not(WrapperStruct00.var_1_6 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L92] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L92] CALL assume_abort_if_not(WrapperStruct00.var_1_6 <= 127) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L92] RET assume_abort_if_not(WrapperStruct00.var_1_6 <= 127) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L93] WrapperStruct00.var_1_7 = __VERIFIER_nondet_uchar() [L94] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L94] CALL assume_abort_if_not(WrapperStruct00.var_1_7 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L94] RET assume_abort_if_not(WrapperStruct00.var_1_7 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L95] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L95] CALL assume_abort_if_not(WrapperStruct00.var_1_7 <= 127) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L95] RET assume_abort_if_not(WrapperStruct00.var_1_7 <= 127) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L96] WrapperStruct00.var_1_9 = __VERIFIER_nondet_uchar() [L97] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L97] CALL assume_abort_if_not(WrapperStruct00.var_1_9 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L97] RET assume_abort_if_not(WrapperStruct00.var_1_9 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L98] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L98] CALL assume_abort_if_not(WrapperStruct00.var_1_9 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L98] RET assume_abort_if_not(WrapperStruct00.var_1_9 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L99] WrapperStruct00.var_1_10 = __VERIFIER_nondet_ushort() [L100] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L100] CALL assume_abort_if_not(WrapperStruct00.var_1_10 >= 16383) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L100] RET assume_abort_if_not(WrapperStruct00.var_1_10 >= 16383) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L101] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L101] CALL assume_abort_if_not(WrapperStruct00.var_1_10 <= 32767) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L101] RET assume_abort_if_not(WrapperStruct00.var_1_10 <= 32767) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L102] WrapperStruct00.var_1_13 = __VERIFIER_nondet_uchar() [L103] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L103] CALL assume_abort_if_not(WrapperStruct00.var_1_13 >= 127) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L103] RET assume_abort_if_not(WrapperStruct00.var_1_13 >= 127) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L104] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L104] CALL assume_abort_if_not(WrapperStruct00.var_1_13 <= 255) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L104] RET assume_abort_if_not(WrapperStruct00.var_1_13 <= 255) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L105] WrapperStruct00.var_1_14 = __VERIFIER_nondet_uchar() [L106] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L106] CALL assume_abort_if_not(WrapperStruct00.var_1_14 >= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L106] RET assume_abort_if_not(WrapperStruct00.var_1_14 >= 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L107] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L107] CALL assume_abort_if_not(WrapperStruct00.var_1_14 <= 126) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L107] RET assume_abort_if_not(WrapperStruct00.var_1_14 <= 126) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L108] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L108] CALL assume_abort_if_not(WrapperStruct00.var_1_14 != 127) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L108] RET assume_abort_if_not(WrapperStruct00.var_1_14 != 127) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L109] WrapperStruct00.var_1_15 = __VERIFIER_nondet_short() [L110] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L110] CALL assume_abort_if_not(WrapperStruct00.var_1_15 >= 16383) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L110] RET assume_abort_if_not(WrapperStruct00.var_1_15 >= 16383) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L111] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L111] CALL assume_abort_if_not(WrapperStruct00.var_1_15 <= 32766) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L111] RET assume_abort_if_not(WrapperStruct00.var_1_15 <= 32766) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L112] WrapperStruct00.var_1_18 = __VERIFIER_nondet_float() [L113] EXPR WrapperStruct00.var_1_18 [L113] EXPR WrapperStruct00.var_1_18 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_18 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L113] EXPR WrapperStruct00.var_1_18 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_18 <= -1.0e-20F [L113] EXPR WrapperStruct00.var_1_18 [L113] EXPR WrapperStruct00.var_1_18 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_18 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L113] EXPR (WrapperStruct00.var_1_18 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_18 <= -1.0e-20F) || (WrapperStruct00.var_1_18 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_18 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L113] EXPR (WrapperStruct00.var_1_18 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_18 <= -1.0e-20F) || (WrapperStruct00.var_1_18 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_18 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L113] CALL assume_abort_if_not((WrapperStruct00.var_1_18 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_18 <= -1.0e-20F) || (WrapperStruct00.var_1_18 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_18 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L113] RET assume_abort_if_not((WrapperStruct00.var_1_18 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_18 <= -1.0e-20F) || (WrapperStruct00.var_1_18 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_18 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L128] RET updateVariables() [L129] CALL step() [L62] signed long int stepLocal_0 = last_1_WrapperStruct00_var_1_11; VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64, stepLocal_0=-4] [L63] COND TRUE stepLocal_0 != last_1_WrapperStruct00_var_1_8 [L64] EXPR WrapperStruct00.var_1_4 [L64] EXPR WrapperStruct00.var_1_5 [L64] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L64] EXPR ((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6) [L64] EXPR WrapperStruct00.var_1_5 [L64] EXPR ((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L64] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L64] EXPR ((((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) > (WrapperStruct00.var_1_7)) ? (((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) : (WrapperStruct00.var_1_7) [L64] EXPR WrapperStruct00.var_1_7 [L64] EXPR ((((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) > (WrapperStruct00.var_1_7)) ? (((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) : (WrapperStruct00.var_1_7) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L64] WrapperStruct00.var_1_1 = (WrapperStruct00.var_1_4 + ((((((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) > (WrapperStruct00.var_1_7)) ? (((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) : (WrapperStruct00.var_1_7)))) [L68] WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L68] COND TRUE WrapperStruct00.var_1_9 [L69] EXPR WrapperStruct00.var_1_10 [L69] EXPR WrapperStruct00.var_1_6 [L69] WrapperStruct00.var_1_8 = ((WrapperStruct00.var_1_10 + 23103) - (32 + WrapperStruct00.var_1_6)) [L71] EXPR WrapperStruct00.var_1_5 [L71] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L71] COND TRUE ! (WrapperStruct00.var_1_5 > WrapperStruct00.var_1_10) [L72] WrapperStruct00.var_1_16 = (32 - 8) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L76] EXPR WrapperStruct00.var_1_18 [L76] WrapperStruct00.var_1_17 = WrapperStruct00.var_1_18 [L77] EXPR WrapperStruct00.var_1_1 [L77] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L77] COND FALSE !(WrapperStruct00.var_1_1 < WrapperStruct00.var_1_16) [L129] RET step() [L130] CALL, EXPR property() [L120] EXPR (last_1_WrapperStruct00_var_1_11 != last_1_WrapperStruct00_var_1_8) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_4 + ((((((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) > (WrapperStruct00.var_1_7)) ? (((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) : (WrapperStruct00.var_1_7)))))) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_4)) [L120] EXPR WrapperStruct00.var_1_1 [L120] EXPR WrapperStruct00.var_1_4 [L120] EXPR WrapperStruct00.var_1_5 [L120] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L120] EXPR ((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6) [L120] EXPR WrapperStruct00.var_1_5 [L120] EXPR ((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L120] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L120] EXPR ((((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) > (WrapperStruct00.var_1_7)) ? (((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) : (WrapperStruct00.var_1_7) [L120] EXPR WrapperStruct00.var_1_7 [L120] EXPR ((((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) > (WrapperStruct00.var_1_7)) ? (((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) : (WrapperStruct00.var_1_7) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L120] EXPR (last_1_WrapperStruct00_var_1_11 != last_1_WrapperStruct00_var_1_8) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_4 + ((((((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) > (WrapperStruct00.var_1_7)) ? (((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) : (WrapperStruct00.var_1_7)))))) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_4)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L120] EXPR ((last_1_WrapperStruct00_var_1_11 != last_1_WrapperStruct00_var_1_8) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_4 + ((((((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) > (WrapperStruct00.var_1_7)) ? (((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) : (WrapperStruct00.var_1_7)))))) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_4))) && (WrapperStruct00.var_1_9 ? (WrapperStruct00.var_1_8 == ((unsigned short int) ((WrapperStruct00.var_1_10 + 23103) - (32 + WrapperStruct00.var_1_6)))) : 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L120] EXPR ((last_1_WrapperStruct00_var_1_11 != last_1_WrapperStruct00_var_1_8) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_4 + ((((((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) > (WrapperStruct00.var_1_7)) ? (((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) : (WrapperStruct00.var_1_7)))))) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_4))) && (WrapperStruct00.var_1_9 ? (WrapperStruct00.var_1_8 == ((unsigned short int) ((WrapperStruct00.var_1_10 + 23103) - (32 + WrapperStruct00.var_1_6)))) : 1) [L120] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L120] EXPR WrapperStruct00.var_1_9 ? (WrapperStruct00.var_1_8 == ((unsigned short int) ((WrapperStruct00.var_1_10 + 23103) - (32 + WrapperStruct00.var_1_6)))) : 1 [L120] EXPR WrapperStruct00.var_1_8 [L120] EXPR WrapperStruct00.var_1_10 [L120] EXPR WrapperStruct00.var_1_6 [L120] EXPR WrapperStruct00.var_1_9 ? (WrapperStruct00.var_1_8 == ((unsigned short int) ((WrapperStruct00.var_1_10 + 23103) - (32 + WrapperStruct00.var_1_6)))) : 1 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L120] EXPR ((last_1_WrapperStruct00_var_1_11 != last_1_WrapperStruct00_var_1_8) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_4 + ((((((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) > (WrapperStruct00.var_1_7)) ? (((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) : (WrapperStruct00.var_1_7)))))) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_4))) && (WrapperStruct00.var_1_9 ? (WrapperStruct00.var_1_8 == ((unsigned short int) ((WrapperStruct00.var_1_10 + 23103) - (32 + WrapperStruct00.var_1_6)))) : 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L120] EXPR (((last_1_WrapperStruct00_var_1_11 != last_1_WrapperStruct00_var_1_8) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_4 + ((((((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) > (WrapperStruct00.var_1_7)) ? (((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) : (WrapperStruct00.var_1_7)))))) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_4))) && (WrapperStruct00.var_1_9 ? (WrapperStruct00.var_1_8 == ((unsigned short int) ((WrapperStruct00.var_1_10 + 23103) - (32 + WrapperStruct00.var_1_6)))) : 1)) && ((WrapperStruct00.var_1_1 < WrapperStruct00.var_1_16) ? ((((- 8) / (WrapperStruct00.var_1_13 - WrapperStruct00.var_1_14)) >= WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_11 == ((signed short int) (WrapperStruct00.var_1_16 - (WrapperStruct00.var_1_15 - WrapperStruct00.var_1_14)))) : 1) : 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L120] EXPR (((last_1_WrapperStruct00_var_1_11 != last_1_WrapperStruct00_var_1_8) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_4 + ((((((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) > (WrapperStruct00.var_1_7)) ? (((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) : (WrapperStruct00.var_1_7)))))) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_4))) && (WrapperStruct00.var_1_9 ? (WrapperStruct00.var_1_8 == ((unsigned short int) ((WrapperStruct00.var_1_10 + 23103) - (32 + WrapperStruct00.var_1_6)))) : 1)) && ((WrapperStruct00.var_1_1 < WrapperStruct00.var_1_16) ? ((((- 8) / (WrapperStruct00.var_1_13 - WrapperStruct00.var_1_14)) >= WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_11 == ((signed short int) (WrapperStruct00.var_1_16 - (WrapperStruct00.var_1_15 - WrapperStruct00.var_1_14)))) : 1) : 1) [L120] EXPR WrapperStruct00.var_1_1 [L120] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L120] EXPR (WrapperStruct00.var_1_1 < WrapperStruct00.var_1_16) ? ((((- 8) / (WrapperStruct00.var_1_13 - WrapperStruct00.var_1_14)) >= WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_11 == ((signed short int) (WrapperStruct00.var_1_16 - (WrapperStruct00.var_1_15 - WrapperStruct00.var_1_14)))) : 1) : 1 [L120] EXPR (WrapperStruct00.var_1_1 < WrapperStruct00.var_1_16) ? ((((- 8) / (WrapperStruct00.var_1_13 - WrapperStruct00.var_1_14)) >= WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_11 == ((signed short int) (WrapperStruct00.var_1_16 - (WrapperStruct00.var_1_15 - WrapperStruct00.var_1_14)))) : 1) : 1 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L120] EXPR (((last_1_WrapperStruct00_var_1_11 != last_1_WrapperStruct00_var_1_8) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_4 + ((((((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) > (WrapperStruct00.var_1_7)) ? (((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) : (WrapperStruct00.var_1_7)))))) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_4))) && (WrapperStruct00.var_1_9 ? (WrapperStruct00.var_1_8 == ((unsigned short int) ((WrapperStruct00.var_1_10 + 23103) - (32 + WrapperStruct00.var_1_6)))) : 1)) && ((WrapperStruct00.var_1_1 < WrapperStruct00.var_1_16) ? ((((- 8) / (WrapperStruct00.var_1_13 - WrapperStruct00.var_1_14)) >= WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_11 == ((signed short int) (WrapperStruct00.var_1_16 - (WrapperStruct00.var_1_15 - WrapperStruct00.var_1_14)))) : 1) : 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L120] EXPR ((((last_1_WrapperStruct00_var_1_11 != last_1_WrapperStruct00_var_1_8) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_4 + ((((((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) > (WrapperStruct00.var_1_7)) ? (((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) : (WrapperStruct00.var_1_7)))))) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_4))) && (WrapperStruct00.var_1_9 ? (WrapperStruct00.var_1_8 == ((unsigned short int) ((WrapperStruct00.var_1_10 + 23103) - (32 + WrapperStruct00.var_1_6)))) : 1)) && ((WrapperStruct00.var_1_1 < WrapperStruct00.var_1_16) ? ((((- 8) / (WrapperStruct00.var_1_13 - WrapperStruct00.var_1_14)) >= WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_11 == ((signed short int) (WrapperStruct00.var_1_16 - (WrapperStruct00.var_1_15 - WrapperStruct00.var_1_14)))) : 1) : 1)) && ((! (WrapperStruct00.var_1_5 > WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_16 == ((signed short int) (32 - 8))) : (WrapperStruct00.var_1_16 == ((signed short int) (WrapperStruct00.var_1_13 - WrapperStruct00.var_1_4)))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L120] EXPR ((((last_1_WrapperStruct00_var_1_11 != last_1_WrapperStruct00_var_1_8) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_4 + ((((((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) > (WrapperStruct00.var_1_7)) ? (((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) : (WrapperStruct00.var_1_7)))))) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_4))) && (WrapperStruct00.var_1_9 ? (WrapperStruct00.var_1_8 == ((unsigned short int) ((WrapperStruct00.var_1_10 + 23103) - (32 + WrapperStruct00.var_1_6)))) : 1)) && ((WrapperStruct00.var_1_1 < WrapperStruct00.var_1_16) ? ((((- 8) / (WrapperStruct00.var_1_13 - WrapperStruct00.var_1_14)) >= WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_11 == ((signed short int) (WrapperStruct00.var_1_16 - (WrapperStruct00.var_1_15 - WrapperStruct00.var_1_14)))) : 1) : 1)) && ((! (WrapperStruct00.var_1_5 > WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_16 == ((signed short int) (32 - 8))) : (WrapperStruct00.var_1_16 == ((signed short int) (WrapperStruct00.var_1_13 - WrapperStruct00.var_1_4)))) [L120] EXPR WrapperStruct00.var_1_5 [L120] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L120] EXPR (! (WrapperStruct00.var_1_5 > WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_16 == ((signed short int) (32 - 8))) : (WrapperStruct00.var_1_16 == ((signed short int) (WrapperStruct00.var_1_13 - WrapperStruct00.var_1_4))) [L120] EXPR WrapperStruct00.var_1_16 [L120] EXPR (! (WrapperStruct00.var_1_5 > WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_16 == ((signed short int) (32 - 8))) : (WrapperStruct00.var_1_16 == ((signed short int) (WrapperStruct00.var_1_13 - WrapperStruct00.var_1_4))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L120] EXPR ((((last_1_WrapperStruct00_var_1_11 != last_1_WrapperStruct00_var_1_8) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_4 + ((((((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) > (WrapperStruct00.var_1_7)) ? (((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) : (WrapperStruct00.var_1_7)))))) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_4))) && (WrapperStruct00.var_1_9 ? (WrapperStruct00.var_1_8 == ((unsigned short int) ((WrapperStruct00.var_1_10 + 23103) - (32 + WrapperStruct00.var_1_6)))) : 1)) && ((WrapperStruct00.var_1_1 < WrapperStruct00.var_1_16) ? ((((- 8) / (WrapperStruct00.var_1_13 - WrapperStruct00.var_1_14)) >= WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_11 == ((signed short int) (WrapperStruct00.var_1_16 - (WrapperStruct00.var_1_15 - WrapperStruct00.var_1_14)))) : 1) : 1)) && ((! (WrapperStruct00.var_1_5 > WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_16 == ((signed short int) (32 - 8))) : (WrapperStruct00.var_1_16 == ((signed short int) (WrapperStruct00.var_1_13 - WrapperStruct00.var_1_4)))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L120] EXPR (((((last_1_WrapperStruct00_var_1_11 != last_1_WrapperStruct00_var_1_8) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_4 + ((((((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) > (WrapperStruct00.var_1_7)) ? (((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) : (WrapperStruct00.var_1_7)))))) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_4))) && (WrapperStruct00.var_1_9 ? (WrapperStruct00.var_1_8 == ((unsigned short int) ((WrapperStruct00.var_1_10 + 23103) - (32 + WrapperStruct00.var_1_6)))) : 1)) && ((WrapperStruct00.var_1_1 < WrapperStruct00.var_1_16) ? ((((- 8) / (WrapperStruct00.var_1_13 - WrapperStruct00.var_1_14)) >= WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_11 == ((signed short int) (WrapperStruct00.var_1_16 - (WrapperStruct00.var_1_15 - WrapperStruct00.var_1_14)))) : 1) : 1)) && ((! (WrapperStruct00.var_1_5 > WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_16 == ((signed short int) (32 - 8))) : (WrapperStruct00.var_1_16 == ((signed short int) (WrapperStruct00.var_1_13 - WrapperStruct00.var_1_4))))) && (WrapperStruct00.var_1_17 == ((float) WrapperStruct00.var_1_18)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L120] EXPR (((((last_1_WrapperStruct00_var_1_11 != last_1_WrapperStruct00_var_1_8) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_4 + ((((((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) > (WrapperStruct00.var_1_7)) ? (((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) : (WrapperStruct00.var_1_7)))))) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_4))) && (WrapperStruct00.var_1_9 ? (WrapperStruct00.var_1_8 == ((unsigned short int) ((WrapperStruct00.var_1_10 + 23103) - (32 + WrapperStruct00.var_1_6)))) : 1)) && ((WrapperStruct00.var_1_1 < WrapperStruct00.var_1_16) ? ((((- 8) / (WrapperStruct00.var_1_13 - WrapperStruct00.var_1_14)) >= WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_11 == ((signed short int) (WrapperStruct00.var_1_16 - (WrapperStruct00.var_1_15 - WrapperStruct00.var_1_14)))) : 1) : 1)) && ((! (WrapperStruct00.var_1_5 > WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_16 == ((signed short int) (32 - 8))) : (WrapperStruct00.var_1_16 == ((signed short int) (WrapperStruct00.var_1_13 - WrapperStruct00.var_1_4))))) && (WrapperStruct00.var_1_17 == ((float) WrapperStruct00.var_1_18)) [L120] EXPR WrapperStruct00.var_1_17 [L120] EXPR WrapperStruct00.var_1_18 [L120] EXPR (((((last_1_WrapperStruct00_var_1_11 != last_1_WrapperStruct00_var_1_8) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_4 + ((((((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) > (WrapperStruct00.var_1_7)) ? (((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) : (WrapperStruct00.var_1_7)))))) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_4))) && (WrapperStruct00.var_1_9 ? (WrapperStruct00.var_1_8 == ((unsigned short int) ((WrapperStruct00.var_1_10 + 23103) - (32 + WrapperStruct00.var_1_6)))) : 1)) && ((WrapperStruct00.var_1_1 < WrapperStruct00.var_1_16) ? ((((- 8) / (WrapperStruct00.var_1_13 - WrapperStruct00.var_1_14)) >= WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_11 == ((signed short int) (WrapperStruct00.var_1_16 - (WrapperStruct00.var_1_15 - WrapperStruct00.var_1_14)))) : 1) : 1)) && ((! (WrapperStruct00.var_1_5 > WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_16 == ((signed short int) (32 - 8))) : (WrapperStruct00.var_1_16 == ((signed short int) (WrapperStruct00.var_1_13 - WrapperStruct00.var_1_4))))) && (WrapperStruct00.var_1_17 == ((float) WrapperStruct00.var_1_18)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L120-L121] return (((((last_1_WrapperStruct00_var_1_11 != last_1_WrapperStruct00_var_1_8) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_4 + ((((((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) > (WrapperStruct00.var_1_7)) ? (((((WrapperStruct00.var_1_5) < (WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_5) : (WrapperStruct00.var_1_6)))) : (WrapperStruct00.var_1_7)))))) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_4))) && (WrapperStruct00.var_1_9 ? (WrapperStruct00.var_1_8 == ((unsigned short int) ((WrapperStruct00.var_1_10 + 23103) - (32 + WrapperStruct00.var_1_6)))) : 1)) && ((WrapperStruct00.var_1_1 < WrapperStruct00.var_1_16) ? ((((- 8) / (WrapperStruct00.var_1_13 - WrapperStruct00.var_1_14)) >= WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_11 == ((signed short int) (WrapperStruct00.var_1_16 - (WrapperStruct00.var_1_15 - WrapperStruct00.var_1_14)))) : 1) : 1)) && ((! (WrapperStruct00.var_1_5 > WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_16 == ((signed short int) (32 - 8))) : (WrapperStruct00.var_1_16 == ((signed short int) (WrapperStruct00.var_1_13 - WrapperStruct00.var_1_4))))) && (WrapperStruct00.var_1_17 == ((float) WrapperStruct00.var_1_18)) ; [L130] RET, EXPR property() [L130] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L19] reach_error() VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 96 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 48.9s, OverallIterations: 25, TraceHistogramMax: 20, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 15.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1651 SdHoareTripleChecker+Valid, 11.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1619 mSDsluCounter, 18442 SdHoareTripleChecker+Invalid, 9.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 15372 mSDsCounter, 187 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 13306 IncrementalHoareTripleChecker+Invalid, 13493 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 187 mSolverCounterUnsat, 3070 mSDtfsCounter, 13306 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1533 GetRequests, 1269 SyntacticMatches, 0 SemanticMatches, 264 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 472 ImplicationChecksByTransitivity, 3.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=729occurred in iteration=19, InterpolantAutomatonStates: 237, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.2s AutomataMinimizationTime, 24 MinimizatonAttempts, 2633 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 29.9s InterpolantComputationTime, 3863 NumberOfCodeBlocks, 3863 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 3680 ConstructedInterpolants, 0 QuantifiedInterpolants, 11234 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 24 InterpolantComputations, 24 PerfectInterpolantSequences, 18240/18240 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-13 06:33:57,909 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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-s_file-84.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.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 4fa328083b1d4aa3a21868494aa94d1f433f55ced0b8b3227cc831ea530b809d --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 06:34:00,099 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 06:34:00,180 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-13 06:34:00,191 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 06:34:00,191 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 06:34:00,218 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 06:34:00,220 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 06:34:00,221 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 06:34:00,221 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 06:34:00,222 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 06:34:00,222 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 06:34:00,223 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 06:34:00,223 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 06:34:00,223 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 06:34:00,224 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 06:34:00,224 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 06:34:00,224 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 06:34:00,225 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 06:34:00,225 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 06:34:00,225 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 06:34:00,226 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 06:34:00,229 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 06:34:00,229 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 06:34:00,230 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 06:34:00,230 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-13 06:34:00,230 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 06:34:00,230 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-13 06:34:00,231 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 06:34:00,231 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 06:34:00,231 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 06:34:00,231 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 06:34:00,232 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 06:34:00,232 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 06:34:00,236 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 06:34:00,236 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 06:34:00,237 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 06:34:00,237 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 06:34:00,237 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 06:34:00,237 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-13 06:34:00,238 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-13 06:34:00,238 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 06:34:00,239 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 06:34:00,239 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 06:34:00,239 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 06:34:00,240 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-13 06:34:00,240 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 -> 4fa328083b1d4aa3a21868494aa94d1f433f55ced0b8b3227cc831ea530b809d [2024-10-13 06:34:00,593 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 06:34:00,622 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 06:34:00,626 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 06:34:00,627 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 06:34:00,628 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 06:34:00,631 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-84.i [2024-10-13 06:34:02,312 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 06:34:02,545 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 06:34:02,547 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-84.i [2024-10-13 06:34:02,558 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/76e2ff441/f1b35ae4f5e3417098932a05cd050222/FLAGe4673dd7d [2024-10-13 06:34:02,896 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/76e2ff441/f1b35ae4f5e3417098932a05cd050222 [2024-10-13 06:34:02,899 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 06:34:02,900 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 06:34:02,902 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 06:34:02,902 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 06:34:02,907 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 06:34:02,907 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 06:34:02" (1/1) ... [2024-10-13 06:34:02,908 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1951c754 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:34:02, skipping insertion in model container [2024-10-13 06:34:02,909 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 06:34:02" (1/1) ... [2024-10-13 06:34:02,945 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 06:34:03,143 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-s_file-84.i[916,929] [2024-10-13 06:34:03,217 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 06:34:03,235 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 06:34:03,251 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-s_file-84.i[916,929] [2024-10-13 06:34:03,311 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 06:34:03,346 INFO L204 MainTranslator]: Completed translation [2024-10-13 06:34:03,346 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:34:03 WrapperNode [2024-10-13 06:34:03,347 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 06:34:03,348 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 06:34:03,348 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 06:34:03,348 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 06:34:03,354 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:34:03" (1/1) ... [2024-10-13 06:34:03,378 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:34:03" (1/1) ... [2024-10-13 06:34:03,427 INFO L138 Inliner]: procedures = 33, calls = 154, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 421 [2024-10-13 06:34:03,428 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 06:34:03,429 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 06:34:03,429 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 06:34:03,429 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 06:34:03,444 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:34:03" (1/1) ... [2024-10-13 06:34:03,444 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:34:03" (1/1) ... [2024-10-13 06:34:03,454 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:34:03" (1/1) ... [2024-10-13 06:34:03,480 INFO L175 MemorySlicer]: Split 122 memory accesses to 2 slices as follows [2, 120]. 98 percent of accesses are in the largest equivalence class. The 17 initializations are split as follows [2, 15]. The 17 writes are split as follows [0, 17]. [2024-10-13 06:34:03,480 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:34:03" (1/1) ... [2024-10-13 06:34:03,482 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:34:03" (1/1) ... [2024-10-13 06:34:03,515 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:34:03" (1/1) ... [2024-10-13 06:34:03,521 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:34:03" (1/1) ... [2024-10-13 06:34:03,524 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:34:03" (1/1) ... [2024-10-13 06:34:03,531 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:34:03" (1/1) ... [2024-10-13 06:34:03,545 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 06:34:03,547 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 06:34:03,550 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 06:34:03,550 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 06:34:03,551 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:34:03" (1/1) ... [2024-10-13 06:34:03,556 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 06:34:03,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 06:34:03,605 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 06:34:03,609 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 06:34:03,669 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 06:34:03,669 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-10-13 06:34:03,669 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-10-13 06:34:03,669 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2024-10-13 06:34:03,669 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2024-10-13 06:34:03,669 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-13 06:34:03,669 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-13 06:34:03,670 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-10-13 06:34:03,670 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-10-13 06:34:03,670 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-10-13 06:34:03,670 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-10-13 06:34:03,670 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-10-13 06:34:03,671 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-10-13 06:34:03,671 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2024-10-13 06:34:03,671 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2024-10-13 06:34:03,672 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 06:34:03,672 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 06:34:03,673 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 06:34:03,673 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 06:34:03,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-10-13 06:34:03,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-10-13 06:34:03,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-10-13 06:34:03,674 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-10-13 06:34:03,795 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 06:34:03,797 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 06:34:04,546 INFO L? ?]: Removed 98 outVars from TransFormulas that were not future-live. [2024-10-13 06:34:04,547 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 06:34:04,598 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 06:34:04,599 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 06:34:04,600 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 06:34:04 BoogieIcfgContainer [2024-10-13 06:34:04,600 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 06:34:04,602 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 06:34:04,603 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 06:34:04,606 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 06:34:04,606 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 06:34:02" (1/3) ... [2024-10-13 06:34:04,607 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53a73481 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 06:34:04, skipping insertion in model container [2024-10-13 06:34:04,608 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:34:03" (2/3) ... [2024-10-13 06:34:04,608 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53a73481 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 06:34:04, skipping insertion in model container [2024-10-13 06:34:04,608 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 06:34:04" (3/3) ... [2024-10-13 06:34:04,610 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-84.i [2024-10-13 06:34:04,628 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 06:34:04,629 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 06:34:04,694 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 06:34:04,701 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;@60756cd3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 06:34:04,702 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 06:34:04,707 INFO L276 IsEmpty]: Start isEmpty. Operand has 96 states, 73 states have (on average 1.3835616438356164) internal successors, (101), 74 states have internal predecessors, (101), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-13 06:34:04,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-10-13 06:34:04,724 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:34:04,725 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:34:04,726 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:34:04,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:34:04,732 INFO L85 PathProgramCache]: Analyzing trace with hash 740533480, now seen corresponding path program 1 times [2024-10-13 06:34:04,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 06:34:04,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1301528340] [2024-10-13 06:34:04,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:34:04,750 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 06:34:04,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 06:34:04,753 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 06:34:04,755 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-13 06:34:05,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:34:05,055 INFO L255 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-13 06:34:05,068 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:34:05,117 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 390 proven. 0 refuted. 0 times theorem prover too weak. 370 trivial. 0 not checked. [2024-10-13 06:34:05,118 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 06:34:05,119 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 06:34:05,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1301528340] [2024-10-13 06:34:05,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1301528340] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:34:05,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:34:05,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 06:34:05,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646158103] [2024-10-13 06:34:05,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:34:05,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 06:34:05,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 06:34:05,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 06:34:05,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 06:34:05,159 INFO L87 Difference]: Start difference. First operand has 96 states, 73 states have (on average 1.3835616438356164) internal successors, (101), 74 states have internal predecessors, (101), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-10-13 06:34:05,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:34:05,212 INFO L93 Difference]: Finished difference Result 189 states and 300 transitions. [2024-10-13 06:34:05,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 06:34:05,219 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 145 [2024-10-13 06:34:05,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:34:05,228 INFO L225 Difference]: With dead ends: 189 [2024-10-13 06:34:05,229 INFO L226 Difference]: Without dead ends: 94 [2024-10-13 06:34:05,234 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 06:34:05,239 INFO L432 NwaCegarLoop]: 132 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, 132 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 06:34:05,240 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 132 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 06:34:05,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-10-13 06:34:05,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2024-10-13 06:34:05,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 72 states have (on average 1.3333333333333333) internal successors, (96), 72 states have internal predecessors, (96), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-13 06:34:05,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 136 transitions. [2024-10-13 06:34:05,284 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 136 transitions. Word has length 145 [2024-10-13 06:34:05,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:34:05,285 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 136 transitions. [2024-10-13 06:34:05,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-10-13 06:34:05,285 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 136 transitions. [2024-10-13 06:34:05,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-10-13 06:34:05,289 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:34:05,289 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:34:05,305 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-13 06:34:05,490 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 06:34:05,490 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:34:05,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:34:05,491 INFO L85 PathProgramCache]: Analyzing trace with hash 342880844, now seen corresponding path program 1 times [2024-10-13 06:34:05,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 06:34:05,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1092489888] [2024-10-13 06:34:05,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:34:05,493 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 06:34:05,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 06:34:05,495 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 06:34:05,496 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process