./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-63.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-63.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 e0b92bdde1a6a66126d19d639f9e494a5579381be868a4b13fb2299a2d0086c0 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 08:55:41,506 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 08:55:41,588 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 08:55:41,596 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 08:55:41,608 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 08:55:41,629 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 08:55:41,629 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 08:55:41,630 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 08:55:41,630 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 08:55:41,631 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 08:55:41,632 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 08:55:41,632 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 08:55:41,633 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 08:55:41,633 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 08:55:41,634 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 08:55:41,634 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 08:55:41,634 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 08:55:41,635 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 08:55:41,635 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 08:55:41,635 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 08:55:41,635 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 08:55:41,636 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 08:55:41,636 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 08:55:41,637 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 08:55:41,640 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 08:55:41,640 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 08:55:41,640 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 08:55:41,641 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 08:55:41,641 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 08:55:41,641 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 08:55:41,641 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 08:55:41,642 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 08:55:41,642 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 08:55:41,642 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 08:55:41,643 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 08:55:41,643 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 08:55:41,646 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 08:55:41,647 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 08:55:41,647 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 08:55:41,647 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 08:55:41,647 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 08:55:41,648 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 08:55:41,648 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 -> e0b92bdde1a6a66126d19d639f9e494a5579381be868a4b13fb2299a2d0086c0 [2024-11-10 08:55:41,932 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 08:55:41,955 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 08:55:41,959 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 08:55:41,961 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 08:55:41,961 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 08:55:41,963 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-63.i [2024-11-10 08:55:43,500 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 08:55:43,742 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 08:55:43,743 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-63.i [2024-11-10 08:55:43,756 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb150dd42/170859b8f6ae4f1981a44c3f66e71946/FLAG40ffbbb5e [2024-11-10 08:55:43,770 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb150dd42/170859b8f6ae4f1981a44c3f66e71946 [2024-11-10 08:55:43,773 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 08:55:43,774 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 08:55:43,776 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 08:55:43,776 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 08:55:43,782 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 08:55:43,783 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 08:55:43" (1/1) ... [2024-11-10 08:55:43,784 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48093155 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:55:43, skipping insertion in model container [2024-11-10 08:55:43,784 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 08:55:43" (1/1) ... [2024-11-10 08:55:43,821 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 08:55:44,016 WARN L250 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_operatoramount_amount50_file-63.i[915,928] [2024-11-10 08:55:44,108 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 08:55:44,125 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 08:55:44,141 WARN L250 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_operatoramount_amount50_file-63.i[915,928] [2024-11-10 08:55:44,188 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 08:55:44,216 INFO L204 MainTranslator]: Completed translation [2024-11-10 08:55:44,216 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:55:44 WrapperNode [2024-11-10 08:55:44,216 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 08:55:44,218 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 08:55:44,219 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 08:55:44,219 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 08:55:44,226 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:55:44" (1/1) ... [2024-11-10 08:55:44,241 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:55:44" (1/1) ... [2024-11-10 08:55:44,300 INFO L138 Inliner]: procedures = 26, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 173 [2024-11-10 08:55:44,304 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 08:55:44,305 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 08:55:44,305 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 08:55:44,306 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 08:55:44,320 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:55:44" (1/1) ... [2024-11-10 08:55:44,321 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:55:44" (1/1) ... [2024-11-10 08:55:44,324 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:55:44" (1/1) ... [2024-11-10 08:55:44,352 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-10 08:55:44,352 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:55:44" (1/1) ... [2024-11-10 08:55:44,352 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:55:44" (1/1) ... [2024-11-10 08:55:44,365 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:55:44" (1/1) ... [2024-11-10 08:55:44,368 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:55:44" (1/1) ... [2024-11-10 08:55:44,370 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:55:44" (1/1) ... [2024-11-10 08:55:44,373 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:55:44" (1/1) ... [2024-11-10 08:55:44,377 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 08:55:44,379 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 08:55:44,379 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 08:55:44,379 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 08:55:44,380 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:55:44" (1/1) ... [2024-11-10 08:55:44,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 08:55:44,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 08:55:44,423 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-11-10 08:55:44,430 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-11-10 08:55:44,480 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 08:55:44,481 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 08:55:44,482 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 08:55:44,482 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 08:55:44,482 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 08:55:44,482 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 08:55:44,583 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 08:55:44,586 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 08:55:44,984 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L124: havoc property_#t~bitwise17#1;havoc property_#t~bitwise18#1;havoc property_#t~short19#1; [2024-11-10 08:55:45,027 INFO L? ?]: Removed 17 outVars from TransFormulas that were not future-live. [2024-11-10 08:55:45,027 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 08:55:45,063 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 08:55:45,066 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 08:55:45,067 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 08:55:45 BoogieIcfgContainer [2024-11-10 08:55:45,067 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 08:55:45,069 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 08:55:45,069 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 08:55:45,072 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 08:55:45,072 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 08:55:43" (1/3) ... [2024-11-10 08:55:45,073 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57c4554c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 08:55:45, skipping insertion in model container [2024-11-10 08:55:45,073 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:55:44" (2/3) ... [2024-11-10 08:55:45,073 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57c4554c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 08:55:45, skipping insertion in model container [2024-11-10 08:55:45,074 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 08:55:45" (3/3) ... [2024-11-10 08:55:45,075 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount50_file-63.i [2024-11-10 08:55:45,090 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 08:55:45,090 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 08:55:45,176 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 08:55:45,184 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;@8e7783c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 08:55:45,185 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 08:55:45,191 INFO L276 IsEmpty]: Start isEmpty. Operand has 76 states, 57 states have (on average 1.368421052631579) internal successors, (78), 58 states have internal predecessors, (78), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-10 08:55:45,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-10 08:55:45,205 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:55:45,207 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 08:55:45,208 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:55:45,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:55:45,215 INFO L85 PathProgramCache]: Analyzing trace with hash 1580325545, now seen corresponding path program 1 times [2024-11-10 08:55:45,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 08:55:45,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083444929] [2024-11-10 08:55:45,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:55:45,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 08:55:45,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:45,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 08:55:45,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:45,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 08:55:45,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:45,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 08:55:45,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:45,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 08:55:45,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:45,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 08:55:45,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:45,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 08:55:45,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:45,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 08:55:45,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:45,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 08:55:45,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:45,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 08:55:45,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:45,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 08:55:45,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:45,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 08:55:45,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:45,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 08:55:45,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:45,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 08:55:45,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:45,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-10 08:55:45,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:45,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-10 08:55:45,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:45,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-10 08:55:45,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:45,815 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-10 08:55:45,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 08:55:45,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083444929] [2024-11-10 08:55:45,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083444929] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 08:55:45,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 08:55:45,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 08:55:45,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991665913] [2024-11-10 08:55:45,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 08:55:45,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 08:55:45,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 08:55:45,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 08:55:45,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 08:55:45,859 INFO L87 Difference]: Start difference. First operand has 76 states, 57 states have (on average 1.368421052631579) internal successors, (78), 58 states have internal predecessors, (78), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-10 08:55:45,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 08:55:45,898 INFO L93 Difference]: Finished difference Result 144 states and 229 transitions. [2024-11-10 08:55:45,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 08:55:45,901 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 119 [2024-11-10 08:55:45,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 08:55:45,907 INFO L225 Difference]: With dead ends: 144 [2024-11-10 08:55:45,907 INFO L226 Difference]: Without dead ends: 71 [2024-11-10 08:55:45,911 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 50 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-11-10 08:55:45,915 INFO L432 NwaCegarLoop]: 98 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, 98 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-11-10 08:55:45,916 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 98 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 08:55:45,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-11-10 08:55:45,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2024-11-10 08:55:45,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 53 states have (on average 1.320754716981132) internal successors, (70), 53 states have internal predecessors, (70), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-10 08:55:45,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 102 transitions. [2024-11-10 08:55:45,966 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 102 transitions. Word has length 119 [2024-11-10 08:55:45,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 08:55:45,969 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 102 transitions. [2024-11-10 08:55:45,970 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-10 08:55:45,970 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 102 transitions. [2024-11-10 08:55:45,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-10 08:55:45,974 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:55:45,974 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 08:55:45,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 08:55:45,975 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:55:45,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:55:45,976 INFO L85 PathProgramCache]: Analyzing trace with hash 1033173123, now seen corresponding path program 1 times [2024-11-10 08:55:45,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 08:55:45,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528751434] [2024-11-10 08:55:45,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:55:45,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 08:55:46,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:46,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 08:55:46,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:46,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 08:55:46,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:46,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 08:55:46,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:46,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 08:55:46,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:46,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 08:55:46,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:46,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 08:55:46,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:46,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 08:55:46,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:46,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 08:55:46,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:46,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 08:55:46,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:46,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 08:55:46,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:46,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 08:55:46,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:46,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 08:55:46,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:46,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 08:55:46,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:46,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-10 08:55:46,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:46,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-10 08:55:46,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:46,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-10 08:55:46,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:46,272 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-10 08:55:46,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 08:55:46,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528751434] [2024-11-10 08:55:46,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528751434] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 08:55:46,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 08:55:46,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 08:55:46,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955879637] [2024-11-10 08:55:46,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 08:55:46,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 08:55:46,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 08:55:46,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 08:55:46,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 08:55:46,277 INFO L87 Difference]: Start difference. First operand 71 states and 102 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-10 08:55:46,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 08:55:46,360 INFO L93 Difference]: Finished difference Result 172 states and 247 transitions. [2024-11-10 08:55:46,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 08:55:46,362 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 119 [2024-11-10 08:55:46,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 08:55:46,365 INFO L225 Difference]: With dead ends: 172 [2024-11-10 08:55:46,367 INFO L226 Difference]: Without dead ends: 104 [2024-11-10 08:55:46,368 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 08:55:46,369 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 36 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 08:55:46,371 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 204 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 08:55:46,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-11-10 08:55:46,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 85. [2024-11-10 08:55:46,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 67 states have (on average 1.3432835820895523) internal successors, (90), 67 states have internal predecessors, (90), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-10 08:55:46,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 122 transitions. [2024-11-10 08:55:46,390 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 122 transitions. Word has length 119 [2024-11-10 08:55:46,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 08:55:46,395 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 122 transitions. [2024-11-10 08:55:46,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-10 08:55:46,396 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 122 transitions. [2024-11-10 08:55:46,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-10 08:55:46,401 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:55:46,401 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 08:55:46,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 08:55:46,401 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:55:46,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:55:46,403 INFO L85 PathProgramCache]: Analyzing trace with hash -220122973, now seen corresponding path program 1 times [2024-11-10 08:55:46,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 08:55:46,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048775600] [2024-11-10 08:55:46,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:55:46,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 08:55:46,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:47,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 08:55:47,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:47,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 08:55:47,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:47,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 08:55:47,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:47,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 08:55:47,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:47,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 08:55:47,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:47,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 08:55:47,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:47,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 08:55:47,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:47,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 08:55:47,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:47,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 08:55:47,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:47,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 08:55:47,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:47,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 08:55:47,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:47,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 08:55:47,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:47,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 08:55:47,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:47,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-10 08:55:47,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:47,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-10 08:55:47,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:47,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-10 08:55:47,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:47,109 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-10 08:55:47,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 08:55:47,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048775600] [2024-11-10 08:55:47,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1048775600] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 08:55:47,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 08:55:47,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 08:55:47,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138727403] [2024-11-10 08:55:47,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 08:55:47,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 08:55:47,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 08:55:47,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 08:55:47,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 08:55:47,116 INFO L87 Difference]: Start difference. First operand 85 states and 122 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-10 08:55:47,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 08:55:47,625 INFO L93 Difference]: Finished difference Result 320 states and 459 transitions. [2024-11-10 08:55:47,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 08:55:47,626 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 119 [2024-11-10 08:55:47,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 08:55:47,632 INFO L225 Difference]: With dead ends: 320 [2024-11-10 08:55:47,633 INFO L226 Difference]: Without dead ends: 238 [2024-11-10 08:55:47,635 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-10 08:55:47,638 INFO L432 NwaCegarLoop]: 191 mSDtfsCounter, 275 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 275 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 08:55:47,638 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [275 Valid, 358 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 08:55:47,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2024-11-10 08:55:47,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 108. [2024-11-10 08:55:47,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 90 states have (on average 1.3777777777777778) internal successors, (124), 90 states have internal predecessors, (124), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-10 08:55:47,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 156 transitions. [2024-11-10 08:55:47,667 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 156 transitions. Word has length 119 [2024-11-10 08:55:47,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 08:55:47,667 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 156 transitions. [2024-11-10 08:55:47,668 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-10 08:55:47,668 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 156 transitions. [2024-11-10 08:55:47,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-10 08:55:47,670 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:55:47,670 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 08:55:47,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 08:55:47,670 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:55:47,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:55:47,671 INFO L85 PathProgramCache]: Analyzing trace with hash -597005700, now seen corresponding path program 1 times [2024-11-10 08:55:47,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 08:55:47,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020896158] [2024-11-10 08:55:47,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:55:47,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 08:55:47,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:48,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 08:55:48,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:48,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 08:55:48,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:48,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 08:55:48,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:48,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 08:55:48,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:48,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 08:55:48,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:48,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 08:55:48,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:48,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 08:55:48,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:48,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 08:55:48,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:48,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 08:55:48,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:48,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 08:55:48,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:48,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 08:55:48,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:48,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 08:55:48,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:48,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 08:55:48,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:48,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-10 08:55:48,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:48,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-10 08:55:48,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:48,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-10 08:55:48,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:48,304 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-10 08:55:48,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 08:55:48,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020896158] [2024-11-10 08:55:48,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020896158] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 08:55:48,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 08:55:48,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 08:55:48,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402822072] [2024-11-10 08:55:48,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 08:55:48,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 08:55:48,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 08:55:48,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 08:55:48,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-10 08:55:48,309 INFO L87 Difference]: Start difference. First operand 108 states and 156 transitions. Second operand has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 states have internal predecessors, (43), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-10 08:55:48,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 08:55:48,681 INFO L93 Difference]: Finished difference Result 272 states and 392 transitions. [2024-11-10 08:55:48,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 08:55:48,681 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 states have internal predecessors, (43), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 120 [2024-11-10 08:55:48,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 08:55:48,685 INFO L225 Difference]: With dead ends: 272 [2024-11-10 08:55:48,687 INFO L226 Difference]: Without dead ends: 167 [2024-11-10 08:55:48,688 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-10 08:55:48,689 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 73 mSDsluCounter, 723 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 878 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 08:55:48,691 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 878 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 08:55:48,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2024-11-10 08:55:48,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 116. [2024-11-10 08:55:48,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 98 states have (on average 1.3775510204081634) internal successors, (135), 98 states have internal predecessors, (135), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-10 08:55:48,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 167 transitions. [2024-11-10 08:55:48,702 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 167 transitions. Word has length 120 [2024-11-10 08:55:48,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 08:55:48,703 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 167 transitions. [2024-11-10 08:55:48,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 states have internal predecessors, (43), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-10 08:55:48,703 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 167 transitions. [2024-11-10 08:55:48,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-10 08:55:48,705 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:55:48,705 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 08:55:48,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 08:55:48,706 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:55:48,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:55:48,706 INFO L85 PathProgramCache]: Analyzing trace with hash 1187288258, now seen corresponding path program 1 times [2024-11-10 08:55:48,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 08:55:48,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732269807] [2024-11-10 08:55:48,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:55:48,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 08:55:48,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:49,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 08:55:49,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:49,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 08:55:49,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:49,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 08:55:49,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:49,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 08:55:49,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:49,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 08:55:49,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:49,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 08:55:49,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:49,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 08:55:49,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:49,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 08:55:49,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:49,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 08:55:49,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:49,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 08:55:49,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:49,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 08:55:49,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:49,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 08:55:49,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:49,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 08:55:49,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:49,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-10 08:55:49,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:49,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-10 08:55:49,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:49,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-10 08:55:49,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:49,289 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-10 08:55:49,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 08:55:49,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732269807] [2024-11-10 08:55:49,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [732269807] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 08:55:49,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 08:55:49,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 08:55:49,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084787775] [2024-11-10 08:55:49,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 08:55:49,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 08:55:49,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 08:55:49,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 08:55:49,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-10 08:55:49,293 INFO L87 Difference]: Start difference. First operand 116 states and 167 transitions. Second operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-10 08:55:49,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 08:55:49,600 INFO L93 Difference]: Finished difference Result 287 states and 413 transitions. [2024-11-10 08:55:49,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 08:55:49,601 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 121 [2024-11-10 08:55:49,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 08:55:49,603 INFO L225 Difference]: With dead ends: 287 [2024-11-10 08:55:49,604 INFO L226 Difference]: Without dead ends: 174 [2024-11-10 08:55:49,604 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-10 08:55:49,605 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 68 mSDsluCounter, 713 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 864 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 08:55:49,610 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 864 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 08:55:49,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2024-11-10 08:55:49,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 125. [2024-11-10 08:55:49,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 107 states have (on average 1.4018691588785046) internal successors, (150), 107 states have internal predecessors, (150), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-10 08:55:49,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 182 transitions. [2024-11-10 08:55:49,629 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 182 transitions. Word has length 121 [2024-11-10 08:55:49,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 08:55:49,630 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 182 transitions. [2024-11-10 08:55:49,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-10 08:55:49,630 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 182 transitions. [2024-11-10 08:55:49,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-10 08:55:49,635 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:55:49,635 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 08:55:49,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 08:55:49,636 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:55:49,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:55:49,636 INFO L85 PathProgramCache]: Analyzing trace with hash 1860989515, now seen corresponding path program 1 times [2024-11-10 08:55:49,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 08:55:49,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323918321] [2024-11-10 08:55:49,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:55:49,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 08:55:49,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:49,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 08:55:49,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:49,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 08:55:49,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:49,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 08:55:49,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:49,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 08:55:49,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:49,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 08:55:49,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:49,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 08:55:49,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:49,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 08:55:49,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:49,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 08:55:49,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:49,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 08:55:49,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:49,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 08:55:49,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:49,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 08:55:49,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:49,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 08:55:49,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:49,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 08:55:49,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:49,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-10 08:55:49,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:49,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-10 08:55:49,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:49,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-10 08:55:49,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:49,762 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-10 08:55:49,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 08:55:49,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323918321] [2024-11-10 08:55:49,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [323918321] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 08:55:49,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 08:55:49,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 08:55:49,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380790169] [2024-11-10 08:55:49,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 08:55:49,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 08:55:49,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 08:55:49,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 08:55:49,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 08:55:49,767 INFO L87 Difference]: Start difference. First operand 125 states and 182 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-10 08:55:49,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 08:55:49,800 INFO L93 Difference]: Finished difference Result 279 states and 400 transitions. [2024-11-10 08:55:49,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 08:55:49,801 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 121 [2024-11-10 08:55:49,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 08:55:49,802 INFO L225 Difference]: With dead ends: 279 [2024-11-10 08:55:49,803 INFO L226 Difference]: Without dead ends: 157 [2024-11-10 08:55:49,803 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 08:55:49,804 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 33 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 08:55:49,804 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 185 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 08:55:49,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2024-11-10 08:55:49,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 125. [2024-11-10 08:55:49,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 107 states have (on average 1.355140186915888) internal successors, (145), 107 states have internal predecessors, (145), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-10 08:55:49,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 177 transitions. [2024-11-10 08:55:49,811 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 177 transitions. Word has length 121 [2024-11-10 08:55:49,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 08:55:49,812 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 177 transitions. [2024-11-10 08:55:49,812 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-10 08:55:49,812 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 177 transitions. [2024-11-10 08:55:49,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-10 08:55:49,813 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:55:49,813 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 08:55:49,814 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 08:55:49,814 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:55:49,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:55:49,814 INFO L85 PathProgramCache]: Analyzing trace with hash 2057503020, now seen corresponding path program 1 times [2024-11-10 08:55:49,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 08:55:49,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598106482] [2024-11-10 08:55:49,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:55:49,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 08:55:49,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:50,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 08:55:50,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:50,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 08:55:50,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:50,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 08:55:50,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:50,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 08:55:50,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:50,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 08:55:50,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:50,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 08:55:50,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:50,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 08:55:50,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:50,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 08:55:50,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:50,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 08:55:50,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:50,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 08:55:50,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:50,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 08:55:50,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:50,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 08:55:50,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:50,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 08:55:50,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:50,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-10 08:55:50,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:50,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-10 08:55:50,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:50,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-10 08:55:50,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:50,489 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-10 08:55:50,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 08:55:50,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598106482] [2024-11-10 08:55:50,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598106482] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 08:55:50,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 08:55:50,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-10 08:55:50,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366813042] [2024-11-10 08:55:50,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 08:55:50,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 08:55:50,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 08:55:50,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 08:55:50,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-11-10 08:55:50,497 INFO L87 Difference]: Start difference. First operand 125 states and 177 transitions. Second operand has 10 states, 10 states have (on average 4.4) internal successors, (44), 10 states have internal predecessors, (44), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-10 08:55:50,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 08:55:50,916 INFO L93 Difference]: Finished difference Result 322 states and 440 transitions. [2024-11-10 08:55:50,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 08:55:50,917 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.4) internal successors, (44), 10 states have internal predecessors, (44), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 121 [2024-11-10 08:55:50,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 08:55:50,918 INFO L225 Difference]: With dead ends: 322 [2024-11-10 08:55:50,918 INFO L226 Difference]: Without dead ends: 200 [2024-11-10 08:55:50,919 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2024-11-10 08:55:50,920 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 101 mSDsluCounter, 536 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 650 SdHoareTripleChecker+Invalid, 328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 08:55:50,920 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 650 Invalid, 328 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 08:55:50,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2024-11-10 08:55:50,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 128. [2024-11-10 08:55:50,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 110 states have (on average 1.3545454545454545) internal successors, (149), 110 states have internal predecessors, (149), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-10 08:55:50,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 181 transitions. [2024-11-10 08:55:50,927 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 181 transitions. Word has length 121 [2024-11-10 08:55:50,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 08:55:50,928 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 181 transitions. [2024-11-10 08:55:50,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.4) internal successors, (44), 10 states have internal predecessors, (44), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-10 08:55:50,928 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 181 transitions. [2024-11-10 08:55:50,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-10 08:55:50,929 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:55:50,930 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 08:55:50,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 08:55:50,930 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:55:50,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:55:50,931 INFO L85 PathProgramCache]: Analyzing trace with hash 1695210173, now seen corresponding path program 1 times [2024-11-10 08:55:50,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 08:55:50,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737596033] [2024-11-10 08:55:50,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:55:50,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 08:55:50,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:51,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 08:55:51,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:51,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 08:55:51,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:51,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 08:55:51,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:51,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 08:55:51,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:51,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 08:55:51,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:51,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 08:55:51,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:51,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 08:55:51,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:51,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 08:55:51,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:51,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 08:55:51,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:51,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 08:55:51,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:51,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 08:55:51,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:51,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 08:55:51,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:51,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 08:55:51,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:51,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-10 08:55:51,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:51,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-10 08:55:51,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:51,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-10 08:55:51,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:51,149 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-10 08:55:51,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 08:55:51,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737596033] [2024-11-10 08:55:51,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737596033] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 08:55:51,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 08:55:51,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 08:55:51,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231092805] [2024-11-10 08:55:51,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 08:55:51,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 08:55:51,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 08:55:51,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 08:55:51,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-10 08:55:51,152 INFO L87 Difference]: Start difference. First operand 128 states and 181 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-10 08:55:51,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 08:55:51,492 INFO L93 Difference]: Finished difference Result 440 states and 622 transitions. [2024-11-10 08:55:51,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 08:55:51,493 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 122 [2024-11-10 08:55:51,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 08:55:51,495 INFO L225 Difference]: With dead ends: 440 [2024-11-10 08:55:51,496 INFO L226 Difference]: Without dead ends: 315 [2024-11-10 08:55:51,496 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-10 08:55:51,497 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 251 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 08:55:51,498 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [251 Valid, 367 Invalid, 310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 08:55:51,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2024-11-10 08:55:51,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 142. [2024-11-10 08:55:51,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 124 states have (on average 1.314516129032258) internal successors, (163), 124 states have internal predecessors, (163), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-10 08:55:51,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 195 transitions. [2024-11-10 08:55:51,515 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 195 transitions. Word has length 122 [2024-11-10 08:55:51,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 08:55:51,515 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 195 transitions. [2024-11-10 08:55:51,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-10 08:55:51,515 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 195 transitions. [2024-11-10 08:55:51,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-10 08:55:51,516 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:55:51,516 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 08:55:51,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 08:55:51,516 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:55:51,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:55:51,517 INFO L85 PathProgramCache]: Analyzing trace with hash 1401807166, now seen corresponding path program 1 times [2024-11-10 08:55:51,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 08:55:51,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244334599] [2024-11-10 08:55:51,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:55:51,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 08:55:51,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:52,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 08:55:52,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:52,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 08:55:52,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:52,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 08:55:52,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:52,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 08:55:52,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:52,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 08:55:52,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:52,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 08:55:52,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:52,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 08:55:52,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:52,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 08:55:52,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:52,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 08:55:52,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:52,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 08:55:52,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:52,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 08:55:52,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:52,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 08:55:52,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:52,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 08:55:52,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:52,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-10 08:55:52,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:52,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-10 08:55:52,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:52,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-10 08:55:52,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:52,137 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-10 08:55:52,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 08:55:52,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244334599] [2024-11-10 08:55:52,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1244334599] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 08:55:52,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 08:55:52,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-10 08:55:52,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462808099] [2024-11-10 08:55:52,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 08:55:52,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 08:55:52,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 08:55:52,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 08:55:52,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-10 08:55:52,139 INFO L87 Difference]: Start difference. First operand 142 states and 195 transitions. Second operand has 9 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-10 08:55:52,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 08:55:52,722 INFO L93 Difference]: Finished difference Result 371 states and 505 transitions. [2024-11-10 08:55:52,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 08:55:52,722 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 122 [2024-11-10 08:55:52,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 08:55:52,725 INFO L225 Difference]: With dead ends: 371 [2024-11-10 08:55:52,725 INFO L226 Difference]: Without dead ends: 232 [2024-11-10 08:55:52,726 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2024-11-10 08:55:52,727 INFO L432 NwaCegarLoop]: 169 mSDtfsCounter, 170 mSDsluCounter, 578 mSDsCounter, 0 mSdLazyCounter, 478 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 747 SdHoareTripleChecker+Invalid, 479 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 478 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 08:55:52,727 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 747 Invalid, 479 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 478 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 08:55:52,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2024-11-10 08:55:52,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 146. [2024-11-10 08:55:52,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 128 states have (on average 1.3125) internal successors, (168), 128 states have internal predecessors, (168), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-10 08:55:52,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 200 transitions. [2024-11-10 08:55:52,739 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 200 transitions. Word has length 122 [2024-11-10 08:55:52,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 08:55:52,740 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 200 transitions. [2024-11-10 08:55:52,740 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-10 08:55:52,740 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 200 transitions. [2024-11-10 08:55:52,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-10 08:55:52,743 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:55:52,743 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 08:55:52,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 08:55:52,743 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:55:52,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:55:52,744 INFO L85 PathProgramCache]: Analyzing trace with hash 684538560, now seen corresponding path program 1 times [2024-11-10 08:55:52,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 08:55:52,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882678373] [2024-11-10 08:55:52,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:55:52,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 08:55:52,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:53,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 08:55:53,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:53,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 08:55:53,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:53,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 08:55:53,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:53,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 08:55:53,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:53,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 08:55:53,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:53,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 08:55:53,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:53,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 08:55:53,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:53,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 08:55:53,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:53,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 08:55:53,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:53,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 08:55:53,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:53,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 08:55:53,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:53,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 08:55:53,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:53,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 08:55:53,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:53,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-10 08:55:53,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:53,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-10 08:55:53,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:53,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-10 08:55:53,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:53,496 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-10 08:55:53,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 08:55:53,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882678373] [2024-11-10 08:55:53,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882678373] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 08:55:53,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 08:55:53,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-10 08:55:53,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716115263] [2024-11-10 08:55:53,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 08:55:53,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-10 08:55:53,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 08:55:53,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-10 08:55:53,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-11-10 08:55:53,499 INFO L87 Difference]: Start difference. First operand 146 states and 200 transitions. Second operand has 11 states, 11 states have (on average 4.090909090909091) internal successors, (45), 11 states have internal predecessors, (45), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-10 08:55:53,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 08:55:53,914 INFO L93 Difference]: Finished difference Result 381 states and 516 transitions. [2024-11-10 08:55:53,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 08:55:53,915 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.090909090909091) internal successors, (45), 11 states have internal predecessors, (45), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 122 [2024-11-10 08:55:53,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 08:55:53,917 INFO L225 Difference]: With dead ends: 381 [2024-11-10 08:55:53,917 INFO L226 Difference]: Without dead ends: 238 [2024-11-10 08:55:53,918 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2024-11-10 08:55:53,918 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 201 mSDsluCounter, 805 mSDsCounter, 0 mSdLazyCounter, 353 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 962 SdHoareTripleChecker+Invalid, 355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 08:55:53,919 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 962 Invalid, 355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 353 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 08:55:53,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2024-11-10 08:55:53,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 150. [2024-11-10 08:55:53,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 132 states have (on average 1.3106060606060606) internal successors, (173), 132 states have internal predecessors, (173), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-10 08:55:53,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 205 transitions. [2024-11-10 08:55:53,925 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 205 transitions. Word has length 122 [2024-11-10 08:55:53,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 08:55:53,926 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 205 transitions. [2024-11-10 08:55:53,926 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.090909090909091) internal successors, (45), 11 states have internal predecessors, (45), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-10 08:55:53,926 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 205 transitions. [2024-11-10 08:55:53,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-10 08:55:53,928 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:55:53,928 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 08:55:53,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-10 08:55:53,929 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:55:53,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:55:53,929 INFO L85 PathProgramCache]: Analyzing trace with hash -1895820072, now seen corresponding path program 1 times [2024-11-10 08:55:53,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 08:55:53,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987850676] [2024-11-10 08:55:53,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:55:53,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 08:55:53,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:54,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 08:55:54,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:54,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 08:55:54,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:54,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 08:55:54,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:54,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 08:55:54,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:54,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 08:55:54,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:54,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 08:55:54,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:54,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 08:55:54,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:54,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 08:55:54,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:54,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 08:55:54,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:54,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 08:55:54,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:54,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 08:55:54,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:54,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 08:55:54,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:54,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 08:55:54,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:54,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-10 08:55:54,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:54,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-10 08:55:54,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:54,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-10 08:55:54,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:54,029 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-10 08:55:54,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 08:55:54,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987850676] [2024-11-10 08:55:54,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987850676] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 08:55:54,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 08:55:54,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 08:55:54,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063226045] [2024-11-10 08:55:54,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 08:55:54,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 08:55:54,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 08:55:54,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 08:55:54,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 08:55:54,031 INFO L87 Difference]: Start difference. First operand 150 states and 205 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-10 08:55:54,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 08:55:54,090 INFO L93 Difference]: Finished difference Result 406 states and 557 transitions. [2024-11-10 08:55:54,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 08:55:54,090 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 122 [2024-11-10 08:55:54,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 08:55:54,092 INFO L225 Difference]: With dead ends: 406 [2024-11-10 08:55:54,092 INFO L226 Difference]: Without dead ends: 259 [2024-11-10 08:55:54,093 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 08:55:54,093 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 90 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 08:55:54,093 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 198 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 08:55:54,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2024-11-10 08:55:54,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 176. [2024-11-10 08:55:54,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 158 states have (on average 1.2974683544303798) internal successors, (205), 158 states have internal predecessors, (205), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-10 08:55:54,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 237 transitions. [2024-11-10 08:55:54,100 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 237 transitions. Word has length 122 [2024-11-10 08:55:54,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 08:55:54,100 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 237 transitions. [2024-11-10 08:55:54,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-10 08:55:54,100 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 237 transitions. [2024-11-10 08:55:54,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-10 08:55:54,101 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:55:54,101 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 08:55:54,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-10 08:55:54,102 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:55:54,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:55:54,102 INFO L85 PathProgramCache]: Analyzing trace with hash 1954562750, now seen corresponding path program 1 times [2024-11-10 08:55:54,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 08:55:54,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659350522] [2024-11-10 08:55:54,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:55:54,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 08:55:54,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:54,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 08:55:54,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:54,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 08:55:54,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:54,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 08:55:54,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:54,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 08:55:54,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:54,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 08:55:54,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:54,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 08:55:54,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:54,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 08:55:54,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:54,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 08:55:54,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:54,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 08:55:54,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:54,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 08:55:54,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:54,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 08:55:54,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:54,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 08:55:54,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:54,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 08:55:54,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:54,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-10 08:55:54,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:54,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-10 08:55:54,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:54,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-10 08:55:54,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:54,183 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-10 08:55:54,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 08:55:54,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659350522] [2024-11-10 08:55:54,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1659350522] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 08:55:54,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 08:55:54,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 08:55:54,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877085990] [2024-11-10 08:55:54,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 08:55:54,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 08:55:54,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 08:55:54,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 08:55:54,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 08:55:54,185 INFO L87 Difference]: Start difference. First operand 176 states and 237 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-10 08:55:54,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 08:55:54,224 INFO L93 Difference]: Finished difference Result 409 states and 553 transitions. [2024-11-10 08:55:54,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 08:55:54,225 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 122 [2024-11-10 08:55:54,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 08:55:54,226 INFO L225 Difference]: With dead ends: 409 [2024-11-10 08:55:54,226 INFO L226 Difference]: Without dead ends: 236 [2024-11-10 08:55:54,227 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 08:55:54,227 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 85 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 08:55:54,228 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 191 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 08:55:54,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2024-11-10 08:55:54,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 187. [2024-11-10 08:55:54,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 169 states have (on average 1.301775147928994) internal successors, (220), 169 states have internal predecessors, (220), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-10 08:55:54,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 252 transitions. [2024-11-10 08:55:54,235 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 252 transitions. Word has length 122 [2024-11-10 08:55:54,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 08:55:54,235 INFO L471 AbstractCegarLoop]: Abstraction has 187 states and 252 transitions. [2024-11-10 08:55:54,236 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-10 08:55:54,236 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 252 transitions. [2024-11-10 08:55:54,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-10 08:55:54,237 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:55:54,237 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 08:55:54,237 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-10 08:55:54,237 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:55:54,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:55:54,238 INFO L85 PathProgramCache]: Analyzing trace with hash -1878492186, now seen corresponding path program 1 times [2024-11-10 08:55:54,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 08:55:54,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513533724] [2024-11-10 08:55:54,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:55:54,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 08:55:54,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:54,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 08:55:54,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:54,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 08:55:54,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:54,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 08:55:54,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:54,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 08:55:54,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:54,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 08:55:54,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:54,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 08:55:54,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:54,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 08:55:54,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:54,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 08:55:54,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:54,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 08:55:54,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:54,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 08:55:54,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:54,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 08:55:54,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:54,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 08:55:54,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:54,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 08:55:54,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:54,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-10 08:55:54,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:54,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-10 08:55:54,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:54,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-10 08:55:54,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:54,344 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-10 08:55:54,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 08:55:54,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513533724] [2024-11-10 08:55:54,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513533724] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 08:55:54,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 08:55:54,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 08:55:54,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616637103] [2024-11-10 08:55:54,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 08:55:54,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 08:55:54,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 08:55:54,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 08:55:54,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 08:55:54,346 INFO L87 Difference]: Start difference. First operand 187 states and 252 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-10 08:55:54,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 08:55:54,389 INFO L93 Difference]: Finished difference Result 422 states and 569 transitions. [2024-11-10 08:55:54,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 08:55:54,390 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 122 [2024-11-10 08:55:54,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 08:55:54,392 INFO L225 Difference]: With dead ends: 422 [2024-11-10 08:55:54,392 INFO L226 Difference]: Without dead ends: 238 [2024-11-10 08:55:54,392 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 08:55:54,393 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 75 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 08:55:54,393 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 173 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 08:55:54,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2024-11-10 08:55:54,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 190. [2024-11-10 08:55:54,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 172 states have (on average 1.2790697674418605) internal successors, (220), 172 states have internal predecessors, (220), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-10 08:55:54,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 252 transitions. [2024-11-10 08:55:54,401 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 252 transitions. Word has length 122 [2024-11-10 08:55:54,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 08:55:54,401 INFO L471 AbstractCegarLoop]: Abstraction has 190 states and 252 transitions. [2024-11-10 08:55:54,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-10 08:55:54,402 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 252 transitions. [2024-11-10 08:55:54,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-10 08:55:54,403 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:55:54,403 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 08:55:54,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-10 08:55:54,403 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:55:54,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:55:54,404 INFO L85 PathProgramCache]: Analyzing trace with hash -442612318, now seen corresponding path program 1 times [2024-11-10 08:55:54,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 08:55:54,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587626413] [2024-11-10 08:55:54,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:55:54,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 08:55:54,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:55,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 08:55:55,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:55,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 08:55:55,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:55,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 08:55:55,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:55,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 08:55:55,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:55,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 08:55:55,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:55,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 08:55:55,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:55,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 08:55:55,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:55,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 08:55:55,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:55,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 08:55:55,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:55,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 08:55:55,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:55,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 08:55:55,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:55,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 08:55:55,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:55,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 08:55:55,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:55,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-10 08:55:55,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:55,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-10 08:55:55,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:55,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-10 08:55:55,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:55,469 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-10 08:55:55,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 08:55:55,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587626413] [2024-11-10 08:55:55,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [587626413] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 08:55:55,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 08:55:55,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-10 08:55:55,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366303878] [2024-11-10 08:55:55,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 08:55:55,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-10 08:55:55,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 08:55:55,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-10 08:55:55,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2024-11-10 08:55:55,472 INFO L87 Difference]: Start difference. First operand 190 states and 252 transitions. Second operand has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 12 states have internal predecessors, (46), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-10 08:55:56,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 08:55:56,047 INFO L93 Difference]: Finished difference Result 615 states and 796 transitions. [2024-11-10 08:55:56,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-10 08:55:56,048 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 12 states have internal predecessors, (46), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 123 [2024-11-10 08:55:56,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 08:55:56,050 INFO L225 Difference]: With dead ends: 615 [2024-11-10 08:55:56,050 INFO L226 Difference]: Without dead ends: 428 [2024-11-10 08:55:56,051 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=64, Invalid=146, Unknown=0, NotChecked=0, Total=210 [2024-11-10 08:55:56,051 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 302 mSDsluCounter, 439 mSDsCounter, 0 mSdLazyCounter, 468 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 302 SdHoareTripleChecker+Valid, 534 SdHoareTripleChecker+Invalid, 476 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 468 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 08:55:56,052 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [302 Valid, 534 Invalid, 476 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 468 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 08:55:56,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2024-11-10 08:55:56,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 345. [2024-11-10 08:55:56,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 345 states, 324 states have (on average 1.2901234567901234) internal successors, (418), 325 states have internal predecessors, (418), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-10 08:55:56,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 454 transitions. [2024-11-10 08:55:56,068 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 454 transitions. Word has length 123 [2024-11-10 08:55:56,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 08:55:56,071 INFO L471 AbstractCegarLoop]: Abstraction has 345 states and 454 transitions. [2024-11-10 08:55:56,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 12 states have internal predecessors, (46), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-10 08:55:56,073 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 454 transitions. [2024-11-10 08:55:56,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-10 08:55:56,074 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:55:56,074 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 08:55:56,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-10 08:55:56,075 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:55:56,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:55:56,075 INFO L85 PathProgramCache]: Analyzing trace with hash -1731072718, now seen corresponding path program 1 times [2024-11-10 08:55:56,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 08:55:56,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379240017] [2024-11-10 08:55:56,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:55:56,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 08:55:56,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:56,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 08:55:56,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:56,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 08:55:56,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:56,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 08:55:56,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:56,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 08:55:56,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:56,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 08:55:56,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:56,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 08:55:56,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:56,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 08:55:56,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:56,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 08:55:56,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:56,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 08:55:56,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:56,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 08:55:56,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:56,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 08:55:56,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:56,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 08:55:56,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:56,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 08:55:56,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:56,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-10 08:55:56,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:56,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-10 08:55:56,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:56,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-10 08:55:56,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:56,184 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-10 08:55:56,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 08:55:56,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379240017] [2024-11-10 08:55:56,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [379240017] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 08:55:56,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 08:55:56,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 08:55:56,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410549793] [2024-11-10 08:55:56,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 08:55:56,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 08:55:56,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 08:55:56,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 08:55:56,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 08:55:56,186 INFO L87 Difference]: Start difference. First operand 345 states and 454 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-10 08:55:56,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 08:55:56,235 INFO L93 Difference]: Finished difference Result 804 states and 1061 transitions. [2024-11-10 08:55:56,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 08:55:56,236 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 123 [2024-11-10 08:55:56,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 08:55:56,240 INFO L225 Difference]: With dead ends: 804 [2024-11-10 08:55:56,241 INFO L226 Difference]: Without dead ends: 462 [2024-11-10 08:55:56,242 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 08:55:56,242 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 79 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 08:55:56,242 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 244 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 08:55:56,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2024-11-10 08:55:56,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 333. [2024-11-10 08:55:56,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 333 states, 312 states have (on average 1.2724358974358974) internal successors, (397), 313 states have internal predecessors, (397), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-10 08:55:56,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 433 transitions. [2024-11-10 08:55:56,262 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 433 transitions. Word has length 123 [2024-11-10 08:55:56,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 08:55:56,263 INFO L471 AbstractCegarLoop]: Abstraction has 333 states and 433 transitions. [2024-11-10 08:55:56,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-10 08:55:56,263 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 433 transitions. [2024-11-10 08:55:56,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-10 08:55:56,266 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:55:56,266 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 08:55:56,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-10 08:55:56,266 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:55:56,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:55:56,267 INFO L85 PathProgramCache]: Analyzing trace with hash -1325862012, now seen corresponding path program 1 times [2024-11-10 08:55:56,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 08:55:56,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561783341] [2024-11-10 08:55:56,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:55:56,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 08:55:56,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:56,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 08:55:56,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:56,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 08:55:56,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:56,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 08:55:56,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:56,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 08:55:56,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:56,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 08:55:56,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:56,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 08:55:56,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:56,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 08:55:56,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:56,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 08:55:56,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:56,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 08:55:56,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:56,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 08:55:56,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:56,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 08:55:56,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:56,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 08:55:56,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:56,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 08:55:56,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:56,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-10 08:55:56,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:56,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-10 08:55:56,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:56,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-10 08:55:56,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:56,823 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-10 08:55:56,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 08:55:56,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561783341] [2024-11-10 08:55:56,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561783341] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 08:55:56,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 08:55:56,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 08:55:56,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405104673] [2024-11-10 08:55:56,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 08:55:56,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 08:55:56,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 08:55:56,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 08:55:56,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-10 08:55:56,828 INFO L87 Difference]: Start difference. First operand 333 states and 433 transitions. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-10 08:55:57,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 08:55:57,170 INFO L93 Difference]: Finished difference Result 693 states and 894 transitions. [2024-11-10 08:55:57,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 08:55:57,171 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 123 [2024-11-10 08:55:57,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 08:55:57,173 INFO L225 Difference]: With dead ends: 693 [2024-11-10 08:55:57,174 INFO L226 Difference]: Without dead ends: 363 [2024-11-10 08:55:57,174 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2024-11-10 08:55:57,175 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 174 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 08:55:57,175 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 344 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 08:55:57,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2024-11-10 08:55:57,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 355. [2024-11-10 08:55:57,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 355 states, 328 states have (on average 1.2560975609756098) internal successors, (412), 330 states have internal predecessors, (412), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (22), 20 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-10 08:55:57,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 456 transitions. [2024-11-10 08:55:57,192 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 456 transitions. Word has length 123 [2024-11-10 08:55:57,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 08:55:57,192 INFO L471 AbstractCegarLoop]: Abstraction has 355 states and 456 transitions. [2024-11-10 08:55:57,193 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-10 08:55:57,193 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 456 transitions. [2024-11-10 08:55:57,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-10 08:55:57,194 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:55:57,194 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 08:55:57,194 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-10 08:55:57,195 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:55:57,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:55:57,195 INFO L85 PathProgramCache]: Analyzing trace with hash -117811686, now seen corresponding path program 1 times [2024-11-10 08:55:57,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 08:55:57,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894394004] [2024-11-10 08:55:57,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:55:57,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 08:55:57,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:57,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 08:55:57,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:57,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 08:55:57,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:57,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 08:55:57,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:57,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 08:55:57,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:57,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 08:55:57,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:57,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 08:55:57,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:57,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 08:55:57,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:57,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 08:55:57,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:57,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 08:55:57,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:57,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 08:55:57,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:57,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 08:55:57,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:57,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 08:55:57,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:57,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 08:55:57,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:57,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-10 08:55:57,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:57,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-10 08:55:57,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:57,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-10 08:55:57,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:57,380 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-10 08:55:57,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 08:55:57,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894394004] [2024-11-10 08:55:57,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [894394004] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 08:55:57,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 08:55:57,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 08:55:57,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828094307] [2024-11-10 08:55:57,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 08:55:57,381 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 08:55:57,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 08:55:57,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 08:55:57,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 08:55:57,382 INFO L87 Difference]: Start difference. First operand 355 states and 456 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-10 08:55:57,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 08:55:57,535 INFO L93 Difference]: Finished difference Result 753 states and 978 transitions. [2024-11-10 08:55:57,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 08:55:57,536 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 123 [2024-11-10 08:55:57,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 08:55:57,539 INFO L225 Difference]: With dead ends: 753 [2024-11-10 08:55:57,539 INFO L226 Difference]: Without dead ends: 401 [2024-11-10 08:55:57,540 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 08:55:57,541 INFO L432 NwaCegarLoop]: 156 mSDtfsCounter, 108 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 08:55:57,541 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 322 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 08:55:57,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2024-11-10 08:55:57,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 310. [2024-11-10 08:55:57,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 310 states, 283 states have (on average 1.2367491166077738) internal successors, (350), 285 states have internal predecessors, (350), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (22), 20 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-10 08:55:57,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 394 transitions. [2024-11-10 08:55:57,561 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 394 transitions. Word has length 123 [2024-11-10 08:55:57,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 08:55:57,562 INFO L471 AbstractCegarLoop]: Abstraction has 310 states and 394 transitions. [2024-11-10 08:55:57,562 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-10 08:55:57,562 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 394 transitions. [2024-11-10 08:55:57,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-10 08:55:57,564 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:55:57,564 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 08:55:57,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-10 08:55:57,565 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:55:57,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:55:57,565 INFO L85 PathProgramCache]: Analyzing trace with hash -750827719, now seen corresponding path program 1 times [2024-11-10 08:55:57,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 08:55:57,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047146635] [2024-11-10 08:55:57,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:55:57,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 08:55:57,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:57,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 08:55:57,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:57,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 08:55:57,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:57,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 08:55:57,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:57,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 08:55:57,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:57,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 08:55:57,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:57,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 08:55:57,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:57,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 08:55:57,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:57,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 08:55:57,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:57,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 08:55:57,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:57,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 08:55:57,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:57,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 08:55:57,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:57,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 08:55:57,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:57,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 08:55:57,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:57,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-10 08:55:57,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:57,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-10 08:55:57,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:57,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-10 08:55:57,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:57,652 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-10 08:55:57,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 08:55:57,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047146635] [2024-11-10 08:55:57,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1047146635] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 08:55:57,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 08:55:57,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 08:55:57,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248853433] [2024-11-10 08:55:57,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 08:55:57,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 08:55:57,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 08:55:57,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 08:55:57,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 08:55:57,653 INFO L87 Difference]: Start difference. First operand 310 states and 394 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-10 08:55:57,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 08:55:57,707 INFO L93 Difference]: Finished difference Result 678 states and 862 transitions. [2024-11-10 08:55:57,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 08:55:57,708 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 123 [2024-11-10 08:55:57,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 08:55:57,710 INFO L225 Difference]: With dead ends: 678 [2024-11-10 08:55:57,711 INFO L226 Difference]: Without dead ends: 371 [2024-11-10 08:55:57,711 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 08:55:57,712 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 66 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 08:55:57,712 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 233 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 08:55:57,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2024-11-10 08:55:57,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 292. [2024-11-10 08:55:57,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 265 states have (on average 1.2150943396226415) internal successors, (322), 267 states have internal predecessors, (322), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (22), 20 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-10 08:55:57,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 366 transitions. [2024-11-10 08:55:57,729 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 366 transitions. Word has length 123 [2024-11-10 08:55:57,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 08:55:57,730 INFO L471 AbstractCegarLoop]: Abstraction has 292 states and 366 transitions. [2024-11-10 08:55:57,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-10 08:55:57,730 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 366 transitions. [2024-11-10 08:55:57,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-10 08:55:57,731 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:55:57,732 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 08:55:57,732 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-10 08:55:57,732 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:55:57,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:55:57,732 INFO L85 PathProgramCache]: Analyzing trace with hash 1440590111, now seen corresponding path program 1 times [2024-11-10 08:55:57,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 08:55:57,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931026211] [2024-11-10 08:55:57,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:55:57,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 08:55:57,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:58,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 08:55:58,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:58,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 08:55:58,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:58,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 08:55:58,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:58,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 08:55:58,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:58,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 08:55:58,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:58,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 08:55:58,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:58,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 08:55:58,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:58,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 08:55:58,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:58,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 08:55:58,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:58,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 08:55:58,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:58,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 08:55:58,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:58,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 08:55:58,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:58,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 08:55:58,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:58,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-10 08:55:58,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:58,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-10 08:55:58,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:58,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-10 08:55:58,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:58,186 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-10 08:55:58,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 08:55:58,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931026211] [2024-11-10 08:55:58,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1931026211] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 08:55:58,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 08:55:58,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 08:55:58,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107745902] [2024-11-10 08:55:58,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 08:55:58,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 08:55:58,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 08:55:58,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 08:55:58,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 08:55:58,190 INFO L87 Difference]: Start difference. First operand 292 states and 366 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-10 08:55:58,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 08:55:58,369 INFO L93 Difference]: Finished difference Result 738 states and 929 transitions. [2024-11-10 08:55:58,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 08:55:58,370 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 123 [2024-11-10 08:55:58,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 08:55:58,372 INFO L225 Difference]: With dead ends: 738 [2024-11-10 08:55:58,372 INFO L226 Difference]: Without dead ends: 449 [2024-11-10 08:55:58,373 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 35 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-11-10 08:55:58,374 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 99 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 08:55:58,375 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 319 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 08:55:58,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2024-11-10 08:55:58,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 331. [2024-11-10 08:55:58,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 331 states, 286 states have (on average 1.1993006993006994) internal successors, (343), 288 states have internal predecessors, (343), 38 states have call successors, (38), 6 states have call predecessors, (38), 6 states have return successors, (38), 36 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-10 08:55:58,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 419 transitions. [2024-11-10 08:55:58,397 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 419 transitions. Word has length 123 [2024-11-10 08:55:58,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 08:55:58,397 INFO L471 AbstractCegarLoop]: Abstraction has 331 states and 419 transitions. [2024-11-10 08:55:58,397 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-10 08:55:58,397 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 419 transitions. [2024-11-10 08:55:58,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-10 08:55:58,398 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:55:58,399 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 08:55:58,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-10 08:55:58,400 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:55:58,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:55:58,400 INFO L85 PathProgramCache]: Analyzing trace with hash -411592511, now seen corresponding path program 1 times [2024-11-10 08:55:58,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 08:55:58,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957456870] [2024-11-10 08:55:58,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:55:58,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 08:55:58,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:58,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 08:55:58,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:58,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 08:55:58,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:58,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 08:55:58,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:58,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 08:55:58,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:58,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 08:55:58,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:58,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 08:55:58,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:58,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 08:55:58,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:58,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 08:55:58,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:58,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 08:55:58,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:58,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 08:55:58,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:58,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 08:55:58,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:58,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 08:55:58,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:58,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 08:55:58,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:58,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-10 08:55:58,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:58,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-10 08:55:58,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:58,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-10 08:55:58,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:55:58,653 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-10 08:55:58,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 08:55:58,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957456870] [2024-11-10 08:55:58,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957456870] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 08:55:58,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 08:55:58,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 08:55:58,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82619687] [2024-11-10 08:55:58,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 08:55:58,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 08:55:58,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 08:55:58,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 08:55:58,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 08:55:58,656 INFO L87 Difference]: Start difference. First operand 331 states and 419 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-10 08:55:58,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 08:55:58,950 INFO L93 Difference]: Finished difference Result 759 states and 964 transitions. [2024-11-10 08:55:58,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 08:55:58,951 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 123 [2024-11-10 08:55:58,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 08:55:58,954 INFO L225 Difference]: With dead ends: 759 [2024-11-10 08:55:58,954 INFO L226 Difference]: Without dead ends: 470 [2024-11-10 08:55:58,956 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 35 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-11-10 08:55:58,956 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 123 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 08:55:58,958 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 330 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 08:55:58,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2024-11-10 08:55:58,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 460. [2024-11-10 08:55:58,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 460 states, 398 states have (on average 1.2010050251256281) internal successors, (478), 400 states have internal predecessors, (478), 54 states have call successors, (54), 7 states have call predecessors, (54), 7 states have return successors, (54), 52 states have call predecessors, (54), 54 states have call successors, (54) [2024-11-10 08:55:58,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 586 transitions. [2024-11-10 08:55:58,991 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 586 transitions. Word has length 123 [2024-11-10 08:55:58,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 08:55:58,992 INFO L471 AbstractCegarLoop]: Abstraction has 460 states and 586 transitions. [2024-11-10 08:55:58,992 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-10 08:55:58,992 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 586 transitions. [2024-11-10 08:55:58,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-10 08:55:58,993 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:55:58,993 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 08:55:58,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-10 08:55:58,994 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:55:58,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:55:58,994 INFO L85 PathProgramCache]: Analyzing trace with hash -1294842205, now seen corresponding path program 1 times [2024-11-10 08:55:58,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 08:55:58,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203136172] [2024-11-10 08:55:58,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:55:58,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 08:55:59,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 08:55:59,044 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 08:55:59,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 08:55:59,132 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 08:55:59,133 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 08:55:59,135 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-10 08:55:59,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-10 08:55:59,141 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] [2024-11-10 08:55:59,247 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 08:55:59,250 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 08:55:59 BoogieIcfgContainer [2024-11-10 08:55:59,250 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 08:55:59,251 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 08:55:59,251 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 08:55:59,251 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 08:55:59,251 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 08:55:45" (3/4) ... [2024-11-10 08:55:59,254 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-10 08:55:59,255 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 08:55:59,256 INFO L158 Benchmark]: Toolchain (without parser) took 15481.66ms. Allocated memory was 172.0MB in the beginning and 369.1MB in the end (delta: 197.1MB). Free memory was 141.5MB in the beginning and 268.4MB in the end (delta: -126.9MB). Peak memory consumption was 70.5MB. Max. memory is 16.1GB. [2024-11-10 08:55:59,256 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 134.2MB. Free memory is still 98.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 08:55:59,257 INFO L158 Benchmark]: CACSL2BoogieTranslator took 441.10ms. Allocated memory is still 172.0MB. Free memory was 141.3MB in the beginning and 128.7MB in the end (delta: 12.6MB). Peak memory consumption was 14.8MB. Max. memory is 16.1GB. [2024-11-10 08:55:59,257 INFO L158 Benchmark]: Boogie Procedure Inliner took 86.78ms. Allocated memory is still 172.0MB. Free memory was 128.7MB in the beginning and 125.2MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 08:55:59,257 INFO L158 Benchmark]: Boogie Preprocessor took 72.11ms. Allocated memory is still 172.0MB. Free memory was 125.2MB in the beginning and 120.2MB in the end (delta: 5.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 08:55:59,258 INFO L158 Benchmark]: IcfgBuilder took 688.39ms. Allocated memory is still 172.0MB. Free memory was 120.2MB in the beginning and 95.9MB in the end (delta: 24.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-10 08:55:59,261 INFO L158 Benchmark]: TraceAbstraction took 14181.45ms. Allocated memory was 172.0MB in the beginning and 369.1MB in the end (delta: 197.1MB). Free memory was 95.1MB in the beginning and 269.5MB in the end (delta: -174.3MB). Peak memory consumption was 22.1MB. Max. memory is 16.1GB. [2024-11-10 08:55:59,261 INFO L158 Benchmark]: Witness Printer took 4.43ms. Allocated memory is still 369.1MB. Free memory was 269.5MB in the beginning and 268.4MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 08:55:59,262 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.19ms. Allocated memory is still 134.2MB. Free memory is still 98.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 441.10ms. Allocated memory is still 172.0MB. Free memory was 141.3MB in the beginning and 128.7MB in the end (delta: 12.6MB). Peak memory consumption was 14.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 86.78ms. Allocated memory is still 172.0MB. Free memory was 128.7MB in the beginning and 125.2MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 72.11ms. Allocated memory is still 172.0MB. Free memory was 125.2MB in the beginning and 120.2MB in the end (delta: 5.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * IcfgBuilder took 688.39ms. Allocated memory is still 172.0MB. Free memory was 120.2MB in the beginning and 95.9MB in the end (delta: 24.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 14181.45ms. Allocated memory was 172.0MB in the beginning and 369.1MB in the end (delta: 197.1MB). Free memory was 95.1MB in the beginning and 269.5MB in the end (delta: -174.3MB). Peak memory consumption was 22.1MB. Max. memory is 16.1GB. * Witness Printer took 4.43ms. Allocated memory is still 369.1MB. Free memory was 269.5MB in the beginning and 268.4MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. 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 someBinaryDOUBLEComparisonOperation at line 124, overapproximation of someBinaryFLOATComparisonOperation at line 124. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = 64; [L23] unsigned char var_1_7 = 0; [L24] unsigned short int var_1_11 = 500; [L25] unsigned char var_1_13 = 64; [L26] unsigned char var_1_15 = 1; [L27] unsigned char var_1_16 = 8; [L28] double var_1_17 = 7.5; [L29] double var_1_18 = 31.125; [L30] double var_1_19 = 10.5; [L31] double var_1_20 = 0.0; [L32] double var_1_21 = 16.75; [L33] double var_1_22 = 2.5; [L34] double var_1_23 = 64.5; [L35] signed long int var_1_24 = 10; [L36] signed char var_1_26 = 16; [L37] signed char var_1_27 = 4; [L38] signed char var_1_28 = -10; [L39] float var_1_29 = 63.794; [L40] unsigned short int var_1_30 = 1; [L41] signed long int var_1_31 = -2; [L42] unsigned char var_1_32 = 64; [L43] signed long int last_1_var_1_1 = 64; [L44] unsigned char last_1_var_1_13 = 64; VAL [isInitial=0, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L128] isInitial = 1 [L129] FCALL initially() [L130] COND TRUE 1 [L131] CALL updateLastVariables() [L120] last_1_var_1_1 = var_1_1 [L121] last_1_var_1_13 = var_1_13 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L131] RET updateLastVariables() [L132] CALL updateVariables() [L91] var_1_7 = __VERIFIER_nondet_uchar() [L92] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64] [L92] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64] [L93] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L93] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L94] var_1_15 = __VERIFIER_nondet_uchar() [L95] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L95] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L96] CALL assume_abort_if_not(var_1_15 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L96] RET assume_abort_if_not(var_1_15 <= 254) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L97] var_1_16 = __VERIFIER_nondet_uchar() [L98] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L98] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L99] CALL assume_abort_if_not(var_1_16 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=0, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=0, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L99] RET assume_abort_if_not(var_1_16 <= 254) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=0, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L100] var_1_18 = __VERIFIER_nondet_double() [L101] CALL assume_abort_if_not((var_1_18 >= 0.0F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 4611686.018427382800e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=0, var_1_17=15/2, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=0, var_1_17=15/2, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L101] RET assume_abort_if_not((var_1_18 >= 0.0F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 4611686.018427382800e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=0, var_1_17=15/2, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L102] var_1_19 = __VERIFIER_nondet_double() [L103] CALL assume_abort_if_not((var_1_19 >= 0.0F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L103] RET assume_abort_if_not((var_1_19 >= 0.0F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L104] var_1_20 = __VERIFIER_nondet_double() [L105] CALL assume_abort_if_not((var_1_20 >= 4611686.018427382800e+12F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854765600e+12F && var_1_20 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L105] RET assume_abort_if_not((var_1_20 >= 4611686.018427382800e+12F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854765600e+12F && var_1_20 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L106] var_1_21 = __VERIFIER_nondet_double() [L107] CALL assume_abort_if_not((var_1_21 >= 0.0F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 4611686.018427382800e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L107] RET assume_abort_if_not((var_1_21 >= 0.0F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 4611686.018427382800e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L108] var_1_22 = __VERIFIER_nondet_double() [L109] CALL assume_abort_if_not((var_1_22 >= -922337.2036854765600e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854765600e+12F && var_1_22 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L109] RET assume_abort_if_not((var_1_22 >= -922337.2036854765600e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854765600e+12F && var_1_22 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L110] var_1_23 = __VERIFIER_nondet_double() [L111] CALL assume_abort_if_not((var_1_23 >= -922337.2036854765600e+13F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 9223372.036854765600e+12F && var_1_23 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L111] RET assume_abort_if_not((var_1_23 >= -922337.2036854765600e+13F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 9223372.036854765600e+12F && var_1_23 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L112] var_1_27 = __VERIFIER_nondet_char() [L113] CALL assume_abort_if_not(var_1_27 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L113] RET assume_abort_if_not(var_1_27 >= -63) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L114] CALL assume_abort_if_not(var_1_27 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L114] RET assume_abort_if_not(var_1_27 <= 63) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L115] var_1_28 = __VERIFIER_nondet_char() [L116] CALL assume_abort_if_not(var_1_28 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=-59, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=-59, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L116] RET assume_abort_if_not(var_1_28 >= -63) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=-59, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L117] CALL assume_abort_if_not(var_1_28 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=-59, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=-59, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L117] RET assume_abort_if_not(var_1_28 <= 63) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=-59, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L132] RET updateVariables() [L133] CALL step() [L48] signed long int stepLocal_1 = last_1_var_1_1; VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=-59, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L49] COND FALSE !(stepLocal_1 != last_1_var_1_13) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=-59, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L52] var_1_31 = var_1_13 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=-59, var_1_29=31897/500, var_1_30=1, var_1_31=64, var_1_32=64, var_1_7=0] [L53] COND FALSE !(\read(var_1_7)) [L56] var_1_17 = var_1_22 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=0, var_1_17=505, var_1_1=64, var_1_22=505, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=-59, var_1_29=31897/500, var_1_30=1, var_1_31=64, var_1_32=64, var_1_7=0] [L58] COND FALSE !(\read(var_1_7)) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=0, var_1_17=505, var_1_1=64, var_1_22=505, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=-59, var_1_29=31897/500, var_1_30=1, var_1_31=64, var_1_32=64, var_1_7=0] [L61] var_1_32 = var_1_16 [L62] unsigned char stepLocal_0 = var_1_13; VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_0=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=0, var_1_17=505, var_1_1=64, var_1_22=505, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=-59, var_1_29=31897/500, var_1_30=1, var_1_31=64, var_1_32=0, var_1_7=0] [L63] EXPR var_1_32 >> var_1_32 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_0=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=0, var_1_17=505, var_1_1=64, var_1_22=505, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=-59, var_1_29=31897/500, var_1_30=1, var_1_31=64, var_1_32=0, var_1_7=0] [L63] COND TRUE (var_1_32 >> var_1_32) < stepLocal_0 [L64] var_1_11 = var_1_32 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=0, var_1_13=64, var_1_15=0, var_1_16=0, var_1_17=505, var_1_1=64, var_1_22=505, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=-59, var_1_29=31897/500, var_1_30=1, var_1_31=64, var_1_32=0, var_1_7=0] [L66] var_1_30 = var_1_32 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=0, var_1_13=64, var_1_15=0, var_1_16=0, var_1_17=505, var_1_1=64, var_1_22=505, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=-59, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_7=0] [L67] COND TRUE var_1_11 >= var_1_30 [L68] var_1_26 = (var_1_27 + var_1_28) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=0, var_1_13=64, var_1_15=0, var_1_16=0, var_1_17=505, var_1_1=64, var_1_22=505, var_1_24=10, var_1_26=4, var_1_27=63, var_1_28=-59, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_7=0] [L70] unsigned short int stepLocal_2 = var_1_30; VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_2=0, var_1_11=0, var_1_13=64, var_1_15=0, var_1_16=0, var_1_17=505, var_1_1=64, var_1_22=505, var_1_24=10, var_1_26=4, var_1_27=63, var_1_28=-59, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_7=0] [L71] COND TRUE ! var_1_7 [L72] var_1_24 = (var_1_11 - ((((((((var_1_30) > (var_1_13)) ? (var_1_30) : (var_1_13)))) < ((var_1_30 + var_1_15))) ? (((((var_1_30) > (var_1_13)) ? (var_1_30) : (var_1_13)))) : ((var_1_30 + var_1_15))))) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_2=0, var_1_11=0, var_1_13=64, var_1_15=0, var_1_16=0, var_1_17=505, var_1_1=64, var_1_22=505, var_1_24=0, var_1_26=4, var_1_27=63, var_1_28=-59, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_7=0] [L80] EXPR (var_1_31 + 4u) | var_1_30 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_2=0, var_1_11=0, var_1_13=64, var_1_15=0, var_1_16=0, var_1_17=505, var_1_1=64, var_1_22=505, var_1_24=0, var_1_26=4, var_1_27=63, var_1_28=-59, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_7=0] [L80] COND TRUE 32u < ((var_1_31 + 4u) | var_1_30) [L81] var_1_1 = (var_1_26 + (var_1_26 + var_1_32)) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_2=0, var_1_11=0, var_1_13=64, var_1_15=0, var_1_16=0, var_1_17=505, var_1_1=8, var_1_22=505, var_1_24=0, var_1_26=4, var_1_27=63, var_1_28=-59, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_7=0] [L133] RET step() [L134] CALL, EXPR property() [L124] EXPR (var_1_31 + 4u) | var_1_30 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=0, var_1_13=64, var_1_15=0, var_1_16=0, var_1_17=505, var_1_1=8, var_1_22=505, var_1_24=0, var_1_26=4, var_1_27=63, var_1_28=-59, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_7=0] [L124] EXPR ((32u < ((var_1_31 + 4u) | var_1_30)) ? (var_1_1 == ((signed long int) (var_1_26 + (var_1_26 + var_1_32)))) : ((! var_1_7) ? (var_1_1 == ((signed long int) ((((var_1_26) < ((var_1_11 - var_1_32))) ? (var_1_26) : ((var_1_11 - var_1_32)))))) : (var_1_1 == ((signed long int) (var_1_32 - var_1_13))))) && (((var_1_32 >> var_1_32) < var_1_13) ? (var_1_11 == ((unsigned short int) var_1_32)) : 1) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=0, var_1_13=64, var_1_15=0, var_1_16=0, var_1_17=505, var_1_1=8, var_1_22=505, var_1_24=0, var_1_26=4, var_1_27=63, var_1_28=-59, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_7=0] [L124] EXPR var_1_32 >> var_1_32 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=0, var_1_13=64, var_1_15=0, var_1_16=0, var_1_17=505, var_1_1=8, var_1_22=505, var_1_24=0, var_1_26=4, var_1_27=63, var_1_28=-59, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_7=0] [L124] EXPR ((32u < ((var_1_31 + 4u) | var_1_30)) ? (var_1_1 == ((signed long int) (var_1_26 + (var_1_26 + var_1_32)))) : ((! var_1_7) ? (var_1_1 == ((signed long int) ((((var_1_26) < ((var_1_11 - var_1_32))) ? (var_1_26) : ((var_1_11 - var_1_32)))))) : (var_1_1 == ((signed long int) (var_1_32 - var_1_13))))) && (((var_1_32 >> var_1_32) < var_1_13) ? (var_1_11 == ((unsigned short int) var_1_32)) : 1) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=0, var_1_13=64, var_1_15=0, var_1_16=0, var_1_17=505, var_1_1=8, var_1_22=505, var_1_24=0, var_1_26=4, var_1_27=63, var_1_28=-59, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_7=0] [L124-L125] return ((((((((((32u < ((var_1_31 + 4u) | var_1_30)) ? (var_1_1 == ((signed long int) (var_1_26 + (var_1_26 + var_1_32)))) : ((! var_1_7) ? (var_1_1 == ((signed long int) ((((var_1_26) < ((var_1_11 - var_1_32))) ? (var_1_26) : ((var_1_11 - var_1_32)))))) : (var_1_1 == ((signed long int) (var_1_32 - var_1_13))))) && (((var_1_32 >> var_1_32) < var_1_13) ? (var_1_11 == ((unsigned short int) var_1_32)) : 1)) && ((last_1_var_1_1 != last_1_var_1_13) ? (var_1_13 == ((unsigned char) ((((var_1_15) < (var_1_16)) ? (var_1_15) : (var_1_16))))) : 1)) && (var_1_7 ? (var_1_17 == ((double) ((((((var_1_18 + var_1_19) - (var_1_20 - var_1_21))) < (((((var_1_22) > (var_1_23)) ? (var_1_22) : (var_1_23))))) ? (((var_1_18 + var_1_19) - (var_1_20 - var_1_21))) : (((((var_1_22) > (var_1_23)) ? (var_1_22) : (var_1_23)))))))) : (var_1_17 == ((double) var_1_22)))) && ((! var_1_7) ? (var_1_24 == ((signed long int) (var_1_11 - ((((((((var_1_30) > (var_1_13)) ? (var_1_30) : (var_1_13)))) < ((var_1_30 + var_1_15))) ? (((((var_1_30) > (var_1_13)) ? (var_1_30) : (var_1_13)))) : ((var_1_30 + var_1_15))))))) : ((var_1_11 < var_1_30) ? (var_1_24 == ((signed long int) -4)) : (var_1_24 == ((signed long int) var_1_26))))) && ((var_1_11 >= var_1_30) ? (var_1_26 == ((signed char) (var_1_27 + var_1_28))) : 1)) && (var_1_7 ? (var_1_29 == ((float) var_1_20)) : 1)) && (var_1_30 == ((unsigned short int) var_1_32))) && (var_1_31 == ((signed long int) var_1_13))) && (var_1_32 == ((unsigned char) var_1_16)) ; [L134] RET, EXPR property() [L134] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=0, var_1_13=64, var_1_15=0, var_1_16=0, var_1_17=505, var_1_1=8, var_1_22=505, var_1_24=0, var_1_26=4, var_1_27=63, var_1_28=-59, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_7=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=0, var_1_13=64, var_1_15=0, var_1_16=0, var_1_17=505, var_1_1=8, var_1_22=505, var_1_24=0, var_1_26=4, var_1_27=63, var_1_28=-59, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_7=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 76 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 14.0s, OverallIterations: 21, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 5.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2409 SdHoareTripleChecker+Valid, 3.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2409 mSDsluCounter, 8201 SdHoareTripleChecker+Invalid, 3.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5601 mSDsCounter, 333 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3228 IncrementalHoareTripleChecker+Invalid, 3561 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 333 mSolverCounterUnsat, 2600 mSDtfsCounter, 3228 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 820 GetRequests, 720 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=460occurred in iteration=20, InterpolantAutomatonStates: 106, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 20 MinimizatonAttempts, 1398 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 7.1s InterpolantComputationTime, 2556 NumberOfCodeBlocks, 2556 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 2413 ConstructedInterpolants, 0 QuantifiedInterpolants, 5974 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 PerfectInterpolantSequences, 9600/9600 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-11-10 08:55:59,303 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with 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/11.0.12-open/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 ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-63.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 e0b92bdde1a6a66126d19d639f9e494a5579381be868a4b13fb2299a2d0086c0 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 08:56:01,765 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 08:56:01,860 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-10 08:56:01,867 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 08:56:01,868 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 08:56:01,913 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 08:56:01,914 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 08:56:01,914 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 08:56:01,914 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 08:56:01,915 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 08:56:01,915 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 08:56:01,915 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 08:56:01,916 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 08:56:01,916 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 08:56:01,917 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 08:56:01,919 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 08:56:01,920 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 08:56:01,921 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 08:56:01,921 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 08:56:01,921 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 08:56:01,921 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 08:56:01,925 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 08:56:01,926 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 08:56:01,926 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 08:56:01,926 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-10 08:56:01,926 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 08:56:01,927 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-10 08:56:01,927 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 08:56:01,927 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 08:56:01,927 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 08:56:01,928 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 08:56:01,928 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 08:56:01,928 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 08:56:01,928 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 08:56:01,928 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 08:56:01,929 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 08:56:01,929 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 08:56:01,929 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 08:56:01,929 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-10 08:56:01,929 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-10 08:56:01,930 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 08:56:01,930 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 08:56:01,930 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 08:56:01,930 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 08:56:01,931 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 -> e0b92bdde1a6a66126d19d639f9e494a5579381be868a4b13fb2299a2d0086c0 [2024-11-10 08:56:02,328 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 08:56:02,360 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 08:56:02,365 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 08:56:02,371 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 08:56:02,372 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 08:56:02,374 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-63.i [2024-11-10 08:56:04,125 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 08:56:04,379 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 08:56:04,380 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-63.i [2024-11-10 08:56:04,395 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/892793492/ea3da49f296d4de3b303bf6167ba7c9b/FLAG72eee94fd [2024-11-10 08:56:04,412 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/892793492/ea3da49f296d4de3b303bf6167ba7c9b [2024-11-10 08:56:04,415 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 08:56:04,417 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 08:56:04,418 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 08:56:04,418 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 08:56:04,424 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 08:56:04,425 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 08:56:04" (1/1) ... [2024-11-10 08:56:04,426 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24ba7cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:56:04, skipping insertion in model container [2024-11-10 08:56:04,426 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 08:56:04" (1/1) ... [2024-11-10 08:56:04,454 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 08:56:04,669 WARN L250 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_operatoramount_amount50_file-63.i[915,928] [2024-11-10 08:56:04,755 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 08:56:04,782 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 08:56:04,806 WARN L250 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_operatoramount_amount50_file-63.i[915,928] [2024-11-10 08:56:04,851 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 08:56:04,883 INFO L204 MainTranslator]: Completed translation [2024-11-10 08:56:04,883 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:56:04 WrapperNode [2024-11-10 08:56:04,883 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 08:56:04,885 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 08:56:04,885 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 08:56:04,885 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 08:56:04,892 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:56:04" (1/1) ... [2024-11-10 08:56:04,911 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:56:04" (1/1) ... [2024-11-10 08:56:04,953 INFO L138 Inliner]: procedures = 27, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 134 [2024-11-10 08:56:04,954 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 08:56:04,955 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 08:56:04,955 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 08:56:04,955 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 08:56:04,968 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:56:04" (1/1) ... [2024-11-10 08:56:04,968 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:56:04" (1/1) ... [2024-11-10 08:56:04,975 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:56:04" (1/1) ... [2024-11-10 08:56:04,996 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-10 08:56:05,001 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:56:04" (1/1) ... [2024-11-10 08:56:05,001 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:56:04" (1/1) ... [2024-11-10 08:56:05,017 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:56:04" (1/1) ... [2024-11-10 08:56:05,018 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:56:04" (1/1) ... [2024-11-10 08:56:05,022 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:56:04" (1/1) ... [2024-11-10 08:56:05,027 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:56:04" (1/1) ... [2024-11-10 08:56:05,035 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 08:56:05,037 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 08:56:05,037 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 08:56:05,037 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 08:56:05,038 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:56:04" (1/1) ... [2024-11-10 08:56:05,044 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 08:56:05,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 08:56:05,075 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-11-10 08:56:05,083 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-11-10 08:56:05,133 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 08:56:05,134 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-10 08:56:05,134 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 08:56:05,134 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 08:56:05,134 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 08:56:05,136 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 08:56:05,246 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 08:56:05,250 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 08:56:13,199 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-11-10 08:56:13,200 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 08:56:13,220 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 08:56:13,221 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 08:56:13,222 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 08:56:13 BoogieIcfgContainer [2024-11-10 08:56:13,222 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 08:56:13,224 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 08:56:13,224 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 08:56:13,228 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 08:56:13,228 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 08:56:04" (1/3) ... [2024-11-10 08:56:13,229 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35b5f432 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 08:56:13, skipping insertion in model container [2024-11-10 08:56:13,229 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:56:04" (2/3) ... [2024-11-10 08:56:13,229 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35b5f432 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 08:56:13, skipping insertion in model container [2024-11-10 08:56:13,229 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 08:56:13" (3/3) ... [2024-11-10 08:56:13,230 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount50_file-63.i [2024-11-10 08:56:13,246 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 08:56:13,247 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 08:56:13,317 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 08:56:13,325 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;@caf45fb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 08:56:13,326 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 08:56:13,331 INFO L276 IsEmpty]: Start isEmpty. Operand has 62 states, 43 states have (on average 1.3255813953488371) internal successors, (57), 44 states have internal predecessors, (57), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-10 08:56:13,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-10 08:56:13,342 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:56:13,343 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 08:56:13,344 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:56:13,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:56:13,349 INFO L85 PathProgramCache]: Analyzing trace with hash 409994490, now seen corresponding path program 1 times [2024-11-10 08:56:13,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 08:56:13,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1830657288] [2024-11-10 08:56:13,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:56:13,363 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-11-10 08:56:13,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 08:56:13,367 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-11-10 08:56:13,368 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-11-10 08:56:13,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:56:13,814 INFO L255 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-10 08:56:13,822 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 08:56:13,858 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 230 proven. 0 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2024-11-10 08:56:13,859 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 08:56:13,859 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 08:56:13,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1830657288] [2024-11-10 08:56:13,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1830657288] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 08:56:13,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 08:56:13,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 08:56:13,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748381801] [2024-11-10 08:56:13,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 08:56:13,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 08:56:13,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 08:56:13,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 08:56:13,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 08:56:13,897 INFO L87 Difference]: Start difference. First operand has 62 states, 43 states have (on average 1.3255813953488371) internal successors, (57), 44 states have internal predecessors, (57), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-10 08:56:13,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 08:56:13,929 INFO L93 Difference]: Finished difference Result 116 states and 187 transitions. [2024-11-10 08:56:13,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 08:56:13,932 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 113 [2024-11-10 08:56:13,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 08:56:13,939 INFO L225 Difference]: With dead ends: 116 [2024-11-10 08:56:13,939 INFO L226 Difference]: Without dead ends: 57 [2024-11-10 08:56:13,943 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 112 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-11-10 08:56:13,946 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 08:56:13,947 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 08:56:13,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2024-11-10 08:56:13,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2024-11-10 08:56:13,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 39 states have (on average 1.2564102564102564) internal successors, (49), 39 states have internal predecessors, (49), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-10 08:56:13,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 81 transitions. [2024-11-10 08:56:13,985 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 81 transitions. Word has length 113 [2024-11-10 08:56:13,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 08:56:13,987 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 81 transitions. [2024-11-10 08:56:13,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-10 08:56:13,988 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 81 transitions. [2024-11-10 08:56:13,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-10 08:56:13,992 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:56:13,992 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 08:56:14,005 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-11-10 08:56:14,193 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-11-10 08:56:14,194 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:56:14,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:56:14,195 INFO L85 PathProgramCache]: Analyzing trace with hash -1869803948, now seen corresponding path program 1 times [2024-11-10 08:56:14,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 08:56:14,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1259864335] [2024-11-10 08:56:14,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:56:14,196 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-11-10 08:56:14,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 08:56:14,199 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-11-10 08:56:14,200 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 [2024-11-10 08:56:14,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:56:14,586 INFO L255 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-10 08:56:14,598 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 08:56:16,620 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-10 08:56:16,620 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 08:56:16,621 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 08:56:16,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1259864335] [2024-11-10 08:56:16,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1259864335] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 08:56:16,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 08:56:16,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 08:56:16,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449547618] [2024-11-10 08:56:16,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 08:56:16,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 08:56:16,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 08:56:16,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 08:56:16,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 08:56:16,625 INFO L87 Difference]: Start difference. First operand 57 states and 81 transitions. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-10 08:56:20,544 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.22s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 08:56:24,494 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.77s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 08:56:24,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 08:56:24,495 INFO L93 Difference]: Finished difference Result 167 states and 239 transitions. [2024-11-10 08:56:24,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 08:56:24,527 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 113 [2024-11-10 08:56:24,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 08:56:24,529 INFO L225 Difference]: With dead ends: 167 [2024-11-10 08:56:24,529 INFO L226 Difference]: Without dead ends: 113 [2024-11-10 08:56:24,530 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-10 08:56:24,531 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 67 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.7s IncrementalHoareTripleChecker+Time [2024-11-10 08:56:24,532 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 254 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 7.7s Time] [2024-11-10 08:56:24,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-11-10 08:56:24,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 92. [2024-11-10 08:56:24,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 57 states have (on average 1.1754385964912282) internal successors, (67), 57 states have internal predecessors, (67), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-10 08:56:24,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 131 transitions. [2024-11-10 08:56:24,555 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 131 transitions. Word has length 113 [2024-11-10 08:56:24,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 08:56:24,555 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 131 transitions. [2024-11-10 08:56:24,556 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-10 08:56:24,556 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 131 transitions. [2024-11-10 08:56:24,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-10 08:56:24,558 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:56:24,558 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 08:56:24,574 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 (3)] Ended with exit code 0 [2024-11-10 08:56:24,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /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-11-10 08:56:24,759 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:56:24,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:56:24,760 INFO L85 PathProgramCache]: Analyzing trace with hash 1914629171, now seen corresponding path program 1 times [2024-11-10 08:56:24,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 08:56:24,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [774173530] [2024-11-10 08:56:24,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:56:24,761 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-11-10 08:56:24,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 08:56:24,763 INFO L229 MonitoredProcess]: Starting monitored process 4 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-11-10 08:56:24,764 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 (4)] Waiting until timeout for monitored process [2024-11-10 08:56:25,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:56:25,117 INFO L255 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-10 08:56:25,120 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 08:56:25,212 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-10 08:56:25,212 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 08:56:25,212 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 08:56:25,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [774173530] [2024-11-10 08:56:25,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [774173530] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 08:56:25,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 08:56:25,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 08:56:25,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64332578] [2024-11-10 08:56:25,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 08:56:25,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 08:56:25,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 08:56:25,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 08:56:25,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 08:56:25,216 INFO L87 Difference]: Start difference. First operand 92 states and 131 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-10 08:56:28,650 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.06s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 08:56:31,982 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.29s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 08:56:32,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 08:56:32,023 INFO L93 Difference]: Finished difference Result 165 states and 234 transitions. [2024-11-10 08:56:32,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 08:56:32,024 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 113 [2024-11-10 08:56:32,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 08:56:32,028 INFO L225 Difference]: With dead ends: 165 [2024-11-10 08:56:32,028 INFO L226 Difference]: Without dead ends: 111 [2024-11-10 08:56:32,029 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 08:56:32,030 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 16 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.8s IncrementalHoareTripleChecker+Time [2024-11-10 08:56:32,030 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 157 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 6.8s Time] [2024-11-10 08:56:32,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-11-10 08:56:32,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 101. [2024-11-10 08:56:32,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 66 states have (on average 1.196969696969697) internal successors, (79), 66 states have internal predecessors, (79), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-10 08:56:32,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 143 transitions. [2024-11-10 08:56:32,059 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 143 transitions. Word has length 113 [2024-11-10 08:56:32,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 08:56:32,060 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 143 transitions. [2024-11-10 08:56:32,060 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-10 08:56:32,061 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 143 transitions. [2024-11-10 08:56:32,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-10 08:56:32,062 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:56:32,063 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 08:56:32,079 INFO L540 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 (4)] Forceful destruction successful, exit code 0 [2024-11-10 08:56:32,263 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /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-11-10 08:56:32,264 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:56:32,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:56:32,265 INFO L85 PathProgramCache]: Analyzing trace with hash 1621226164, now seen corresponding path program 1 times [2024-11-10 08:56:32,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 08:56:32,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1083329755] [2024-11-10 08:56:32,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:56:32,266 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-11-10 08:56:32,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 08:56:32,269 INFO L229 MonitoredProcess]: Starting monitored process 5 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-11-10 08:56:32,270 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 (5)] Waiting until timeout for monitored process [2024-11-10 08:56:32,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:56:32,637 INFO L255 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-10 08:56:32,645 INFO L278 TraceCheckSpWp]: Computing forward predicates...